제출 #19271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
19271		kaTkaHr	창문 (kriii4_C)	C++14	100 / 100	0 ms	1084 KiB

C

#include <stdio.h>
#include <algorithm>
#include <map>
 
using namespace std;
 
typedef long long ll;
 
const int MX = 105, MM = 1000000007;
 
ll rv(ll A){
    ll R = 1, B = MM-2;
    while(B){
        if( B&1 ) R = R * A % MM;
        A = A * A % MM; B /= 2;
    }
    return R;
}
 
struct frac{
    ll A, B;
    frac(ll a, ll b){
        A = (a%MM+MM) % MM;
        B = (b%MM+MM) % MM;
    }
    frac(){A = 0, B = 1;}
    frac operator+ (const frac &l)const{
        return frac((A * l.B + B * l.A) % MM, B * l.B % MM);
    }
    frac operator*(const frac &l)const{
        return frac(A*l.A % MM, B*l.B % MM);
    }
    frac operator/(const frac &l)const{
        return frac(A*l.B % MM, B*l.A % MM);
    }
    frac operator- (const frac &l)const{
        return frac((A*l.B - B*l.A%MM + MM) % MM, B*l.B % MM);
    }
    ll v(){ return A * rv(B) % MM; }
};
 
int main()
{
    ll H, W;
    scanf("%lld%lld", &H, &W);
    printf("%lld\n", (frac(H+2, 1) * frac(W+2, 1)).v());
}

• Subtask 1: 3 / 3
• Subtask 2: 97 / 97