| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 24699 |
2017-06-12T00:45:04 Z |
dotorya |
scanf 함수 4 (BSC_0_6) |
C++14 |
|
0 ms |
2020 KB |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
#define mp make_pair
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;
int IT_MAX = 1 << 20;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1E-11;
int main() {
int N = 0, t;
while (scanf("%d", &t) != EOF) N++;
return !printf("%d\n", N);
}
Compilation message
scanf4.cpp:23:0: warning: ignoring #pragma warning [-Wunknown-pragmas]
#pragma warning(disable:4996)
^
scanf4.cpp:24:0: warning: ignoring #pragma comment [-Wunknown-pragmas]
#pragma comment(linker, "/STACK:336777216")
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2020 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2020 KB |
Output is correct |
