题解 | #送水#
送水
https://ac.nowcoder.com/acm/problem/22241
#include <stdio.h>
int main() {
int Y, k, n;
scanf("%d %d %d", &Y, &k, &n);
if (Y > n || k > n || k <= 0)
{
printf("-1");
return 0;
}
int found = 0;
int start = Y;
if (start % k != 0)
{
start += k - start % k;
}
for (int T = start; T <= n; T += k)
{
int x = T - Y;
if (x >= 0)
{
printf("%d ", x);
found = 1;
}
}
if (!found)
{
printf("-1");
}
return 0;
}
