//倍增思想 #include iostream using namespace std; typedef long long ll; ll a,b,m,s=1; //快速幂 ll pow2(ll a,ll b,ll m){ ll ans=1; while(b){ if(b%2){ ans*=a; ans%=m; } b/=2; a=a*a; a%=m; } return ans; } int main(){ cinabm; coutpow2(a,
点我呐
#include bits/stdc++.husing namespace std;int main(){ int n; cinn; int s=0; for(int i=0;i=n;i++){ s+=i; } couts; return 0;}
点我呐
#include bits/stdc++.husing namespace std;int main(){ int n; cinn; for(int i=1;i=n;i++){ if(i%2==0) couti" "; } return 0;}
点我呐
#include bits/stdc++.husing namespace std;int main(){ int n; cinn; int s1=0,s2=0; for(int i=1;i=n;i++){ if(i%2==0) s1+=i; else s2+=i; } couts1" "s2; return 0;}
点我呐
#includebits/stdc++.husing namespace std;int main(){long long n;cinn;long long sum=1;for(int i=1;i=n;i++){sum*=i;}coutsum;}
点我呐
#include bits/stdc++.husing namespace std;int main(){ int n; cinn; double s=0; for(int i=1;i=n;i++){ int age; cinage; s+=age; } printf("%.2lf",s/n); return 0;}
点我呐
#include bits/stdc++.husing namespace std;int main(){ int n; cinn; double s=0; for(int i=1;i=n;i++){ double x; cinx; s+=x; } printf("%.4lf",s/n); return 0;}
点我呐
#include bits/stdc++.husing namespace std;int main(){ int n; cinn; int s=0; for(int i=1;i=n;i++){ int x; cinx; s+=x; } printf("%d %.5lf",s,1.0*s/n); return 0;}
点我呐
#include iostream#include cstdio //标准输入输出流#include iomanipusing namespace std;int main(){ int n; cinn; //当n除了限制次数,没有其他作用 //n次循环最简单的做法↓ int m,maxm=-999; while(n--){ cinm; if(maxmm
点我呐
#include bits/stdc++.husing namespace std;int main(){ int n; cinn; int s=0,t=99999999; for(int i=1;i=n;i++){ int x; cinx; if(sx) s=x; if(tx) t=x; } couts-t; return 0;}
点我呐
#include iostream#include queueusing namespace std;struct node{char c;node *left,...
#include iostreamusing namespace std;int n,m;long long a[100050];long long l=0,r=...