Submission #131664


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define EPS 1e-9
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

int main() {
	int N;
	cin >> N;
	cout << 2 * N << endl;
	return 0;
}

Submission Info

Submission Time
Task A - 流行
User anta
Language C++ (G++ 4.6.4)
Score 100
Code Size 1312 Byte
Status AC
Exec Time 21 ms
Memory 932 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 28
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 21 ms 804 KB
max_1000000.txt AC 21 ms 800 KB
min_0.txt AC 20 ms 752 KB
rand_133007.txt AC 20 ms 796 KB
rand_171937.txt AC 21 ms 676 KB
rand_172717.txt AC 20 ms 928 KB
rand_232508.txt AC 20 ms 804 KB
rand_242450.txt AC 20 ms 800 KB
rand_246841.txt AC 19 ms 800 KB
rand_269046.txt AC 21 ms 680 KB
rand_320433.txt AC 21 ms 800 KB
rand_435534.txt AC 20 ms 800 KB
rand_50616.txt AC 21 ms 680 KB
rand_537196.txt AC 21 ms 808 KB
rand_565439.txt AC 21 ms 932 KB
rand_601980.txt AC 21 ms 680 KB
rand_622146.txt AC 21 ms 804 KB
rand_624081.txt AC 21 ms 808 KB
rand_678601.txt AC 21 ms 804 KB
rand_696476.txt AC 21 ms 800 KB
rand_762274.txt AC 19 ms 804 KB
rand_798714.txt AC 20 ms 676 KB
rand_821336.txt AC 20 ms 804 KB
rand_85323.txt AC 21 ms 680 KB
rand_859632.txt AC 20 ms 676 KB
rand_921203.txt AC 19 ms 796 KB
rand_934508.txt AC 19 ms 804 KB
rand_993594.txt AC 21 ms 808 KB