Parity check

Think:
PS : 题目出处 “浪潮杯”山东省第八届ACM大学生程序设计竞赛
注意 最后输出的结果时 f(n) % 2 所以 结果 只可能时 0 或 1

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
Author***
“浪潮杯”山东省第八届ACM大学生程序设计竞赛（感谢青岛科技大学）

#include<bits/stdc++.h>
using namespace std;
int main()
 {
  char str[1050];
  int i;
  while(~scanf("%s", str))
    {
      int d = strlen(str);
      int k = 0;
      for (i = 0;i <= d - 1;i ++)
        {
           k = k + str[i] - '0';
    }
           if (k % 3 == 0)
             printf("0\n");
             else
             printf("1\n");
    }
 }