#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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
0 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |