Submission #2959841
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) // {{{ template<typename T> void printmatrix(vector<vector<T> > ar){ for (int i = 0; i < (int)ar.size(); i++) { for (int j = 0; j < (int)ar[0].size(); j++) { cout << ar[i][j]; } cout << endl; } } template<typename T> void printvector(vector<T> vec){ for (int i = 0; i < (int)vec.size(); i++) { cout << vec[i] << endl; } } template<typename T> void unique(vector<T>& vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end()); } template<typename T> vector<T> cumsum(vector<T> vec){ vector<T> newvec((T)vec.size()); int tmp = 0; for (int i = 0; i < (int)vec.size(); i++) { tmp += vec[i]; newvec[i] = tmp; } return newvec; } template<typename T> T digitsum(T x){ T y=0; while(x){ y += x % 10; x /= 10; } return y; } template<typename T> T gcd(T x, T y){ if (x == 0 || y == 0) { return 0; } while (x != y){ if (x > y) { x -= y; }else{ y -= x; } } return x; } // }}} /* vim:set foldmethod=marker: */ void solve(){ int m; cin >> m; if (m < 100) { cout << "00" << endl; }else if (m <= 5000) { printf("%02d\n", m/100); }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; } int main(int argc, char const* argv[]) { solve(); return 0; } // sortの仕方 // int a[N]; // array<int,N> ar; // vector<int> v; // // sort(a, a+N); // 配列 // sort(ar.begin(), ar.end()); // array // sort(v.begin(), v.end()); // vector 昇順 // sort(v.begin(), v.end(), greater<int>()); // 降順 // Template // template <class T> // T foomax(T x, T y){ // if (x > y){ // return x; // }else{ // return y; // } // } // string を int に変換 stoi("1010") // int を string に変換 to_string(1010) // map の key, value を全て抜き出す。 // for (auto itr = mp.begin(); itr != mp.end(); itr++) { // cout << "key" << itr->first << " value" << itr->second << endl; // } // 文字列の検索 // string s="abc"; // if (s.find('d') == string::npos){ // cout << "find" << endl; // }else{ // cout << "not find" << endl; // }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | goropikari |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2691 Byte |
Status | AC |
Exec Time | 1 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 | 1 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 |