| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 19415 | golala123 | Σ (kriii4_P2) | C++98 | 14 ms | 1720 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 <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
long long a ,b , total;
long long ans = 1;
int t;
const int MOD = 1000000007;
int x = 1000000005;
int main(){
	cin >> t >> b >> a;
	while (t--){
		vector<long long> m;
		vector< pair<int, int > > two;
		long long temp = 1;
		int i = 0;
		m.push_back(b);
		while (temp < MOD){
			long long aa = 1;
			aa = m[i] % MOD * m[i] % MOD;
			aa %= MOD;
			m.push_back(aa%MOD);
			temp *= 2;
			i++;
		}
		int j = 0;
		while (x != 0){
			if (x % 2 == 1)
				two.push_back({ j, x % 2 });
			x /= 2;
			j++;
		}
		for (int i = 0; i < two.size(); i++){
			if (two[i].second == 1){
				ans = ans*m[two[i].first] % MOD;
				ans %= MOD;
			}
		}
		ans = a*ans % MOD;
		total += ans;
		total %= total;
	}
	cout << total;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
