发表评论取消回复
相关阅读
相关 Codeforces Round #708 (Div. 2) C1 C2
[Problem - C1 - Codeforces][] 题意: 让你构造三个数,使它们加起来是n,然后lcm(a1,a2,a3)<=n/2 思路: 构造题,要满足两
相关 Codeforces Round #729 (Div. 2) c题
[https://codeforces.com/contest/1542/problem/C][https_codeforces.com_contest_1542_proble
相关 Codeforces Round 374 div2
题目链接: [ CodeforcesRound374][CodeforcesRound374] 做了这么久cf了,,c题有时候还是做不起,,真的好菜,,,,
相关 Codeforces Round #433 (Div. 2) C. Planning(贪心)
C. Planning time limit per test 1 second memory limit per test 512 megabytes input
相关 Codeforces Round #433 (Div.2 ) B. Maxim Buys an Apartment(水题)
B. Maxim Buys an Apartment time limit per test 1 second memory limit per test 512 me
相关 #433 - C. Planning(贪心,优先队列)
-------------------- 题目连接:[http://codeforces.com/contest/854/problem/C][http_codeforces
相关 Codeforces Round #118 (Div. 2) C. Plant
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". Th
相关 Codeforces Round #258 (Div. 2) . Sort the Array 贪心
B. Sort the Array 题目连接: [http://codeforces.com/contest/451/problem/B][http_codef
相关 Codeforces Round #553 (Div. 2)
A:[http://codeforces.com/contest/1151/problem/A][http_codeforces.com_contest_1151_proble
相关 Codeforces Round #562 (Div. 2)
A. Circle Metro 题意:有两条线路线路,一条是正着走的,一条是倒着走的,一个人在第一条,一个人在第二条,给你两个人的起点和终点,问你是否能相遇。 ![Cont
还没有评论,来说两句吧...