I'm小宇宙

/*h*/#include #include double hanshu(int n,int m);int main(){ int n,m; int i,j,k; scanf("%d",&n); for (i=1;i  printf("%10.0lf",hanshu(n,i)); return 0;}double hanshu(int n,int m){ int i,j,k; double n1=1,m1=1; int s1=0,s2=0; if (n {  if (m  {   n1=1;m1=1;   

http://acm.pku.edu.cn/JudgeOnline/problem?id=1182#include #define max 50000+5int f[max];int r[max];/*rank[x]表示father[x]与x的关系rank[x] == 0 表示father[x]与x是同类rank[x] == 1 表示x吃father[x]rank[x] == 2 表示father[x]吃x*/void make