摘要:
#include#define N 1100000struct node {int x,y;}f[N],pre[N];int find(int x) {if(x!=pre[x].x) { int h=pre[x].x; pre[x].x=find(h); pre[x].y=(pr... 阅读全文
摘要:
#include#include#include#define N 5int f[N];int visit[N];int vis[10000];void dfs(int sum,int k) { int i; if(k==4) { if(vis[sum]==0) vis[sum]=1; ... 阅读全文