Submission #615735
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(int i=0;i<(int)(n);i++) #define ALL(x) (x).begin(), (x).end() typedef long long ll; typedef long double ld; const int INF = 1e9; const ld EPS = 1e-8; int main(){ int N; cin >> N; int nico[4] = {25,2525,252525,25252525}; int cnt = 0; for(int i=1; i<=N;++i) { REP(j,4){ if(i % nico[j] == 0) { cnt++; break; } } } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | lan |
Language | C++ (GCC 4.9.2) |
Score | 0 |
Code Size | 497 Byte |
Status | TLE |
Exec Time | 2560 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | Subtask1 | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 60 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 26 ms | 800 KB |
sample_02.txt | AC | 632 ms | 672 KB |
test_01.txt | AC | 24 ms | 920 KB |
test_02.txt | AC | 24 ms | 796 KB |
test_03.txt | AC | 23 ms | 800 KB |
test_04.txt | AC | 30 ms | 804 KB |
test_05.txt | AC | 45 ms | 924 KB |
test_06.txt | AC | 794 ms | 672 KB |
test_07.txt | AC | 180 ms | 792 KB |
test_08.txt | TLE | 2557 ms | 804 KB |
test_09.txt | TLE | 2560 ms | 924 KB |
test_10.txt | TLE | 2559 ms | 832 KB |
test_11.txt | TLE | 2560 ms | 800 KB |
test_12.txt | TLE | 2560 ms | 916 KB |
test_13.txt | AC | 794 ms | 796 KB |
test_14.txt | AC | 27 ms | 916 KB |
test_15.txt | AC | 27 ms | 916 KB |