Submission #131692
Source Code Expand
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <set>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <iomanip>
#include <iterator>
#include <vector>
#include <limits>
#include <stack>
#include <queue>
#include <deque>
#include <typeinfo>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cfloat>
#include <cassert>
#include <cmath>
#include <cctype>
#include <ctime>
#include <sstream>
#include <bitset>
#define reb(i,b,n) for(int i=(int)(b); i<(int)(n); i++)
#define rep(i,n) reb(i,0,n)
#define rer(i,n) for(int i=1; i<=n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreb(i,n,b) for(int i = n; i >= b; i--)
#define resz(i,v) rep(i,sz(v))
#define let(v, x) __typeof(x) v = (x)
#define each(it,v) for(let(it, (v).begin()); it!=(v).end(); it++)
#define reach(it,v) for(let(it, (v).rbegin());i!=(v).rend();i++)
#define priArr(table, n) rep(i,n){cout<<table[i]<<' ';}cout<<'\n';
#define priAr2(table,W,H) rep(y,H){rep(x,W)cout<<table[y][x]<<' ';cout<<'\n';}
#define vall(x) (x).begin(), (x).end()
#define rvall(x) (x).rbegin(), (x).rend()
#define vsort(v) sort(vall(v))
#define rvsort(v) sort(rvall(v))
#define len(array) (sizeof (array) / sizeof *(array))
#define aall(x) x, x+len(x)
#define asort(x) sort(aall(x))
#define rasort(a, type) sort(aall(a), greater<type>())
#define afill(a, v) fill(aall(a), v)
#define afill2(a, v, type) fill((type *)a, (type *)(a + len(a)), v)
#define sz(x) (int)(x).size()
#define mp(a, b) make_pair(a, b)
#define dmax(x,y) x = max(x,y);
#define dmin(x,y) x = min(x,y);
#define dadd(x,y) x = (x+(y))%MOD;
#define ddel(x,y) x = (x-(y)+MOD)%MOD;
#define dmul(x,y) x = ((ll)x*(y))%MOD;
#define snuke srand((unsigned)clock()+(unsigned)time(NULL))
#define fi first
#define se second
#define pb push_back
#define _USE_MATH_DEFINES
using std::stringstream;
using namespace std;
typedef long long ll; typedef unsigned long long ull;
typedef pair <int, int> P; typedef pair <int, P> PP;
typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<string> vs;
typedef vector<ll> vl; typedef vector<P > vP; typedef vector<char> vc;
typedef long double ld;
const static int INF = 0x3f3f3f3f;
const static ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const static double EPS = 1e-9;
const static ll MOD = 1000000007LL;
inline int toInt(std::string s) {int v; std::istringstream sin(s);sin>>v;return v;}
template<class T> inline std::string toString(T x) {std::ostringstream sout;sout<<x;return sout.str();}
int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};
/* --------------------------------------------------------------- */
int main(int argc, char *argv[])
{
ios::sync_with_stdio(false);
cin.tie(0); // off the synchronous of cin and cout
int n;
while (cin >> n) {
cout << n*2 << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 流行 |
User |
emacs |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
3015 Byte |
Status |
AC |
Exec Time |
25 ms |
Memory |
936 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 |
20 ms |
796 KB |
max_1000000.txt |
AC |
20 ms |
932 KB |
min_0.txt |
AC |
21 ms |
804 KB |
rand_133007.txt |
AC |
22 ms |
736 KB |
rand_171937.txt |
AC |
20 ms |
924 KB |
rand_172717.txt |
AC |
23 ms |
932 KB |
rand_232508.txt |
AC |
22 ms |
932 KB |
rand_242450.txt |
AC |
22 ms |
740 KB |
rand_246841.txt |
AC |
22 ms |
936 KB |
rand_269046.txt |
AC |
22 ms |
804 KB |
rand_320433.txt |
AC |
21 ms |
784 KB |
rand_435534.txt |
AC |
22 ms |
736 KB |
rand_50616.txt |
AC |
22 ms |
800 KB |
rand_537196.txt |
AC |
22 ms |
756 KB |
rand_565439.txt |
AC |
20 ms |
796 KB |
rand_601980.txt |
AC |
22 ms |
804 KB |
rand_622146.txt |
AC |
23 ms |
796 KB |
rand_624081.txt |
AC |
25 ms |
804 KB |
rand_678601.txt |
AC |
22 ms |
796 KB |
rand_696476.txt |
AC |
22 ms |
804 KB |
rand_762274.txt |
AC |
20 ms |
800 KB |
rand_798714.txt |
AC |
21 ms |
928 KB |
rand_821336.txt |
AC |
22 ms |
928 KB |
rand_85323.txt |
AC |
22 ms |
768 KB |
rand_859632.txt |
AC |
22 ms |
800 KB |
rand_921203.txt |
AC |
21 ms |
748 KB |
rand_934508.txt |
AC |
21 ms |
804 KB |
rand_993594.txt |
AC |
23 ms |
808 KB |