ACM---数论 - 随笔分类 - 芷水

HDU 4944 FSF’s game 一道好题

摘要：FSF’s game Time Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 727 Accepted Submission(s): 377 Prob 阅读全文

posted @ 2014-11-08 19:03 芷水阅读(280) 评论(0) 推荐(0)

POJ Sky Code 莫比乌斯反演

摘要：N. Sky CodeTime Limit:1000msCase Time Limit:1000msMemory Limit:65536KB64-bit integer IO format:%lld Java class name:MainSubmitStatusFont Size:+-Stancu... 阅读全文

posted @ 2014-10-18 10:46 芷水阅读(284) 评论(0) 推荐(0)

HDU How many integers can you find 容斥

摘要：How many integers can you findTime Limit: 12000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4249Accepted Submis... 阅读全文

posted @ 2014-10-17 10:18 芷水阅读(156) 评论(0) 推荐(0)

spoj 3871. GCD Extreme 欧拉+积性函数

摘要：3871. GCD ExtremeProblem code: GCDEXGiven the value of N, you will have to find the value of G. The meaning of G is given in the following codeG=0;for... 阅读全文

posted @ 2014-08-30 11:15 芷水阅读(267) 评论(0) 推荐(0)

spoj LCMSUM sigma(lcm(i,n));

摘要：Problem code: LCMSUMGiven n, calculate the sum LCM(1,n) + LCM(2,n) + .. + LCM(n,n), where LCM(i,n) denotes the Least Common Multiple of the integers i... 阅读全文

posted @ 2014-08-28 21:07 芷水阅读(431) 评论(0) 推荐(0)

bzoj 2005: [Noi2010]能量采集

摘要：2005: [Noi2010]能量采集Time Limit:10 SecMemory Limit:552 MBSubmit:1653Solved:983[Submit][Status]Description栋栋有一块长方形的地，他在地上种了一种能量植物，这种植物可以采集太阳光的能量。在这些植物采集能... 阅读全文

posted @ 2014-08-27 12:09 芷水阅读(163) 评论(0) 推荐(0)

bzoj 2818: Gcd GCD(a,b) = 素数

摘要：2818: GcdTime Limit:10 SecMemory Limit:256 MBSubmit:1566Solved:691[Submit][Status]Description给定整数N，求1 2 #include 3 #include 4 #include 5 using namespa... 阅读全文

posted @ 2014-08-26 23:41 芷水阅读(1151) 评论(0) 推荐(0)

spoj 7001. Visible Lattice Points GCD问题莫比乌斯反演

摘要：SPOJ Problem Set (classical)7001. Visible Lattice PointsProblem code: VLATTICEConsider a N*N*N lattice. One corner is at (0,0,0) and the opposite one ... 阅读全文

posted @ 2014-08-24 19:49 芷水阅读(659) 评论(0) 推荐(0)

nyoj CO-PRIME 莫比乌斯反演

摘要：CO-PRIME时间限制：1000ms | 内存限制：65535KB难度：3描述This problem is so easy! Can you solve it?You are given a sequence which contains n integers a1,a2……an, your t... 阅读全文

posted @ 2014-08-10 09:35 芷水阅读(355) 评论(0) 推荐(0)

HDU 4910 Problem about GCD 找规律+大素数判断+分解因子

摘要：Problem about GCDTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 470Accepted Submission(s): 77Prob... 阅读全文

posted @ 2014-08-08 22:26 芷水阅读(533) 评论(0) 推荐(0)

HDU 4651 Partition 整数划分，可重复情况

摘要：PartitionTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 842Accepted Submission(s): 478 Problem... 阅读全文

posted @ 2014-08-01 09:50 芷水阅读(236) 评论(0) 推荐(0)

hdu 4869 Turn the pokers

摘要：Turn the pokersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1213Accepted Submission(s): 449Prob... 阅读全文

posted @ 2014-07-27 11:04 芷水阅读(169) 评论(0) 推荐(0)

hnu Dirichlet's Theorem

摘要：1 /* 2 求ax+b x属于区间[L,R];范围内素数的个数。 3 a*R+b1 那么a+b 2*a+b ..都会是合数。此时只有判断b是否为素数。 7 8 2.如果GCD(a,b)=1 那么就可以列式子 9 ax+b %p = 0 其中p为素数。如果满足，那么ax+b... 阅读全文

posted @ 2014-07-23 16:20 芷水阅读(192) 评论(0) 推荐(0)

hdu 3123

摘要：GCCTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3754Accepted Submission(s): 1216Problem Descr... 阅读全文

posted @ 2014-07-23 11:11 芷水阅读(162) 评论(0) 推荐(0)

nylg 小M的因子和

摘要：小M的因子和时间限制：1000ms | 内存限制：65535KB难度：2描述小M在上课时有些得意忘形，老师想出道题目难住他。小M听说是求因子和，还是非常得意，但是看完题目是求A的B次方的因子和，有些手足无措了，你能解决这个问题吗？输入有多组测试样例每行两个数 A ,B ，（1≤A,B≤10^9）输出... 阅读全文

posted @ 2014-05-13 15:01 芷水阅读(326) 评论(0) 推荐(0)

hdu 1452 Happy 2004 膜拜这推导过程

摘要：Happy 2004Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 920Accepted Submission(s): 648Problem De... 阅读全文

posted @ 2014-05-12 23:12 芷水阅读(150) 评论(0) 推荐(0)

nylg 640 Geometric Sum

摘要：Geometric Sum时间限制：1000ms | 内存限制：65535KB难度：3描述Compute (a + a^2 + … + a^n) mod m.(a+a2+…an)mod输入Three integers a,n,m.(1≤a,n,m≤10^18)It ends with EOF.输出T... 阅读全文

posted @ 2014-05-09 21:51 芷水阅读(395) 评论(0) 推荐(0)

hdu 4002 Find the maximum

摘要：Find the maximumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1561Accepted Submission(s): 680Pro... 阅读全文

posted @ 2014-05-07 23:08 芷水阅读(239) 评论(0) 推荐(0)

uestc 1072 a ^ b

摘要：a ^ bTime Limit: 1000 ms Memory Limit: 65535 kB Solved: 334 Tried: 2153 Description求a的b次方后四位。Input 输入的第一行是T（不超过1000）。T表示测试部分的个数，每一部分都要求单独计算并按照要求输出结果。接下来是每个测试部分。第一行给出a b，0 2 #include 3 using namespace std; 4 5 typedef long long LL; 6 LL mod=10000; 7 8 9 LL pow_sum1(LL a,LL b)10 {11 LL ans=0;... 阅读全文

posted @ 2013-10-24 21:29 芷水阅读(246) 评论(0) 推荐(0)

bnu 10805 矩形神码的平面向量的运行

摘要：矩形神码的Time Limit:1000msMemory Limit:65536KBSpecial Judge64-bit integer IO format:%lld Java class name:MainPrevSubmitStatusStatisticsDiscussNextFont Size:+-Type:Tag it!我们都知道，矩形是由两条对角线的，没错吧？（谜之声：这不是显然么！）这两条线的长度也是相等的，没错吧？（谜之声：这不废话么！）然后我们给定一条对角线的起始点和终止点的坐标，然后给定另一个对角线和他的夹角，是不是就能得到两个面积相等的矩形？（谜之声：呃，貌似好像或许应该阅读全文

posted @ 2013-10-02 09:27 芷水阅读(214) 评论(0) 推荐(0)

随笔分类 - ACM---数论

公告