9 solutions

  • 3
    @ 2024-1-27 10:40:30
    #include<bits/stdc++.h>
    #define maxn 1000000000
    using namespace std;
    long long s;
    long a,b;
    int main(){
    	cin>>a>>b;
    	s=pow(a,b);
    	if(s>maxn) cout<<-1<<"\n";
    	else cout<<s<<"\n"; 
    	return 0;
    }
    
    • 2
      @ 2023-9-17 12:00:46
      #include <bits/stdc++.h>
      using namespace std;
      int m,a;
      int main(){
      	cin>>a>>m;
      	cout<<pow(a,m);
      	return 0;
      }
      
      • 1
        @ 2024-7-10 16:40:42
        #include <bits/stdc++.h>
        using namespace std;
        int n,a;
        int main(){
        	cin>>a>>n;
        	cout<<pow(a,n);
        	return 0;
        }
        
        • 1
          @ 2024-5-3 18:11:36
          #include<bits/stdc++.h>
          
          using namespace std;
          
          int main()
          {
          	int a, b;
          	cin >> a >> b;
          	a = pow(a, b);
          	cout << a;
          	
          	return 0;
          }
          
          • 1
            @ 2023-10-4 15:57:31
            #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;
            }
            
            • 1
              @ 2023-9-19 19:46:33
              #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;
              }
              
              • 1
                @ 2023-9-15 22:05:16

                大水题又㕛双叒叕一个

                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;
                }
                
                
                • 0
                  @ 2025-1-27 16:36:42
                  #include<bits/stdc++.h>
                  using namespace std;
                  long long a;
                  short n;
                  int main(){
                     cin>>a>>n;
                     cout<<pow(a,n);
                     return 0;
                  }
                  
                  • -1
                    @ 2024-1-31 12:53:57
                    #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;
                    }
                    
                    • 1

                    Information

                    ID
                    558
                    Time
                    1000ms
                    Memory
                    256MiB
                    Difficulty
                    2
                    Tags
                    # Submissions
                    142
                    Accepted
                    83
                    Uploaded By