【DP】 HDOJ 4834 JZP Set

可以说是DP。。也可以说是递推。。。挺难的题。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 10000005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

LL cnt[maxn], dp[maxn], sum[maxn];
void init(void)
{
	for(int i = 1; i <= 10000000; i += 2)
		for(int j = i; j <= 10000000; j += i)
			++cnt[j];
	sum[0] = dp[0] = 1;
	for(int i = 1; i <= 10000000; i++) sum[i] = sum[i-1] + cnt[i-1];
	for(int i = 1; i <= 10000000; i++) dp[i] = dp[i-1] + sum[i];
}
int main(void)
{
	init();
	int _, __, n;
	while(scanf("%d", &_)!=EOF) {
		__ = 0;
		while(_--) {
			scanf("%d", &n);
			printf("Case #%d:\n", ++__);
			printf("%I64d\n", dp[n]);
		}
	}
	return 0;
}