CSES1081:Common Divisors 传送门 题意:找到两个gcd最大的数。n≤2e5,ai≤1e6。 一种方法是枚举i:1∼n,O(ai)把ai因数的出现次数加一。 然后i:1000000∼1,如果cnt[i]>1,输出i结束。 复杂度O(nV),2e8,可惜 CSES 的机子跑不过。 枚举倍数。
1BranchTags Code README This was my practice run for ICPC. There are more than 250 accepted solutions listed here. I have also added tags for some of the problems. At first try to come up with a solution by yourself. If you can't then read some article on the associated tags and tr...
main 1Branch 0Tags Code README CSES Solutions Over 280 accepted solutions to theCSES Problem Set, written in C++ by Jonathan Uy(nulltype). As of December 23th, the following number of solutions have been completed: Problem TypeNumber Solved ...
evenvalue's accepted solutions for theCSES problemset Table of Contents Introductory Problems Dynamic Programming Graph Algorithms Tree Algorithms 1731 - Word Combinations 1753 - String Matching 1732 - Finding Borders 1733 - Finding Periods 1110 - Minimal Rotation ...