Submission #615987
Source Code Expand
#include <string> #include <array> #include <vector> #include <unordered_map> #include <unordered_set> #include <iostream> #include <algorithm> #include <cstdio> #include <stack> #include <cmath> using namespace std; #define REP(i, N) for(i = 0; i < N; ++i) typedef long long ll; void solve() { ll N; cin >> N; ll ans = 0; for (ll j = 1; j * 25 <= N; ++j) { ans++; } cout << ans << endl; } int main(int argc, char const* argv[]) { cin.tie(0); ios::sync_with_stdio(false); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | agatan |
Language | C++11 (GCC 4.9.2) |
Score | 60 |
Code Size | 598 Byte |
Status | AC |
Exec Time | 92 ms |
Memory | 928 KB |
Judge Result
Set Name | Sample | Subtask1 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 60 / 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 | 27 ms | 916 KB |
sample_02.txt | AC | 25 ms | 812 KB |
test_01.txt | AC | 25 ms | 916 KB |
test_02.txt | AC | 24 ms | 928 KB |
test_03.txt | AC | 24 ms | 804 KB |
test_04.txt | AC | 24 ms | 920 KB |
test_05.txt | AC | 25 ms | 800 KB |
test_06.txt | AC | 27 ms | 800 KB |
test_07.txt | AC | 27 ms | 920 KB |
test_08.txt | AC | 89 ms | 920 KB |
test_09.txt | AC | 92 ms | 800 KB |
test_10.txt | AC | 64 ms | 928 KB |
test_11.txt | AC | 90 ms | 800 KB |
test_12.txt | AC | 53 ms | 800 KB |
test_13.txt | AC | 27 ms | 732 KB |
test_14.txt | AC | 28 ms | 912 KB |
test_15.txt | AC | 27 ms | 920 KB |