CS Academy Round #80 (unrated, based on Romanian Olympiad IOI selection camp) A - 代码天地

CS Academy Round #80 (unrated, based on Romanian Olympiad IOI selection camp) A

其他 2018-06-22 21:48:12 阅读次数: 3

NoSuchKey

猜你喜欢

转载自blog.csdn.net/light2chasers/article/details/80428685

CS Academy Round #80 (unrated, based on Romanian Olympiad IOI selection camp) A

CS Academy Round 75 Permutations NTT

CS Academy Round #77 (Div. 2 only) C D

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises)

Codeforces Round #680 (Div. 2, based on Moscow Team Olympiad)

Testing Round #16 (Unrated)

[BZOJ5312]-[CS Academy_Round #70 F]And or Max-线段树+势能分析

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A, B, D, E

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises).B. Shashlik Cooking（模拟）

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises).A. Palindrome Dance（思维）

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) D mt19937

Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)

Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)

Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)【ABCD】（题解）

Codeforces Round #707 (Div. 2, based on Moscow Open Olympiad in Informatics)

CS academy B Digits Permutation

Treasure Island（两遍dfs）-- Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)

Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)E. Petya and Construction Set（pair操作构造）

Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)D. Treasure Island（1214）

Codeforces Round #626 (Div. 1, based on Moscow Open Olympiad in Informatics)C（二分图，哈希）

Codeforces Round #626 (Div. 1, based on Moscow Open Olympiad in Informatics) B. Present（位运算+二分）

CS Academy Gcd on a Circle（dp + 线段树）

Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)/CF1323 C. Unusual Competitions（栈/括号匹配）

Codeforces Round #680 (Div. 2, based on Moscow Team Olympiad)C. Division（质因数分解+欧拉筛优化）

feature selection 心得。PSO based

Educational Codeforces Round 64(Unrated for Div.1+Div. 2)

Codeforces Round #571 (Unrated for Div. 1+Div. 2)

CodeChef Replay of Indian IOI Training Camp (IOITC) #1 简要题解

笔记：Dissimilarity-Based Sparse Subset Selection

EOJ Monthly 2019.2 (based on February Selection)

今日推荐

周排行

报错 : Field sysLogService in com.tedu.controller.SysLogController required a bean of type 'com.tedu.service.SysLogService' that could not be found

python正课2

六、JAVA_int的最大值或最小值

应用程序开发总结(10)--存在完美的数学计算

图书管理系统1.0（当然是很简low的系统，没有华丽界面，但是很锻炼软件开发能力，只用到c++的面向对象知识）

delphi操作wps表格

区块王者荣耀游戏系统开发介绍

2015年度笔记统计与2016规划

Linux 平台下zRAM 和 swap 使用(内存交换)

Java面试基础知识点-框架

每日归档

更多

2025-03-23(0)

2025-03-22(0)

2025-03-21(0)

2025-03-20(0)

2025-03-19(0)

2025-03-18(0)

2025-03-17(0)

2025-03-16(0)

2025-03-15(0)

2025-03-14(0)