Parity check

最新推荐文章于 2024-09-08 09:38:59 发布

格林黄

最新推荐文章于 2024-09-08 09:38:59 发布

阅读量568

点赞数

分类专栏：算法题目

本文链接：https://blog.csdn.net/apity123/article/details/76022122

版权

算法题目专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Parity check

Time Limit: 2000MS Memory Limit: 524288KB

Submit Statistic

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.

Example Input

Example Output

Hint

Author

“浪潮杯”山东省第八届ACM大学生程序设计竞赛（感谢青岛科技大学）

n=0 0 1 2 3 4 5 6 7 8 9 10 11 12 121 1221

f(n) 0 1 1 2 3 5 8 13 21 34 55 89 144

输出结果 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0

即以0，1，1三位数一次循环

import java.util.*;
import java.math.*;
public class Main {
	static String str;
	static char [] st = new char [10000];  
	public static void main(String[] args) {
		// TODO Auto-generated method stub
			Scanner in = new Scanner (System.in);
			while(in.hasNext())
			{
			    str=in.next();
			    st=str.toCharArray();
			    int num=0;
			    for(int i=0;i<str.length();i++)
			    {
			    	num=(num*10+(st[i]-'0'))%3;
			    }
			    if(num==0)
			    {
			    	System.out.println(0);
			    }
			    else
			    {
			    	System.out.println(1);
			    }
			}
		
		}
}