![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
YCQ_Lancet
骐骥一跃,不能十步,驽马十驾,功在不舍
展开
-
k-Factorization CF
k-Factorization time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Given a positive integer n, find k integers (not necessary disti原创 2017-04-16 08:17:38 · 718 阅读 · 0 评论 -
Alice and Bob CodeForces - 347C
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to原创 2017-06-16 10:28:58 · 435 阅读 · 0 评论 -
Identify Smith Numbers
A Smith number is a composite number, the sum of whose digits is the sum of the digits of its prime factors obtained as a result of prime factorization (excluding ). The first few such numbers are原创 2017-06-18 08:32:48 · 305 阅读 · 0 评论 -
D. My pretty girl Noora(数论,dp)
D. My pretty girl Noora time limit per test 1.5 seconds memory limit per test 256 megabytes input standard input output standard output In Pavlopolis University where Noora studie原创 2017-07-04 08:01:39 · 704 阅读 · 0 评论