三水的鱼塘♂

which indicates that the repeaters B, C, D and H are adjacent to the repeater A. The first line describes those adjacent to repeater A, the second those adjacent to B, and so on for all of the repeate

http://poj.org/problem?id=1639转自https://blog.youkuaiyun.com/u011265346/article/details/42919889#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include ...

http://codeforces.com/problemset/problem/510/C#include<bits/stdc++.h>using namespace std;int n;int main(){ char a[111][111]; bool vis[33][33]; int ru[33]; int ma[33][33]; int flag=0; wh...

http://codeforces.com/problemset/problem/510/B#include<bits/stdc++.h>using namespace std;int flag;int sx,sy; int n,m;char ma[55][55];bool vis[55][55];void dfs(char md,int x,int y,int js){...

http://codeforces.com/problemset/problem/103/B找环，一个环#include<bits/stdc++.h>using namespace std;#define ll long longconst int N=511111;int mm[105][105];bool vis[1005];int m,n;void dfs(int ...

http://codeforces.com/problemset/problem/102/A暴力搜索#include<bits/stdc++.h>using namespace std;#define ll long longvector<int> p[1111];bool ma[1111][1111];int v[1111];long long ans;vo...

http://acm.hdu.edu.cn/showproblem.php?pid=4403#include#include#includeusing namespace std;long long int ans=0;char a[22];void dfs(int wz,long long int dq,long long int sav,int op){ if(wz

http://acm.split.hdu.edu.cn/showproblem.php?pid=5952#include #include #include #include #include #include #include #includeusing namespace std; vector st[111];b

http://codeforces.com/problemset/problem/760/C#includeusing namespace std;int ans;int ans1;int ma[222222];bool vis[222222];void dfs(int x){ if(vis[ma[x]]==1){ a

http://codeforces.com/problemset/problem/884/C#include using namespace std;int con=0;long long int ans[111111]; bool vis[111111]; int ma[111111];void dfs(int x,int num

http://acm.hdu.edu.cn/showproblem.php?pid=5971#include#include#include#include#include#include #include#includeusing namespace std;int n,m,x,y;vectorma[1111];in

Sudoku KillerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8125    Accepted Submission(s): 2507Problem Description自从2006年3月10日至11日

Counting Sheep Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 49   Accepted Submission(s) : 38Font: Times New Roman | Verdana | Georgia F

Sum It Up Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 49   Accepted Submission(s) : 33Font: Times New Roman | Verdana | Georgia Font S

Square Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 154   Accepted Submission(s) : 57Font: Times New Roman | Verdana | Georgia Font Si

Zipper Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 96   Accepted Submission(s) : 42Font: Times New Roman | Verdana | Georgia Font Size

哈密顿绕行世界问题 Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 82   Accepted Submission(s) : 44Font: Times New Roman | Verdana | Georgia Font S

1562: Fun HouseSubmit Page    Summary    Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 498     Solved: 176    DescriptionAmerican Carnival Makers Inc. (ACM) has a l

https://www.nowcoder.com/acm/contest/203/J 分开来看，第一个问题很简单，知道染色发现冲突即可。对于第二个问题就是一个dfs找奇数环即可。   #include<bits/stdc++.h>using namespace std;const int maxn=3e5+10;vector<int>e[...