OJ Board

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

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

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

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

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

Thanks a lot.... got AC!

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

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

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!

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

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