oj.uz

Submission #22253

# Submission time Handle Problem Language Result Execution time Memory
22253 2017-04-30T03:13:38 Z King_God_OnionPringles(#981, mAng0) Fully Generate (KRIII5_FG) C++
2 / 7
 500 ms 392644 KB 
#include<bits/stdc++.h>
#define je 1000000007
using namespace std;

long long gop(int x, int y){
    long long poww = x;
    long long ans = 1;
    int left = y;
    while(left){
        if(left & 1){
            ans = (ans * poww) % je;
        }
        poww = (poww * poww) % je;
        left >>= 1;
    }
    return ans;
}

int cnt[100000001];

int main(){
    long long n;
    scanf("%lld",&n);
    long long ans = 1;
    int pnt = 1, now = 2;
    for(int i=1;;i++){
        if(i<=2){
            cnt[i] = i;
        }else{
            if(pnt == 0){
                now++;
                pnt = cnt[now];
            }
            cnt[i] = now;
            pnt--;
        }
        if(n <= cnt[i]){
            ans = (ans * gop(i,n)) % je;
            break;
        }else{
            n -= cnt[i];
            ans = (ans * gop(i,cnt[i])) % je;
        }
    }
    printf("%lld",ans);
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:23:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&n);
                     ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 392644 KB Output is correct
2 Correct 0 ms 392644 KB Output is correct
3 Correct 0 ms 392644 KB Output is correct
4 Correct 0 ms 392644 KB Output is correct
5 Correct 0 ms 392644 KB Output is correct
6 Correct 0 ms 392644 KB Output is correct
7 Correct 0 ms 392644 KB Output is correct
8 Correct 0 ms 392644 KB Output is correct
9 Correct 0 ms 392644 KB Output is correct
10 Correct 0 ms 392644 KB Output is correct
11 Correct 0 ms 392644 KB Output is correct
12 Correct 0 ms 392644 KB Output is correct
13 Correct 0 ms 392644 KB Output is correct
14 Correct 0 ms 392644 KB Output is correct
15 Correct 0 ms 392644 KB Output is correct
16 Correct 0 ms 392644 KB Output is correct
17 Correct 0 ms 392644 KB Output is correct
18 Correct 0 ms 392644 KB Output is correct
19 Correct 0 ms 392644 KB Output is correct
20 Correct 0 ms 392644 KB Output is correct
21 Correct 0 ms 392644 KB Output is correct
22 Correct 0 ms 392644 KB Output is correct
23 Correct 0 ms 392644 KB Output is correct
24 Correct 0 ms 392644 KB Output is correct
25 Correct 0 ms 392644 KB Output is correct
26 Correct 0 ms 392644 KB Output is correct
27 Correct 0 ms 392644 KB Output is correct
28 Correct 0 ms 392644 KB Output is correct
29 Correct 0 ms 392644 KB Output is correct
30 Correct 0 ms 392644 KB Output is correct
31 Correct 0 ms 392644 KB Output is correct
32 Correct 0 ms 392644 KB Output is correct
33 Correct 0 ms 392644 KB Output is correct
34 Correct 0 ms 392644 KB Output is correct
35 Correct 0 ms 392644 KB Output is correct
36 Correct 0 ms 392644 KB Output is correct
37 Correct 0 ms 392644 KB Output is correct
38 Correct 0 ms 392644 KB Output is correct
39 Correct 0 ms 392644 KB Output is correct
40 Correct 0 ms 392644 KB Output is correct
41 Correct 0 ms 392644 KB Output is correct
42 Correct 0 ms 392644 KB Output is correct
43 Correct 0 ms 392644 KB Output is correct
44 Correct 0 ms 392644 KB Output is correct
45 Correct 0 ms 392644 KB Output is correct
46 Correct 0 ms 392644 KB Output is correct
47 Correct 0 ms 392644 KB Output is correct
48 Correct 0 ms 392644 KB Output is correct
49 Correct 0 ms 392644 KB Output is correct
50 Correct 0 ms 392644 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 392644 KB Output is correct
2 Correct 0 ms 392644 KB Output is correct
3 Correct 0 ms 392644 KB Output is correct
4 Correct 0 ms 392644 KB Output is correct
5 Correct 0 ms 392644 KB Output is correct
6 Correct 0 ms 392644 KB Output is correct
7 Correct 0 ms 392644 KB Output is correct
8 Correct 0 ms 392644 KB Output is correct
9 Correct 0 ms 392644 KB Output is correct
10 Correct 0 ms 392644 KB Output is correct
11 Correct 0 ms 392644 KB Output is correct
12 Correct 0 ms 392644 KB Output is correct
13 Correct 0 ms 392644 KB Output is correct
14 Correct 0 ms 392644 KB Output is correct
15 Correct 0 ms 392644 KB Output is correct
16 Correct 0 ms 392644 KB Output is correct
17 Correct 0 ms 392644 KB Output is correct
18 Correct 0 ms 392644 KB Output is correct
19 Correct 0 ms 392644 KB Output is correct
20 Correct 0 ms 392644 KB Output is correct
21 Correct 0 ms 392644 KB Output is correct
22 Correct 0 ms 392644 KB Output is correct
23 Correct 0 ms 392644 KB Output is correct
24 Correct 0 ms 392644 KB Output is correct
25 Correct 0 ms 392644 KB Output is correct
26 Correct 0 ms 392644 KB Output is correct
27 Correct 0 ms 392644 KB Output is correct
28 Correct 0 ms 392644 KB Output is correct
29 Correct 0 ms 392644 KB Output is correct
30 Correct 0 ms 392644 KB Output is correct
31 Correct 0 ms 392644 KB Output is correct
32 Correct 0 ms 392644 KB Output is correct
33 Correct 0 ms 392644 KB Output is correct
34 Correct 0 ms 392644 KB Output is correct
35 Correct 0 ms 392644 KB Output is correct
36 Correct 0 ms 392644 KB Output is correct
37 Correct 0 ms 392644 KB Output is correct
38 Correct 0 ms 392644 KB Output is correct
39 Correct 0 ms 392644 KB Output is correct
40 Correct 0 ms 392644 KB Output is correct
41 Correct 0 ms 392644 KB Output is correct
42 Correct 0 ms 392644 KB Output is correct
43 Correct 0 ms 392644 KB Output is correct
44 Correct 0 ms 392644 KB Output is correct
45 Correct 0 ms 392644 KB Output is correct
46 Correct 0 ms 392644 KB Output is correct
47 Correct 0 ms 392644 KB Output is correct
48 Correct 0 ms 392644 KB Output is correct
49 Correct 0 ms 392644 KB Output is correct
50 Correct 0 ms 392644 KB Output is correct
51 Execution timed out 500 ms 392644 KB Execution timed out
52 Halted 0 ms 0 KB -