【数论】[luoguP2818]天使的起誓

题目

前两天考试的题
读入m的时候%n就行了 好像是解方程那个题的思想
叫什么同余定理搞得一个大整数取模 紫书p314

代码如下

#include
#include
#include

    using namespace std;
    #define in1 = read1()
    #define in2 = read2()
    typedef long long ll;

        ll n,m;

inline ll read1(){

        ll num = 0 ,f = 1;    char ch = getchar();

        while (!isdigit(ch)){
                if(ch == '-')   f = -1;
                ch = getchar();
        }

        while (isdigit(ch)){
                num = num*10 + ch - '0';
                ch = getchar();
        }

        return num*f;
}

inline ll read2(){

        ll num = 0 ,f = 1;    char ch = getchar();

        while (!isdigit(ch)){
                if(ch == '-')   f = -1;
                ch = getchar();
        }

        while (isdigit(ch)){
                num = num*10 + ch - '0';
                num %= n;
                ch = getchar();
        }

        return num*f;
}

int main(){

        n in1;   m in2;

        ll ans = 0;
        if(m == 0)    ans = n;
        else    ans = m;

        printf("%d",ans);

}

//COYG

转载于:https://www.cnblogs.com/ars4me/p/7536176.html