oj.uz

답안 #22915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22915 2017-04-30T12:44:25 Z dotorya 다항식 계산 (KRIII5P_2) C++14
7 / 7
 276 ms 9840 KB 
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;

#define mp make_pair
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
#define ldb ldouble

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 1034567890123456789ll;
const db PI = acos(-1);
const db ERR = 1E-11;

ll A[1000050];
ll sum[1050];
int main() {
	int N, P, i, j;
	scanf("%d %d", &N, &P);
	for (i = N; i >= 0; i--) {
		scanf("%lld", &A[i]);
		sum[i % (P - 1)] += A[i];
		sum[i % (P - 1)] %= P;
	}

	printf("%lld\n", A[0] % P);
	for (i = 1; i < P; i++) {
		ll s = 0, v = 1;
		for (j = 0; j < P; j++) {
			s = (s + sum[j] * v) % P;
			v = (v*i) % P;
		}
		printf("%lld\n", s);
	}
	return 0;
}

Compilation message

pc.cpp:22:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)
 ^
pc.cpp:23:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")
 ^
pc.cpp: In function 'int main()':
pc.cpp:56:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &P);
                        ^
pc.cpp:58:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &A[i]);
                       ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 9840 KB Output is correct
2 Correct 0 ms 9840 KB Output is correct
3 Correct 0 ms 9840 KB Output is correct
4 Correct 0 ms 9840 KB Output is correct
5 Correct 0 ms 9840 KB Output is correct
6 Correct 26 ms 9840 KB Output is correct
7 Correct 39 ms 9840 KB Output is correct
8 Correct 29 ms 9840 KB Output is correct
9 Correct 23 ms 9840 KB Output is correct
10 Correct 23 ms 9840 KB Output is correct
11 Correct 19 ms 9840 KB Output is correct
12 Correct 23 ms 9840 KB Output is correct
13 Correct 6 ms 9840 KB Output is correct
14 Correct 0 ms 9840 KB Output is correct
15 Correct 3 ms 9840 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 9840 KB Output is correct
2 Correct 0 ms 9840 KB Output is correct
3 Correct 0 ms 9840 KB Output is correct
4 Correct 0 ms 9840 KB Output is correct
5 Correct 0 ms 9840 KB Output is correct
6 Correct 26 ms 9840 KB Output is correct
7 Correct 39 ms 9840 KB Output is correct
8 Correct 29 ms 9840 KB Output is correct
9 Correct 23 ms 9840 KB Output is correct
10 Correct 23 ms 9840 KB Output is correct
11 Correct 19 ms 9840 KB Output is correct
12 Correct 23 ms 9840 KB Output is correct
13 Correct 6 ms 9840 KB Output is correct
14 Correct 0 ms 9840 KB Output is correct
15 Correct 3 ms 9840 KB Output is correct
16 Correct 223 ms 9840 KB Output is correct
17 Correct 199 ms 9840 KB Output is correct
18 Correct 219 ms 9840 KB Output is correct
19 Correct 223 ms 9840 KB Output is correct
20 Correct 223 ms 9840 KB Output is correct
21 Correct 243 ms 9840 KB Output is correct
22 Correct 233 ms 9840 KB Output is correct
23 Correct 223 ms 9840 KB Output is correct
24 Correct 216 ms 9840 KB Output is correct
25 Correct 219 ms 9840 KB Output is correct
26 Correct 276 ms 9840 KB Output is correct
27 Correct 216 ms 9840 KB Output is correct
28 Correct 193 ms 9840 KB Output is correct
29 Correct 213 ms 9840 KB Output is correct
30 Correct 236 ms 9840 KB Output is correct