Submission #26348

#	Time	Username	Problem	Language	Result	Execution time	Memory
26348		dotorya	팩토리얼 세제곱들의 합 (YDX14_fact)	C++14	1 / 1	0 ms	2020 KiB

fact

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#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 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 << 18;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x1f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

int F[105];
int main() {
	int N, K, i, j;
	scanf("%d %d", &N, &K);

	F[0] = 1;
	for (i = 1; i <= N; i++) F[i] = F[i - 1] * i % 1000;

	int ans = 0;
	for (i = 0; i <= N; i++) {
		int t = 1;
		for (j = 1; j <= K; j++) t = t * F[i] % 1000;
		ans = (ans + t) % 1000;
	}
	
	int a = ans % 10;
	if (!a) a = (ans / 10) % 10;
	if (!a) a = (ans / 100) % 10;
	return !printf("%d\n", a);
}

Compilation message (stderr)

fact.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)  
 ^
fact.cpp:24:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")  
 ^
fact.cpp: In function 'int main()':
fact.cpp:51:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &K);
                        ^

• Subtask 1: 1 / 1