UVA
caorui_blog
这个作者很懒,什么都没留下…
展开
-
安迪的第一个字典(UVa 10815)
【问题描述】输入一个文本,找出所有不同的单词(连续的字母序列),按字典序从小到大输出。单词不区分大小写。【样例输入】Adventures in DisneylandTwo blondes were going to Disneyland when they came to a fork in theroad. The sign read: "Disneyland原创 2018-01-28 15:10:38 · 429 阅读 · 2 评论 -
UVA101木块问题
UVA 101 the block problem 木块问题原创 2018-01-28 11:21:47 · 238 阅读 · 0 评论 -
UVA10922 2 the 9s【大数模除+进制】(老师的程序注释)
A well-known trick to know if an integer N is a multiple of nine is to compute the sum S of its digits. If S is a multiple of nine, then so is N. This is a recursive test, and the depth of the recu...转载 2018-07-20 10:04:47 · 250 阅读 · 0 评论 -
UVA10696 f91【数学函数+打表】(老师程序代码注释)
McCarthy is a famous theorician of computer science. In his work, he defined a recursive function, called f91, that takes as input a positive integer N and returns a positive integer defined as fol...转载 2018-07-20 10:17:21 · 564 阅读 · 0 评论 -
UVA10391 ZOJ1825 Compound Words【SET+暴力】(老师程序代码注释)
Compound WordsTime Limit: 5 Seconds Memory Limit: 32768 KBYou are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is the con...转载 2018-07-21 16:04:56 · 221 阅读 · 0 评论 -
UVALive5346 UVA374 Big Mod【快速幂】
Calculate R := B ^ P mod M for large values of B, P, and M using an efficient algorithm. (That’s right, this problem has a time dependency !!!.) Input The input will contain several test c...原创 2018-09-07 09:48:38 · 211 阅读 · 0 评论 -
UVA10179 Irreducable Basic Fractions【欧拉函数+数论】
A fraction m / n is basic if 0 ≤ m < n and it is irreducible if gcd(m, n) = 1. Given a positive integer n, in this problem you are required to find out the number of irreducible basic fractions w...原创 2018-09-07 11:02:21 · 295 阅读 · 0 评论