Submission #3431464
Source Code Expand
#include <algorithm> #include <climits> #include <complex> #include <cstring> #include <iostream> #include <map> #include <set> #include <vector> // using using namespace std; // typedef typedef long long ll; // define #define ALL(c) (c).begin(), (c).end() #define SORT(c) sort(ALL(c)) #define REVERSE(c) reverse(ALL(c)) #define UNIQ(c) unique(ALL(c)) #define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c)) #define REP(i, n) FOR(i, 0, n, 1) #define RFOR(i, a, b, c) for (int i = (int)(a); i >= (int)(b); i -= (int)(c)) #define RREP(i, n) RFOR(i, n, 0, 1) // functions int ceil(int a, int b) { return (a + b - 1) / b; } int round(int a, int b) { return (a + b / 2) / b; } int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a * b / gcd(a, b); } template <class T> bool amax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template <class T> bool amin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } // main int main() { int m; cin >> m; if (m < 100) { cout << "00" << endl; } else if (m < 1000) { cout << "0" + to_string(m / 100) << endl; } else if (m <= 5000) { cout << m / 100 << endl; } else if (m <= 30000) { cout << m / 1000 + 50 << endl; } else if (m <= 70000) { cout << (m / 1000 - 30) / 5 + 80 << endl; } else { cout << 89 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | taka256 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1592 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.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, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
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 |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 1 ms | 256 KB |
test_20.txt | AC | 1 ms | 256 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 1 ms | 256 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | AC | 1 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | AC | 2 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 1 ms | 256 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | AC | 1 ms | 256 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 1 ms | 256 KB |