ACM--数论
关注
分享
扫一扫
文章平均质量分 81
剑不飞
时刻思考，找准方向，坚定执行，永不服输（AC才是王道。）
展开
-
hdu 1164 Eddy's research I （数论）
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem D原创 2012-04-14 11:02:22 · 585 阅读 · 0 评论 -
hdu 2608 0 or 1（数论）
0 or 1Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1659 Accepted Submission(s): 418Problem DescriptionSolving problem is a i原创 2013-01-29 16:01:05 · 404 阅读 · 0 评论 -
LS 2 Xor（数论）
XorFor given multisets AandB, find minimum non-negative xwhichA⊕x=B.Note that for A={a1,a2,…,an},A⊕x={a1⊕x,a2⊕x,…,an⊕x}.⊕stands for exclusive-or原创 2013-02-07 21:00:50 · 765 阅读 · 2 评论 -
LS 15 Divisor counting (Easy)（数论）
Divisor counting (Easy)Let σ(n)denote the number of divisors of n.Compute σ(1)+σ(2)+⋯+σ(n).InputAn integer n.(1≤n≤108)OutputThe sum.Sample input5Sample output10原创 2013-02-08 13:27:01 · 551 阅读 · 0 评论 -
LS 14 Square free（枚举）
Square freeTest whether nis square free. nis square free if and only if for all p>1,p2is not divisors of n.InputThe first line contains an integer t, the number of test原创 2013-02-07 20:14:16 · 494 阅读 · 0 评论 -
LS 38 Geometric sum（数论+二分快速幂）
Geometric sumCompute (a+a2+…an)modm.InputThree integers a,n,m.(1≤a,n,m≤1018)OutputThe only integer denotes the result.Sample input2 2 1000000000Sample output6原创 2013-03-09 14:23:57 · 905 阅读 · 0 评论 -
poj 1067 取石子游戏(博弈+威佐夫博奕(Wythoff Game))
取石子游戏Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29959 Accepted: 9818Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；原创 2013-02-26 20:54:00 · 496 阅读 · 0 评论 -
USACO Section 3.4 Electric Fence(数论)
Electric FenceDon PieleIn this problem, `lattice points' in the plane are points with integer coordinates.In order to contain his cows, Farmer John constructs a triangular electric fence by st原创 2013-03-13 16:17:54 · 731 阅读 · 0 评论 -
CF 17D - Notepad(数论取模+欧拉函数)
D - NotepadTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 17DDescriptionNick is attracted by everything unconventio原创 2013-03-14 12:15:15 · 852 阅读 · 0 评论 -
CF-50E-Square Equation Roots(数论)
E - Square Equation RootsTime Limit:5000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 50EDescriptionA schoolboy Petya studies sq原创 2013-03-17 17:29:20 · 1025 阅读 · 0 评论 -
USACO section 3.4 Closed Fences(计算几何+叉积+二分)
Closed FencesA closed fence in the plane is a set of non-crossing, connected line segments with N corners (3 i, yi}, i in (1..N).Every pair of adjacent vertices defines a side of the fence.原创 2013-03-19 10:50:41 · 1184 阅读 · 0 评论 -
CF-60D - Savior(并查集+数论)
D - SaviorTime Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 60DDescriptionMisha decided to help Pasha and Akim be fri原创 2013-03-22 14:36:45 · 1110 阅读 · 0 评论 -
USACO section 4.1 Beef McNuggets(数论+背包)
Beef McNuggetsHubert ChenFarmer Brown's cows are up in arms, having heard that McDonalds is considering the introduction of a new product: Beef McNuggets. The cows are trying to find any possibl原创 2013-03-26 10:45:01 · 923 阅读 · 0 评论 -
nefu702 The minimum square sum(数论)
The minimum square sumTime Limit 1000msMemory Limit 65536Kdescription Given a prime p (p8),you are to find min{x2+y2},where x and y belongs t原创 2013-05-05 14:36:16 · 1167 阅读 · 0 评论 -
hdu 1271 整数对（数学，3级）
整数对Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2109 Accepted Submission(s): 700Problem DescriptionGardon和小希玩了一个游戏，Gardon随便想原创 2013-06-16 16:48:50 · 641 阅读 · 0 评论 -
hdu 4357 String change(推理题，4级)
String changeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 802 Accepted Submission(s): 370Problem DescriptionIn this proble原创 2013-07-20 10:20:15 · 943 阅读 · 0 评论 -
hdu 4350 Card(递推循环节，3级)
2013暑期多校联合训练——80+高校，300+队伍，10000元奖金，敬请期待~CardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 889 Accepted Submission(s): 517原创 2013-07-20 10:16:57 · 699 阅读 · 0 评论 -
hdu 4678 Mine(博弈SG，4级)
MineTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 487 Accepted Submission(s): 134Problem DescriptionHave you ever played a game原创 2013-08-16 14:01:05 · 643 阅读 · 0 评论 -
hdu 2101 A + B Problem Too(数论)
A + B Problem TooTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8373 Accepted Submission(s): 6277Problem DescriptionThis probl原创 2013-01-13 19:00:50 · 612 阅读 · 0 评论 -
hdu 1165 Eddy's research II
Eddy's research IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2182 Accepted Submission(s): 806Problem DescriptionAs is know原创 2013-01-25 15:50:26 · 450 阅读 · 0 评论 -
素数判断（数论）
素数判定 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 8 Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →原创 2012-04-14 10:08:38 · 831 阅读 · 0 评论 -
寻找素数对 （数论）
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4 Accepted Submission(s) : 3Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Probl原创 2012-04-14 10:30:34 · 461 阅读 · 0 评论 -
hdu 2710
计算大素数因子 #include#include#define N 20004using namespace std;int isp[N];int main(){ int m,n,max,ans; memset(isp,0,sizeof(isp)); isp[1]=1; for(int i=2;i<N;i++) { if(isp[i]==0)//如果没被选择原创 2012-04-14 09:08:39 · 489 阅读 · 0 评论 -
hdu 2138 How many prime numbers(miller_rabin?)
How many prime numbersTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3302 Accepted Submission(s): 1074 Problem D原创 2012-04-28 20:35:15 · 496 阅读 · 0 评论 -
h
#include#include#include#define N 1000005using namespace std;int position[N];int main(){ memset(position,0,sizeof(position)); position[1]=0; int next=1; int i,j; for(i=2;i原创 2012-04-28 21:54:26 · 372 阅读 · 0 评论 -
hdu 3117 Fibonacci Numbers
Fibonacci NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 993 Accepted Submission(s): 424Problem DescriptionThe Fibonacci原创 2012-07-21 12:04:36 · 786 阅读 · 0 评论 -
hdu 1042 N!
N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33314 Accepted Submission(s): 9234Problem Description Given an in原创 2012-07-23 18:28:43 · 839 阅读 · 0 评论 -
hdu 1250 Hat's Fibonacci
Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3726 Accepted Submission(s): 1252Problem DescriptionA Fibonacci se原创 2012-07-22 09:24:45 · 1182 阅读 · 0 评论 -
hdu 1005 Number Sequence
Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60820 Accepted Submission(s): 13862Problem DescriptionA number seq原创 2012-07-23 19:58:24 · 385 阅读 · 0 评论 -
pku 1681 Painter's Problem(高斯消元)
Painter's ProblemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3462 Accepted: 1710DescriptionThere is a square wall which is made of n*n small square br原创 2012-09-05 21:18:22 · 1885 阅读 · 0 评论 -
pku 1753 Flip Game(高斯消元+枚举)
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20199 Accepted: 8752DescriptionFlip game is played on a rectangular 4x4 field with two-sided piec原创 2012-09-06 19:41:56 · 1592 阅读 · 0 评论 -
USACO section 3.2 Stringsobits(组合数学)
StringsobitsKim Schrijvers Consider an ordered set S of strings of N (1 <= N <= 31) bits. Bits, of course, are either 0 or 1.This set of strings is interesting because it is ordered and contai原创 2012-10-24 16:58:44 · 556 阅读 · 0 评论 -
hdu 2527 Safe Or Unsafe(哈夫曼编码)
Safe Or UnsafeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 863 Accepted Submission(s): 309Problem DescriptionJavac++ 一天在看计算机的书原创 2012-11-05 14:49:40 · 679 阅读 · 0 评论 -
USACO section 3.3 Riding the Fences(欧拉通路的遍历，dfs)
Riding the FencesFarmer John owns a large number of fences that must be repaired annually. He traverses the fences by riding a horse along each and every one of them (and nowhere else) and fixing原创 2012-11-05 16:13:41 · 685 阅读 · 0 评论 -
hdu 1007 Quoit Design(平面最近点对)
Quoit DesignTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17773 Accepted Submission(s): 4563Problem DescriptionHave you ever p原创 2012-11-23 16:27:08 · 738 阅读 · 0 评论 -
hdu 1018 Big Number(纯数学公式)
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17227 Accepted Submission(s): 7705Problem DescriptionIn many applicatio原创 2012-11-24 19:34:08 · 410 阅读 · 0 评论 -
hdu 1212 Big Number(数论)
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3256 Accepted Submission(s): 2219Problem DescriptionAs we know, Big Num原创 2013-01-09 18:44:09 · 432 阅读 · 0 评论 -
hdu 4465 Candy(概率公式+极大乘极小，4级)
CandyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1016 Accepted Submission(s): 449Special JudgeProblem DescriptionLazyChil原创 2013-10-03 14:28:07 · 899 阅读 · 0 评论