Submission #19446

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
19446	2016-02-24 12:40:26	xhae	Ω (kriii4_P3)	C++14	100 / 100	0 ms	1724 KiB

P3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const long long MOD = 1000000007;
long long P, Q, N, K;
long long p[101], q[101], d[101];
long long inv(long long tar) {
  long long ret = 1;
  for(int i = 30; i >= 0; i--) {
    ret = ret * ret % MOD;
    if((1ll << i) & (MOD - 2)) ret = ret * tar % MOD;
  }
  return ret;
}
int main(void) {
  cin >> P >> Q >> N >> K;
  if(K == 0) printf("0\n");
  else if(K == N) printf("1\n");
  else {
    long long gcdv = __gcd(Q, P);
    long long a = Q / gcdv * inv(P / gcdv) % MOD;
    gcdv = __gcd(P - Q, P);
    long long b = (P - Q) / gcdv * inv(P / gcdv) % MOD;
    p[N - 1] = a, q[N - 1] = b;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100