• Length is a positive integer number that does not exceed 106.

    一个正整数号码长度不超过106。

    youdao

  • The first line contains two integers: a positive integer n (0 50) giving the length of the strings; and a positive integer m (0 number of strings.

    第一行包含两个数:一个正整数n(050)表示字符串长度,一个正整数m(0个数。

    youdao

  • You could also write code that USES a positive integer's factors to determine if it is a prime number (defined as an integer greater than 1 whose only factors are 1 and the number itself).

    您还可以编写代码,用一个正整数的因子来确定它是否为素数(定义为大于1的整数,该数字仅有的因子为1和本身)。

    youdao

  • Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.

    给定一个无重复的正整数数组,计算得到一个目标正整数的所有可能组合方式的个数。

    youdao

  • Given a positive integer, output its complement number.

    给定一个正整数,输出其补数。

    youdao

  • The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below.

    输入以一个正整数开始,它占一行,本身代表的是下面这种情形的数目,每一个都按下面的要求描述。

    youdao

  • A second input of a table-looping extractor functoid must be a positive integer which determines the column number that will be extracted from the table-looping functoid's grid.

    “表循环提取程序”functoid的第二个输入参数必须是一个正整数,它确定将从“表循环”functoid的网格中提取的列数。

    youdao

  • For a given n-bit positive integer a and positive integer k, to design an algorithm to identify the composition of the remaining number of the smallest number of new programs to delete a few.

    对于给定的n位正整数a和正整数k,设计一个算法找出剩下数字组成的新数最小的删数方案。

    youdao

  • For a given n-bit positive integer a and positive integer k, to design an algorithm to identify the composition of the remaining number of the smallest number of new programs to delete a few.

    对于给定的n位正整数a和正整数k,设计一个算法找出剩下数字组成的新数最小的删数方案。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定