What the test is it?

Some tests:

n - answer
15 - No
99 - No
23 - Yes
97 - Yes
16 - No

Why you read 4 numbers?

I am also get WA#13.I don't understand why. Please help me.
My code is


#include"iostream"
using namespace std;
int main()
{
    int x[100];
    int n, x0;
    cin>>n;
    cin>>x0;
    if(n==0){cout<<"Impossible";
        return 0;}
    for(int i=0;i<n;i++)
        cin>>x[i];
    if(n==1)
    {
        n=2;
        x[1]=x0;
    }
    for(int i=0;i<n;i++)
        for(int j=i+1;j<n;j++)
            if(x[j]<x[i])
            {
                int t=x[i];
                x[i]=x[j];
                x[j]=t;
            }
            int i=0;
            for(;i<n-1;i++)
            {
                if(x0>=x[i]&&x0<=x[i+1])
                 {
                     if(x[i]<=0&&x[i+1]>=0)
                     {
                         if(x0>0)
                         {
                             cout<<x0<<' '<<x0+abs(2*x[i]);
                             return 0;
                         }
                         else
                         {
                             cout<<2*x[i+1]+abs(x0)<<' '<<abs(x0);
                             return 0;
                         }
                     }
                }
            }
            cout<<"Impossible";
    return 0;
}

maybe it's "antiquicksort" test.
I use anti("antiquicksort" test) coding   =)

for( long i=0; i < 1e6; ++i ) swap( v[rand()%v.size()], v[rand()%v.size()] );
where 'v' is vector of string. =)

Edited by author 14.01.2012 19:42

Edited by author 14.01.2012 19:42

yep

my algo need less time but i got TLE on test 19 . Then i was interested and send your solution . At first your array size was very small and at second time  it got TLE on test 19.
So sorry, but it's not solution.

Any hints or tests can be helpful! Thanks!

4
-999999999 1000000000
-1000000000 999999999
1000000000 -1000000000
-1000000000 1000000000

out: 3 4

I cann't believe. It DON'T get TLE.

    for( long i = m-1; i < (long)arr.size(); ++i )
        cout << *max_element( arr.begin()+i+1-m, arr.begin()+i+1 ) << endl;

=)

I'll give you two hints:

1) You must be familiar with nimbers.
2) Look for a cycle. I used another program to find a cycle when generating nimbers up to let's say 10 000.

Good luck ;)

I think your j should be n div 2,and I promise it's not TLE.And you can define 'ans' to store the answer and let it equal n.That's all.

zj_zcy, what if n = 3 ?
Your program wrote 0, but right answer 2

The trouble is if n is big prime.
Try this:
99999989
The answer is:
99999988.

Think how to modify algorithm to catch big primes in factorization. Here it isn't necessary, but it will be useful.

Your code will possibly fail for integers like 2*n,also for test cases where n is a prime number

Apply the GOOD JOB for College ACMers to Make Large Money and Become a Millionaire

Hello, We need large no. of dedicated and hard working ACMers. The payment is good so we need ACMers to be efficient. All you have to do to get the job is to sign up at our websites. The link of our websites are given below.

http://www.PaisaLive.com/register.asp?3556638-4847933

After the registration, a confirmation email will be sent to your specified email address. Please click on the link inside the confirmation email to activate your account and recieve ACM work instantly. For any other queries you can mail the administrator.

Miss Juliet

Admin paisalive.com