Submission #3561150


Source Code Expand

#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>

using namespace std;

int main() {
   
    int n;
    long long a,b;
    cin >> n >> a >> b;
    static const int N = n;
    long long t[N];
    for (int i=0;i<N;i++){
        cin >> t[i];
    }
    for (int i=0;i<N;i++){
        if(t[i] >= a and t[i] < b){
            n -= 1;
        }
    }
    cout << n << endl;

}

Submission Info

Submission Time
Task A - A Barricade
User KFCHY
Language C++14 (GCC 5.4.1)
Score 66
Code Size 703 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 66 / 66
Status
AC × 9
Set Name Test Cases
All 00_sample.txt, 01_sample.txt, 02_sampe.txt, 03_sample.txt, corner_case_03.txt, corner_case_04.txt, random_case_00.txt, random_case_01.txt, random_case_02.txt
Case Name Status Exec Time Memory
00_sample.txt AC 1 ms 256 KB
01_sample.txt AC 1 ms 256 KB
02_sampe.txt AC 1 ms 256 KB
03_sample.txt AC 1 ms 256 KB
corner_case_03.txt AC 1 ms 256 KB
corner_case_04.txt AC 1 ms 256 KB
random_case_00.txt AC 1 ms 256 KB
random_case_01.txt AC 1 ms 256 KB
random_case_02.txt AC 1 ms 256 KB