Start: Jun, 30, 2019 09:00:00
2019年度暑期短学期第十天 助教场
End: Jul, 08, 2019 23:59:00
Time elapsed:
Time remaining:

Problem_ID: D
Result: Accepted
Time: 4ms
Memory: 1756kB
Author: 2018212212246
In contest: 1290

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
const int MAXN = 1e3 + 6;
char s[MAXN];
int main() 
{
	while (cin >> s)
	{
		if (s[0] == '0')
			break;
		int len = strlen(s);
		bool flag = false;
		int tmp = s[0] - '0';
		for (int i = 0; i < len - 1; i++)
		{
			tmp = (tmp * 10 + (s[i + 1] - '0')) % 17;
			//printf("tmp:%d\n", tmp);
		}
		if (tmp == 0)
			printf("1\n");
		else
			printf("0\n");
	}
	return 0;
}