oj.uz

Submission #1035940

# Submission time Handle Problem Language Result Execution time Memory
1035940 2024-07-26T19:55:08 Z HienTD scanf 함수 4 (BSC_0_6) C++11
0 / 100
 1000 ms 344 KB 
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; ++ i)
#define FORD(i, b, a) for(int i = (b), _a = (a); i >= _a; -- i)
#define REP(i, n) for(int i = 0, _n = (n); i < _n; ++ i)
#define FORE(i, v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define ALL(v) (v).begin(), (v).end()
#define IS_INF(x) (std::isinf(x))
#define IS_NAN(x) (std::isnan(x))
#define fi first
#define se second
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define div ___div
#define prev ___prev
#define left ___left
#define __builtin_popcount __builtin_popcountll
using namespace std;

template<class X, class Y>
    bool minimize(X &x, const Y &y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }
template<class T>
    T abs(const T &x){
        return (x < 0 ? -x : x);
    }

/** END OF TEMPLATE **/

void init(){
    //
}

int process(){
    int cnt = 0;
    int t;
    while(scanf("%d", &t)) ++ cnt;
    printf("%d", cnt);
    return 1;
}

int main(){
    init();
    process();

    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -