Submission #7507264
Source Code Expand
// --https://kenkoooo.com/atcoder/#/table/soma62jp // ---------------------------------------------------------- #include <stdio.h> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <list> #include <queue> #include <stack> #include <cmath> #include <ctime> #include <cstdio> #include <vector> #include <string> #include <bitset> #include <cctype> #include <cstdlib> #include <cstring> #include <utility> #include <numeric> #include <complex> #include <sstream> #include <fstream> #include <iomanip> #include <cassert> #include <iostream> #include <iterator> #include <algorithm> #include <functional> using namespace std; typedef long long LL; typedef unsigned int UI; typedef long double LD; const LL MOD = (LL)1000000007; const LL LL_INF = (LL)1 << 62; const int INT_INF = (int)1 << 30; #define rSort(a) sort(a.rbegin(),a.rend()) #define Sort(a) sort(a.begin(),a.end()) #define Reverse(a) reverse(a.begin(),a.end()) #define Sum(a) accumulate(a.begin(), a.end(), 0) #define REP(i, n) for(UI i = 0;i < n;i++) #define REPR(i, n) for(UI i = n;i >= 0;i--) #define FOR(i, m, n) for(UI i = m;i < n;i++) #define pb(i) push_back(i) #define SWAP(x,y) ((x!=y)&&(x^=y,y^=x,x^=y)) int main(int argc, char* argv[]) { cin.tie(0); ios::sync_with_stdio(false); LD m; cin >> m; m/=1000; if (m < 0.1) { cout << "00" << endl; } else if (m >= 0.1 && m <= 5) { if (m > 1) { cout << to_string((m * 10)) << endl; } else { cout << "0" + to_string(m * 10) << endl; } } else if (m >= 6 && m <= 30) { cout << to_string((m + 50)) << endl; } else if (m >= 35 && m <= 70) { cout << to_string((m - 30) / 5 + 80) << endl; } else if (m > 70) { cout << "89" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | soma62jp |
Language | C (Clang 3.8.0) |
Score | 0 |
Code Size | 1847 Byte |
Status | CE |
Compile Error
./Main.c:6:10: fatal error: 'set' file not found #include <set> ^ 1 error generated.