結果
問題 | No.804 野菜が苦手 |
ユーザー | ningenMe |
提出日時 | 2019-02-25 23:38:10 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 1,205 ms / 2,000 ms |
コード長 | 2,493 bytes |
コンパイル時間 | 1,269 ms |
コンパイル使用メモリ | 158,708 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-19 01:42:17 |
合計ジャッジ時間 | 26,397 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,134 ms
5,248 KB |
testcase_01 | AC | 1,130 ms
5,376 KB |
testcase_02 | AC | 1,128 ms
5,376 KB |
testcase_03 | AC | 1,128 ms
5,376 KB |
testcase_04 | AC | 1,130 ms
5,376 KB |
testcase_05 | AC | 1,129 ms
5,376 KB |
testcase_06 | AC | 1,205 ms
5,376 KB |
testcase_07 | AC | 1,130 ms
5,376 KB |
testcase_08 | AC | 1,129 ms
5,376 KB |
testcase_09 | AC | 1,130 ms
5,376 KB |
testcase_10 | AC | 1,130 ms
5,376 KB |
testcase_11 | AC | 1,129 ms
5,376 KB |
testcase_12 | AC | 1,127 ms
5,376 KB |
testcase_13 | AC | 1,127 ms
5,376 KB |
testcase_14 | AC | 1,127 ms
5,376 KB |
testcase_15 | AC | 1,130 ms
5,376 KB |
testcase_16 | AC | 1,130 ms
5,376 KB |
testcase_17 | AC | 1,132 ms
5,376 KB |
testcase_18 | AC | 1,129 ms
5,376 KB |
testcase_19 | AC | 1,129 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; #define REP(i,n) for(long long i = 0; i < (n); i++) #define FOR(i, m, n) for(long long i = (m);i < (n); ++i) #define ALL(obj) (obj).begin(),(obj).end() template<class T> using V = vector<T>; template<class T, class U> using P = pair<T, U>; const ll MOD = (ll)1e9 + 7; const ll MOD2 = 998244353; const ll LLINF = (ll)1e18; const ll INTINF = (ll)1e9; const long double PI = 3.1415926535897932384626433; template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} void print(void) {cout << endl;} template <class Head> void print(Head&& head) {cout << head;print();} template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} template <class T> void chmax(T& a, const T b){a=max<T>(a,b);} template <class T> void chmin(T& a, const T b){a=min<T>(a,b);} void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;} void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;} int main() { ll A,B,C,D; cin >> A >> B >> C >> D; B /= C; D /= (C+1); ll ans = 0; for(ll x = (ll)1e9; 1 <= x; --x) if(x <= A && x <= B && x <= D) chmax(ans,x); cout << ans << endl; return 0; }