Try to "draw" the organization of seats, it helps a lot in writing algorithm solution.

Wrong answer 3 test. Help!

Brute force this question! There's really no reason to do anything else.

All tests on this forum gave the correct results ... I do not know what the problem is. Please, help!!!!

Check if you're not using printf to output long long integers, it will not work on the server. So instead of:
printf("%lld\n", count);
do:
cout << count << endl;

I got WA on test 6 due to this problem.

the answer is
the coefficient of y^n
of A(n)=(1+y+y^2+y^3+...)(1+y^2+y^4+y^6+...)
...(1+y^n+y^2n+y^3n...)
if y<1;
A(n)=1/((1-y)(1-y^2)(1-y^3)....)

Dear Colleagues,

It's occurring a weird situation: on my notebook, compiling using this Online Judge way, my java code for this problem works fine and gives the correct answers. When i submit it, however, online judge accuses of "Runtime Error". It follows below my "java version":

"java version "1.7.0_01" # At Ubuntu 11.10
Java(TM) SE Runtime Environment (build 1.7.0_01-b08)
Java HotSpot(TM) 64-Bit Server VM (build 21.1-b02, mixed mode)"

Can anyone explain why "Runtime Error" in Online Judge?

If you have WA on 16 test than maybe you have error in calculation of (xi - xj)^2.
See problem statement |xi| < 10^6 so (xi-xj)^2 may be 4*10^12 and it does not fit in int type.

I got a WA while using scanf but got an Accepted when I used cin instead.

    using System;
    using System.Globalization;

    namespace a_b
    {
        public class Program
        {
            private static void Main()
            {
                int first = 0;
                int N = int.Parse(Console.ReadLine());
                if (N <= System.Math.Abs(1000))
                {
                    if (N == 1)
                    {
                        first = 1;
                        for (int i = 1; i <= N; i++)
                        {
                            first += i;
                        }
                    }

                    if (N > 1)
                    {
                        first = 0;
                        for (int i = 0; i <= N; i++)
                        {
                            first += i;
                        }
                    }

                    if (N < 1)
                    {
                        first = 1;
                        for (int i = 0; i >= N; i--)
                            first += i;
                    }
                    Console.WriteLine(first);
                }
            }
        }
    }

0 and 1 is trivial solution.
Let x solution it must satisfy for follow requirements:
{x=0(mod p);x=1(mod q);} or
{x=0(mod q);x=1(mod p);}
We can find 2 solution for these equation let it be x1,x2;
And all solution will satisyf for follow requirements (x1+lcm(p,q))mod n,(x2+lcm(p,q))mod n;
but lcm(p,q)==n we have only for solutions
0 1 x1 x2;
Sorry for bad English!

who can give some tests like test 4, pls.

I am having problem in 1. Plz tell me that what should i do to solve this?

помогите

Can you give me a hint with test #41?

С хера он не принимает задачу?!
Вот:


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Dimmell
{
    class Program
    {
        static void Main(string[] args)
        {

            int a = Convert.ToInt32(Console.ReadLine());
            int b = Convert.ToInt32(Console.ReadLine());
            Console.WriteLine(a + b);
        }
    }
}

Edited by author 03.06.2013 19:24

Ok, so my program gets WA2. And if I add code like
int t2=45;
if(n==2) cout << t2 << endl;
I get WA3. Funny fact though - "45" is answer my program always gave for n==2. So we have two different "45", and only one of them is good as answer. Somehow cout << s(9,n) << endl; doesn't work well, even if s(9,n)=45. Someone had problems of this kind?