“浪潮杯”山东省第八届ACM大学生程序设计竞赛I

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

2

Example Output

1

Hint

最水的一道题 类似斐波那契数列mod2

也是大数类的  同字符串很好处理写几个会发现规律

01	#include <iostream>

02	#include<string.h>

03	#include<string>

04	#include<algorithm>

05	#include<stdio.h>

06	using namespace std;

07	int main()

08

{

09

string a;

10

int sum;

11	while(cin>>a)

12

{

13

sum=0;

14	int n=a.size();

15	for(int i=0;i<n;i++)

16	sum+=(a[i]-48);

17	if(sum%3==0)

18	cout<<"0"<<endl;

19

else

20	cout<<"1"<<endl;

21

}

22

return 0;

23

}

24

25	/***************************************************