oj.uz

Submission #22089

# Submission time Handle Problem Language Result Execution time Memory
22089 2017-04-29T07:51:44 Z 삼*전자 그린픽스(#1005, pichulia) None (KRIII5P_2) C++
2 / 7
 186 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] += a[i%(m-1)];
	}
	for (i = 1; i < m; i++) {
		long long int j = 1;
		long long int res = 0;
		for (k = 0; k < m; 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 26 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
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 26 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 Incorrect 186 ms 8936 KB Output isn't correct
17 Halted 0 ms 0 KB -