Submission #7041929


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define int ll

#define REP(i,n) for(int i=0;i<n;++i)
#define ALL(name) name.begin(),name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#  define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#  define DBG(fmt, ...)
#endif

const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
#define MAX_N 100010

bool Bissextile(int year) {
    if(year % 400 == 0) { return true; }
    if(year % 100 == 0) { return false; }
    if(year % 4 == 0) { return true; }
    return false;
}

signed main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);

    int Y;
    cin >> Y;
    printf("%s\n", Bissextile(Y) ? "YES" : "NO");

    return 0;
}

Submission Info

Submission Time
Task A - うるう年
User VTR
Language C++14 (GCC 5.4.1)
Score 100
Code Size 940 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 44
Set Name Test Cases
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_100_00.txt, 02_100_01.txt, 02_100_02.txt, 02_100_03.txt, 02_100_04.txt, 02_100_05.txt, 02_100_06.txt, 02_100_07.txt, 02_100_08.txt, 02_100_09.txt, 02_100_10.txt, 02_100_11.txt, 02_100_12.txt, 02_100_13.txt, 02_100_14.txt, 02_100_15.txt, 02_100_16.txt, 02_100_17.txt, 02_100_18.txt, 02_100_19.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
01_rnd_00.txt AC 1 ms 256 KB
01_rnd_01.txt AC 1 ms 256 KB
01_rnd_02.txt AC 1 ms 256 KB
01_rnd_03.txt AC 1 ms 256 KB
01_rnd_04.txt AC 1 ms 256 KB
01_rnd_05.txt AC 1 ms 256 KB
01_rnd_06.txt AC 1 ms 256 KB
01_rnd_07.txt AC 1 ms 256 KB
01_rnd_08.txt AC 1 ms 256 KB
01_rnd_09.txt AC 1 ms 256 KB
01_rnd_10.txt AC 1 ms 256 KB
01_rnd_11.txt AC 1 ms 256 KB
01_rnd_12.txt AC 1 ms 256 KB
01_rnd_13.txt AC 1 ms 256 KB
01_rnd_14.txt AC 1 ms 256 KB
01_rnd_15.txt AC 1 ms 256 KB
01_rnd_16.txt AC 1 ms 256 KB
01_rnd_17.txt AC 1 ms 256 KB
01_rnd_18.txt AC 1 ms 256 KB
01_rnd_19.txt AC 1 ms 256 KB
02_100_00.txt AC 1 ms 256 KB
02_100_01.txt AC 1 ms 256 KB
02_100_02.txt AC 1 ms 256 KB
02_100_03.txt AC 1 ms 256 KB
02_100_04.txt AC 1 ms 256 KB
02_100_05.txt AC 1 ms 256 KB
02_100_06.txt AC 1 ms 256 KB
02_100_07.txt AC 1 ms 256 KB
02_100_08.txt AC 1 ms 256 KB
02_100_09.txt AC 1 ms 256 KB
02_100_10.txt AC 1 ms 256 KB
02_100_11.txt AC 1 ms 256 KB
02_100_12.txt AC 1 ms 256 KB
02_100_13.txt AC 1 ms 256 KB
02_100_14.txt AC 1 ms 256 KB
02_100_15.txt AC 1 ms 256 KB
02_100_16.txt AC 1 ms 256 KB
02_100_17.txt AC 1 ms 256 KB
02_100_18.txt AC 1 ms 256 KB
02_100_19.txt AC 1 ms 256 KB