Diary_2.24

爆学数据库的一天

Codeforces

1. Shashlik Cooking

void solve(){
    int n, k;   cin >> n >> k;
    int len = 2*k+1;
    if(n % len <= k && n%len != 0){
        cout << n/len+1 << endl;
        int last = n%len;
        int dif = k+1-last;
        for(int i=k+1-dif; i<=n; i+=2*k+1){
            cout << i << ' ';
        }
        cout << endl;
    }else{
        cout << n/len+(n%len ? 1 : 0) << endl;
        for(int i=k+1; i<=n; i+=2*k+1){
            cout << i << ' ';
        }
        cout << endl;
    }
}