Submission #131699

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<vector>
#include<string>
#include<sstream>
#include<set>
#include<map>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<complex>
#include<algorithm>

#define pb push_back
#define sz size()
#define clr clear()
#define EPS (1e-10)
#define INF 500000000
#define fs first
#define sc second

#define rep(i,a) for(int i=0;i<(int)(a);i++)
#define rrep(i,a) for(int i=(int)(a)-1;i>=0;i--)
#define let(i,a) __typeof(a)i=(a)
#define all(a) (a).begin(),(a).end()
#define each(i,a) for(let(i,(a).begin());i!=(a).end();i++)
#define INIT(i) memset(i,0,sizeof(i))
#define EQ(a,b) (abs((a)-(b)) < EPS)
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> P;
typedef complex<double> Po;

int main(){
  int n;
  cin >> n;
  cout << 2*n << endl;
}

Submission Info

Judge Result