IF R=0.000999999999
I think (2*R).3f =(0.00199999).3f=0.001    (MY Solution gives 0.001)
BUT 2*(R.3f)=2*(0.0009999999.3f)=0.000

Edited by author 24.06.2008 15:14

Why wa on test 6?!?!?!
please help me with some tests

Edited by author 02.03.2008 02:35

how can i see the test case used in a problem?
what is the p and q for test#14?

isn't it ?
but the numbers are too large,how to deal with it ?

Edited by author 04.01.2009 14:33

Why WA1 ???
Even if replace cw and ccw. The same with lowermost (3) point.
Help me pleace. What with my output?

#include <iostream>
using namespace std;

int main()
{
    int n;
    int x1, y1;
    int x, y;
    int Oldx, Oldy;

    cin >> n;

    cin >> x1 >> y1;

    Oldx=x1;
    Oldy=y1;

    double sum = 0;

    for(int i=2; i<=n; ++i)
    {
        scanf("%d %d", &x, &y);
        sum += (Oldx*(double)y-x*(double)Oldy);
        Oldx=x;
        Oldy=y;
    }

    sum += (x*(double)y1-x1*(double)y);

    if(sum)
        cout << "cw";
    else
        cout << "ccw";


    return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{double a[10000];
 int n;
 for(n=1;scanf("%lf",&a[n])!=EOF;n++);
 for(;n>=1;n--)
 {a[n]=sqrt(a[n]);
 printf("%0.4lf\n",a[n]);
 }
 return 0;
}

what's the text8?

I am a green hand,I am interested in ACM competition, but I do not know what should I do?

It really hard to understand the meaning of the description of this problem!It took me an hour and more!

I think nth test is n. :)

You must write eoln and not eof

It's a very easy problem bur needs much attention.
I got WA many times just for small things:
1) "Impossible." its not "Impossible"
2) Input data order
3) Precision
4) Not writing "Distance is..."

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

short a[10000];
short sets[10000];
short p[10000];

int main()
{
  long i,n;
//  freopen("input.txt","rt",stdin);
//  freopen("output.txt","wt",stdout);

  while (scanf("%ld",&n)==1)
  {
  if (n==1) { printf("1\n"); continue; }
    long k,j,sum;
    sum=0;

    memset(a,0,sizeof(a));
    memset(sets,0,sizeof(sets));

    for (i=0; i<n; i++)
    {
      scanf("%ld",&k);
      for(j=2; j<=k; j++) a[j]--;
      sets[k]++;
      sum+=k;
    }
    for(j=2; j<=sum; j++) a[j]++;
    for(i=1; i<=sum; i++)
      for(j=2; j<=sets[i]; j++) a[j]--;

    memset(p,0,sizeof(p));
    unsigned long result=1;
    for(i=2; i<=sum; i++)
    if(!p[i])
    {
      j=i+i;
      while (j<=sum)
    { p[j]=1;
      k=j;
      while(k%i==0) {
        k/=i;
        a[i]+=a[j];
      }
      j+=i;
    }

      for(j=a[i]; j>=1; j--) result*=i;
    }
    printf("%lu\n",result);
  }

  exit(0);
  return 0;
}

I use G++.
#include <iostream>
#include <math.h>
using namespace std;
int n;
int main() {

 cin>>n;
 cout<<floor(____________);
    return 0;
}

My definitely incorrect prog got AC! Where to send new tests?

a very simplistic mistake that I think eveyone can make is that:
you must NOT use the ROUND function
you must not round the number up if the fraction part is EXACTLY .5
Good Luck

The compiler says there doesn't exist any function called "round"
Thanks

This test is something like
1 2
1 2