Parity check[山东省第八届ACM大学生程序设计竞赛]

题目链接
Problem Description

Fascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem:
f(n)=
She is required to calculate f(n) mod 2 for each given n. Can you help her?
Input

Multiple test cases. Each test case is an integer n(0≤n≤) in a single line.
Output

For each test case, output the answer of f(n)mod2.
Sample Input

2
Sample Output

1

解题思路:
1.打表找规律,发现以0 1 1 这三个数进行循环
2.Java大数模板,暴力

import java.math.BigInteger;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		//第一个注意点,多组测试数据,Java中的表示方法in.hasNextBigInteger()
		while(in.hasNextBigInteger()){
			BigInteger a = in.nextBigInteger();
			//第二个注意点,Java大数中的'=='使用equal()函!数!
			if(a.mod(BigInteger.valueOf(3)).equals(BigInteger.valueOf(0)))
				System.out.println(0);
			//第二个注意点,Java大数中的'=='使用equal()函!数!
			else if(a.mod(BigInteger.valueOf(3)).equals(BigInteger.valueOf(1)))
				System.out.println(1);
			//第二个注意点,Java大数中的'=='使用equal()函!数!
			else
				System.out.println(1);
		}		
	}
}