Submission
Status:
PPPxxxPx-P
Score: 50
User: tankunkid
Problemset: เรือสำราญ
Language: cpp
Time: 0.002 second
Submitted On: 2024-09-29 13:58:00
#include <stdio.h>
#include <math.h>
int main() {
int K, T, N, S, swap1 = 0;
int arr[100];
scanf("%d %d", &K, &T);
scanf("%d", &N);
int u[N];
int v[N];
for (int i = 0; i < N; i++) {
scanf("%d", &u[i]);
scanf("%d", &v[i]);
}
for (int i = 0; i < int(K/T); i++) {
arr[i] = T*(i+1);
}
for (int i = 0; i < N; i++) {
for (int p = 0; p < int(K/T)-swap1; p++) {
if (arr[p] >= u[i] && arr[p] <= v[i]) {
for (int j = p; j < int(K/T); j++) {
arr[j] = arr[j+1];
}
swap1++;
}
}
}
if ((int(K/T) - swap1) <= 1) {
printf("no");
return 0;
}
printf("%d\n", int(K/T)-swap1);
for (int i = 0; i < int(K/T)-swap1; i++) {
printf("%d\n", arr[i]);
}
}