Submission #19325

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
19325	2016-02-24T09:45:18 Z	gs14004	Σ (kriii4_P2)	C++14	100 / 100	17 ms	1720 KB

P2

#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 <assert.h>
#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 n;
	lint ret = 0;
	cin >> n;
	for(int i=0; i<n; i++){
		lint a, b;
		cin >> b >> a;
		ret += a * ipow(b, mod - 2) % mod;
		ret %= mod;
	}
	cout << ret;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	1720 KB	Output is correct
2	Correct	15 ms	1720 KB	Output is correct
3	Correct	15 ms	1720 KB	Output is correct
4	Correct	14 ms	1720 KB	Output is correct
5	Correct	11 ms	1720 KB	Output is correct
6	Correct	14 ms	1720 KB	Output is correct
7	Correct	16 ms	1720 KB	Output is correct
8	Correct	15 ms	1720 KB	Output is correct
9	Correct	14 ms	1720 KB	Output is correct
10	Correct	14 ms	1720 KB	Output is correct
11	Correct	15 ms	1720 KB	Output is correct
12	Correct	15 ms	1720 KB	Output is correct
13	Correct	14 ms	1720 KB	Output is correct
14	Correct	11 ms	1720 KB	Output is correct
15	Correct	14 ms	1720 KB	Output is correct
16	Correct	17 ms	1720 KB	Output is correct
17	Correct	14 ms	1720 KB	Output is correct
18	Correct	15 ms	1720 KB	Output is correct
19	Correct	12 ms	1720 KB	Output is correct
20	Correct	15 ms	1720 KB	Output is correct