Search found 11 matches

by ankit.arora
Wed Aug 01, 2007 7:41 pm
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 60372

>>ankit.arora did u check the sample inputs. for the following input 1423 2222 ur output is 44.12 but the correct output is 44.13. use double calculation and output like this printf(".2lf\n" , res); and don't forget about EPS. Hope this helps. Actually for this input the actual floating answer is 4...
by ankit.arora
Tue Jul 31, 2007 5:21 pm
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 60372

I m gettin WA but i have checked my output for all inputs provided in this thread!..... Please help me!!! #include<iostream> #include<cmath> using namespace std; int main() { unsigned long long i,j,count,t; int set; int arr[100001]={0}; arr[0]=1; arr[1]=1; for(i=2;i<100001;i++) { if(arr[i]==0) { j=2...
by ankit.arora
Tue Jun 26, 2007 7:53 pm
Forum: C++
Topic: BigInt in C++!!!
Replies: 4
Views: 5349

Thanks for that!!! I got the point now actually i read many times on this forum that there is a need to use bigint..... and by this i thought that like java we have something in c++..... actually i m a newcomer to c++..... so i got error while trying it and than i thought to enquire about that.... b...
by ankit.arora
Tue Jun 26, 2007 12:04 am
Forum: C++
Topic: BigInt in C++!!!
Replies: 4
Views: 5349

BigInt in C++!!!

can someone please explain me what is this BIGINT and how can i use it for lengthy integer values...... actually i tried the syntax but there was a stright forward error....... please help!!!!!
Thanks!!!
by ankit.arora
Sun Jun 24, 2007 10:26 pm
Forum: Volume 111 (11100-11199)
Topic: 11100 - The Trip, 2007
Replies: 18
Views: 13686

hi! I am getting WA can anyone please help me out..... here's my code! #include<iostream> using namespace std; int main() { int n,i,j,count,max,temp,prev; int arr[10010]; while(cin>>n) { if(n==0) break; for(i=0;i<n;i++) cin>>arr[i]; for(i=0;i<n;i++) { for(j=i;j<n;j++) { if(arr[i]>arr[j]) { temp=arr[...
by ankit.arora
Fri Jun 22, 2007 9:55 pm
Forum: Volume 109 (10900-10999)
Topic: 10935 - Throwing cards away I
Replies: 15
Views: 9917

Thanks a lot.... got AC!
by ankit.arora
Wed Jun 20, 2007 1:57 am
Forum: Volume 104 (10400-10499)
Topic: 10451 - Ancient Village Sports
Replies: 22
Views: 9423

My code gives WA...... Please help #include<iostream> #include<cmath> using namespace std; int main() { double n,ang,area,r,r2,rim,areaspec,areaoffi,d1; unsigned long long ar; int count=0; while(cin>>n>>area) { if(n<3) break; count++; ang=((2*acos(0.0))/n); r=sqrt((area/(n*cos(ang)*sin(ang)))); r2=r...
by ankit.arora
Wed Jun 20, 2007 1:51 am
Forum: Volume 109 (10900-10999)
Topic: 10935 - Throwing cards away I
Replies: 15
Views: 9917

i am getting PE but the output seems to be in order..... please help!!

Code: Select all

CODE REMOVED AFTER AC  
by ankit.arora
Tue Jun 19, 2007 8:25 pm
Forum: Volume 109 (10900-10999)
Topic: 10903 - Rock-Paper-Scissors Tournament
Replies: 27
Views: 11056

i am getting WA but everything seems to be all right in my code.....
please if anyone can give me few test cases so that i am able to fix it.
Thanks!
by ankit.arora
Thu May 24, 2007 3:00 pm
Forum: Volume 4 (400-499)
Topic: 408 - Uniform Generator
Replies: 48
Views: 3840

P.E. in 408

I am getting P.E. in 408...... someone please help! #include<iostream> using namespace std; int main() { int step,mod; while(cin>>step>>mod) { int arr[100010],set=0,prev,i,j,count,seed; for(j=0;j<mod;j++) arr[j]=0; prev=0; count=0; while(1) { if(count==mod) { set=1; break; } seed=(prev+step)%mod; if...
by ankit.arora
Tue May 22, 2007 10:16 pm
Forum: Volume 4 (400-499)
Topic: 408 - Uniform Generator
Replies: 48
Views: 3840

408 P.E.........Please help

This is my code for prob 408 in which i m getting repeated P.E please help!!!! #include<iostream> using namespace std; int main() { int step,mod; while(cin>>step>>mod) { int arr[100010],set=0,prev,i,j,count,seed; for(j=0;j<mod;j++) arr[j]=0; prev=0; count=0; while(1) { if(count==mod) { set=1; break;...

Go to advanced search