1 solutions
-
0
C :
#include<stdio.h> main() { int n,j,m; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&m); printf("Case #%d:\n",i); puts("*------------*"); for(j=0;j<10;j++) { if(j<(100-m)/10) puts("|............|"); else puts("|------------|"); } puts("*------------*"); } }C++ :
#include<stdio.h> int main(){ int t, n, tot = 1; int i, j, k; scanf("%d", &t); while(t--){ scanf("%d", &n); printf("Case #%d:\n", tot++); printf("*"); for(i = 0; i < 12; i++){ printf("-"); } printf("*\n"); for(i = 0; i < 10 - n / 10; i++){ printf("|"); for(j = 0; j < 12; j++){ printf("."); } printf("|\n"); } for(i = 0; i < n / 10; i++){ printf("|"); for(j = 0; j < 12; j++){ printf("-"); } printf("|\n"); } printf("*"); for(i = 0; i < 12; i++){ printf("-"); } printf("*\n"); } return 0; }
- 1
Information
- ID
- 19459
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By