2025年12月5日
Educational Codeforces Round 185 (Rated for Div. 2)
摘要： A. Maximum Neighborhood void solve(){ int n; cin >> n; if(n == 1) { cout << 1 << endl; return ; } if(n == 2){ cout << 9 << endl; return ; } int t1 = 4 阅读全文
posted @ 2025-12-05 00:31 菜鸡の编程日常 阅读(8) 评论(0) 推荐(0)