rqnoj-122-种菊

来源：互联网发布：打开mpp的软件编辑：程序博客网时间：2024/04/29 23:24

这道题虽然水，但很坑，本蒟蒻用了20分钟得了70分，但剩下的三十分用了两个小时......竟然还要考虑负数......

#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<iostream>int n,a[]={0,1,2,3,4,2,3,4,1,3,4,1,2,4,1,2,3};int q[5][5]={0,0,0,0,0,0,1,2,3,4,0,2,3,4,1,0,3,4,1,2,0,4,1,2,3};int abs(int n){    return -n;}int main(){scanf("%d",&n);//printf("%d",abs(n));if(abs(n)<16 && n<0){        n+=17;    }if(n<0 && abs(n)%17==0){        n+=16;    }    //printf("%d",n);if(n<0 && abs(n)>16){        while(abs(n)>16)        {            n+=16;        }    }    //printf("%d",n);    if(abs(n)<16 && n<0){        n+=17;    }    //printf("%d\n",n);int d=n%16;int e;if(n%4==0){e=n/4;e=e%4;}else e=(n/4+1)%4;if(e==0) e=4;if(a[d]==1) printf("hong\n");if(a[d]==2) printf("bai\n");if(a[d]==3 || a[d]==0) printf("qing\n");if(a[d]==4) printf("huang\n");if(e==1){for(int i=1;i<=4;i++){if(q[1][i]==1) printf("hong ");if(q[1][i]==2) printf("bai ");if(q[1][i]==3) printf("qing ");if(q[1][i]==4) printf("huang ");}}if(e==2){for(int i=1;i<=4;i++){if(q[2][i]==1) printf("hong ");if(q[2][i]==2) printf("bai ");if(q[2][i]==3) printf("qing ");if(q[2][i]==4) printf("huang ");}}if(e==3){for(int i=1;i<=4;i++){if(q[3][i]==1) printf("hong ");if(q[3][i]==2) printf("bai ");if(q[3][i]==3) printf("qing ");if(q[3][i]==4) printf("huang ");}}if(e==4){for(int i=1;i<=4;i++){if(q[4][i]==1) printf("hong ");if(q[4][i]==2) printf("bai ");if(q[4][i]==3) printf("qing ");if(q[4][i]==4) printf("huang ");}}//system("pause");return 0;}