数论
obsorb_knowledge
心有不甘,呼唤着我
展开
-
卡特兰数(Train Problem II HDU - 1023 )
As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railwa...原创 2018-05-13 11:03:57 · 169 阅读 · 0 评论 -
GCD and LCM HDU - 4497 (考最大公约数和最小公倍数的本质了)
Given two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, y, z) = L? Note, gcd(x, y, z) means the greatest common di...原创 2018-05-20 11:20:56 · 200 阅读 · 0 评论 -
Codeforces Round #511 (Div. 2) C. Enlarge GCD(消掉最少的数,让所有数的最大公约数变大)
C. Enlarge GCD time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Mr. F has nn positive integers, a1,a2,…,ana1,a2,…,an. He thinks th...原创 2018-10-01 17:46:02 · 529 阅读 · 2 评论