![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
文章平均质量分 71
sunbaofeng2
这个作者很懒,什么都没留下…
展开
-
n-k集
#include#include#include#include#include#include#include#include #define LL long long#define inf 0x7fffffff#define E 1e-9#define M 310#define N 505#define f(n,k) f[n+1][k+1]using namespa原创 2012-09-26 19:29:45 · 1679 阅读 · 0 评论 -
10375 - Choose and divide
#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 10000#define MIN 1e-11#define M 100#define LL long longusing namespace std;//int n,k,h,t,m;int ma原创 2012-09-17 23:42:57 · 332 阅读 · 0 评论 -
uva 10791 - Minimum Sum LCM
#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 60000000#define MIN 1e-11#define M 100#define LL long longusing namespace std;//int n,k,h,t,m;in原创 2012-09-17 22:24:12 · 449 阅读 · 0 评论 -
无平方因子的数
#include#include#include#include#include#include#include#include #define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 1000005using namespace std;int n,k,h,m,e;原创 2012-09-19 23:40:43 · 625 阅读 · 0 评论 -
HDU 3641 Treasure Hunting
题意:给出ai bi(i=1->n),M = a1^b1 * … * ai^bi * … * an^bn,求一个最小的整数x,使x! % M == 0.#include#include#include#include#include #define M 1#define N#define inf 100000000using namespace std;long原创 2012-08-07 11:33:14 · 341 阅读 · 0 评论