Submission #10094

#TimeUsernameProblemLanguageResultExecution timeMemory
10094jujakhanaPalindromes (APIO14_palindrome)C11
0 / 100
0 ms1380 KiB
#include<stdio.h> #include<string.h> char str[300000]; int palindrome(int size) { int i, j; int ok=1; for(i=size;;i++) { ok=1; for(j=0;j<size;j++) { if((i-j-1)<size && str[j]!=str[i-j-1] ) { printf("%d번째 : %c %c\n",i, str[j], str[i-j-1]); ok=0; break; } } if(ok) return i; } } int main() { int str_length=0; char a='0'; while(a!='\n'&&str_length<50) { scanf("%c", &a); str[str_length] = a; str_length++; } printf("%d", palindrome(str_length-1)); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...