oj.uz

답안 #22063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22063 2017-04-29T06:46:39 Z 아재 goto 써요?(#1011, baactree) 다항식 계산 (KRIII5P_2) C++14
7 / 7
 369 ms 8252 KB 
// =====================================================================================
// 
//       Filename:  pc.cpp
//        Created:  2017년 04월 29일 15시 32분 37초
//       Compiler:  g++ -O2 -std=c++14
//         Author:  baactree ,  [email protected]
//        Company:  Chonnam National University
// 
// =====================================================================================

#include <bits/stdc++.h>
using namespace std;
int n, p;
int arr[1001];
vector<int> temp;
int _pow(int a, int b){
	if(b==0)
		return 1;
	int temp=_pow(a, b/2);
	temp=(temp*temp)%p;
	if(b&1)
		return (temp*a)%p;
	return temp;
}
int main(){
	scanf("%d%d", &n, &p);
	for(int i=0;i<n+1;i++){
		int in;
		scanf("%d", &in);
		temp.push_back(in);
	}
	reverse(temp.begin(), temp.end());
	for(int i=0, idx=0;i<n+1;i++, idx++){
		if(idx==p)
			idx=1;
		int in=temp[i];
		arr[idx]=(arr[idx]+in)%p;
	}
	for(int i=0;i<p;i++){
		int ans=0;
		for(int j=0;j<p;j++){
			ans+=_pow(i, j)*arr[j];
			ans%=p;
		}
		printf("%d\n", ans);
	}
	return 0;
}

Compilation message

pc.cpp: In function 'int main()':
pc.cpp:26:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &p);
                       ^
pc.cpp:29:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &in);
                   ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2024 KB Output is correct
2 Correct 0 ms 2024 KB Output is correct
3 Correct 0 ms 2024 KB Output is correct
4 Correct 0 ms 2024 KB Output is correct
5 Correct 0 ms 2024 KB Output is correct
6 Correct 176 ms 2024 KB Output is correct
7 Correct 176 ms 2024 KB Output is correct
8 Correct 173 ms 2024 KB Output is correct
9 Correct 166 ms 2024 KB Output is correct
10 Correct 163 ms 2024 KB Output is correct
11 Correct 89 ms 2024 KB Output is correct
12 Correct 123 ms 2024 KB Output is correct
13 Correct 29 ms 2024 KB Output is correct
14 Correct 9 ms 2024 KB Output is correct
15 Correct 19 ms 2024 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2024 KB Output is correct
2 Correct 0 ms 2024 KB Output is correct
3 Correct 0 ms 2024 KB Output is correct
4 Correct 0 ms 2024 KB Output is correct
5 Correct 0 ms 2024 KB Output is correct
6 Correct 176 ms 2024 KB Output is correct
7 Correct 176 ms 2024 KB Output is correct
8 Correct 173 ms 2024 KB Output is correct
9 Correct 166 ms 2024 KB Output is correct
10 Correct 163 ms 2024 KB Output is correct
11 Correct 89 ms 2024 KB Output is correct
12 Correct 123 ms 2024 KB Output is correct
13 Correct 29 ms 2024 KB Output is correct
14 Correct 9 ms 2024 KB Output is correct
15 Correct 19 ms 2024 KB Output is correct
16 Correct 193 ms 8252 KB Output is correct
17 Correct 193 ms 8252 KB Output is correct
18 Correct 183 ms 8252 KB Output is correct
19 Correct 179 ms 8252 KB Output is correct
20 Correct 176 ms 8252 KB Output is correct
21 Correct 366 ms 8252 KB Output is correct
22 Correct 369 ms 8252 KB Output is correct
23 Correct 359 ms 8252 KB Output is correct
24 Correct 359 ms 8252 KB Output is correct
25 Correct 353 ms 8252 KB Output is correct
26 Correct 269 ms 8252 KB Output is correct
27 Correct 309 ms 8252 KB Output is correct
28 Correct 216 ms 8252 KB Output is correct
29 Correct 186 ms 8252 KB Output is correct
30 Correct 213 ms 8252 KB Output is correct