I have two ACCEPTED solution that gives different results (difference greater than 1E-5) in approximately 7.5-8% points.
Is this normal? :)

If you have access:
"Correct" solution: http://acm.timus.ru/getsubmit.aspx/6557034.cpp
Wrong solution: http://acm.timus.ru/getsubmit.aspx/6554840.cpp

Here some of this points:

-5.4 -4.0
-0.0 -4.0
5.4 -4.0
-5.4 -2.8
-2.7 -2.8
-2.4 -2.8
-2.1 -2.8
-0.6 -2.8
0.6 -2.8
2.1 -2.8
2.4 -2.8
2.7 -2.8
5.4 -2.8
-2.7 -2.5
-0.6 -2.5
0.6 -2.5
2.7 -2.5
-2.7 -2.2
2.7 -2.2
-5.1 -1.9
-4.8 -1.9
-1.8 -1.9
-0.3 -1.9
0.3 -1.9
1.8 -1.9
4.8 -1.9
5.1 -1.9
-4.2 -0.7
-2.7 -0.7
2.7 -0.7
4.2 -0.7
-1.8 -0.4
1.8 -0.4
-1.8 -0.1
1.8 -0.1
-1.8 0.2
1.8 0.2
-4.2 0.5
-2.1 0.5
-1.8 0.5
1.8 0.5
2.1 0.5
4.2 0.5
-4.2 0.8
4.2 0.8
-4.2 1.7
4.2 1.7
-5.1 2.0
5.1 2.0
-2.7 2.3
2.7 2.3
-5.4 2.6
-2.7 2.6
-2.4 2.6
-0.6 2.6
0.6 2.6
2.4 2.6
2.7 2.6
5.4 2.6
-5.4 2.9
-2.7 2.9
-2.4 2.9
-2.1 2.9
-0.6 2.9
0.6 2.9
2.1 2.9
2.4 2.9
2.7 2.9
5.4 2.9

New anti-greedy tests were added. 93 authors lost AC. If you still have AC with greedy solution, please, tell us about it here or to timus_support(at)acm.timus.ru.

What is the answer for the test case
6
1 3 2 5 4 6

Admins, please add these tests:
0.683013 0.2
0.683013 0.3
0.583013 0.4
0.583013 0.5

Just add them :)

I know this might sound stupid, but how am I supposed to know when I've finished inputting numbers? I don't see anything saying what A is equal to, so how do I know?

He guys if you can't come up with any formula...pre-computation will do the job.I could not come up with any formula so I used precomputation and AC in 0.015 sec.Good luck :)

Sorry to blunt, but I don't understand the meaning of the task.
Explain what needs to be done.

#include <cstdio>
#include <map>
std:: map <int, int> a;
int n, m, q, i, x, ans;
void solve(){
    scanf("%d", &n);
    for(i = 0 ; i < n ; i ++) scanf("%d", &x), a[x] ++;
    scanf("%d", &m);
    for(i = 0 ; i < m ; i ++){
        scanf("%d", &q);
        if(a[q]) ans ++;
    }
    printf("%d", ans);
}
int main(){
    solve();
}

Add some tests...

hi, I used bf search and all the things seem to work correctly, but I get WA 45... I have no idea what is my mistake... help me, please :) give me some tests

My solution is depend on next_permutation in C++.

I got AC with O(N*N);

Idea: use mathematical induction and prove that solution exist always.
Induction gives a solution.

this is my solution
#include <iostream>
#include <cmath>
using namespace std;

int main()
{
   long long a,b,s=0,d=0,k=0,jama,kk=0,ss=0,dd=0;
   cin>>b;
   a=b;
   b=b-1;
   while(b-1>0)
   { jama=b%10;
       k++;
       if(k<=3)
       {
           s+=jama;
       }
       else{
        d+=jama;
       }
       b/=10;

   }

   int i=0;
   if(s-d==0 )
   {
      i++;

   }

   a=a+1;
   int joma;
    while(a>0)
   { joma=a%10;
       kk++;
       if(kk<=3)
       {
           ss+=joma;
       }
       else{
        dd+=joma;
       }
       a/=10;

   }
   if(ss-dd==0 )
   {
      i++;

   }
   if(i>0)
   {
       cout<< "Yes";

   }
   else
    cout<< "No";
    return 0;
}

#include <iostream>
using namespace std;


int main()
{
    int k = 0;
    long long int s = 0;
    char num[52];
    int arr[51];
    bool flag = true;
    cin >> num;
    for(int i = 0; flag; i++)
    {
        switch(num[i])
        {
            case '0':
            {
                arr[i] = 0;
                k++;
                break;
            }
            case '1':
            {
                arr[i] = 1;
                k++;
                break;
            }
            case '2':
            {
                arr[i] = 2;
                k++;
                break;
            }
            case '3':
            {
                arr[i] = 3;
                k++;
                break;
            }
            case '4':
            {
                arr[i] = 4;
                k++;
                break;
            }
            case '5':
            {
                arr[i] = 5;
                k++;
                break;
            }
            case '6':
            {
                arr[i] = 6;
                k++;
                break;
            }
            case '7':
            {
                arr[i] = 7;
                k++;
                break;
            }
            case '8':
            {
                arr[i] = 8;
                k++;
                break;
            }
            case '9':
            {
                arr[i] = 9;
                k++;
                break;
            }
            case '\0':
            {
                flag = false;
                break;
            }
        }
    }
    for(int i = k-1; i+1 > 6;)
    {
        s = s + arr[i];
        s = s + arr[i-1]*3;
        s = s + arr[i-2]*2;
        s = s + arr[i-3]*6;
        s = s + arr[i-4]*4;
        s = s + arr[i-5]*5;
        i = i - 6;
        k = k - 6;
    }
    if(k > 0)
    {
        s = s + arr[k-1];
        k--;
    }
    if(k > 0)
    {
        s = s + arr[k-1]*3;
        k--;
    }
    if(k > 0)
    {
        s = s + arr[k-1]*2;
        k--;
    }
    if(k > 0)
    {
        s = s + arr[k-1]*6;
        k--;
    }
    if(k > 0)
    {
        s = s + arr[k-1]*4;
        k--;
    }
    if(k > 0)
    {
        s = s + arr[k-1]*5;
        k--;
    }
    cout << s%7;
    return 0;
}

Edited by author 16.11.2013 14:57

Edited by author 16.11.2013 14:57

import java.util.Scanner;


public class A380 {
    public static void main(String agrs[]){
        Scanner sys=new Scanner(System.in);
        String input=sys.next();
        String[] part=input.split("(?<=\\d)(?=\\D)");
        int num=Integer.parseInt(part[0]);
        if(num==1 || num==2){
            if(part[1].equals("A")||part[1].equals("D"))
                System.out.println("window");
            else if(part[1].equals("B")||part[1].equals("C"))
                System.out.println("aisle");

        }
        else if(num>=3 && num<=20){
            if(part[1].equals("A")||part[1].equals("F"))
                System.out.println("window");
            else if(part[1].equals("B")||part[1].equals("C") || part[1].equals("D")||part[1].equals("E"))
                System.out.println("aisle");

        }
        else
            if(num>=21 && num<=65){
            if(part[1].equals("A")||part[1].equals("K"))
                System.out.println("window");
            else if(part[1].equals("C")||part[1].equals("D") || part[1].equals("H")||part[1].equals("G"))
                System.out.println("aisle");
            else if(part[1].equals("B")||part[1].equals("E") || part[1].equals("F")||part[1].equals("J"))
                System.out.println("niether");
        }

    }

}

Time limit is 1.0s, my program executes test 11 in 0.187s the result is TLE, why ?

I can't pass test 4, I just can't,,,,,


thanks,, problem founded....

Edited by author 29.11.2013 11:03

#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (39+2*a>a+2*b) cout << 39+2*a;
else;cout << 40+2*b;
return 0;
}