7 solutions
- 1
Information
- ID
- 524
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 4
- Tags
- # Submissions
- 253
- Accepted
- 118
- Uploaded By
s一定要=1,,不然只有0 记住我哈
#include<iostream>
#include<iomanip>
using namespace std;
int main(){
long long n,s=1;
cin>>n;
for(int i=1;i<=n;i++){
s*=2;
}
cout<<s;
return 114514;
}
#include <bits/stdc++.h>
using namespace std;
int a,b;
int main(){
cin>>a;
cin>>b;
cout<<a*b;
return 0;}
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,ans;
int main(){
cin>>n;
ans=pow(2,n);
cout<<ans<<"\n";
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main(){
int a = 1, n;
cin >> n;
for(int i = 0; i < n; i++){
a *= 2;
}
cout << a;
return 0;
}
#include <bits/stdc++.h> using namespace std; int main(){ int n,s=1; cin>>n; for(int i=1;i<=n;i++){ s=s*2; } cout<<s; return 0; }
#include<bits/stdc++.h>
using namespace std;
void b(int a){
int c=1;
for(int i=1;i<=a;i++){
c*=2;
}
cout<<c;
}
int main(){
long long a;
cin>>a;
b(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.