摘要: 12 13打表而过View Code 1 #include <iostream> 2 /* 3 ID: your_id_here 4 PROG: checker 5 LANG: C++ 6 */ 7 #include<cstdio> 8 #include<cstring> 9 #include<cmath>10 using namespace std;11 int f[20][20],num[20],n,t;12 void dfs(int v,int x)13 {14 int j,g,i,ff = 0;15 if(v<=n)16 num[v 阅读全文
posted @ 2012-11-18 20:55 _雨 阅读(186) 评论(0) 推荐(0) 编辑
摘要: http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2465View Code 1 #include <iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<queue> 5 using namespace std; 6 typedef struct node 7 { 8 int x1,y1,x,y,num,flag1; 9 friend bool operator<( stru 阅读全文
posted @ 2012-11-18 19:12 _雨 阅读(225) 评论(0) 推荐(0) 编辑