I can't understand Why I got "Wrong Answer" in TEST#18......? Give me some tests !!!!!
This is my code.---
int n = in.nextInt();
boolean f =true;
if((n+1)%4==0){
System.out.print("2");
 f = false;
}
 else
 if(n%4==0)
 {
 System.out.print("0");
 f = false;
}
if(f) System.out.print("1");

After rejudge bruteforce algo rules ;-)

#include<iostream>
using namespace std;
int main () {
int period[20]={
1,
1,
2,
0,
2,
1,
2,
0,
1,
1,2,0,1,1,2,0,1,1,2,0};
int n;
cin>>n;
cout<<period[((n%20)?n%20:20)-1]<<endl;;
system ("pause");
return 0;
}

New tests were added. 517 authors lost AC verdict. Thanks to yujj.

I really think that the statement for output should be written in english.

can someone give me tests to compile my programm?

It runs well on MS Visual C# 2005, but here i get CE

using System;
using System.Text;

class Program
{
    static void Main()
    {
        ulong n = ulong.Parse(Console.ReadLine());
        ulong sum = 1;
        ulong ans = 0;
        ulong a = 2, b = 3, c = 4;
        ulong a1 = 1, b1 = 1, c1 = 1;
        for (ulong i = 1; i <= n; ++i)
        {
            a1 *= a;
            a1 %= 1000;
            b1 *= b;
            b1 %= 1000;
            c1 *= c;
            c1 %= 1000;
        }
        sum += a1 + b1 + c1;

        while (true)
        {
            if ((sum % 10) == 0)
            {
                ans++;
            }
            else
            {
                Console.WriteLine(ans);
                break;
            }
            sum /= 10;
        }
    }
}

Edited by author 30.01.2007 15:26

Who can help me?

Problem is VERY easy =)
I get AC on 0.001s and 104Kb.
Who can faster?

You need the period of 8 length.
I used a "BRUT" programm - it was quite funny;-)

Edited by author 08.01.2006 19:41

Const period:array[0..19] of byte=(2,1,2,0,1,1,2,0,1,1,2,0,1,1,2,0,1,1,2,0);

Edited by author 10.10.2005 00:38

My code:
---------------------------------
|const a:array[1..20]of integer = (2,1,2,0,1,1,2,0,1,1,2,0,1,1,2,0,1,1,2,0);
|
|var n:integer;
|
|begin
|  readln(n);
|
|  if n=1 then writeln(1) else
|  if n=2 then writeln(1) else
|  if n=3 then writeln(2) else
|  if n=4 then writeln(0)
|  else begin
|   n:=(n mod 20)-4 ;
|   writeln(a[n]);
|  end;
|end.

Begging it divideds by with 8 of remainder, have the regulation