結果

問題 No.2850 Make Slimes
ユーザー graph11463
提出日時 2024-08-25 13:33:46
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,723 bytes
コンパイル時間 3,597 ms
コンパイル使用メモリ 276,504 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-08-25 13:34:04
合計ジャッジ時間 4,120 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
//
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP2(i, s, n) for (ll i = s; i < (ll)n; i++)
#define REP3(v, A) for(auto v: A)
#define REP4(It, A) for (ll It=A.begin();It!=A.end();++It)
#define REP5(i, n) for (ll i = 0; i * i < (ll)(n); i++)
//vector
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(RALL(A))
//
#define GET(A) cin >> A
#define GETV(i,n,A) REP(i,n)cin >> A[i]
//
#define print(A) cout << A << endl
#define YeNo(bo) print(((bo) ? "Yes":"No"))
#define YENO(bo) print(((bo) ? "YES":"NO"))
#define yeno(bo) print(((bo) ? "yes":"no"))
#define LISTOUT(A) rep(i,A.size())cout << A[i] << " ";cout << endl
//
#define PB push_back
#define IS insert
#define SZ size
#define TE true
#define FE false
#define Fir first
#define Sec second
//
#define I_MAX 2147483647
#define I_MIN -2147483647
#define UI_MAX 4294967295
#define LL_MAX 9223372036854775807
#define LL_MIN -9223372036854775808
#define ULL_MAX 18446744073709551615
//
using ll = long long;
using ull =unsigned long long;
using P = pair<int,int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
//using mint = modint998244353;
//
#ifdef _DEBUG
#define debug(x) cerr << "dbg: "<< #x << ": " << x << endl
#define debug_v(x) cerr << "dbg_vec: " << #x << ": "; REP3(v,x) cerr << v << " "; cerr << endl
#define debug_s(x) cerr << "dbg_set: " << #x << ": {"; REP3(v,x) cerr << v << ","; cerr << "}" << endl
#define debug_m(x) cerr << "dbg_map: " << #x << ": "; REP4(Ite1,x)cerr << "key: " << Ite1->first << " : " << Ite1->second << " "; cerr<< endl
#else
#define debug(x)
#define debug_v(x)
#define debug_s(x)
#define debug_m(x)
#endif
//
ll GCM(ll a,ll b){
if(b==0){
return a;
}
return GCM(b,b%a);
}
bool kaibuncheck(string S){
bool ret=TE;
REP(i,S.SZ()/2){
if(S[i]!=S[S.SZ()-i-1]){
ret=FE;
break;
}
}
return ret;
}
vector<pair<ll,ll>> primefact(ll N){
vector<pair<ll,ll>> ret;
REP5(i,N){
ll cot=0;
if(N%i==0){
while(N%i==0){
cot++;
N/=i;
}
ret.PB(make_pair(i,cot));
}
}
if(N!=1)ret.PB(make_pair(N,1));
return ret;
}
int main() {
ll A,B,C,D;cin >> A >> B >> C >> D;
if(A==0){
cout << D/B << endl;
}else if(B==0){
cout << C/A << endl;
}else{
cout << min(C/A,D/B) << endl;
}}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0