- 博客(16)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 D. Vessels
D. Vesselstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a system of n vessels arranged one abov
2015-03-28 16:44:56
760
原创 C. Hamburgers
C. Hamburgerstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus loves hamburgers very much. He espe
2015-03-28 14:44:22
608
原创 B. Fox Dividing Cheese
B. Fox Dividing Cheesetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo little greedy bears have found tw
2015-03-28 10:45:31
1108
原创 B - 家
B - 家Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 373BDescriptionWe'll define S(n) for positive integer n as follo
2015-03-28 09:26:45
473
原创 A. Counting Kangaroos is Fun
There are n kangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who hold the kangaroo is at least
2015-03-27 23:54:50
723
原创 A - Prime Path
#include #include #include #include #include #include #include using namespace std;int map[10000];bool prime[10005];int a,b;queue int> qq; void bfs(){ while ( !qq.empty() ) {
2015-03-20 15:54:37
477
原创 迷宫DFS
#include #include #include #include #include #include using namespace std;int ok=0;int k;int f[10][10];int trackk[50][50];int track[50][50][50];int qu;int qunimei[50];
2015-03-20 15:52:40
524
原创 G - Dungeon MasterBFS+填路
#include #include #include #include #include #include #include using namespace std;struct node {int x,y,z; }; queue qq;char map[35][35][35]; int track[
2015-03-20 15:52:07
488
原创 迷宫BFS+递归回溯找爹打印路径
#include #include #include #include #include #include #includeusing namespace std;int ok=0;int k;int f[10][10];struct node {int x,y; }; node trackk
2015-03-20 15:51:55
723
原创 F - Catch That Cow-BFS-只计次不求路径
#include #include #include #include #include #include #include using namespace std;queue qq;int track[100010];int n;int k;bool vis[100010];int bfs(){wh
2015-03-20 15:51:24
464
原创 E - Children of the Candy Corn`特别DFS+BFS+DFS陷阱
#include #include #include #include #include #include#include using namespace std;int w,h;char map[41][41]; char map1[41][41]; char map2[41][41]; int ok;int xx[]={9,0 ,-1
2015-03-20 15:51:11
442
原创 D - Lake Counting-dfs
#include #include #include #include #include #include using namespace std;char map[101][101];int floorr,k;int dx[]={0,-1,-1,0,1,1,1,0,-1};int dy[]={0,0,-1,-1,-1,0,1,1,1};
2015-03-20 15:51:05
450
原创 C - Sudoku+dfs
#include #include #include #include #include #include using namespace std;int f[10][10]; int position[100][3];int ks;int ok;int main(){int dfs(int r,int c,int pos
2015-03-20 15:50:48
444
原创 B - Red and Black+dfs
#include #include #include #include #include #include using namespace std;int w,h;char f[21][21];int k,kk; int dx[]={-1,1,0,0};int dy[]={0,0,-1,1};int main(){
2015-03-20 15:50:22
416
原创 A Knight's Journey+dFS
#include #include #include #include #include #include using namespace std;int ok=0;int k;int n,m;int f[50][50];int trackk[400][3]; int dx[]={-2,-2,-1,-1,1,1,2,2};in
2015-03-20 15:49:57
453
原创 B - Channel Allocation
#include #include #include #include #include #include #include using namespace std;char cha[50][50];int map[27][27];int vis[27];/*struct node {int x,y;}; */
2015-03-20 15:48:38
420
java/swing编写的第一个扫雷程序.jar
2015-12-24
java/swing编写的第一个扫雷程序
2015-12-24
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人