1. 程式人生 > >洛谷P2613有理數取餘

洛谷P2613有理數取餘

傳送門

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define re register
using namespace std;
const int mod = 19260817;

inline long long read() {
    char ch = getchar();
    long long f = 1 , x = 0;
    while(ch > '9' || ch < '0') {if(ch == '-') f = -1 ;ch = getchar();}
    while(ch >= '0' && ch <= '9') {x = ((x << 1) + ( x << 3) + ch - '0') % mod;ch = getchar();}
    return x * f;
}

long long a,b;

inline long long quick_power(long long x , long long y) {
    long long ans = 1 ;
    while(y) {
        if(y & 1)  ans = ans * x % mod ;
        x = x * x % mod;
        y >>= 1 ;
    }
    return ans % mod;
}

int main(){
    a = read(); b = read();
    long long sum = (a * quick_power(b , mod - 2)) % mod ;
    if(sum == 0)  printf("Angry!\n");
    else printf("%lld\n",sum);
    return 0;
}