BZOJ1225题解
(CSDN公式会蛋疼……于是只能贴图……)
![](https://img-my.csdn.net/uploads/201301/08/1357650420_2991.jpg)
Code
DP:
//BZOJ1225; 求正整数 (HNOI2001); DP
//SGU475; Droid Fromation;
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#define N 50000
#define LOGN 15
#define SIZE 10000
#define MOD 100000000LL
#ifdef WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long long ll;
const double INFI = 123456789012345.0;
const int p[LOGN + 1] = {0, 2, 3, 5, 7, 11, 13