I cannot understand why the answer is win 5 and lose 1.I think it should be win 3 and lose 3.

here is my c++ code:
#include <iostream.h>
int main()
{
int n,i,j,x[501],z[501],aux,max,V[501],L[501],k,poz;
     cin>>n;
     for(i=1;i<=501;i++)
            z[i]=i;
     for(i=1;i<=n;i++)
     cin>>x[i]>>V[i];
     if(n>1)
     {
     for(i=1;i<=n-1;i++)
        for(j=i+1;j<=n;j++)
             if(x[i]<x[j])
                     {
                          aux=x[i];
                          x[i]=x[j];
                          x[j]=aux;
                          aux=V[i];
                          V[i]=V[j];
                          V[j]=aux;
                          aux=z[i];
                          z[i]=z[j];
                          z[j]=aux;
                     }

  }
  L[n]=1;
  for (k=n-1;k>=1;k--)
  { max=0;
     for (i=k+1;i<=n;i++)
        if ((V[i]>V[k])&&(L[i]>max))
    max=L[i];
         L[k]=max+1;
  }
 max=L[1];
 poz=1;
 for (k=1;k<=n;k++)
    if (L[k]>max)
      { max=L[k];
         poz=k;
      }
  cout<<max<<endl;
  cout<<z[poz]<<" ";
  for (i=poz+1;i<=n;i++)
     if ((V[i]>V[poz])&&(L[i]==max-1))
      { cout<<z[i]<<" ";
         max--;
      }
  return 0;
}

Here is my brutforce:

#include <stdio.h>
#include <iostream.h>
#include <math.h>
//typedef enum {true,false} bool;
bool z[20];
long int a[20];
long int min,v1,v2,k,n,j,l,i;

void incr()
{
 int in;
 for (in = 0; in< 20 ; in++ )
 {
  if (z[in]==false){z[in]=true;break;}
  else z[in]=false;
  return;
 }
}
 int main(){
 for (l=0;l<20;l++)
  z[l]=1;
  cin>>n;
 // long int i;
  for (i=0;i<n;i++)
   cin>>a[i];

  min=100000;
  for (i=0;i<=1048575;i++)
  {
   incr();
   v1=0;v2=0;
   for (j=0;j<20;j++)
   {
    if (z[j]) v1=v1+a[j];
    else
    v2=v2+a[j];

    if (fabs((double)(v1-v2))<min)
     min=fabs((double)(v1-v2));

  }
  }
  cout<<(long int)min<<endl;
 return 0;
}

Thx in advance!

I think they consider 1700, 1800, 1900 as being leap years whereas in the problem statement these years are not considered so.

http://www.timeanddate.com/calendar/index.html?year=1700&country=20

Who can help me?
Why I got WA#6
This is my code
# include <iostream>
using namespace std;
int main ()
{
    int n,i,j,k;
    int x[10002],y[10002],h[10002];
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i];
        h[i]=i;
    }
    for(i=1;i<n;i++)
        for(j=i+1;j<=n;j++)
        {
            if((x[j]<x[i]) || (x[j]==x[i] && y[j]>y[i]))
            {
                k=x[i];x[i]=x[j];x[j]=k;
                k=y[i];y[i]=y[j];y[j]=k;
                k=h[i];h[i]=h[j];h[j]=k;
            }
        }
    for(i=1;i<=(n/2)+1;i+=2)
        cout<<h[i]<<" "<<h[i+1]<<endl;
    return 0;
}

using System;
using System.Collections.Generic;
using System.Text;
using System.IO;

namespace Timus1081
{
    class Program
    {
        static void Main(string[] args)
        {
            new Program().Run(Console.In, Console.Out);
            //new Program().Run(new StreamReader(@"d:\a.txt"), Console.Out);
            //Console.ReadLine();
        }

        private void Run(System.IO.TextReader textReader, System.IO.TextWriter textWriter)
        {
            string[] ss = textReader.ReadToEnd().Split();
            //string ss = input.Split('\n');

            List<double> bs = new List<double>();

            for (int i = 0; i < ss.Length; i++)
            {
                if (ss[i].Trim().Length > 0)
                {
                    //string[] s1 = ss[i].Trim().Split(' ');
                    //for (int j = 0; j < s1.Length; j++)
                    {
                        try
                        {
                            bs.Add(Math.Sqrt(Double.Parse(ss[i])));
                        }
                        catch (Exception ex)
                        {
                        }
                    }
                }
            }

            for (int i = bs.Count - 1; i >= 0; i--) textWriter.WriteLine(bs[i].ToString("F4"));
        }

    }
}

The method is something like DP + greedy...

/....bigint class...////
....................
bigint a,b,c,temp;
    a = 2;
    b = 3;
    c = a*b;
    if(n == 1)
    {
        cout << '2';
        return 0;
    }
    cout << "2\n3\n";
    for(int i = 3; i <= n; i++)
    {
        temp = a*b;
        c = temp + 1;
        cout << c << endl;
        a = c;
        b = temp;
    }
................................
////////////////////////////////

Edited by author 25.06.2008 12:19

My prog that easily gets TLE on my tests got AC on timus. Bad. New tests were sent on your mail...

It seems we must output the shortest way of changing,but in the problem says:
If there are several solutions, you can output any one.
isn't it wrong?

sorry for my english.

В стРоках с нечетным номером ходы белых, в строках с четным номером – черных.

Edited by author 08.07.2008 03:39

May be it's posiible to add a filter for search? Such as a county of coder. Very interesting to watch coders from one country together.

WA6. What's wrong? Give some test's. In my solution I used Deixtra algo.

does the problem require only finding average that i have done still WA1. can please someone give me some test cases??

Edited by author 08.07.2008 11:04

Edited by author 08.07.2008 11:05