Search found 14 matches
- Sun May 28, 2006 7:48 am
- Forum: Volume 102 (10200-10299)
- Topic: 10226 - Hardwood Species
- Replies: 121
- Views: 41854
10226... Runtime Error
I got RTE, But Why? #include <stdio.h> #include <string.h> char str[1000001][31], t[31]; int i, j, n, cnt; double x; int main() { while(gets(str[n])!=NULL) n++; for(i=0;i<n;i++){ for(j=i+1;j<n;j++){ if(strcmp(str[i],str[j])>0){ strcpy(t,str[i]); strcpy(str[i],str[j]); strcpy(str[j],t); } } } for(i=0...
- Thu Apr 06, 2006 12:24 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11012 - Cosmic Cabbages
- Replies: 29
- Views: 9522
Hint
There are 8 cases.
max = 1, min = 0
0 0 0
0 0 1
0 1 0
1 0 0
1 1 0
0 1 1
1 0 1
1 1 1
Have a good time!
max = 1, min = 0
0 0 0
0 0 1
0 1 0
1 0 0
1 1 0
0 1 1
1 0 1
1 1 1
Have a good time!
- Thu Mar 09, 2006 2:26 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10973 - Triangle Counting
- Replies: 31
- Views: 14218
RTE is...
RTE is...
1. Small array size
2. Devided zero(ex : 0/0, 1/0, 0/1)
I think you are case 2.
Check!
1. Small array size
2. Devided zero(ex : 0/0, 1/0, 0/1)
I think you are case 2.
Check!
- Thu Mar 09, 2006 2:24 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11000 - Bee
- Replies: 25
- Views: 12897
11000 Why AC?
My program is print N Fibonachi -1, N+1 Fibonachi -1.
Is it OK?
I am 0.000 and AC!
I'm confused...-_-;;;
check = 11321

Is it OK?
I am 0.000 and AC!
I'm confused...-_-;;;
check = 11321


- Tue Feb 21, 2006 2:31 pm
- Forum: Volume 4 (400-499)
- Topic: 459 - Graph Connectivity
- Replies: 132
- Views: 28662
하하하
한국사람이군하...
web.humoruniv.com
웃긴대학에 다니는 형을 몰라보다니...ㅋㅋ
굴다리 밑으로 10초안에 와라!
web.humoruniv.com
웃긴대학에 다니는 형을 몰라보다니...ㅋㅋ
굴다리 밑으로 10초안에 와라!
- Tue Feb 21, 2006 2:29 pm
- Forum: Volume 4 (400-499)
- Topic: 483 - Word Scramble
- Replies: 122
- Views: 24015
Umm..
I think you have to delete some words.
Are you think too?
Are you think too?
- Tue Feb 21, 2006 2:28 pm
- Forum: Volume 4 (400-499)
- Topic: 490 - Rotating Sentences
- Replies: 212
- Views: 25775
Umm...
I think too, Huh?
- Wed Feb 15, 2006 10:58 am
- Forum: Volume 6 (600-699)
- Topic: 620 - Cellular Structure
- Replies: 18
- Views: 5534
Hey!
I think this problem's tip is.. len=string length Mutant : len is 1, and str[0]='B' Simple : if len is 1, and str[0]='A' Fully-Grown : str[len-1]='B', and str[len-2]='A' Mutagenic : str[0]='B', and str[len-1]='A' Else : Mutant In case of Mutant, it has 2 cases to print. I got AC thie problem in C, l...
- Fri Feb 03, 2006 2:21 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10679 - I Love Strings!!
- Replies: 101
- Views: 51239
10679 - I Love String ( STL ) Why TLE???
#include <iostream> #include <cstring> #include <cstdio> #include <string> using namespace std; int n, j, find, i, k; int main() { scanf("%d",&n); for(j=0;j<n;j++) { string s; cin >> s; string::size_type idx; cin >> find; for(i=0;i<find;i++) { k=0; string strFind; cin >> strFind; idx=s...
- Fri Feb 03, 2006 2:16 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10679 - I Love Strings!!
- Replies: 101
- Views: 51239
Thanks
Thanks......
But I can't using KMP...
I am serching many question, But they are all says "Using KMP"
Need I using KMP?
Please.... Hint....
타임 리미트...I want to Accpted
But I can't using KMP...
I am serching many question, But they are all says "Using KMP"
Need I using KMP?
Please.... Hint....
타임 리미트...I want to Accpted
- Fri Feb 03, 2006 1:48 pm
- Forum: C++
- Topic: Why STL is TLE? I don't want to KMP........Plzzzzzzzzzzz
- Replies: 1
- Views: 1798
Why STL is TLE? I don't want to KMP........Plzzzzzzzzzzz
#include <iostream> #include <string> #include <cstdio> #include <cstring> using namespace std; int n, j, find, i, k; int main() { scanf("%d",&n); for(j=0;j<n;j++) { string s; cin >> s; string::size_type idx; cin >> find; for(i=0;i<find;i++) { k=0; string strFind; cin >> strFind; idx=s...
- Fri Feb 03, 2006 1:40 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10679 - I Love Strings!!
- Replies: 101
- Views: 51239
10679 - I Love String (STL) Why TLE?
#include <iostream> #include <cstring> #include <cstdio> #include <string> using namespace std; int n, j, find, i, k; int main() { scanf("%d",&n); for(j=0;j<n;j++) { string s; cin >> s; string::size_type idx; cin >> find; for(i=0;i<find;i++) { k=0; string strFind; cin >> strFind; idx=s...
- Fri Jan 27, 2006 3:00 pm
- Forum: Volume 4 (400-499)
- Topic: 444 - Encoder and Decoder
- Replies: 155
- Views: 25964
444 Why WA? I Have to finish!!!!! HELP!!!
#include<stdio.h> #include<string.h> char str[10000]; int i, j, len; int main() { while(gets(str)) { len=strlen(str); for(i=len;i>=0;i--) { switch(str ) { case ' ' : printf("23"); str =0; break; case '!' : printf("33"); str =0; break; case ',' : printf("44"); str =0; br...
- Sat Jan 21, 2006 3:35 pm
- Forum: Volume 1 (100-199)
- Topic: 190 - Circle Through Three Points
- Replies: 126
- Views: 25156
Thank you! I got PE too!
Thank you Source!
I inserted some parts, and I got AC!!
I inserted some parts, and I got AC!!