2022级专题四数论课后练习B - Fedya and Maths

最新推荐文章于 2024-08-10 07:14:43 发布

huigh143

最新推荐文章于 2024-08-10 07:14:43 发布

阅读量70

点赞数

分类专栏： 22寒假文章标签：算法 Powered by 金山文档

本文链接：https://blog.csdn.net/m0_74319106/article/details/129111731

版权

22寒假专栏收录该内容

13 篇文章 0 订阅

订阅专栏

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

(1n + 2n + 3n + 4n) 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^5). The number doesn't contain any leading zeroes.

Output

Print the value of the expression without leading zeros.

思路：

n的范围大得离谱，通过打表找规律可以发现当n%4=0时答案为4其他时候为0，所以我们只需判断n整不整除4就可以了

#include <stdio.h>
int main()
{
    char a;
    int tot;
    tot=0;
    a=getchar();
    while(a!='\n'){
        tot=(tot*10+a-'0')%4;
        a=getchar();
    }
    if(tot!=0)
        printf("0");
    else
        printf("4");
    return 0;
}