Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
#include <cstdio>
int main(){
int n, k;
scanf(“%d%d”, &n, &k);
int l = (n – 2) / k + 1;
printf(“%d\n”, 2 * l – ((n – 1) % k == 1));
for(int i = 2; i <= n; i++)
printf(“%d %d\n”, i, i <= k + 1 ? 1 : i – k);
return 0;
}
📦 Looking for Codeforces Round 423 Div Based Vk? Check the best deals on Amazon.
🛒 Shop Codeforces Round 423 Div Based Vk on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
, problem: (D) High Load Solution In C/C++. #include int main(){ int n, k;){kind=link}