寒假集训_专题四题解_B - Fedya and Maths

最新推荐文章于 2022-02-25 17:51:47 发布

m0_46185124

最新推荐文章于 2022-02-25 17:51:47 发布

阅读量291

点赞数

分类专栏：专题训练

本文链接：https://blog.csdn.net/m0_46185124/article/details/103986575

版权

专题训练专栏收录该内容

32 篇文章 1 订阅

订阅专栏

题目

Fedya studies in a gymnasium. Fedya’s maths hometask is to calculate the following expression:

(1ⁿ + 2ⁿ + 3ⁿ + 4ⁿ) mod 5
for given value of n. Fedya managed to complete the task. Can you? Note that given number n can be extremely large (e.g. it can exceed any integer type of your programming language).

Input
The single line contains a single integer n (0 ≤ n ≤ 10^10 ⁵). The number doesn’t contain any leading zeroes.

Output
Print the value of the expression without leading zeros.

Examples
Input
4
Output
4
Input
124356983594583453458888889
Output
0
Note
Operation x mod y means taking remainder after division x by y.

Note to the first sample:

题目大意

求(1ⁿ + 2ⁿ + 3ⁿ + 4ⁿ) mod 5

题解

打表可发现规律

代码

#include <iostream>
#include <cstring>
using namespace std; 
const int N = 1e5 + 10;
char a[N];
int main()
{
	cin >> a;
	int l = strlen(a);
	int x ;
	if(l >= 2)x = a[l-1]-'0' + (a[l-2]-'0')*10;
	else x = a[0] - '0';
	if(x%4 != 0)printf("0");
	else printf("4");
	return 0;
}