摘要: 爆学数据库的一天 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 << end 阅读全文
posted @ 2025-02-24 22:40 Devpp 阅读(12) 评论(0) 推荐(0)