oj.uz

답안 #19552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19552 2016-02-24T17:58:19 Z Namnamseo Ω (kriii4_P3) C++14
0 / 100
 0 ms 1084 KB 
#include <cstdio>
typedef long long ll;
const int M=int(1e9)+7;
ll pow(ll a,ll b){
    if(b==0) return 1;
    ll ret=pow(a,b/2);
    ret=(ret*ret)%M;
    if(b&1) ret=(ret*a)%M;
    return ret;
}
int gcd(int a,int b){ return b?gcd(b,a%b):a; }
int main()
{
    int p,q,n,k;
    scanf("%d%d%d%d",&p,&q,&n,&k);
    if(k==0){ puts("0"); return 0; }
    if(k==n){ puts("1"); return 0; }
    if(q==0){
        puts("1");
        return 0;
    } else if(p==q){
        puts("0");
        return 0;
    }
    int rja=q, rmo=p-q;
    int g=gcd(rja,rmo);
    rja/=g; rmo/=g;
    ll r=rja*pow(rmo,M-2);
    ll bunja = (M + 1 - pow(r,k))%M;
    ll bunmo = (M + 1 - pow(r,n))%M;
    printf("%d\n",int( bunja*pow(bunmo,M-2)%M ));
    return 0;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Incorrect 0 ms 1084 KB Output isn't correct
18 Halted 0 ms 0 KB -