# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19356 | 2016-02-24T10:27:42 Z | algoshipda | Σ (kriii4_P2) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lld; const int MOD = 1e9 + 7; int fpow(int n, int k) { if(k == 0) return 1; if(k % 2){ return 1ll * n * fpow(n, k - 1) % MOD; } int h = fpow(n, k / 2); return 1ll * h * h % MOD; } int main() { int t; cin >> t; int s = 0; while(t--){ int n, k; cin >> k >> n; int g = gcd(k, n);; s += 1ll * n * fpow(k, MOD - 2) % MOD; s %= MOD; } cout << s << '\n'; }