- 博客(5)
- 收藏
- 关注
原创 POJ 3020 Antenna Placement
Source Code #include #include using namespace std; int map[40+5][10+5], next[4][2]={{1,0},{-1,0},{0,1},{0,-1}}; int a[400+5][400+5], match[400+5]; bool vis[400+5]; int k; bool fin(int x) { for(
2016-08-09 15:32:26 314
原创 POJ 3041 Asteroids
#include #include #include using namespace std; int n, m, in[200+5], q[200+5], k; bool map[200+5][200+5]; int toposort() { int flag, temp[200+5]; for(int i=1;i temp[i]=in[i
2016-08-03 20:59:17 341
原创 POJ 3267 The Cow Lexicon
The Cow Lexicon Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 9759 Accepted: 4678 Description Few know that the cows have their own dictionary with W (1
2016-08-03 20:08:04 279
原创 POJ 2488 A Knight's Journey
A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 41039 Accepted: 13964 Description Background The knight is getting bored of seeing the
2016-08-03 10:44:47 283
原创 POJ 3083 C - Children of the Candy Corn
#include #include #include #include using namespace std; int sx, sy, ex, ey, d1,d2, n, m, next[4][2]={{-1,0},{0,1},{1,0},{0,-1}}; char s[40+5][40+5]; struct node { int x, y, step; };
2016-08-02 10:36:51 751
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人