【HDU4944】预处理（类似素数筛选）

FSF’s game Time Limit: 9000/4500 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 443    Accepted Submission(s): 211 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   Author UESTC   Source 2014 Multi-University Training Contest 7

题解转自：http://blog.csdn.net/keshuai19940722/article/details/38519681#comments

题目大意：给定N，可以用不大于N的长a和宽b，组成N∗(N−1)2种不同的矩形，对于每个矩形a∗b要计算它的值，K为矩形a，b可以拆分成若干个K∗K的正方形。∑a∗bgcd(a/k,b/k),输出所有矩形值的和。

解题思路：假设有边a和b，那么k肯定即使a的因子也是b的因子。定义f(n)为矩形最长边等于n的情况下所有矩形值的和。那么f(n)=val(1∗n)+val(2∗n)+⋯+val(n∗n),枚举n的因子作为k，现在假设有因子k，使得n=k∗a:
g(k)=1∗k∗nk+2∗k∗nk+⋯+a∗k∗nk

=1∗n+2∗n+⋯+a∗n

=(1+a)∗a2∗n

f(n)=∑g(k)（k为n的因子）
然后用类似素数筛选法的方式处理处f(i)的值，对应再累加即使答案。

#define DeBUG
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <sstream>
#include <map>
#include <list>
#include <bitset>
using namespace std ;
#define zero {0}
#define INF 0x3f3f3f3f
#define EPS 1e-6
#define TRUE true
#define FALSE false
typedef long long LL;
const double PI = acos(-1.0);
//#pragma comment(linker, "/STACK:102400000,102400000")
inline int sgn(double x)
{
    return fabs(x) < EPS ? 0 : (x < 0 ? -1 : 1);
}
#define N 100005
const long long MOD = 1LL << 32;
const int maxn = 500000;
unsigned long long f[maxn + 5], s[maxn + 5];
void init()
{
    memset(f, 0, sizeof(f));
    s[0] = f[1] = 0;
    for (int i = 1; i <= maxn; i++)
    {
        for (int k = i, d = 1; k <= maxn; k += i, d++)
        {
            f[k] += (1LL + d) * d / 2;
            f[k] %= MOD;
        }
        f[i] = f[i] * i % MOD;
    }
    for (long long i = 1; i <= maxn; i++)
        s[i] = (s[i - 1] + f[i]) % MOD;
}
int main()
{
#ifdef DeBUGs
    freopen("C:\\Users\\Sky\\Desktop\\1.in", "r", stdin);
#endif
    init();
    int cas, n;
    scanf("%d", &cas);
    for (int kcas = 1; kcas <= cas; kcas++)
    {
        scanf("%d", &n);
        printf("Case #%d: %I64u\n", kcas, s[n]);
    }

    return 0;
}