OJ Board

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...

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!

RTE is...

1. Small array size

2. Devided zero(ex : 0/0, 1/0, 0/1)

I think you are case 2.

Check!

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

한국사람이군하...

web.humoruniv.com

웃긴대학에 다니는 형을 몰라보다니...ㅋㅋ

굴다리 밑으로 10초안에 와라!

I think you have to delete some words.

Are you think too?

I think too, Huh?

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...

#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...

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

#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...

#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...

#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...

Thank you Source!

I inserted some parts, and I got AC!!