| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 21287 | gs12117 | 제비 (kriii4_W) | C++11 | 0 ms | 1116 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
