abc186_a - Brick
19 Dec 2020 — Tags: easy — URL \[floor(\frac{n}{w})\]Time complexity: $O(1)$
Memory complexity: $O(1)$
Click to show code.
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main(void)
{
ios::sync_with_stdio(false), cin.tie(NULL);
int n, w;
cin >> n >> w;
cout << n / w << endl;
return 0;
}