水题
Cifer
这个作者很懒,什么都没留下…
展开
-
Vijos P1033 家族
~~~题目链接~~~水果~#include #define N 5002using 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])原创 2012-09-28 22:16:55 · 540 阅读 · 0 评论 -
HDOJ 4054 Hexadecimal View
~~~题目链接~~~思路:模拟#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;原创 2012-09-25 19:15:21 · 430 阅读 · 0 评论