返回题解分享
讨论 / 题解分享/ 帖子详情

八次求和(编程题) - 题解

#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define LL long long
#define endl '\n'

const int MOD = 123456789;

int n;

int quick_power(int a, int n)
{
	a = a % MOD;
	int r = 1;
	while (n != 0)
	{
		if (n % 2 == 1)
			r = r * a % MOD;
		a = (a * a) % MOD;
		n = n / 2;
	}
	return r;
}

void solve()
{
	cin >> n;
	int sum = 0;
	for (int i = 1; i <= n; i++)
	{
		sum += quick_power(i, 8);
	}
	cout << sum % MOD;
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	solve();

	return 0;
}
0 回复 0 转发 0 喜欢 0 阅读
回复 (0)
默认 最新
暂无回复,快来抢沙发!