Submission #3598500

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <string>
#include <utility>
#include <map>
#include <queue>
#include <list>
#include <functional>
int dx[4] = { -1,0,1,0 };
int dy[4] = { 0,1,0,-1 };
const int INF = 1 << 21;
using pii = std::pair<int, int>;
#define SORT(v) std::sort(v.begin(), v.end())
int main(void) {
	int N, K;
	int a;
	std::cin >> N >> K;
	for (int i = 0; i < N; ++i) {
		std::cin >> a;
	}
	std::cout << (N + K - 3) / (K - 1) << std::endl;
	return 0;
	
}

Submission Info

Judge Result