嫑

摘要： codefroce A.Sum of Odd Integers You are given two integers nn and kk. Your task is to find if nn can be represented as a sum of kk distinct positive o 阅读全文

摘要： C. Adding Powers Suppose you are performing the following algorithm. There is an array v1,v2,…,vnv1,v2,…,vn filled with zeroes at start. The following 阅读全文

摘要： Codeforces Round #625 (Div. 2, based on Technocup 2020 Final Round) B. Journey Planning time limit per test 2 seconds memory limit per test 256 megaby 阅读全文

摘要： 首先我们要明白只有有向无环图（DAG）才有最长路最近在重新看到最长路，总是能看到各种说法说SPFA，Floyd，Dijkstra等能做最短路，比如修改个符号，或者初始化时加个负号，但是前提是这个图必须是有向无环图。在这个前提下，我们使用Floyd，SPFA都可以求最长路，我们给每个边加一个负号，求出 阅读全文

摘要： Codeforces Round #609 (Div. 2) D. Domino for Young time limit per test 3 seconds memory limit per test 256 megabytes input standard input output stand 阅读全文

摘要： Codeforces Round #609 (Div. 2)-C. Long Beautiful Integer time limit per test 3 seconds memory limit per test 256 megabytes input standard input output 阅读全文

摘要： B. Modulo Equality time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output You are given a posit 阅读全文

摘要： Educational Codeforces Round 78 (Rated for Div. 2) 1278B - 6 B. A and B time limit per test 1 second memory limit per test 256 megabytes input standar 阅读全文

摘要： Educational Codeforces Round 78 (Rated for Div. 2) C - Berry Jam C. Berry Jam time limit per test 2 seconds memory limit per test 256 megabytes input 阅读全文

摘要： C.As Simple as One and Two A. As Simple as One and Two time limit per test 3 seconds memory limit per test 256 megabytes input standard input output s 阅读全文