Cifer

~~~题目链接~~~ 水果~ #include #define N 5002 using namespace std; int n = 0, m = 0, p = 0, father[N], rank[N]; int find(int x) { if(father[x] != x) father[x] = find(father[x])

~~~题目链接~~~ 思路：模拟 #include #include int len = 0; char str[5002]; void print(int cur) { int i = 0, j = 0; for(i = cur; i<cur+16; i++) { if(j == 2) printf(" "), j = 0;