제출 #22473

#제출 시각아이디문제언어결과실행 시간메모리
22473최숭실 (#40)Fully Generate (KRIII5_FG)C++11
2 / 7
500 ms313616 KiB
#include <cstdio>
#include <queue>
#include <set> 
#include <vector>
#include <algorithm>
#include <map>
#define MOD 1000000007

long long pow(long long n, long long k) {
	if (k == 0) return 1;
	if (k == 1) return n%MOD;
	long long ret = pow(n, k / 2);
	ret = ret * ret % MOD;
	if (k & 1) ret = ret * n % MOD;
	return ret;
}
long long count(long long i) {
	if (i & 1) {
		return i / 2 * (i / 2 + 1) + i/2 + 1;
	}
	else {
		return i/2 * (i/2+1);
	}
}
long long dy[40000000];
int main() {
	long long n;
	scanf("%lld", &n);
	long long ans = 1;
	long long nu = 1;
	long long i = 0;
	long long pv = 0;
	dy[1] = 1; 
	dy[2] = dy[3] = 2;
	long long tot = 5;
	nu = 4;
	for (int i = 3; i < 40000000; i++) {
		for (int j = nu; j < nu + dy[i] && j < 40000000; j++) {
			dy[j] = i;
			tot += i;
		}
		nu += dy[i];
		if (nu >= 40000000) break;
	}
	ans = 1;
	nu = 0;
	for (i = 1; nu <= n; i++) {
		pv = dy[i];
		if (nu + pv > n) break;
		ans = ans * pow(i, pv) % MOD;
		nu += pv;
	}
	n -= nu;
	ans = ans * pow(i, n) % MOD;
	printf("%lld\n", ans);
}

컴파일 시 표준 에러 (stderr) 메시지

FG.cpp: In function 'int main()':
FG.cpp:28: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...