![](https://img-blog.csdnimg.cn/20190927151117521.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
翻译
文章平均质量分 60
翻译编程题目
Ling_1501
这个作者很懒,什么都没留下…
展开
-
翻译(20)
题目:Encoding | JXNUOJ描述:Given a string containing only 'A' - 'Z', we could encode it using the following method:给定一个仅包含'A' - 'Z'的字符串,我们能够使用以下方法编码它。1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only characte原创 2022-02-17 22:37:45 · 233 阅读 · 0 评论 -
翻译(18)
题目:Prime Ring Problem | JXNUOJ描述:A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the number of first circle should原创 2022-02-13 16:38:30 · 7404 阅读 · 0 评论 -
翻译(17)
描述:Kamishirasawa Keine always says, "If you don't know what to do, why not give mathematical practice a try."However, Cirno is way too much talented to work on simple problems. Therefore, you are now tasked to crack one.We consider one operation on a原创 2022-02-13 15:56:59 · 75 阅读 · 0 评论 -
翻译(16)
题目:Color Sequence | JXNUOJ描述:You are given a integer sequencecof lengthn,cidenotes theithcolor in the sequencec.We define a color sequence is legal only if it merely contains colors that appear even number of times.For example, sequence0,1...原创 2022-02-11 10:31:16 · 263 阅读 · 0 评论 -
翻译(15)
题目:Chinese Valentime's Day | JXNUOJ描述:Recently, God Liu has been so absorbed in the Pac-Man game that he has even neglected his young fans.So before Chinese valentine's day,in order to have time for him to accompany the girls, while God Liu went to the翻译 2022-02-10 20:13:03 · 66 阅读 · 0 评论 -
翻译(14)
题目:Charging | JXNUOJ翻译 2022-02-10 19:11:11 · 63 阅读 · 0 评论 -
翻译(13)
题目:Big number | JXNUOJ描述:In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to determine the number翻译 2022-02-09 12:21:06 · 204 阅读 · 0 评论 -
翻译(12)
题目:Apple | JXNUOJ描述:There are a box of apples,which contains N apples. You're going to give them to M person. It is required that everyone must be given a positive integer apple, and no one must have the same amount. If it can be done, output possible;翻译 2022-02-03 15:08:59 · 150 阅读 · 0 评论 -
翻译(11)
题目:A simple Math Problem | JXNUOJ描述:Huanhuan challenges you to a simple math problem.Define F(x) as the sum of the decimal digits of x.For example: F(123)=1+2+3=6, F(700)=7+0+0=7.Huanhuan wants you to calculate the sum of F(j)for every i,j that s翻译 2022-01-27 17:38:15 · 154 阅读 · 0 评论 -
翻译(10)
题目:Digital Roots | JXNUOJ描述:The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those di翻译 2022-01-26 20:58:01 · 152 阅读 · 0 评论 -
翻译(9)
题目:u Calculate e | JXNUOJ描述:有一个关于e的数学公式,即i从0开始到n,对i的阶乘的倒数求和,n可以接近于无限。这能够通过较小的n,产生精确的e的近似值。输出:通过上述的公式和n的值(0~9)输出e的近似值。你的输出格式应该参考下面的样例。词汇:infinity 无限 yield 产生 approximation 近似值 formula 公式 generated 产生,生成...翻译 2022-01-25 22:17:24 · 71 阅读 · 0 评论 -
翻译(8)
题目:Tempter of the Bone | JXNUOJ描述:The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he翻译 2022-01-24 10:02:00 · 204 阅读 · 0 评论 -
翻译(7)
题目:FatMouse'Trade | JXNUOJ描述:FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F..翻译 2022-01-23 23:01:54 · 287 阅读 · 0 评论 -
今日份翻译
翻译(6)题目:Elevator描述:The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one f翻译 2022-01-22 22:15:54 · 64 阅读 · 0 评论 -
翻译(5)
题目:Quoit Design | JXNUOJ描述:Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the position of each toy is fixed, and the ring is care翻译 2022-01-21 16:33:13 · 372 阅读 · 0 评论 -
翻译(4)
题目:Tick and Tick | JXNUOJ描述:The three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and each of them would like to stay away from the other two. A hand is happy if it is at leas翻译 2022-01-20 16:01:23 · 70 阅读 · 0 评论 -
翻译(3)
题目:Number Sequence | JXNUOJ翻译:描述:一个数组的定义如下:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.给你A,B和n的值,你需要计算 f(n) 的值。输入:输入包括大量组测试。每组测试包括三个整数:A,B和n,并且在一行。输入数据为三个0时结束输入并且不会被读入。输出:对于每组测试,单行输出f(n)的值。...翻译 2022-01-19 19:51:29 · 75 阅读 · 0 评论 -
翻译(2)
题目:Let the Balloon Rise | JXNUOJ翻译:描述:又到了比赛的时候!看见漂浮在附近的气球是多兴奋啊。但是告诉你一个秘密,评委最喜欢干的事是猜测最受欢迎的题目。比赛结束之后,他们会统计分布的每个颜色的气球的个数并且找到答案。今年他们决定把这个可爱的工作交给你。输入:输入包括多组测试。每组测试从数字N(0 < N <= 1000)开始,N为气球的总数。接下来N行每行一个颜色。气球的颜色是一个字符串,由最高十五位的小写字母组成。若测试个数为0,将停止读入,并且翻译 2022-01-18 18:36:37 · 156 阅读 · 0 评论 -
翻译(1)
题目:Max Sum | JXNUOJ翻译:<动态规划>描述:给你一个数组 a[1],a[2],a[3]......a[n],你的目标是计算出这个数列的子数列的最大的和。比如,给你 (6,-1,5,4,-7),它的最大的和:6 + (-1) + 5 + 4 = 14。输入:第一行的输入包含一个整数T(1<=T<=20),即测试的组数。接下来的T行,每行第一个数为N(1<=N<=100000),即数列元素的个数,其后接着N个整数,范围都在-1000~1000.翻译 2022-01-17 16:36:44 · 77 阅读 · 0 评论