As I understand the user can use new line to seperate the numbers, but how can we know which "Enter" is the last one (or the input stream ends) ?

WHY TIme limit  on 1 test??????????????????????????
program z1027;

{$APPTYPE CONSOLE}

uses
  SysUtils;
var s,s1:string;
    flag,flag1,i:integer;
begin
  { TODO -oUser -cConsole Main : Insert code here }
  {$IFNDEF ONLINE_JUDGE}
    assign(input, 'input.txt');
    reset(input);
    assign(output, 'output.txt');
    rewrite(output);
  {$ENDIF}
  while not seekeof do
  Begin
    read(s1);
    s:=s+s1;
  End;
  .....
  .....
  {$IFNDEF ONLINE_JUDGE}
    close(input);
    close(output);
  {$ENDIF}
end.

Edited by author 01.03.2007 12:38

Edited by author 01.01.2008 18:34

I have used quick sort algo, but I've got WA#5. Show me this test, please. I can't understand what mistake I've done in my solution.

P.S. Sorry for my English.

I can't seem to read the end of the input file, how can i fix this?

This is my code:

import java.io.*;
import java.util.*;

public class revroot
{

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        while (in.hasNextDouble())
        {
            double a = in.nextDouble();
            out.println(Math.sqrt(a));
        }
        out.close();
        }
}


Thanks in advance.

=)

What output?
150
4
50
50
50
50



and this

200
4
50
50
50
50

HOW  TO DEFINE ???

Please, explain, why a man with smallest precision must not shoot before killing one of others, and give me some examples for testing my program

There are trailing spaces in some lines of input in test 11.
Please, check this.


Edited by author 25.12.2007 02:47

this is my code:


#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{  long  K[5000005],N,i,j,t,value,k,count,a,flag;
            scanf ("%ld",&N);
            if (N%2==0) k=N/2;
            else k=N/2+1;
            for (i=0;i<N;i++)
                     scanf("%ld",&K[i]);
            for(i=0;i<N;i++){
                    j=rand()%N;
                    for(flag=0,count=1,t=0;t<N;t++){
                            if (K[t]==K[j])
                                    count++;
                            if (count>=k){
                                     value=K[j];
                                     flag=1;
                                     break;
                            }
                    }
                    if (flag=1) break;
             }
            printf("%ld\n",value);
 return 0;
}

why  Crash (stack overflow)?

please help me ?

Excellent problem. Very realistic and DP works.
Small advice: We should consider moments after stationary
condition established: first trains went to last stations.
Without this we must include 10^5 moments in Dp and
will be MLE and TLE.

Edited by author 30.12.2007 10:32

I think that correct answer for n=2 is 1, because if one of eagles has 2 heads and another 0 heads then IQ will be 2*0=0, isn't it? But my program had WA3 in that case. When I wrote 2 in output for n=2, I got accepted. Why?

270
5
50
50
100
110
170
and the answer is
-1

#include<stdio.h>

long n,a,k;
void work ()
{
   long i,na,x;
   if (n<316227) x=2*n; else x=316227;
    for (i=x;i>=1;i--)
     {
       na=2*n+i-i*i;
       if (((na%(2*i))==0)&&(na>0))
     {
        na=na/(2*i);
        a=na;
        k=i;
        break;
     }
    }
}
int main ()
{
  scanf ("%ld",&n);
  work ();
  printf ("%ld %ld",a,k);
   return 0;
}

i've been making it for nearly a week and i still get WA on #14.who can tell me why,or give me the data?

#include<iostream>
#include<math.h>
#define MAX 200000
#define N 350
using namespace std;
int n;
double map1[N][N];
struct node
{
    int x,y;
}point[N];
double dist(node a,node b)
{
    return sqrt((double)((b.x-a.x)*(b.x-a.x)+(b.y-a.y)*(b.y-a.y)));
}
void init()
{
    cin>>n;
    int i,j;
    for(i=1;i<=n;i++)
        cin>>point[i].x>>point[i].y;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            map1[i][j]=dist(point[i],point[j]);
            //cout<<map1[i][j]<<" ";
        }
        //cout<<endl;
    }
}
double calck(node a,node b)
{
    if(a.x-b.x!=0) return (a.y-b.y)/(a.x-b.x);else return -MAX;
}
int mid(node c,node a,node b)
{
    if(a.x!=b.x)
    {
        if(abs(a.x-b.x)>abs(a.x-c.x)) return 1;
    }else if(abs(a.y-b.y)>abs(a.y-c.y)) return 1;
    return 0;
}
void solve()
{
    int i,j,k,used[N][N];
    double ans=0;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            ans+=map1[i][j];
            used[i][j]=0;
        }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            for(k=1;k<=n;k++)
            {
            if(i==j || j==k || i==k) continue;
            if(calck(point[i],point[j])==calck(point[i],point[k]) && mid(point[k],point[i],point[j]) && used[i][k]==0 && used[k][i]==0)
                    {ans-=map1[i][k]*2;used[i][k]=1;}
            }
        }
    }
    ans/=2;
    cout<<(int)(ans)<<endl;
}
int main()
{
    init();
    solve();
    return 0;
}