摘要: 原文章:https://blog.csdn.net/niushuai666/article/details/6981689#commentsedit题目链接:http://poj.org/problem?id=1... 阅读全文
posted @ 2018-08-18 09:54 hum0r0 阅读(8) 评论(0) 推荐(0)
摘要: 暴力模拟D - Zhenya moves from the dormitoryAfter moving from his parents’ place Zhenya has been living in the ... 阅读全文
posted @ 2018-08-08 17:27 hum0r0 阅读(17) 评论(0) 推荐(0)
摘要: 非常可乐Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s)... 阅读全文
posted @ 2018-08-04 16:45 hum0r0 阅读(8) 评论(0) 推荐(0)
摘要: //单点修改 区间求和#define Max 41234int ans;int data[Max],sum[4*Max];void creat(int l,int r,int root){ if(l==r)... 阅读全文
posted @ 2018-08-03 11:20 hum0r0 阅读(9) 评论(0) 推荐(0)
摘要: 敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s)... 阅读全文
posted @ 2018-08-03 10:05 hum0r0 阅读(10) 评论(0) 推荐(0)
摘要: PotsTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 22062 Accepted: 9389 Spe... 阅读全文
posted @ 2018-08-01 09:15 hum0r0 阅读(13) 评论(0) 推荐(0)
摘要: 快速幂运算利用位运算大大节省了运算时间,举个例子,5^11,11的二进制为1011,5^11就变成了5^(2^3)*5^(2^1)*5^(2^0);不难看出1011上从高位到低位分别对应着5的8次幂,5的4次幂,... 阅读全文
posted @ 2018-07-30 20:45 hum0r0 阅读(4) 评论(0) 推荐(0)
摘要: FliptileTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 15827 Accepted: 5793 Desc... 阅读全文
posted @ 2018-07-26 20:18 hum0r0 阅读(4) 评论(0) 推荐(0)
摘要: 不要用pow()函数!!!!!一个简单题wa了n次。QAQB - Vanya and Books CodeForces - 552B Vanya got an important task — he should... 阅读全文
posted @ 2018-07-26 11:32 hum0r0 阅读(7) 评论(0) 推荐(0)
摘要: POJ崩了,我也不知道错没错,感觉挺对,样例过了,如果错了,请在下面留言,谢谢!!!Dungeon MasterTime Limit: 1000MS Memory Limit: 65536K Tot... 阅读全文
posted @ 2018-07-24 15:03 hum0r0 阅读(5) 评论(0) 推荐(0)