| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 339948 | MertD014 | Pot (COCI15_pot) | C++17 | 1 ms | 364 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 <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,x,ans;
ll powf(int a,int b){
	if(b==0) return 1;
	if(b==1) return a;
	if(b%2) return a*powf(a,b/2)*powf(a,b/2);
	return powf(a,b/2)*powf(a,b/2);
}
int main(){
	cin>>n;
	while(n--){
		cin>>x;
		int y=x%10;
		x/=10;
		ans+=powf(x,y);
	}
	cout<<ans;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
