oj.uz

Submission #22138

# Submission time Handle Problem Language Result Execution time Memory
22138 2017-04-29T11:21:04 Z 연습대회 팀 네임은 수정할 수 있을까?(#1024, qja0950) None (KRIII5P_2) C++14
7 / 7
 209 ms 5024 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <string.h>

using namespace std;

#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long ll;

const int MAX_N = 1e6 + 100, MAX_P = 1e3 + 100;

int N, P, Nr[MAX_N], Ans[MAX_P];
int main() {
	scanf("%d%d", &N, &P); for(int i=N; i>=0; i--) scanf("%d", &Nr[i]), Nr[i] %= P;
	Ans[0] = Nr[0];
	for(int i=N; i>=P-1; i--) Nr[i-(P-1)] = (Nr[i-(P-1)] + Nr[i]) % P;
	for(int x=1; x<P; x++) {
		int pw = 1, &ans = Ans[x];
		for(int i=0; i<P-1; i++) {
			ans = (ans + pw * Nr[i]) % P;
			pw = pw * x % P;
		}
	}
	for(int i=0; i<P; i++) printf("%d\n", Ans[i]);
	return 0;
}

Compilation message

pc.cpp: In function 'int main()':
pc.cpp:20:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &P); for(int i=N; i>=0; i--) scanf("%d", &Nr[i]), Nr[i] %= P;
                       ^
pc.cpp:20:80: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &P); for(int i=N; i>=0; i--) scanf("%d", &Nr[i]), Nr[i] %= P;
                                                                                ^

Subtask #1
2.0 / 2.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5024 KB Output is correct
2 Correct 0 ms 5024 KB Output is correct
3 Correct 0 ms 5024 KB Output is correct
4 Correct 0 ms 5024 KB Output is correct
5 Correct 0 ms 5024 KB Output is correct
6 Correct 13 ms 5024 KB Output is correct
7 Correct 13 ms 5024 KB Output is correct
8 Correct 13 ms 5024 KB Output is correct
9 Correct 13 ms 5024 KB Output is correct
10 Correct 13 ms 5024 KB Output is correct
11 Correct 6 ms 5024 KB Output is correct
12 Correct 9 ms 5024 KB Output is correct
13 Correct 3 ms 5024 KB Output is correct
14 Correct 0 ms 5024 KB Output is correct
15 Correct 0 ms 5024 KB Output is correct
16 Correct 206 ms 5024 KB Output is correct
17 Correct 189 ms 5024 KB Output is correct
18 Correct 196 ms 5024 KB Output is correct
19 Correct 189 ms 5024 KB Output is correct
20 Correct 183 ms 5024 KB Output is correct
21 Correct 199 ms 5024 KB Output is correct
22 Correct 196 ms 5024 KB Output is correct
23 Correct 189 ms 5024 KB Output is correct
24 Correct 206 ms 5024 KB Output is correct
25 Correct 196 ms 5024 KB Output is correct
26 Correct 189 ms 5024 KB Output is correct
27 Correct 209 ms 5024 KB Output is correct
28 Correct 193 ms 5024 KB Output is correct
29 Correct 186 ms 5024 KB Output is correct
30 Correct 189 ms 5024 KB Output is correct