Subarray Sums II

input/code.cpp: In function 'int main()':
input/code.cpp:43:13: warning: variable 'v' set but not used [-Wunused-but-set-variable]
   43 |     int64_t v = 1;
      |             ^

#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <search.h>

#define LOOP(i,s,e) for (uint64_t i = (s); i < (e); i++)
#define SCAN(...) if (scanf(__VA_ARGS__) == 0) return EXIT_FAILURE

int main() {
    uint64_t n = 0;
    int64_t target;
    //printf("0\n");
    SCAN("%ld %ld", &n, &target);

    // main algo

    //printf("1\n");
    int64_t *tab = (int64_t *) malloc(n * sizeof(int64_t));
    //printf("2\n");
    int64_t *pref = (int64_t *) malloc(n * sizeof(int64_t));
    //printf("3\n");

    (void) hcreate(n);
    //printf("4\n");

    SCAN("%ld", tab);
    pref[0] = tab[0];
    LOOP(i, 1, n){
        SCAN("%ld", tab+i);
        //printf("add tab[%ld] : %ld", i, tab[i]);
        pref[i] = pref[i-1] + tab[i];
    }


    // ajout de 0
    // printf("ajout %ld : %ld\n", -1, 0);
    char *key = (char*) malloc(20 * sizeof(char));
    char *store_key = (char*) malloc(20 * sizeof(char));
    memcpy(store_key, "0", 2);
    int64_t v = 1;
    ENTRY e = {store_key, (void*) 1};
    hsearch(e, ENTER);
    // printf("adding %s (%ld)\n", store_key, 0);

    uint64_t acc = 0;
    LOOP(i, 0, n){
        int64_t val = pref[i] - target;
        ENTRY e;
        ENTRY *pe;
        sprintf(key, "%ld", val);
        //printf("4\n");
        e = {key, NULL};
        pe = hsearch(e, FIND);
        // printf("search : %ld\n", val);
        if (pe != NULL){
            // printf("trouvé\n");
            acc += ((int64_t)pe->data);
        }
        // printf("end of loop %ld, acc = %ld. val = %ld\n", i, acc, val);
        // printf("searching : %s\n", key);
        // if (pe == NULL)
        //     printf("found     : NULL\n");
        // else
        //     printf("found     : %s  ->  %ld\n", pe->key, (int64_t)pe->data);
        sprintf(key, "%ld", pref[i]);
        e = {key, NULL};
        pe = hsearch(e, FIND);
        if (pe == NULL){
            //printf("3a\n");
            // printf("ajout %ld : %ld\n", i, pref[i]);
            store_key = (char*) malloc(20 * sizeof(char));
            sprintf(store_key, "%ld", pref[i]);
            // printf("adding %s (%ld)\n", store_key, pref[i]);
            v = 1;
            ENTRY e = {store_key, (void *) 1};
            hsearch(e, ENTER);
        } else {
            //printf("3b\n");
            // printf("increment %ld\n", i);
            pe->data = (void*) ((int64_t)pe->data + 1);
            // printf("increment %s (%ld)\n", key, pref[i]);
        }
        //printf("5\n");
    }

    hdestroy();
    free(key);
    free(tab);
    free(pref);
    printf("%ld\n", acc);

    return EXIT_SUCCESS;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED