# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140164 | rdd6584 | Fully Generate (KRIII5_FG) | C++14 | 1084 ms | 78528 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 <cstdio>
#include <algorithm>
#include <memory.h>
#include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int vec[20000001];
ll mp(ll a, ll b) {
ll ret = 1;
while (b) {
if (b % 2) ret = ret * a % MOD;
a = a * a % MOD;
b /= 2;
}
return ret;
}
int main() {
ll n;
scanf("%lld", &n);
if (n == 1) return !printf("1");
if (n == 2) return !printf("2");
if (n == 3) return !printf("4");
int now = 3; // 수 이자 인덱스.
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |