# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1038679 |
2024-07-30T06:03:48 Z |
vjudge1 |
Pot (COCI15_pot) |
C++17 |
|
0 ms |
348 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int const N=2e5+5;
int const mod=1e9+7;
void solve(){
int n;
cin>>n;
ll sm=0;
for (int i = 0; i < n; ++i)
{
int num;
cin>>num;
int p=num%10;
num/=10;
ll v=1;
for (int i = 0; i < p; ++i)
v*=num;
sm+=v;
}
cout<<sm<<endl;
}
int main(){
int t=1;
// cin>>t;
while(t--)
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |