![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
文章平均质量分 83
qq243887
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #279 (Div. 2) E. Restoring Increasing Sequence
E. Restoring Increasing Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPeter wrote on the board a原创 2014-11-25 23:53:58 · 339 阅读 · 0 评论 -
poj1316 Self Numbers
Self NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21683 Accepted: 12209DescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered a原创 2015-02-01 14:56:56 · 337 阅读 · 0 评论 -
poj 1281 MANAGER
MANAGERTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2654 Accepted: 955DescriptionOne of the programming paradigm in parallel processing is the produc原创 2015-03-11 20:21:14 · 407 阅读 · 0 评论 -
zoj 1256
What Day Is It?Time Limit: 2 Seconds Memory Limit: 65536 KBThe calendar now in use evolved from the Romans. Julius Caesar codified a calendar system that came to be known as the Julian ca原创 2015-05-09 16:42:19 · 409 阅读 · 0 评论 -
zoj 1720 Polynomial Showdown
Polynomial ShowdownTime Limit: 2 Seconds Memory Limit: 65536 KBGiven the coefficients of a polynomial from degree 8 down to 0, you are to format the polynomial in a readable format with u原创 2015-05-09 17:35:59 · 452 阅读 · 0 评论 -
zoj 1026 Modular multiplication of polynomials
Modular multiplication of polynomialsTime Limit: 2 Seconds Memory Limit: 65536 KBConsider polynomials whose coefficients are 0 and 1. Addition of two polynomials is achieved by 'adding' t原创 2015-05-09 17:45:28 · 447 阅读 · 0 评论