编程语言
文章平均质量分 77
idealistic
编程渣渣~~
展开
-
【杭电1009】FatMouse' Trade
FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66428 Accepted Submission(s): 22572Problem DescriptionFatMouse prepa原创 2016-07-22 14:31:37 · 329 阅读 · 0 评论 -
【杭电2124】Repair the Wall
Repair the WallTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionLong time ago , Kitty lived in a small village. The air was fresh原创 2016-07-22 15:09:12 · 611 阅读 · 0 评论 -
【杭电4883】TIANKENG’s restaurant
TIANKENG’s restaurantTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionTIANKENG manages a restaurant after graduating from ZCMU, a原创 2016-07-22 16:27:52 · 291 阅读 · 0 评论 -
【杭电1061】Rightmost Digit 求n^n,找规律!!
Rightmost DigitTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a positive integer N, you should output the most right digi原创 2016-07-22 17:53:30 · 870 阅读 · 0 评论 -
A^B取后三位
D - DTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription求A^B的最后三位数表示的整数。 说明:A^B的含义是“A的B次方” Input输入数据包含多个测试实例原创 2016-07-23 10:34:21 · 419 阅读 · 0 评论 -
(A1^B1+A2^B2+ ... +AH^BH)mod M.
- CTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionPeople are different. Some secretly read magazines full of interesting girl原创 2016-07-23 11:17:20 · 829 阅读 · 0 评论 -
非空子集个数
A - ATime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionsoda has a set with integers . A set is called key set if the sum of i原创 2016-07-23 15:50:22 · 2726 阅读 · 0 评论 -
【codefors】贪心
VacationsTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionVasya has n days of vacations! So he decided to improve his IT skill原创 2016-07-23 19:35:21 · 250 阅读 · 0 评论 -
【codeforces】New Year and Days
New Year and DaysTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionToday is Wednesday, the third day of the week. What's more int原创 2016-07-21 20:29:08 · 221 阅读 · 0 评论 -
【codeforces】HDD is Outdated Technology
HDD is Outdated TechnologyTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionHDD hard drives group data by sectors. All files are原创 2016-07-21 21:15:14 · 431 阅读 · 0 评论 -
【杭电1872】稳定排序
稳定排序(sort+结构体)Description大家都知道,快速排序是不稳定的排序方法。 如果对于数组中出现的任意a[i],a[j](i某高校招生办得到一份成绩列表,上原创 2016-07-21 09:55:16 · 425 阅读 · 0 评论 -
【杭电2083】The MAX
The MAX说实话,还没怎么看懂题意,先记下。。。原创 2016-07-21 07:58:43 · 228 阅读 · 0 评论 -
【杭电2037】今年暑假不AC
今年暑假不ACTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription“今年暑假不AC?” “是的。” “那你干什么呢?” “看世界杯呀,笨蛋!” “@#$%^&*%...” 确实如此,世界杯原创 2016-07-22 10:20:41 · 287 阅读 · 0 评论 -
【codeforces】Bear and Three Balls(sort)
实际上是找是否存在三个连续的数字原创 2016-07-23 20:31:34 · 298 阅读 · 0 评论 -
【杭电1789】Doing Homework again贪心(还不太懂)
Doing Homework againDescriptionzichen has just come back school from the 30th ACM/ ICPC.原创 2016-07-23 16:04:44 · 499 阅读 · 0 评论 -
【杭电2005】第几天
第几天?Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2005Description据说东区学姐就要生日了,某acmer正在紧张准备礼物,学姐问谁能在短时间内算出所有学姐的生日是她出生那年原创 2016-07-24 17:30:43 · 376 阅读 · 0 评论 -
【杭电1201】18岁生日
18岁生日Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1201Description当你还是18岁的时候,那个曾经一起追过的女孩刚好也是18岁,而且她的生日就要到了,你突然想到一个问题,是不原创 2016-07-24 17:35:23 · 289 阅读 · 0 评论 -
【杭电2018】母牛的故事
技巧 规律题原创 2016-07-24 17:51:52 · 237 阅读 · 0 评论 -
【杭电1865】1Sting 打表法 初学不懂!!
技巧 规律题原创 2016-07-24 17:54:40 · 285 阅读 · 0 评论 -
【杭电1212】大数除法
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7331 Accepted Submission(s): 5062Problem DescriptionAs we know, Big Num原创 2016-07-24 19:35:41 · 302 阅读 · 0 评论 -
【杭电4548】美素数
美素数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4548Description 小明对数的研究比较热爱,一谈到数,脑子里就涌现出好多数的问题,今天,小明想考考你对素数的认识。 问原创 2016-07-24 19:46:53 · 362 阅读 · 0 评论 -
【杭电1222】互质
Wolf and RabbitTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1222DescriptionThere is a hill with n holes around. The ho原创 2016-07-24 20:21:59 · 233 阅读 · 0 评论 -
【杭电2504】又见GCD
a,c,最大公约数是b,已知a,b,求c原创 2016-07-24 20:28:39 · 308 阅读 · 0 评论 -
【杭电1722】Cake
CakeTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1722Description一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等)原创 2016-07-24 20:24:56 · 304 阅读 · 0 评论 -
【杭电1108】最小公倍数
最小公倍数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1108Description给定两个正整数,计算这两个数的最小公倍数。 Input输入包含多组测试数据原创 2016-07-24 20:33:27 · 266 阅读 · 0 评论 -
【杭电2012】素数判定
素数判定Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2012Description对于表达式n^2+n+41,当n在(x,y)范围内取整数值时(包括x,y)(-39Input原创 2016-07-24 20:35:22 · 344 阅读 · 0 评论 -
【杭电2098】分拆素数和
分拆素数和Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2098Description把一个偶数拆成两个不同素数的和,有几种拆法呢? Input输入包含一些正的原创 2016-07-24 20:37:55 · 253 阅读 · 0 评论 -
【POJ1363】栈
B - IITime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThere is a famous railway station in PopPush City. Country there is incred原创 2016-07-25 19:58:21 · 310 阅读 · 0 评论 -
【杭电1551】Cable master
Cable masterTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInhabitants of the Wonderland have decided to hold a regional prog原创 2016-07-26 12:04:54 · 285 阅读 · 0 评论 -
【POJ】River Hopscotch
River HopscotchTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionEvery year the cows hold an event featuring a peculiar version原创 2016-07-26 18:02:20 · 386 阅读 · 0 评论 -
【杭电2141】Can you find it?
Can you find it?Time Limit:3000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGive you three sequences of numbers A, B, C, then we give you原创 2016-07-26 21:04:56 · 205 阅读 · 0 评论 -
【杭电4004】The Frog's Games Time 青蛙过河
The Frog's GamesTime Limit:1000MS Memory Limit:65768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe annual Games in frogs' kingdom started again. The most fam原创 2016-07-26 16:05:40 · 446 阅读 · 0 评论 -
【杭电2199】找方程的解 (二分法)
Can you solve this equation?Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription现在,给出等式8* X^4+ 7* X^3+ 2* X^2+ 3 * X +6= Y,请找出他在0和原创 2016-07-26 10:29:25 · 263 阅读 · 0 评论 -
Crossed Ladders
Crossed LaddersTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA narrow street is lined with tall buildings. An x foot long ladder i原创 2016-07-27 09:24:20 · 352 阅读 · 0 评论 -
未整理
/*#include//二进制数中1的个数 main(){ int N,M,t,s;scanf("%d",&M);while(M--){scanf("%d",&N);s=0;while(N!=0){t=N%2;N=N/2;if(t==1)s++;}printf("%d\n",s);}return 0;}*//*#inc原创 2016-07-27 09:33:42 · 194 阅读 · 0 评论 -
【POJ1905】
Expanding RodsTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionWhen a thin rod of length L is heated n degrees, it expands to a new le原创 2016-07-27 11:21:11 · 231 阅读 · 0 评论 -
Pie(二分)
PieTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pi原创 2016-07-27 16:10:30 · 255 阅读 · 0 评论 -
Red packet~二分
Red packetTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNew Year is coming! Our big boss Wine93 will distribute some “Red Pa原创 2016-07-27 17:57:55 · 330 阅读 · 0 评论 -
【杭电4907】Task schedule
Task scheduleTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription有一台机器,并且给你这台机器的工作表,工作表上有n个任务,机器在ti时间执行第i个任务,1秒即可完成1个任务。 有m个询问,每原创 2016-07-27 20:54:27 · 253 阅读 · 0 评论 -
【POJ1979】
Red and BlackTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere is a rectangular room, covered with square tiles. Each tile i原创 2016-07-28 11:37:32 · 258 阅读 · 0 评论