Search found 12 matches

by kawsar
Wed Aug 18, 2010 8:10 am
Forum: Volume 4 (400-499)
Topic: 412 - Pi
Replies: 104
Views: 18906

412 - Some spacial input-output for 412 program

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...........!!! :( :( :(
by kawsar
Sat Aug 14, 2010 8:45 pm
Forum: Volume 3 (300-399)
Topic: 348 - Optimal Array Multiplication Sequence
Replies: 22
Views: 4179

Re: 348 WA

I got accepted......:):)
by kawsar
Sat Aug 14, 2010 8:44 pm
Forum: Volume 3 (300-399)
Topic: 348 - Optimal Array Multiplication Sequence
Replies: 22
Views: 4179

Re: 348: Why am i getting wrong answer?

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

For your simple input output, i found my mistake in my program.
Thanks a lot.....
Bye.
by kawsar
Tue Aug 10, 2010 3:45 pm
Forum: Volume 4 (400-499)
Topic: 490 - Rotating Sentences
Replies: 212
Views: 22270

Re: 490 - Rotating Sentences

#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' ; if(strlen(x) > p) p ...
by kawsar
Tue Aug 10, 2010 11:47 am
Forum: Volume 100 (10000-10099)
Topic: 10026 - Shoemaker's Problem
Replies: 82
Views: 35330

Re: 10026 - Shoemaker's Problem

Thanks, Zwergesel.

I got accepted.
Thanks for reply....
bye.
by kawsar
Sun Aug 08, 2010 4:22 am
Forum: Volume 100 (10000-10099)
Topic: 10026 - Shoemaker's Problem
Replies: 82
Views: 35330

Re: 10026 - Shoemaker's Problem

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 *x = ...
by kawsar
Sun Aug 08, 2010 4:09 am
Forum: Volume 100 (10000-10099)
Topic: 10038 - Jolly Jumpers
Replies: 445
Views: 86006

Re: 10038 - Jolly Jumpers

I got accepted....just a few change of my code.
Thanks. :D
by kawsar
Sun Aug 08, 2010 3:13 am
Forum: Volume 100 (10000-10099)
Topic: 10038 - Jolly Jumpers
Replies: 445
Views: 86006

Re: 10038 - Jolly Jumpers

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<n; i++) b[j++] = a...
by kawsar
Sat Aug 07, 2010 1:27 pm
Forum: Volume 3 (300-399)
Topic: 348 - Optimal Array Multiplication Sequence
Replies: 22
Views: 4179

348 WA

I got accepted....bye.:):):):):):)
by kawsar
Thu Aug 05, 2010 8:49 pm
Forum: Volume 4 (400-499)
Topic: 443 - Humble Numbers
Replies: 82
Views: 7877

443 Wrong Answer

#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; i<31; i++){ for(j=0; ...
by kawsar
Thu Aug 05, 2010 8:27 pm
Forum: Volume 4 (400-499)
Topic: 412 - Pi
Replies: 104
Views: 18906

412 Wrong answer

#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++; continue; } x = a % a[j]; p ...
by kawsar
Thu Aug 05, 2010 7:58 pm
Forum: Volume 4 (400-499)
Topic: 490 - Rotating Sentences
Replies: 212
Views: 22270

490 wrong answer

#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); i++ ; } for(j=0; j<i...

Go to advanced search