摘要: Codeforces Round 1006 (Div. 3) 1. New World, New Me, New Array int n, k, p; void solve(){ cin >> n >> k >> p; if((k>0 && n*p < k )|| (k<0 && -n*p > k) 阅读全文
posted @ 2025-02-26 09:19 Devpp 阅读(36) 评论(0) 推荐(0)