Fedya and Maths//Codeforces 456B//数论

Fedya and Maths//Codeforces 456B//数论

---

题目

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

(1^n + 2^n + 3^n + 4^n) 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 ≤ 10105). 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
题意
给n求等式结果
链接:https://vjudge.net/contest/351853#problem/B

思路

找规律

代码

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define maxn 0x3fffffff

using namespace std;

int main(){
    long long n,k,m=1;
    cin>>n>>k;
    for(int i=0;i<k;i++)
        m*=10;
    cout<<(n*m)/__gcd(n,m)<<endl;
    return 0;
}

注意

最后两位能被4整除则该数能被4整除