Street Construction

AIO 2018mediumgraph
Time: O(n log n)
Space: O(n)
View original problem

Solution

C++
// https://orac2.info/problem/265/
#include<bits/stdc++.h>
using namespace std;
int main(){
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  int n,k; cin>>n>>k;
  cout<<n/(k+1)<<'\n';
  return 0;
}

Editorial

Editorial coming soon.