## Search found 7 matches

Sun Nov 28, 2010 5:59 pm
Forum: Volume 100 (10000-10099)
Topic: 10096 - The Richest Man of the Universe
Replies: 42
Views: 16286

### Re: 10096 - Richest Man of the Universe

GETTING TOO MANY WA's :( My code gives correct answer of all the test cases posted here .. cant understand where the problem is :( Please help #include <stdio.h> #include <math.h> int main(void) { int n; char c; double w,l,r,ans,R,d,a1,a2,a,tmp,L,W; scanf("%d",&n); while(n--) { scanf(" %c",&c); if(c...
Sat May 01, 2010 7:28 am
Forum: Volume 103 (10300-10399)
Topic: 10341 - Solve It
Replies: 64
Views: 34657

### Re: 10341 - Solve It

Pls someone help me.getting tons of WA :( here goes my code #include <stdio.h> #include <math.h> #include <iostream> #define EPS 1e-4 int p,q,r,s,t,u; double x,val,low,high,med,val_low,a,b,val_hig; double calcul(double x) { return (p / exp(x) + q * sin(x) + r*cos(x) + s*tan(x) + t*x*x +u); } using n...
Fri Oct 16, 2009 7:06 am
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 21774

### Re: prime cuts- 406 getting presentation error

[quote="Toufique"]I am getting presentation error.But can't understand why.please help me out. printf(" %d %d: ",n,c); printf("%d ",i); printf(" %d %d: ",n,c); printf("%d ",i); you are printing one extra space after the last prime number in each test case.. replace those lines with these... printf(...
Thu Oct 15, 2009 9:36 am
Forum: Volume 101 (10100-10199)
Topic: 10193 - All You Need Is Love
Replies: 23
Views: 9269

### Re: 10193 - All You Need Is Love

GOT AC>>>

MADE A LOOP For gcd....

Thnx for ur help

Thu Oct 15, 2009 6:41 am
Forum: Volume 101 (10100-10199)
Topic: 10193 - All You Need Is Love
Replies: 23
Views: 9269

### Re: 10193 - All You Need Is Love

Getting TLE.... can anyone help me to improve the algo??? how can i get decimal from binary more efficiently???? or get gcd ????? it is really a simple problem ...so these tle are really disappointing me.... my code:{in C} #include<stdio.h> #include<string.h> #include<math.h> int main() { long int t...
Mon Oct 12, 2009 6:39 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 27940

### AC :D :D

Thnx jehad for ur help...now got ac :D
Mon Oct 12, 2009 3:20 am
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 27940

### Re: 371 - Anckerman Functions - Why WA ?

getting Runtime error again and again.......i changed the array size{list} and also have used long long......but all the time the program gets RTE...it runs for 0.000 seconds......I dont think the problem is with the array size or using long or long long..... PLS HELP....THNX IN ADVANCE.... here is ...