Search found 44 matches

by @mjad
Sat Apr 23, 2011 10:43 am
Forum: Volume 117 (11700-11799)
Topic: 11777 - Automate the Grades
Replies: 32
Views: 5715

11777 - Automate the Grades

please help me #include<stdio.h> int main() { int ks =0,term1,term2,term3, term4, at1,at2,at3,total, min ,n; //freopen("input.txt", "r",stdin); scanf("%d", &n); for( ; n > 0; n--) { total = 0; ks++; scanf("%d%d%d%d%d%d%d", &term1, &term2, &term3, &term4, &at1, &at2,&at3); total = term1+term2+term3+t...
by @mjad
Wed Apr 20, 2011 12:20 pm
Forum: Volume 3 (300-399)
Topic: 382 - Perfection
Replies: 95
Views: 19185

382 WA

why wrong answer please help me #include<stdio.h> #include<string.h> #include<stdlib.h> long i, num,sum; int list[100]; char input[50000]; int main() { gets(input); char *p; printf("PERFECTION OUTPUT\n"); p = strtok(input," "); while( p != NULL ) { num = atol( p); if(num == 0) break; sum = 0; for( i...
by @mjad
Wed Apr 20, 2011 10:32 am
Forum: Volume 9 (900-999)
Topic: 913 - Joana and the Odd Numbers
Replies: 32
Views: 13758

913 - Joana and the Odd Numbers

i am not understand how i can solve it?
write me algorithm, or give me short hints to solve this problem
by @mjad
Thu Nov 04, 2010 3:59 am
Forum: Volume 101 (10100-10199)
Topic: 10183 - How Many Fibs?
Replies: 66
Views: 23634

Re: 10183 why worng answer?

:( please help me why WA? #include<iostream.h> #include<string.h> //using namespace std; int compare(char a[100009],char b[100009]); void sum(char a[100009],char b[100009]); void fact(char f1[100009],char f2[100009]); char f1[100009],f2[100009]; long z; int main() { char first[100009],second[100009]...
by @mjad
Thu Nov 04, 2010 3:53 am
Forum: Volume 4 (400-499)
Topic: 486 - English-Number Translator
Replies: 27
Views: 6966

486 - English-Number Translator WA

:o why wrong answer please help me // English-Number Translator // problem no 486 #include<cstdio> #include<cstring> #include<queue> using namespace std; #define M 1000000 //typedef __int64 ll; int main() { char taka[32][15]={ "negative","zero","one", "two","three","four","five","six","seven","eight...
by @mjad
Thu Nov 04, 2010 3:49 am
Forum: Volume 4 (400-499)
Topic: 494 - Kindergarten Counting Game
Replies: 119
Views: 21924

Re: 494 WA

:D Thanks for your reply , i got AC :D
by @mjad
Thu Nov 04, 2010 3:11 am
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 45878

Re: 673 - Parentheses Balance

:D Thanks for Help
i got AC
by @mjad
Mon Nov 01, 2010 2:45 pm
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 45878

Why 673 WA?

AC
by @mjad
Thu Oct 28, 2010 6:53 am
Forum: Volume 4 (400-499)
Topic: 494 - Kindergarten Counting Game
Replies: 119
Views: 21924

494 test my code. why WA?

why wrong answer? please help me #include<stdio.h> #include<string.h> #include<ctype.h> #define M 1000000 int main() { //freopen ("494.txt","r",stdin); char text[M],*t; int f,i,count,tem; while(gets(text)) { count=0; t=strtok(text," !.,;~!@#$%^&*()\t_\?/\n"); while(t) { f=0; tem=strlen(t); for(i=0;i...
by @mjad
Wed Oct 20, 2010 5:53 am
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 21250

147 how to calculate coin change?

please any body help me.
give me an example of coin change made up.
by @mjad
Wed Oct 20, 2010 4:55 am
Forum: Volume 8 (800-899)
Topic: 884 - Factorial Factors
Replies: 49
Views: 26926

Re: 884 - Factorial Factors

i don't understand properly ?
so concept not clear .
Please discuss your Code

thanks for your help
by @mjad
Tue Oct 19, 2010 10:12 pm
Forum: Volume 8 (800-899)
Topic: 884 - Factorial Factors
Replies: 49
Views: 26926

Re: 884 - Factorial Factors

Thanks for your reply
i am trying to understand.
you may remove it now.
by @mjad
Tue Oct 19, 2010 2:27 pm
Forum: Volume 8 (800-899)
Topic: 884 - Factorial Factors
Replies: 49
Views: 26926

Why 884 TL? I don't know. please help me

Here is my code I think this is so efficient #include<stdio.h> #define M 1000002 int *prime =new int[M]; long *pre =new long[M]; int isprime() { long i,j; for(i=0;i<M;i++) { pre[i]=prime[i]=0; } for(i=2;i*i<=M-2;i++) if(!prime[i]) for(j=i+i;j<=M-2;j+=i) prime[j]=1; return 0; } long divsor(long n) { ...
by @mjad
Sun Aug 15, 2010 7:58 am
Forum: Volume 101 (10100-10199)
Topic: 10190 - Divide, But Not Quite Conquer!
Replies: 105
Views: 23925

10190why presentation error?

please anybody help me why presentation error? i think this is write , but i don't get AC my code is here please any body help me here is my code #include<stdio.h> #include<queue> using namespace std; int main() { long int n,b; while(scanf("%ld %ld",&n,&b)==2) { queue<long int>q; if(n<=1||b<=1) { pr...
by @mjad
Sun Aug 15, 2010 7:09 am
Forum: Volume 101 (10100-10199)
Topic: 10190 - Divide, But Not Quite Conquer!
Replies: 105
Views: 23925

10190why runtime error? please help me!

:D
i go AC
thanx a lot for your reply

Go to advanced search