4 条题解

  • 2
    @ 2025-11-13 19:51:53
    #include <stdio.h>
    long long power(long long a,long long b)
    {
        long long p = 1;
        for(long long i=0;i<b;i++){
            p*=a;
        }
        return p;
    }
    int main(){
        long long a,b,ans;
        while(scanf("%lld %lld",&a,&b)!=EOF){
            ans=power(a,b);
            printf("%lld\n",ans);
        }
        return 0;
    }//直接用pow函数会精度丢失,可以自己写一个power函数来用
    
    • 2
      @ 2023-9-5 9:31:15

      #include <stdio.h> #define EOF (-1) int main() {long long a; int i,x,n; while(scanf("%d %d",&x,&n)!=EOF) {a=1; for(i=0;i<n;i++) {a=a*x;} printf("%lld\n",a); } return 0; }

      • 1
        @ 2025-11-14 21:00:31
        #include <stdio.h>
        long long ksm(long long a ,long long b){
        	long long ans = 1;
        	while(b){
        		if(b%2==1){
        			ans*=a;
        		}
        		b/=2;
        		a*=a;
        	}
        	return ans;
        }
        int main(){
        	long long m,n;
        	while(scanf("%lld%lld",&m,&n)!=EOF){
        		if(n==0){
        			printf("1\n");
        			continue;
        		}
        		printf("%lld\n",ksm(m,n));
        	}
        	return 0;
        }
        
        • @ 2025-11-14 21:00:56

          快速幂写

      • 0
        @ 2025-9-13 23:01:40
        from math import sqrt,ceil,gcd,log;re=lambda:map(int,input().strip().split())
        while True:
            try:
                print(pow(*re()))
            except:
                break
        
        • 1

        信息

        ID
        169
        时间
        1000ms
        内存
        128MiB
        难度
        7
        标签
        (无)
        递交数
        1176
        已通过
        287
        上传者