Submission #20123

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
20123	2016-02-26T12:23:48 Z	gs14004	제비 (kriii4_W)	C++14	6 / 100	9 ms	1720 KB

W

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;

lint ipow(lint x, lint p){
    lint ret = 1, piv = x % mod;
    while(p){
        if(p&1) ret *= piv;
        piv *= piv;
        ret %= mod;
        piv %= mod;
        p >>= 1;
    }
    return ret;
}

int main(){
	int t;
	cin >> t;
	while(t--){
		int r, g, b, k;
		cin >> r >> g >> b >> k;
		lint ret = k + r * (1 - ipow(b * ipow(b+1, mod - 2), k) + mod);
		ret += (g * k) % mod * ipow(b, mod - 2);
		cout << ret % mod << endl;
	}
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1720 KB	Output is correct
2	Correct	0 ms	1720 KB	Output is correct
3	Correct	0 ms	1720 KB	Output is correct
4	Correct	9 ms	1720 KB	Output is correct
5	Correct	0 ms	1720 KB	Output is correct
6	Correct	0 ms	1720 KB	Output is correct
7	Correct	3 ms	1720 KB	Output is correct
8	Correct	3 ms	1720 KB	Output is correct
9	Correct	7 ms	1720 KB	Output is correct
10	Correct	0 ms	1720 KB	Output is correct

Subtask #2

0.0 / 94.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	1720 KB	Output isn't correct
2	Halted	0 ms	0 KB	-