9 solutions
- 1
Information
- ID
- 558
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 2
- Tags
- # Submissions
- 142
- Accepted
- 83
- Uploaded By
#include <bits/stdc++.h>
using namespace std;
int m,a;
int main(){
cin>>a>>m;
cout<<pow(a,m);
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int n,a;
int main(){
cin>>a>>n;
cout<<pow(a,n);
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
a = pow(a, b);
cout << a;
return 0;
}
#include<iostream>
using namespace std;
int main(){
int m,n,s=1;
cin>>m;
cin>>n;
for(int i=1; i<=n; i++){
s*=m;
}
cout<<s;
}
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv){
int a,n;
cin >> a >> n;
cout << pow(a,n);
return 0;
}
大水题又㕛双叒叕一个
using namespace std;
int main(){
int m,a,sum;
cin >> a >> m;
sum = a;
for(int i = 1;i < m;i++){
sum *= a;
}
cout <<sum;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
long long a;
short n;
int main(){
cin>>a>>n;
cout<<pow(a,n);
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main () {
int a,n; cin >> a >> n; int t = a;
for (int i = 1; i < n; i++) {
a *= t;
}
cout << a;
return 0;
}
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.