Submission #1239281

#TimeUsernameProblemLanguageResultExecution timeMemory
1239281luserBouquet (EGOI24_bouquet)C++20
8 / 100
24 ms3400 KiB
#include<bits/stdc++.h> #define ll long long #define endl "\n" #define moo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); using namespace std; void solve() { ll n,ans=0,i; cin>>n; vector<pair<ll,ll>>v(n); for(i=0;i<n;i++) cin>>v[i].first>>v[i].second; ans=n/(v[0].first+1); if(n%(v[0].first+1)) ans++; cout<<ans; } //6 2 /* x . . x . . */ int main() { moo ll t=1; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...