Submission details
Task:Array
Sender:🍦🍧🍨
Submission time:2015-09-30 18:16:40 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#1--details
#20.55 sdetails
#30.09 sdetails
#40.68 sdetails
#50.06 sdetails
#6--details
#7--details
#8--details
#9--details
#10--details
#11--details
#12--details
#13--details
#14--details
#15--details
#16--details
#17--details
#18--details
#19--details
#20--details
#21--details

Compiler report

input/code.cpp: In function 'int main(int, const char**)':
input/code.cpp:9:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%ld", &n);
                  ^
input/code.cpp:10:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%ld", &x);
                  ^
input/code.cpp:19:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%ld", &nums[i]);
                         ^

Code

#include <stdio.h>

int main(int argc, char const *argv[])
{
	

	//read input
	long n, x;
	scanf("%ld", &n);
	scanf("%ld", &x);
	

	long nums[n];
	long sums[n];

	int i,j;
	for (i=0; i<n; i++) {
		sums[i] = 0;
		scanf("%ld", &nums[i]);
	}

	int count=0;

	for (i=0; i<n; i++) {// subarray length
		for (j=0; j<n-i; j++) {// start index
			sums[i] += nums[j+i];
			if(sums[i] == x) count++;
		}
	}

	printf("%d\n", count);

	return count;
}

Test details

Test 1

Verdict:

input
89384 -6
-1 9 -2 0 0 -1 5 0 -8 9 10 -6 ...

correct output
2029635

user output
(empty)

Test 2

Verdict:

input
32688 -4
6 0 9 -10 -2 -2 -1 5 -5 -6 9 8...

correct output
321307

user output
321307

Test 3

Verdict:

input
11023 2
5 0 -1 9 -10 3 10 -10 1 -3 -8 ...

correct output
146015

user output
146015

Test 4

Verdict:

input
36884 -7
6 8 2 -4 1 7 1 -7 5 3 1 -6 1 -...

correct output
471565

user output
471565

Test 5

Verdict:

input
2875 -6
-4 1 -6 -10 -2 -5 9 0 -2 9 -3 ...

correct output
9343

user output
9343

Test 6

Verdict:

input
52346 -111
973 629 570 312 541 -117 332 7...

correct output
8791

user output
(empty)

Test 7

Verdict:

input
55283 298
593 -881 937 901 -91 -622 632 ...

correct output
7351

user output
(empty)

Test 8

Verdict:

input
93592 -589
951 -193 -855 -692 926 -602 -6...

correct output
26431

user output
(empty)

Test 9

Verdict:

input
98149 942
-816 178 196 -503 654 -474 -64...

correct output
37659

user output
(empty)

Test 10

Verdict:

input
79573 -346
-161 619 720 182 726 452 -63 -...

correct output
19690

user output
(empty)

Test 11

Verdict:

input
100000 -9229
-6207 -4894 -1224 8410 -2954 4...

correct output
1969

user output
(empty)

Test 12

Verdict:

input
100000 4655
134 4684 8364 -7381 -1874 3429...

correct output
2353

user output
(empty)

Test 13

Verdict:

input
100000 -5901
-4907 7494 7673 -3917 -3223 -7...

correct output
2345

user output
(empty)

Test 14

Verdict:

input
100000 -2507
-845 -6674 -3174 9309 -1411 53...

correct output
2242

user output
(empty)

Test 15

Verdict:

input
100000 -4850
-9232 -2843 5422 -5336 -2835 -...

correct output
3753

user output
(empty)

Test 16

Verdict:

input
100000 -745023
-561148 78606 440682 608892 -3...

correct output
27

user output
(empty)

Test 17

Verdict:

input
100000 987216
602043 416718 216813 720665 -6...

correct output
41

user output
(empty)

Test 18

Verdict:

input
100000 -140762
-813926 -641015 5926 -87604 -8...

correct output
43

user output
(empty)

Test 19

Verdict:

input
100000 -828680
-53023 -23367 -91278 162438 82...

correct output
27

user output
(empty)

Test 20

Verdict:

input
100000 -731243595
-728764339 -159138563 36776806...

correct output
0

user output
(empty)

Test 21

Verdict:

input
100000 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

correct output
5000050000

user output
(empty)