OJ Board

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}; whil...

thankssssss
brianfry713
ACC

Cutt
thanks "brianfry713"
a lot u help me to a lot of problem
thanks again

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...

cutt

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...

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; ...

Cutt

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

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...

thanks acc

brianfry713 wrote:Try input:

Code: Select all

1
1 1 1

out put will be floating
what will be the answer

Acc

cuttttttttttttt

ACCCC