# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22864 | 이대회 트래쉬 대회에야옹 (#40) | Fully Generate (KRIII5_FG) | C++98 | 0 ms | 2020 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.
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
long long *mp;
int main()
{
long long n;
long long sum = 0;
scanf("%lld", &n);
mp = new long long[n];
if (n == 1)
{
cout << 1;
return 0;
}
mp[1] = 1;
sum += mp[1];
long long i,j;
long long mul =1;
for (i = 2; i <= n; i++)
{
mp[i] = 1 + mp[i - mp[mp[i - 1]]];
sum += mp[i];
if(sum > n)
{
sum -= mp[i];
while(1)
{
if(sum == n)
break;
mul = (mul*i)%1000000007;
sum++;
}
}
else
{
for(j=0; j<mp[i]; j++)
{
mul = (mul*i)%1000000007;
}
}
}
cout << mul << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |