본문 바로가기

Solutions/Fanta's Solution

PKU 1298. The Hardest Probelm Ever. AC #include int main() { char string[101]; int i; while(1) { gets(string); if(strcmp("ENDOFINPUT",string)==0) return 0; if(strcmp("START",string)==0 || strcmp("END",string)==0) continue; for(i=0; string[i]!=0; i++) { if (string[i]='A') printf("%c",string[i]+21); else if (string[i]>'E' && string[i] 더보기
PKU 1089. Intervals. AC #include typedef struct { int start,end; }inter; int fcmp(inter *a, inter *b) { return a->start-b->start; } main() { int i, n; inter input[50000], *p; while(scanf("%d",&n)!=EOF) { for(i=0; iend) { printf("%d %d\n",p->start,p->end); p->start=input[i].start; p->end=input[i].end; } if(input[i].end > p->end) p->end=input[i].end; } printf("%d %d\n",p->start,p->end); } } Run ID User Problem Result Mem.. 더보기
PKU 1089. Intervals. TLE #include typedef struct { int start,end; }inter; int fcmp(inter *a, inter *b) { return a->start-b->start; } main() { int i, j, n; inter input[50000]; while(scanf("%d",&n)!=EOF) { for(i=0; i 더보기
UVa. 112, PKU 1145. Tree Summing. AC #include int num,yes; char ch; int func(int sum) { int n,leaf=0; if(scanf(" %d",&n)) { sum+=n; scanf(" %c",&ch); leaf+=func(sum); scanf(" %c",&ch); leaf+=func(sum); if(leaf==2 && sum==num) { yes=1; } } else { if(scanf(" %c",&ch)) { if(ch==')') return 1; } } if(scanf(" %c",&ch)) { if(ch==')') return 0; } } main() { while (scanf("%d", &num) != EOF) { scanf(" %c",&ch); func(0); if(yes==1) puts("yes.. 더보기
PKU 3438. Look and Say. AC #include #include main() { char string[1001]; int n, i, cnt, lenth; scanf("%d",&n); while(n--) { scanf("%s",string); lenth=strlen(string); for(i=0, cnt=1; i 더보기
PKU 2521. How much did the businessman lose. AC #include main() { int n, m, p, c; while(scanf("%d %d %d %d",&n,&m,&p,&c)) { if(n+m+c+p==0) break; printf("%d\n",n-m+p); } } 흠..... 똑같네요 ㅇㅅㅇ 더보기
PKU 2636. Electrical Outlets. AC 숏코딩 main(i,j,k,sum){for(scanf("%d",&i);i--;printf("%d\n",sum+1))for(sum=0,scanf("%d",&j);j--;scanf("%d",&k),sum+=k-1);} 정상소스 #include main() { int i, j, k, sum=0; scanf("%d",&i); while(i--) { sum=0; scanf("%d",&j); while(j--) { scanf("%d",&k); if(j) k--; sum+=k; } printf("%d\n",sum); } } Run ID User Problem Result Memory Time Language Code Length Submit Time 4433684 jht009 2636 Accepted 204K 0MS.. 더보기
PKU 1979. Red and Black. AC #include char string[20][20]; int y,x=1; int cnt; void back(int yy,int xx) { cnt++; string[yy][xx]='#'; if(yy>0 && string[yy-1][xx]=='.') back(yy-1,xx); if(yy0 && string[yy][xx-1]=='.') back(yy,xx-1); if(xx 더보기
PKU 3094. Quicksum. AC #include #include main() { char string[256]; int i, lenth, sum; while(gets(string)) { if(strcmp(string,"#")==0) break; lenth=strlen(string); for(i=0, sum=0; i 더보기
PKU 3077. Rounders. AC #include #include main() { int n, lenth, i; char string[10]; scanf("%d",&n); while(n--) { scanf("%s",&string); lenth=strlen(string); i=lenth; while(--i) { if(string[i] >= '5') { string[i]='0'; string[i-1]+=1; } else { string[i]='0'; } } while(i 더보기
PKU 2388. Who's in the Middle. AC #include main() { int n,arr[9999],i; scanf("%d",&n); for(i=0; i 더보기
PKU 1804. Brainman. AC #include main() { int arr[1000]; int cnt,i,j,k,cases,n,tmp; int sorted=1; scanf("%d",&cases); for(k=1;k 더보기
PKU 2649. Factovisors. AC 소인수분해 #include #include int m,n; int is_prime(int m) { int i, sqrn; sqrn=sqrt(m); for(i=2 ; i1;) { if(a%i==0) { a/=i; count++; } if(a%i!=0 || a==1) { if(count>0) { if(n/i 더보기
PKU 2649. Factovisors. AC #include #include int m,n; int is_prime(int m) { int i; if(m 더보기
PKU 2649. Factovisors. TLE #include #include int m,n; int is_prime(int a) { int i=2; int sqrn=sqrt(a); while(i 더보기
PKU 1844, Sum. AC #include int i,in,sum; int main() { do { scanf("%d",&in); }while(in100000); for(i=sum=0;;i++) { sum+=i; if(sum>=in && (sum-in)%2==0) { printf("%d\n",i); break; } } } Run ID User Problem Result Memory Time Language Code Length Submit Time 4114901 jht009 1844 Accepted 204K 0MS C 296B 2008-09-23 15:25:49 매트릭스 포기해도 되나요???????????????????????????????? 헣헣헣 GG 더보기
PKU 2017, Speed Limit. AC #include int n,s,h2,h1; int arr[10],i,j; int main() { while(1) { scanf("%d",&n); if(n==-1)break; for(i=0;i 더보기
PKU 2027. No Brainer. AC 94B main(x,y,n){for(scanf("%d",&n);n;puts(x 더보기