poj
da_fan_shu_
这个作者很懒,什么都没留下…
展开
-
poj 1753.Flip Game
Flip Game#include#includeint source,steps;int dy[]={0,0,0,1,-1},dx[]={0,1,-1,0,0};void init(){ char ch; source=0; for(int i=0;i<4;i++) { for(int j=0;j<4;j++) source=(source<原创 2012-10-18 22:47:27 · 299 阅读 · 0 评论 -
poj 1204.Word Puzzles
Word Puzzles#include#includeconst int MAX_CHARN=26;const int MAXL=1000;const int MAXC=1000;const int MAXW=1000;const int MAX_WORD_LEN=1000;const int DIR[8][2]={{-1,0},{-1,1},{0,1},{1原创 2012-11-09 21:54:37 · 251 阅读 · 0 评论 -
poj 2121.Inglish-Number Translator
Inglish-Number Translator#include#include#include#includeusing namespace std;int main(){ char line[256]; int ans; mapentod; entod[string("zero")]=0; entod[string("one")]=1原创 2012-11-11 14:38:21 · 604 阅读 · 0 评论 -
poj 1578.Instruens Fabulam
Instruens Fabulam#include#includestruct TableCell{ char content[128]; int len;};int row, col;int colWidth[128];int tableWidth;char header[128];char nextHeader[128];bool end原创 2012-11-11 14:06:27 · 483 阅读 · 0 评论 -
poj 2136.Vertical Histogram
Vertical Histogram#include int main() { char line[128]; int cnt[26], n; int i, j, k; for(i=0;i<26;i++){ cnt[i]=0; } for(i=0;i<4;i++){ cin.getline(line,128);原创 2012-11-11 11:54:43 · 440 阅读 · 0 评论 -
poj 1706.References
References#include#include#include#includechar refDes[1024][256];//旧文献边编号为i的文献的内容 int nmapo[1024];//新文献编号为i的文献,其旧文献编号为nmapo[i]. int omapn[1024];//旧文献编号为i的文献,其新文献编号为omapn[i]. int refN原创 2012-11-12 13:14:18 · 538 阅读 · 0 评论 -
poj 1027.The Same Game
The Same Game#includeconst int R=10;const int C=15;char board[R][C+1];int cluster[R][C];int sizeOfCluster[R*C];int nMove, score;//得到游戏版中包含位置(r,c)处小球的Cluster。 void GetCluster(原创 2012-11-12 22:48:16 · 236 阅读 · 0 评论 -
poj 2729.Robocode
Robocode#include#includeconst int MAX_TANK=10;const int MAX_COMMAND=1000;const int MAX_SHOT=1000;const int SCALE=6;const int MAX_X=13+(SCALE-1)*12;const int MAX_Y=13+(SCALE-1)*12;原创 2012-11-13 15:50:01 · 1005 阅读 · 0 评论 -
poj 1879.Tempus et mobilius Time and motion
Tempus et mobilius Time and motion#includeconst int MAX_BALLS=127;const int QUEUE_LENGTH=MAX_BALLS;int nBalls;int ans;int qu[QUEUE_LENGTH+1];int qs, qt;int map[MAX_BALLS+1];int c原创 2012-11-13 18:06:43 · 589 阅读 · 0 评论 -
poj 1002.487-3279
487-3279#include#include#include#includeusing namespace std;int main(){ int n; char c; string s; mapmp; map::iterator it; scanf("%d",&n); c=getchar(); for(int i=0;i<n;i++原创 2012-11-28 21:16:31 · 269 阅读 · 0 评论 -
poj 1456.Supermarket
Supermarket #include#include#include#includeusing namespace std;#define N 10010int pre[N];struct node{ int profit, deadline;}p[N];bool operator < (const node& a, const node原创 2012-11-28 21:28:59 · 310 阅读 · 0 评论 -
poj 3895.Cycles of Lanes
Cycles of Lanes#include #include #include using namespace std;#define N 5000vector v[N];int vis[N];int step[N];int ans;void dfs(int x,int t){ vis[x]=1; step[x]=t原创 2012-11-22 21:08:08 · 255 阅读 · 0 评论 -
poj 3032.Card Trick
Card Trick#include#include#includeusing namespace std;const int MAXN=250+10;queue q;int v[MAXN];int main(){ int m,n; cin>>m; while(m--){ cin>>n; for(int i=0;i<n;i++){原创 2012-11-22 20:56:01 · 362 阅读 · 0 评论 -
poj 2352.Stars
Stars#includeconst int MAXN=15000;const int MAXX=32000+1;int N, X, Y;int c[MAXN+1];int ans[MAXN];//求整数x最低有效位的值并返回. int LowBit(int x);//求原数组下标从1到ind的各元素的和并返回. int GetSum(int i原创 2012-11-09 14:41:08 · 224 阅读 · 0 评论 -
poj 1151.Atlantis
Atlantis#include#includeconst int MAXN=100;struct Vsegment{ double x, yb, ye; bool isLeft;};struct StreeNode{ int b, e; int c; StreeNode* left; StreeNode* right;};int原创 2012-11-09 13:32:37 · 234 阅读 · 0 评论 -
poj 2965.The Pilots Brothers' refrigerator
The Pilots Brothers' refrigerator#includeusing namespace std;bool board[16];int is[16];int js[16];bool check(){ for(int i=0;i<16;i++){ if(board[i]!=1) return false; } return原创 2012-10-20 00:02:28 · 229 阅读 · 0 评论 -
poj 1328.Radar Installation
Radar Installation#include#include#includeusing namespace std;struct node{ double x,y;}a[1010];int cmp(node x,node y){ if(x.x==y.x)return x.y<y.y; else return x.x<y.x;}原创 2012-10-20 15:47:55 · 252 阅读 · 0 评论 -
poj 1164.The Castle
The Castle#includeusing namespace std;typedef struct node{ int east,south,west,north; bool used;}Lnode;int n,m;int num,area;Lnode castle[55][55];void init(){ int tsum; Ln原创 2012-10-20 23:46:16 · 320 阅读 · 0 评论 -
poj 2109.Power of Cryptography
Power of Cryptography类型 长度 (bit) 有效数字 绝对值范围float 32 6~7 10^(-37) ~ 10^38double 64 15~16原创 2012-10-21 00:25:28 · 221 阅读 · 0 评论 -
poj 2106.Boolean Expressions
Boolean Expressions#includeusing namespace std;const int MAX_STRLEN=256;const int MAX_STACKSIZE=256;//将中辍表达式infix转化为后缀表达式suffix.void InfixToSuffix(const char* infix, char* suffix); //原创 2012-11-06 23:29:55 · 440 阅读 · 0 评论 -
poj 3125.Printer Queue
Printer Queue#includeconst int MAX_QUEUESIZE=128;int n,m;int qu[MAX_QUEUESIZE],s;int ans;int main(){ int t; int i; cin>>t; while(t-->0){ cin>>n>>m; for(int i=0;i<n原创 2012-11-07 23:56:19 · 299 阅读 · 0 评论 -
poj 1308.Is It A Tree?
Is It A Tree?#include_M_cache_locale(const int MAX_NODEN=5120;struct Edge{ int f, t; Edge* next;};int node[MAX_NODEN], nNode;Edge* edgeList;int vst[MAX_NODEN];//生成节点nd的索引并返回,同时原创 2012-11-07 23:57:52 · 244 阅读 · 0 评论 -
poj 2049.Finding Nemo
Finding Nemo#includeconst int INF=100000000;const int MAX_SIZE=256;struct PriorityQueueNode{ int x,y; int p;};int M, N;int x,y,d,t;double f1,f2;int vEdge[MAX_SIZE][MAX_SIZE原创 2012-11-08 21:15:07 · 309 阅读 · 0 评论 -
poj 2318.TOYS
TOYS#includeconst int MAX_N=5000;int n,m;int x1, y1, x2, y2;int Li, U[MAX_N+1];int Xj, Yj;int dx[MAX_N+1], dy;int ans[MAX_N+1];//二分查找求出当前点所在梯形的编号并返回.int Solve();int main(原创 2012-11-08 21:48:28 · 348 阅读 · 0 评论 -
poj 1611.The Suspects
The Suspects#includeconst int MAX_N=3000;int n, m, k;int set[MAX_N];//初始化并查集,即将set中n个元素初始化为n个只有一个元素的集合.void Init();//查找元素x所在集合的树根并返回.int Root(int x);//合并树根分别为r1和r2的两个集合.返回合并后集合原创 2012-11-09 00:01:36 · 192 阅读 · 0 评论 -
poj 2503.Babelfish
Babelfish#include#includeconst int MAX_ENTRY=100000;const int Max_WORD_LEN=12;const int MAX_HASH_SIZE=21169;struct Entry{ char english[Max_WORD_LEN]; char foreign[Max_WORD_LEN];}原创 2012-11-08 22:32:59 · 256 阅读 · 0 评论 -
poj 1028.Web Navigation
Web Navigation#include#include#includeusing namespace std;#define ACM "http://www.acm.org/"int main(){ stack Forward; stack Backward; string str; Backward.push(ACM); while(c原创 2012-11-22 20:58:33 · 332 阅读 · 0 评论