- 博客(6)
- 资源 (1)
- 收藏
- 关注
原创 “玲珑杯”ACM比赛 Round #7
A #include #include #include #include #include #include #include const int INF = 0x3f3f3f3f; const int N = 100005; const int maxs = 1e6+5; const double eps = 1e-10; #define left lll #define rig
2016-12-24 15:56:32 341
原创 线性筛选求素数
几种方法求素数的 1 目前是我见过的较快的速度求素数了 #include #include #include char whe[1000001]; int main() { clock_t t1,t2; int t,count=0; t1=clock(); for(int i=2; i<=1000; i++) if(whe[i]==0)
2016-12-10 21:43:51 289
原创 471D - MUH and Cube Walls (KMP)
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing the cube
2016-12-04 20:50:42 238
原创 poj Lake Counting (dfs)
Description Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains
2016-12-01 20:40:06 239
原创 poj 2255 Tree Recovery 递归
Description Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of o
2016-12-01 18:37:29 240
原创 hdu oj 1013 Digital Roots(dfs)
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the result
2016-12-01 16:10:51 163
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人