Submission

PPPPPPPPPP

Score: 100

User: Khiem

Problemset: เรือสำราญ

Language: cpp

Time: 0.005 second

Submitted On: 2024-09-25 13:58:09

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int d[N], cnt;
signed main(){
	int k, t, n, l, r; scanf("%d %d %d", &k, &t, &n);
	while(n--){
		scanf("%d %d", &l, &r); if(l > r) swap(l, r);
		++d[l]; --d[r+1];
	}
	for(int i = 1; i<=k; ++i) d[i] += d[i-1];
	for(int i = t; i<=k; i+=t) cnt += !d[i];
	if(!cnt){ puts("no"); return 0;}
	printf("%d\n", cnt);
	for(int i = t; i<=k; i+=t) if(!d[i]) printf("%d\n", i);
}