首页 > 代码库 > HDU - 4944 FSF’s game

HDU - 4944 FSF’s game

2024-07-17 05:57:02   219人阅读

Problem Description
FSF has programmed a game.
In this game, players need to divide a rectangle into several same squares.
The length and width of rectangles are integer, and of course the side length of squares are integer.

After division, players can get some coins.
If players successfully divide a AxB rectangle(length: A, width: B) into KxK squares(side length: K), they can get A*B/ gcd(A/K,B/K) gold coins.
In a level, you can’t get coins twice with same method.
(For example, You can get 6 coins from 2x2(A=2,B=2) rectangle. When K=1, A*B/gcd(A/K,B/K)=2; When K=2, A*B/gcd(A/K,B/K)=4; 2+4=6; )

There are N*(N+1)/2 levels in this game, and every level is an unique rectangle. (1x1 , 2x1, 2x2, 3x1, ..., Nx(N-1), NxN)

FSF has played this game for a long time, and he finally gets all the coins in the game.
Unfortunately ,he uses an UNSIGNED 32-BIT INTEGER variable to count the number of coins.
This variable may overflow.
We want to know what the variable will be.
(In other words, the number of coins mod 2^32)
 

Input
There are multiply test cases.

The first line contains an integer T(T<=500000), the number of test cases

Each of the next T lines contain an integer N(N<=500000).
 

Output
Output a single line for each test case.

For each test case, you should output "Case #C: ". first, where C indicates the case number and counts from 1.

Then output the answer, the value of that UNSIGNED 32-BIT INTEGER variable.
 

Sample Input
3
1
3
100
 

Sample Output
Case #1: 1
Case #2: 30
Case #3: 15662489


Hint
In the second test case, there are six levels(1x1,1x2,1x3,2x2,2x3,3x3)
Here is the details for this game:
1x1: 1(K=1); 1x2: 2(K=1); 1x3: 3(K=1);  2x2: 2(K=1), 4(K=2); 2x3: 6(K=1); 3x3: 3(K=1), 9(K=3); 
1+2+3+2+4+6+3+9=30

题意：给你个n，让你求在n的范围内，能否将一个矩形分成若干个相同大小为k的正方形，对应有val值，让你统计在n内的所有可能的分数总值

思路：首先我们来试着求解∑(n*i)/(gcd(n/k, i/k)) {1<=i <= n} ，那么我们可以确定的是如果可以把n*m的矩形分成大小为k的正方形的话，那么k一定是gcd(n, i)的因子，那么对于一项来说因为公式可以变形为(n*i*k)/gcd(n, i) -> n*(i/c1 + i/c2 + ...) {k枚举所有的可能}，

就拿6*1, 6*2, 6*3, 6*4, 6*5, 6*6来说，对应的k依次有

       1；1、2； 1、3；1、2；1；1，2，6，那么cj是n的因子，那么i/cj就是因子对应的系数，我们再从所有的i来讲，对于因子cj我们可以计算出所有可能的数，比如因子cj,我们可以得到cj, 2*cj, 3*cj, 4*cj....n，那么对应的系数就是我们需要的i/cj,累加起来计算是:

num[cj] = (1+2+...+n/cj)=(1+n/cj)*(n/cj)/2，然后最后是递推：

ans[n]=ans[n-1]+val[n] {val[n]=∑num[cj] {1<=i <= n}}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll __int64
using namespace std;
const int maxn = 500005;
const ll mod = 1ll<<32;

ll num[maxn], dp[maxn];

void cal() {
	for (ll i = 1; i < maxn; i++) 
		for (ll j = i; j < maxn; j += i)
			num[j] += (j/i+1) * (j/i) / 2;
}

void init() {
	memset(num, 0, sizeof(num));
	cal();
	dp[1] = 1;
	for (ll i = 2; i < maxn; i++) {
		dp[i] = dp[i-1] + num[i]*i;
		dp[i] = dp[i] % mod;
	}
}

int main() {
	init();
	int t, n, cas = 1;
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		printf("Case #%d: %I64d\n", cas++, dp[n]);
	}
	return 0;
}


联系
我们