## Search found 87 matches

Mon Jun 02, 2014 7:24 pm
Forum: Volume 101 (10100-10199)
Topic: 10114 - Loansome Car Buyer
Replies: 38
Views: 13800

### Re: 10114 - Loansome Car Buyer

getting WAAA i gives right ans all the test case above but still waaa plz help #include<stdio.h> int main() { long I,K,L,M,N,Month; float Current,Loan,Down,Car,Check; while(true){ scanf("%ld %f %f %ld",&Month,&Down,&Loan,&N); if(Month<0) break; float Value[1000]={0.0}; while(N--){ scanf("%ld %f",&I,...
Tue Dec 10, 2013 9:21 am
Forum: Volume 117 (11700-11799)
Topic: 11747 - Heavy Cycle Edges
Replies: 11
Views: 4093

### Re: 11747 - Heavy Cycle Edges

thankssssss
brianfry713
ACC
Wed Dec 04, 2013 7:50 pm
Forum: Volume 102 (10200-10299)
Topic: 10227 - Forests
Replies: 23
Views: 9165

### Re: 10227 - Forests

Cutt
thanks "brianfry713"
a lot u help me to a lot of problem
thanks again
Tue Nov 26, 2013 4:07 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 14285

### Re: 481 - What Goes UP (Run Time Error)

getting WAAAA help need #include<stdio.h> #include<string.h> #define mx 100000 long n=0; long value[mx]; long dp[mx]={0},dir[mx]={0}; void solution(long start) { while(start!=0) { printf("%ld\n",value[start]); start=dir[start]; } //printf("%d\n",value[start]); } long longest(long u) { if(dp[u]!=0) r...
Tue Nov 26, 2013 3:36 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21629

### Re: 497- Strategic Defense Initiative...Getting WA

cutt
Tue Nov 12, 2013 5:45 pm
Forum: Volume 116 (11600-11699)
Topic: 11624 - Fire!
Replies: 54
Views: 14894

### Re: 11624 - Fire!

still TLE TLE TLE TLe ....help need #include<cstdio> #include<iostream> #include<vector> #include<queue> using namespace std; typedef queue<pair<int,int> >Queue; int Fire[1010][1010],Joe[1010][1010],R,C; char Input[1010][1010]; pair<int,int> Pair; void Cal(Queue F){ int I,K,L; while(!F.empty()){ Pai...
Tue Nov 05, 2013 9:34 pm
Forum: Volume 6 (600-699)
Topic: 679 - Dropping Balls
Replies: 5
Views: 5319

### Re: 679 - Dropping Balls

getting tle help need #include<stdio.h> int main() { long I,K,L,M,N,P; while(scanf("%ld",&P)&&P>0){ while(P--){ scanf("%ld %ld",&I,&K); bool Tree[1048580]={0}; for(L=1;L<=K;L++){ M=0; N=1; while(++M<I){ if(!Tree[N]){ Tree[N]=true; N*=2; } else{ Tree[N]=false; N=N*2+1; } } } printf("%ld\n",N); } } re...
Mon Nov 04, 2013 10:15 am
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 30491

### Re: 10487 - Closest Sums

Cutt
Fri Nov 01, 2013 7:18 pm
Forum: Volume 100 (10000-10099)
Topic: 10042 - Smith Numbers
Replies: 75
Views: 23529

### Re: 10042 - Smith Numbers

brianfry713 wrote:Try to speed up your Cal function. If you only want 10,000 primes you only need to check up to 104,729, not 100,000,000.
acc
thanxx
Thu Oct 31, 2013 10:01 pm
Forum: Volume 8 (800-899)
Topic: 884 - Factorial Factors
Replies: 49
Views: 27338

### Re: 884 - Factorial Factors

getting tle need help any idea to get me out of tle #include<stdio.h> #include<math.h> bool Status[1000002]={0}; long Data[1003]={0,2},Ary[1000002]; void Cal() { long N=7928,I,K; for(I=3;I<1001;I+=2){ if(!Status[I]){ for(K=I*I;K<=N;K+=I+I) Status[K]=1; } } K=1; for(I=3;I<=N;I+=2) if(!Status[I]){ Dat...
Thu Oct 31, 2013 4:35 pm
Forum: Volume 114 (11400-11499)
Topic: 11496 - Musical Loop
Replies: 9
Views: 4510

### Re: 11496 - Musical Loop

thanks acc
Thu Oct 31, 2013 6:24 am
Forum: Volume 125 (12500-12599)
Topic: 12502 - Three Families
Replies: 23
Views: 10067

### Re: 12502 - Three Families

brianfry713 wrote:Try input:

Code: Select all

``````1
1 1 1``````
out put will be floating
Wed Oct 30, 2013 5:27 pm
Forum: Volume 100 (10000-10099)
Topic: 10042 - Smith Numbers
Replies: 75
Views: 23529

### Re: 10042 - Smith Numbers

Acc
Mon Oct 28, 2013 4:02 pm
Forum: Volume 113 (11300-11399)
Topic: 11313 - Gourmet Games
Replies: 5
Views: 4294

### Re: 11313 - GOURMET GAMES

cuttttttttttttt
Wed Oct 09, 2013 8:48 pm
Forum: Volume 1 (100-199)
Topic: 190 - Circle Through Three Points
Replies: 126
Views: 21456

ACCCC