- 博客(9)
- 收藏
- 关注
RSS订阅转载 敌兵布阵(线段树)
敌兵布阵Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy
2016-01-25 17:34:14
345
转载 More is better（并查集问题）
More is betterTime Limit:1000MS Memory Limit:102400KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMr Wang wants some boys to help him with a project. Because the p
2016-01-23 10:26:44
395
转载 Is It A Tree?（并查集问题）
Is It A Tree?Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA tree is a well-known data structure that is either empty (null, voi
2016-01-22 19:37:14
404
原创 triangle
#include #includeusing namespace std;void triangle(int n){ for(int i=0;i {for(int j=0;j if(j=(2*n-1)) printf(" "); else printf("#"); printf("\n")
2016-01-18 20:59:20
298
原创 hanxin
#include #includeusing namespace std;void hanxin(int a,int b,int c){ int temp,i; for(i=1;i for(int j=2;j { temp=c+7*i; if((5*j+b)==temp) {
2016-01-18 20:21:25
297
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人