Poj
不要绝望总会慢慢变强
当你觉得整个世界都放弃了你,还有那几行代码值得你珍重!
展开
-
poj1724(dfs)
#include<iostream>#include<vector>#include<cstring>#include<algorithm>using namespace std;struct road{ int d; int L; int t;};vector< vector<road> ...原创 2018-06-22 00:05:04 · 323 阅读 · 0 评论 -
poj1163
#include<iostream>using namespace std;int main(){ int m = 1, n = 1; int tan[101][101] = {0}; int flag=0; cin >> m; for (int i = 1; i <= m; i++) { for (int j = 1...原创 2018-06-10 20:33:21 · 139 阅读 · 0 评论 -
poj1222
#include<iostream>#include<cstring>#include<memory>#include<string>using namespace std;char orI[5];char lights[5];char result[5];int getbit(char c, int i){ return (c >>...转载 2018-06-01 21:07:26 · 243 阅读 · 0 评论 -
PEKING1013
#include<iostream>#include<cstring>using namespace std;char Left[3][7];char Right[3][7];char result[3][7];bool IsFake(char c,bool light);int main(){ int t; cin>>t; while(t...原创 2018-04-05 11:45:56 · 124 阅读 · 0 评论 -
poj3278
#include<iostream>#include<cstdlib>#include<queue>#include<cstring>using namespace std;int v, e;int visited[100010];struct node{ int x; int mintime; node(i...原创 2018-06-22 21:52:36 · 155 阅读 · 0 评论 -
poj3984
#include<iostream>#include<queue>#include<stack>#include<cstdlib>#include<cstring>int g = 0;using namespace std;int maze[5][5];int visited[30];struct node{ int x; i...原创 2018-06-23 16:06:56 · 328 阅读 · 0 评论