# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
21287 | 2017-04-12T11:33:08 Z | gs12117 | 제비 (kriii4_W) | C++11 | 0 ms | 1116 KB |
#include<cstdio> const int mod = 1000000007; long long int mpow(int x, int y) { if (y == 0)return 1; long long int r = mpow(x, y / 2); r *= r; r %= mod; if (y % 2) { r *= x; r %= mod; } return r; } long long int inv(int x) { return mpow(x, mod - 2); } int main() { int tcn; scanf("%d", &tcn); while (tcn--) { int a, b, c, d; scanf("%d%d%d%d", &a, &b, &c, &d); long long int ans = d; ans += b*inv(c) % mod*d%mod; ans += a; ans += mod; ans -= a*mpow(c*inv(c + 1) % mod, d) % mod; ans %= mod; printf("%lld\n", ans); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1116 KB | Output is correct |
2 | Correct | 0 ms | 1116 KB | Output is correct |
3 | Correct | 0 ms | 1116 KB | Output is correct |
4 | Correct | 0 ms | 1116 KB | Output is correct |
5 | Correct | 0 ms | 1116 KB | Output is correct |
6 | Correct | 0 ms | 1116 KB | Output is correct |
7 | Correct | 0 ms | 1116 KB | Output is correct |
8 | Correct | 0 ms | 1116 KB | Output is correct |
9 | Correct | 0 ms | 1116 KB | Output is correct |
10 | Correct | 0 ms | 1116 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1116 KB | Output is correct |
2 | Correct | 0 ms | 1116 KB | Output is correct |
3 | Correct | 0 ms | 1116 KB | Output is correct |
4 | Correct | 0 ms | 1116 KB | Output is correct |
5 | Correct | 0 ms | 1116 KB | Output is correct |
6 | Correct | 0 ms | 1116 KB | Output is correct |
7 | Correct | 0 ms | 1116 KB | Output is correct |
8 | Correct | 0 ms | 1116 KB | Output is correct |
9 | Correct | 0 ms | 1116 KB | Output is correct |
10 | Correct | 0 ms | 1116 KB | Output is correct |
11 | Correct | 0 ms | 1116 KB | Output is correct |
12 | Correct | 0 ms | 1116 KB | Output is correct |
13 | Correct | 0 ms | 1116 KB | Output is correct |
14 | Correct | 0 ms | 1116 KB | Output is correct |
15 | Correct | 0 ms | 1116 KB | Output is correct |
16 | Correct | 0 ms | 1116 KB | Output is correct |
17 | Correct | 0 ms | 1116 KB | Output is correct |
18 | Correct | 0 ms | 1116 KB | Output is correct |
19 | Correct | 0 ms | 1116 KB | Output is correct |
20 | Correct | 0 ms | 1116 KB | Output is correct |