- 博客(27)
- 收藏
- 关注
原创 hdu 2064 汉诺塔III
汉诺塔IIITime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11335 Accepted Submission(s): 5121Problem Description约19世纪末,在欧州的商店中出售一种智力玩具
2015-03-28 20:53:31 709
原创 hdu 1171 Big Event in HDU
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26285 Accepted Submission(s): 9244Problem DescriptionNowadays, w
2015-03-28 20:27:25 473
原创 hdu 1203
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18210 Accepted Submission(s): 7291Problem DescriptionSpeakless很早就想
2015-03-28 19:58:45 541
原创 hdu 1059 Dividing 多重背包,二进制优化
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18995 Accepted Submission(s): 5305Problem DescriptionMarsha and Bill own
2015-03-28 19:32:33 512
原创 hud 1043 Eight
EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14009 Accepted Submission(s): 3965Special JudgeProblem DescriptionThe 15-pu
2015-03-27 20:15:45 731
原创 康拓展开和康拓展开的逆运算
康托展开就是一种特殊的哈希函数 把一个整数X展开成如下形式: X=a[n]*(n-1)!+a[n-1]*(n-2)!+...+a[2]*1!+a[1]*0!; 期中,a[n]表示这个排列中小于第n大的数有几个。 比如,{1,2,3} 按从小到大排列一共6个。123 132 213 231 312 321 。
2015-03-25 21:06:59 668
转载 GDUT决赛 游戏王
Problem I: 游戏王Description小学的时候,Stubird非常喜欢玩游戏王,有一天,他发现了一个绝佳的连锁组合,这个连锁组合需要6张卡, 可是他一张都没有,但是他的那些朋友们有,不过当然,他们不会白给,不过也不排除有人和他交情好,送给他了。 不过他们有成全别人的美德,当他们看到Stubird已经有某些他们喜欢的卡的时候,他们会给他优惠,或者更贵也说不定 嘛
2015-03-19 17:09:03 631
原创 GDUT决赛 我是好人
Problem F: 我是好人Description众所周知,我是好人!所以不会出太难的题,题意很简单 给你两个数n和m,问你有多少对正整数对最大公约数是n,最小公倍数是m最后友情提供解题代码(我真是太好人了)void solve(){ long long n, m; scanf("%lld%lld", &n, &m)
2015-03-19 15:56:04 843
原创 GDUT 初赛 01串也疯狂之光棍也有伴
Problem A: 01串也疯狂之光棍也有伴Description话说春节那天,小明和晓明在实验室刷题。刷着刷着小明觉得累了,就邀请晓明一起看春晚。晓明觉得小明很无聊,不想理小明,但是小明很会磨嘴皮子,晓明耐不住小明的胡嘴蛮缠,于是和小明一起看起春晚来。小明顿时觉得倍儿爽啊! 可是一看,“wocao”,“最炫小苹果”,小明顿时觉得很伤心。 “连小苹果都有伴了。。。
2015-03-19 14:44:13 1185
原创 Codeforces Round #296 (Div. 2) C. Glass Carving
C. Glass Carvingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLeonid wants to become a glass carver (the
2015-03-18 11:39:31 931
原创 Codeforces Round #296 (Div. 2) B. Error Correct System
B. Error Correct Systemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFord Prefect got a job as a web dev
2015-03-18 10:32:15 1096
原创 POJ 2479
A - Maximum sumTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2479DescriptionGiven a set of n integers: A={a1, a2,..., a
2015-03-17 19:05:15 727
原创 HDU 2152 Fruit
FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3583 Accepted Submission(s): 2043Problem Description转眼到了收获的季节,由于有TT的专业指导,Lel
2015-03-17 10:53:02 780
原创 HDU 2110 Crisis of HDU
Crisis of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3766 Accepted Submission(s): 1066Problem Description话说上回讲到HDU大战东洋小苟,
2015-03-17 10:12:02 779
原创 hdu 2079
选课时间(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3222 Accepted Submission(s): 2525Problem Description又到了选课的时间了,xhd
2015-03-17 08:58:04 692
原创 HDU 2817 A sequence of numbers 等比OR等差
A sequence of numbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3796 Accepted Submission(s): 1164Problem DescriptionXinlv wr
2015-03-16 22:02:54 812
原创 HDU 小明系列故事——师兄帮帮忙 快速幂
小明系列故事——师兄帮帮忙Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4850 Accepted Submission(s): 1275Problem Description 小明自从告别了ACM/ICP
2015-03-16 21:45:10 791
原创 POJ 3641
Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7043 Accepted: 2881DescriptionFermat's theorem states that for any prime number p a
2015-03-16 20:57:23 574
原创 Codeforces Round #295 (Div. 2) C. DNA Alignment
C. DNA Alignmenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya became interested in bioinformatics.
2015-03-16 17:09:56 118
原创 Codeforces Round #191 (Div. 2) D. Block Tower
D. Block Towertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter too much playing on paper, Iahub has s
2015-03-15 11:20:11 125
原创 HDU 1398 Square Coins
Square CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8893 Accepted Submission(s): 6069Problem DescriptionPeople in Silverl
2015-03-14 21:24:35 564
原创 HDU 1085 简单母函数
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16123 Accepted Submission(s): 7236Problem DescriptionWe
2015-03-14 15:09:05 601
转载 母函数相关题目
母函数:分为普通型母函数和指数型母函数两种,总的来说是利用模拟数学计算的方法来编程的。好的参考资料:http://www.wutianqi.com/?p=2644普通型母函数:只要是用来求组合问题,不考虑顺序,所以不用避免重复,但是不能出现两个一样的表达式相乘,即相同的物品不能分开乘。题目:hdu1085、hdu1171、hdu1398、hdu2079、hdu2082、hdu2110、hd
2015-03-13 22:10:35 508
原创 POJ 3258 River Hopscotch
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8048 Accepted: 3469DescriptionEvery year the cows hold an event featuring a peculiar ve
2015-03-13 18:54:49 524
原创 URAL 1385 Interesting Number
DescriptionTyomitch calls the number with 2 N digits (without leading zeroes) "interesting", if it's divisible by both the number formed from its firstN digits and the number formed from its las
2015-03-12 20:27:55 1110
原创 POJ 3273 Monthly Expense
Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16076 Accepted: 6408DescriptionFarmer John is an astounding accounting wizard and has r
2015-03-08 15:07:26 646
原创 Codeforces Round #176 (Div. 2)B pipeline
B. Pipelinetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVova, the Ultimate Thule new shaman, wants to b
2015-03-08 15:03:53 811
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人