First, I apologize for problems with round and serious problem with Div1A/Div2C. It was very important round for me and, as always, something goes wrong. KAN have already wrote about this.

Anyway, there are problems, so editorial must exists. Due some circumstances, Editorial will be upload in parts. Also, most of tutorials will contain main ideas how to solve task, not ready algorithm.

return true;

int add = v0;

while(pos < c) {
    add = min(v1, add + a);

    pos += add - l;
    t++;
}

cout << t << endl;

int t = gett();

srand(time(NULL));
cout << fixed << setprecision(10);

while(read()) {
    solve();   

}
return 0;

return true;

int bk = base;
for(int ck = max(1, base - 2); ck <= min(n - 2, base + 2); ck++) {
    if(abs(180 * ck - n * a) < abs(180 * bk - n * a))
       bk = ck;
}

cout << 2 << " " << 1 << " " << bk + 2 << endl;

int t = gett();

srand(time(NULL));
cout << fixed << setprecision(10);

while(read()) {
    solve();   

}
return 0;