Submission #41541

#	Time	Username	Problem	Language	Result	Execution time	Memory
41541		dudgh623	팩토리얼 세제곱들의 합 (YDX14_fact)	C++14	1 / 1	2 ms	696 KiB

fact

#include <iostream>
#include <memory.h>
#include <map>
#include <string>
#include <functional>
#include <vector>
using namespace std;

typedef long long ll;
const ll mod = 10000000;
ll n, k;
ll fa(ll a)
{
	if (a == 0)
		return 1;
	ll res = 1;
	for (ll i = 1; i <= a; i++)
		res =(res* i)%mod;
	return res;
}
ll po(ll a)
{
	if (k == 0)
		return 1;
	ll res = 1;
	for (int i = 0; i < k; i++)
		res = (res * a)%mod;
	return res;
}
int main() {
	
	cin >> n >> k;
	ll res = 0;
	for (ll i = 0; i <= n; i++)
		res = res + (po(fa(i)));
	

	while (1)
	{
		if (res == 0)
			return 0;
		else if (res % 10 != 0) {
			cout << res % 10 << endl;
			return 0;
		}
		res = res / 10;
	}
	return 0;


}

• Subtask 1: 1 / 1