2019 年 2月 12 日随笔档案 - 新海岛Blog

POJ2689 ZOJ1842 UVA10140 Prime Distance【筛选法】

摘要： "Prime Distance" Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 25099 Accepted: 6567 Description The branch of mathematics called number t 阅读全文

posted @ 2019-02-12 23:20 新海岛Blog 阅读(84) 评论(0) 推荐(0)

UVA10789 Prime Frequency【筛选法】

摘要： Given a string containing only alpha numerals (0 9, A Z and a z) you have to count the frequency (the number of times the character is present) of all 阅读全文

posted @ 2019-02-12 17:49 新海岛Blog 阅读(129) 评论(0) 推荐(0)

UVA10780 Again Prime? No Time.【筛选法】

摘要： The problem statement is very easy. Given a number n you have to determine the largest power of m, not necessarily prime, that divides n!. Input The i 阅读全文

posted @ 2019-02-12 17:01 新海岛Blog 阅读(117) 评论(0) 推荐(0)

UVA10664 Luggage【水题】

摘要： Peter and his friends are on holiday, so they have decided to make a trip by car to know the north of Spain. They are seven people and they think that 阅读全文

posted @ 2019-02-12 11:03 新海岛Blog 阅读(134) 评论(0) 推荐(0)

UVA10050 Hartals【水题】

摘要： A social research organization has determined a simple set of parameters to simulate the behavior of the political parties of our country. One of the 阅读全文

posted @ 2019-02-12 08:47 新海岛Blog 阅读(78) 评论(0) 推荐(0)

UVALive2116 The Mobius Function【筛选法＋莫比乌斯函数】

摘要： The Mobius function M(n) is defined on positive integers as follows: M(n) = 1 if n is 1. M(n) = 0 if any prime factor of n is contained in n more than 阅读全文

posted @ 2019-02-12 07:59 新海岛Blog 阅读(138) 评论(0) 推荐(0)