OJ Board

I found every time Wrong Answer for this problem...
Is there any spacial input output for this problem ???

If there , then any one please give me the input output.... I am so fucked up for this problem...
Help me...........!!!

I got accepted......:)

Thanks......,
Mr. Tommy Wu

For your simple input output, i found my mistake in my program.
Thanks a lot.....
Bye.

#include<stdio.h>
#include<string.h>
#include<ctype.h>

int main(){
char a[1000][1000], x[1000], c ;
int i=0, p=0, j, k, n ;

while (c = getchar ()) {
if (c == EOF)
return 0;
n = 0 ;

if(isalpha(c))
x[n++] = c ;

while((c=getchar()) != '\n')
if(isalpha(c))
x[n++] = c ;
x[n] = '\0 ...

Thanks, Zwergesel.

I got accepted.
Thanks for reply....
bye.

Can any one help me to find out , why i getting presentation error ???
several times i submit this code, but every time i got presentation error.
Please help me ...........
Here is my code,

#include<stdio.h>
#include<stdlib.h>
#include<string.h>


int compair(const void *a, const void *b){
float ...

I got accepted....just a few change of my code.
Thanks.

Why i get WA, every time ??
can anyone explain about this problem.

#include<stdio.h>
#include<stdlib.h>

int main(){
long n, a[3000], b[3000], i, j ;

while(scanf("%ld",&n)==1){

for(i=0; i<n; i++)
scanf("%ld",&a );

if(n == 0 || n == 1){
printf("Jolly\n");
continue;
}

j=0;
for(i=1; i ...

I got accepted....bye.:):):):):)

#include<stdio.h>
#include<math.h>
#include<stdlib.h>


void InsertionSort(long m[], long n){
long i, k, key;

for(k=2;k<=n;k++){
key = m[k];
i=k-1;

while(i>0 && m >key){
m[i+1]=m ;
i--;
}
m[i+1]=key;
}
}

int main(){
long i, j, k, l, n ;
long a[10000] ;
double x ;

n = 0 ;
for(i=0 ...

#include<stdio.h>
#include<math.h>

long a[1000000];

int main(){
long n, i, j, x, p, q ;

while(scanf("%ld",&n)==1){
long num =0, sum=0;
if(n == 0)
return 0;

for(i=0; i<n; i++)
scanf("%ld",&a );


for(i=0; i<n; i++){
for(j=i+1; j<n; j++){
num++;

if(a == 1 && a[j]==1){
sum ...

#include<stdio.h>
#include<string.h>

int main(){
char a[1000][1000], x[1000], c ;
int i=0, p=0, j, k, n ;

while (c = getchar ()) {
if (c == EOF)
return 0;
n = 0 ;

x[n++] = c ;

while((c=getchar()) != '\n')
x[n++] = c ;
x[n] = '\0' ;


if(strlen(x) > p)
p = strlen(x) ;

strcpy(a ,x ...