oj.uz

Submission #22091

# Submission time Handle Problem Language Result Execution time Memory
22091 2017-04-29T07:54:00 Z 삼*전자 그린픽스(#1005, pichulia) None (KRIII5P_2) C++
7 / 7
 249 ms 8936 KB 
#include<stdio.h>
int n, m;
long long int a[1000009];
long long int d[1009];
int main() {
	int i, j, k, l;
	scanf("%d %d", &n, &m);
	for (i = 0; i <= n; i++) {
		scanf("%lld", &a[n-i]);
	}
	printf("%lld\n", a[0]%m);
	for (i = 0; i <= n; i++) {
		d[i % (m - 1)] = (d[i % (m - 1)]+a[i])%m;
	}
	for (i = 1; i < m; i++) {
		long long int j = 1;
		long long int res = 0;
		for (k = 0; k < m-1; k++) {
			res = (res + j * d[k]) % m;
			j = (j*i) % m;
		}
		printf("%lld\n", res);
	}
	return 0;
}

Compilation message

pc.cpp: In function 'int main()':
pc.cpp:6:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j, k, l;
         ^
pc.cpp:6:15: warning: unused variable 'l' [-Wunused-variable]
  int i, j, k, l;
               ^
pc.cpp:7:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
                        ^
pc.cpp:9:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a[n-i]);
                         ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8936 KB Output is correct
2 Correct 0 ms 8936 KB Output is correct
3 Correct 0 ms 8936 KB Output is correct
4 Correct 0 ms 8936 KB Output is correct
5 Correct 0 ms 8936 KB Output is correct
6 Correct 23 ms 8936 KB Output is correct
7 Correct 26 ms 8936 KB Output is correct
8 Correct 23 ms 8936 KB Output is correct
9 Correct 23 ms 8936 KB Output is correct
10 Correct 23 ms 8936 KB Output is correct
11 Correct 13 ms 8936 KB Output is correct
12 Correct 19 ms 8936 KB Output is correct
13 Correct 6 ms 8936 KB Output is correct
14 Correct 0 ms 8936 KB Output is correct
15 Correct 3 ms 8936 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8936 KB Output is correct
2 Correct 0 ms 8936 KB Output is correct
3 Correct 0 ms 8936 KB Output is correct
4 Correct 0 ms 8936 KB Output is correct
5 Correct 0 ms 8936 KB Output is correct
6 Correct 23 ms 8936 KB Output is correct
7 Correct 26 ms 8936 KB Output is correct
8 Correct 23 ms 8936 KB Output is correct
9 Correct 23 ms 8936 KB Output is correct
10 Correct 23 ms 8936 KB Output is correct
11 Correct 13 ms 8936 KB Output is correct
12 Correct 19 ms 8936 KB Output is correct
13 Correct 6 ms 8936 KB Output is correct
14 Correct 0 ms 8936 KB Output is correct
15 Correct 3 ms 8936 KB Output is correct
16 Correct 206 ms 8936 KB Output is correct
17 Correct 226 ms 8936 KB Output is correct
18 Correct 193 ms 8936 KB Output is correct
19 Correct 193 ms 8936 KB Output is correct
20 Correct 196 ms 8936 KB Output is correct
21 Correct 213 ms 8936 KB Output is correct
22 Correct 226 ms 8936 KB Output is correct
23 Correct 249 ms 8936 KB Output is correct
24 Correct 216 ms 8936 KB Output is correct
25 Correct 216 ms 8936 KB Output is correct
26 Correct 236 ms 8936 KB Output is correct
27 Correct 239 ms 8936 KB Output is correct
28 Correct 223 ms 8936 KB Output is correct
29 Correct 196 ms 8936 KB Output is correct
30 Correct 199 ms 8936 KB Output is correct