Submission #22931

#TimeUsernameProblemLanguageResultExecution timeMemory
22931dotoryaFully Generate (KRIII5_FG)C++14
7 / 7
426 ms939520 KiB
#include <stdio.h> #include <algorithm> #include <assert.h> #include <cmath> #include <complex> #include <deque> #include <functional> #include <iostream> #include <limits.h> #include <map> #include <math.h> #include <queue> #include <set> #include <stdlib.h> #include <string.h> #include <string> #include <time.h> #include <unordered_map> #include <unordered_set> #include <vector> #pragma warning(disable:4996) #pragma comment(linker, "/STACK:336777216") using namespace std; #define mp make_pair #define Fi first #define Se second #define pb(x) push_back(x) #define szz(x) ((int)(x).size()) #define rep(i, n) for(int i=0;i<n;i++) #define all(x) (x).begin(), (x).end() #define ldb ldouble typedef tuple<int, int, int> t3; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair <int, int> pii; typedef pair <ll, ll> pll; typedef pair <ll, int> pli; typedef pair <db, db> pdd; int IT_MAX = 1 << 19; const ll MOD = 1000000007; const int INF = 0x3f3f3f3f; const ll LL_INF = 1034567890123456789ll; const db PI = acos(-1); const db ERR = 1E-11; ll cnt[40000000]; ll sum[40000000]; ll val[40000000]; ll mypow(ll a, ll b) { ll rv = 1; while (b) { if (b % 2) rv = (rv * a) % MOD; a = (a*a) % MOD; b /= 2; } return rv; } int main() { cnt[1] = 1, cnt[2] = 2; sum[1] = 1, sum[2] = 3; ll N, i; scanf("%lld", &N); if (N == 1) return !printf("1\n"); if (N == 2) return !printf("2\n"); if (N == 3) return !printf("4\n"); int p = 2; for (i = 3;; i++) { if (sum[p] < i) p++; cnt[i] = p; sum[i] = sum[i - 1] + cnt[i]; if (sum[i] > N) { cnt[i] = N - sum[i - 1]; break; } } int x = i; for (i = 1; i <= max(cnt[x - 1], cnt[x]); i++) val[i] = 1; for (i = 1; i <= x; i++) val[cnt[i]] = (val[cnt[i]] * i) % MOD; ll ans = 1; for (i = 1; i <= max(cnt[x - 1], cnt[x]); i++) ans = (ans * mypow(val[i], i)) % MOD; return !printf("%lld\n", ans); }

Compilation message (stderr)

FG.cpp:22:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)
 ^
FG.cpp:23:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")
 ^
FG.cpp: In function 'int main()':
FG.cpp:70:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &N);
                   ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...