9 solutions
-
0
#include<stdio.h> int main(){ int n; int i; char id[18]; scanf("%d",&n); for(i=0;i<n;i++){ for(int m=0;m<18;m++){ scanf(" %c",&id[m]);} for(int abc=0;abc<17;abc++){ id[abc]=id[abc]-'0';}
//7-9-10-5-8-4-2-1-6-3-7-9-10-5-8-4-2 int end; end=id[0]*7+id[1]*9+id[2]*10+id[3]*5+id[4]*8+id[5]*4+id[6]*2+id[7]+id[8]*6+id[9]*3+id[10]*7+id[11]*9+id[12]*10+id[13]*5+id[14]*8+id[15]*4+id[16]*2; //1-0-X -9-8-7-6-5-4-3-2。 5、 switch(end%11){ case 0: if(id[17]'1') printf("True"); else printf("False"); break; case 1: if(id[17]'0') printf("True"); else printf("False"); break; case 2: if(id[17]'X') printf("True"); else printf("False"); break; case 3: if(id[17]'9') printf("True"); else printf("False"); break; case 4: if(id[17]'8') printf("True"); else printf("False"); break; case 5: if(id[17]'7') printf("True"); else printf("False"); break; case 6: if(id[17]'6') printf("True"); else printf("False"); break; case 7: if(id[17]'5') printf("True"); else printf("False"); break; case 8: if(id[17]'4') printf("True"); else printf("False"); break; case 9: if(id[17]'3') printf("True"); else printf("False"); break; case 10: if(id[17]=='2') printf("True"); else printf("False"); break; } printf("\n");
}
return 0; }
Information
- ID
- 41
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 8
- Tags
- # Submissions
- 1878
- Accepted
- 246
- Uploaded By