Submission #72336576
Source Code Expand
#if !__INCLUDE_LEVEL__
#include __FILE__
void solve() {
int x,y;
cin>>x>>y;
while(y--){
x*=2;
}
cout<<x<<el;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int T=1;
//cin>>T;
while(T--)solve();
}
#else
#include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint=modint998244353;
//using mint=modint1000000007;
// 関数テンプレート
template<typename T> bool chmax(T &m, const T q) {
if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m,const T q){
if(m>q){m=q;return true;}else return false;
}
template<typename T>
bool grid_inside(const T h, const T w, const T &m, const T &n) {
return (m >= 0 && m < h && n >= 0 && n < w);
}
// ループマクロ
#define rep(i,r) for(int i=0;(r)>i;i++)
#define REP(i,l,r) for(int i=(l);i<(r);i++)
#define rrep(i,N) for(int i=(N)-1;i>=0;i--)
#define RREP(i,r,N) for(int i=(N)-1;i>=r;i--)
// コンテナショートカット
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define pb push_back
#define fixed15 std::fixed << std::setprecision(15)
// YES/NO 出力
#define Yes cout<<"Yes"<<el
#define No cout<<"No"<<el
#define YES cout<<"YES"<<el
#define NO cout<<"NO"<<el
#define YESNO(bool) if(bool){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(bool) if(bool){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(bool) if(bool){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
// 型エイリアス
using ll=long long;
using ull=unsigned long long;
using pqgi=priority_queue<int, vector<int>, greater<int>>;
using pqgl=priority_queue<long long, vector<long long>, greater<long long>>;
using pqgpl=priority_queue<pair<long long,long long>,vector<pair<long long,long long>>,greater<pair<long long,long long>>>;
using pqgptpl=priority_queue<tuple<ll,ll,ll>,vector<tuple<ll,ll,ll>>,greater<tuple<ll,ll,ll>>>;
using pqi=priority_queue<int>;
using pii=pair<int, int>;
using tpi=tuple<int,int,int>;
using tpl=tuple<ll,ll,ll>;
using pll=pair<long long, long long>;
using vs=vector<string>;
using vi=vector<int>;
using vb=vector<bool>;
using vl=vector<long long>;
using vc=vector<char>;
using vvi=vector<vector<int>>;
using vvl=vector<vector<long long>>;
using vvc=vector<vector<char>>;
using vvb=vector<vector<bool>>;
using vvs=vector<vector<string>>;
using vpii=vector<pii>;
using vpll=vector<pll>;
using vvpii=vector<vector<pii>>;
using vvpll=vector<vector<pll>>;
using vtiii=vector<tuple<int, int, int>>;
using lb=long double;
// 定数
const long long INF=1e18;
const int mod=1e9+7;
//const int mod=998244353;
const int MAX=1e5+10;
const int MIN=-1e9;
const vpii dir={{1,0},{-1,0},{0,1},{0,-1}};
#endif
Submission Info
| Submission Time |
|
| Task |
A - Octave |
| User |
yasaikeikaku |
| Language |
C++23 (GCC 15.2.0) |
| Score |
100 |
| Code Size |
2866 Byte |
| Status |
AC |
| Exec Time |
1 ms |
| Memory |
3616 KiB |
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
100 / 100 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt |
| All |
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 00-sample-01.txt |
AC |
1 ms |
3480 KiB |
| 00-sample-02.txt |
AC |
1 ms |
3616 KiB |
| 00-sample-03.txt |
AC |
1 ms |
3540 KiB |
| 01-01.txt |
AC |
1 ms |
3456 KiB |
| 01-02.txt |
AC |
1 ms |
3496 KiB |
| 01-03.txt |
AC |
1 ms |
3520 KiB |
| 01-04.txt |
AC |
1 ms |
3516 KiB |
| 01-05.txt |
AC |
1 ms |
3532 KiB |
| 01-06.txt |
AC |
1 ms |
3528 KiB |
| 01-07.txt |
AC |
1 ms |
3528 KiB |
| 01-08.txt |
AC |
1 ms |
3576 KiB |
| 01-09.txt |
AC |
1 ms |
3484 KiB |