oj.uz

답안 #22069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22069 2017-04-29T07:04:45 Z 연습 세션과 본 대회의 등록은 왜 따로일까(#1013, gs13105) 다항식 계산 (KRIII5P_2) C++14
7 / 7
 246 ms 8928 KB 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>

using namespace std;

long long arr[1000010];

int main()
{
    int n, p, i, j;
    long long c, r;
    scanf("%d%d", &n, &p);
    for(i = n; i>=0; i--)
        scanf("%lld", &arr[i]);

    if(p == 2)
    {
        printf("%lld\n", arr[0] % p);
        r = 0;
        for(i = 0; i<=n; i++)
        {
            r += arr[i];
            r %= p;
        }
        printf("%lld", r);
        return 0;
    }

    printf("%lld\n", arr[0] % p);

    for(i = p-1; i<=n; i++)
    {
        arr[i%(p-1)] += arr[i];
        arr[i%(p-1)] %= p;
    }
    
    for(i = 1; i<p; i++)
    {
        c = 1;
        r = 0;
        for(j = 0; j<p-1; j++)
        {
            r += arr[j] * c;
            c *= i;

            r %= p;
            c %= p;
        }

        printf("%lld\n", r);
    }
    return 0;
}

Compilation message

pc.cpp: In function 'int main()':
pc.cpp:14:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &p);
                          ^
pc.cpp:16:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &arr[i]);
                               ^

Subtask #1
2.0 / 2.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 8928 KB Output is correct
2 Correct 0 ms 8928 KB Output is correct
3 Correct 0 ms 8928 KB Output is correct
4 Correct 0 ms 8928 KB Output is correct
5 Correct 0 ms 8928 KB Output is correct
6 Correct 26 ms 8928 KB Output is correct
7 Correct 23 ms 8928 KB Output is correct
8 Correct 23 ms 8928 KB Output is correct
9 Correct 29 ms 8928 KB Output is correct
10 Correct 23 ms 8928 KB Output is correct
11 Correct 13 ms 8928 KB Output is correct
12 Correct 19 ms 8928 KB Output is correct
13 Correct 6 ms 8928 KB Output is correct
14 Correct 0 ms 8928 KB Output is correct
15 Correct 3 ms 8928 KB Output is correct
16 Correct 179 ms 8928 KB Output is correct
17 Correct 203 ms 8928 KB Output is correct
18 Correct 196 ms 8928 KB Output is correct
19 Correct 193 ms 8928 KB Output is correct
20 Correct 246 ms 8928 KB Output is correct
21 Correct 229 ms 8928 KB Output is correct
22 Correct 239 ms 8928 KB Output is correct
23 Correct 233 ms 8928 KB Output is correct
24 Correct 239 ms 8928 KB Output is correct
25 Correct 209 ms 8928 KB Output is correct
26 Correct 199 ms 8928 KB Output is correct
27 Correct 219 ms 8928 KB Output is correct
28 Correct 213 ms 8928 KB Output is correct
29 Correct 206 ms 8928 KB Output is correct
30 Correct 203 ms 8928 KB Output is correct