Submission #472108
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
int main() {
li n;
cin >> n;
cout << 2 * n << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 流行 |
User |
ynq1242 |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
2131 Byte |
Status |
AC |
Exec Time |
31 ms |
Memory |
1076 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_sample_00.txt, max_1000000.txt, min_0.txt, rand_133007.txt, rand_171937.txt, rand_172717.txt, rand_232508.txt, rand_242450.txt, rand_246841.txt, rand_269046.txt, rand_320433.txt, rand_435534.txt, rand_50616.txt, rand_537196.txt, rand_565439.txt, rand_601980.txt, rand_622146.txt, rand_624081.txt, rand_678601.txt, rand_696476.txt, rand_762274.txt, rand_798714.txt, rand_821336.txt, rand_85323.txt, rand_859632.txt, rand_921203.txt, rand_934508.txt, rand_993594.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_00.txt |
AC |
30 ms |
988 KB |
max_1000000.txt |
AC |
27 ms |
1048 KB |
min_0.txt |
AC |
28 ms |
1044 KB |
rand_133007.txt |
AC |
26 ms |
1052 KB |
rand_171937.txt |
AC |
26 ms |
1048 KB |
rand_172717.txt |
AC |
26 ms |
1048 KB |
rand_232508.txt |
AC |
26 ms |
1052 KB |
rand_242450.txt |
AC |
27 ms |
1076 KB |
rand_246841.txt |
AC |
27 ms |
1048 KB |
rand_269046.txt |
AC |
27 ms |
1056 KB |
rand_320433.txt |
AC |
26 ms |
1052 KB |
rand_435534.txt |
AC |
27 ms |
1048 KB |
rand_50616.txt |
AC |
31 ms |
1052 KB |
rand_537196.txt |
AC |
25 ms |
1052 KB |
rand_565439.txt |
AC |
27 ms |
1048 KB |
rand_601980.txt |
AC |
27 ms |
1048 KB |
rand_622146.txt |
AC |
25 ms |
1048 KB |
rand_624081.txt |
AC |
29 ms |
940 KB |
rand_678601.txt |
AC |
27 ms |
1044 KB |
rand_696476.txt |
AC |
27 ms |
1052 KB |
rand_762274.txt |
AC |
27 ms |
1052 KB |
rand_798714.txt |
AC |
26 ms |
1056 KB |
rand_821336.txt |
AC |
27 ms |
944 KB |
rand_85323.txt |
AC |
27 ms |
1052 KB |
rand_859632.txt |
AC |
27 ms |
1056 KB |
rand_921203.txt |
AC |
26 ms |
1048 KB |
rand_934508.txt |
AC |
25 ms |
1052 KB |
rand_993594.txt |
AC |
27 ms |
1044 KB |