# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22406 | 예제는 나오는데 왜 틀리죠?? (#40) | Fully Generate (KRIII5_FG) | C++14 | 500 ms | 395316 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// =====================================================================================
//
// Filename: fg.cpp
// Created: 2017년 04월 30일 12시 39분 09초
// Compiler: g++ -O2 -std=c++14
// Author: baactree , [email protected]
// Company: Chonnam National University
//
// =====================================================================================
#include <bits/stdc++.h>
using namespace std;
const int mod=1000000007;
typedef long long ll;
ll _pow(ll a, ll b){
if(b==0)
return 1;
ll temp=_pow(a, b/2);
temp=(temp*temp)%mod;
if(b&1)
return (temp*a)%mod;
return temp;
}
int main(){
int cnt=1;
int idx=1;
vector<int> arr;
arr.push_back(0);
arr.push_back(1);
arr.push_back(2);
arr.push_back(2);
for(int i=3;i<60000;i++){
for(int j=0;j<arr[i];j++)
arr.push_back(i);
}
long long n;
scanf("%lld", &n);
int k;
long long sum=0;
for(int i=1;i<arr.size();i++){
sum+=arr[i];
if(sum>n){
k=i;
break;
}
}
ll ans=1;
for(int i=1;i<k;i++){
ans=(ans*_pow(i, arr[i]))%mod;
n-=arr[i];
}
ans=(ans*_pow(k, n))%mod;
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |