2013年8月7日

zoj 2562 反素数

摘要： 题目大意：求n范围内最大的反素数（反素数定义：f(x)表示x的因子数，f(x)>f(x1) （0=p2>=......>=pn证明：若pi#includeusing namespace std;typedef long long LL;int prime[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};LL n,ans,Max;void dfs(LL sum,LL num,LL k,LL t){ if(sum>Max) {Max=sum;ans=num;} if(sum==Max && num14) retu 阅读全文

posted @ 2013-08-07 22:36 雄.. 阅读(194) 评论(0) 推荐(0)

uva 11916 解模方程a^x=b (mod n)

摘要： Emoogle GridYou have to color anMxN(1M,N108) two dimensional grid. You will be providedK(2K108) different colors to do so. You will also be provided a list ofB(0B500) list of blocked cells of this grid. You cannot color those blocked cells. A cell can be described as(x,y), which points to they-th ce 阅读全文

posted @ 2013-08-07 09:44 雄.. 阅读(545) 评论(0) 推荐(0)

导航