• Given a positive integer, output its complement number.

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

    youdao

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

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

    youdao

  • The method took a positive integer and turned it into roman numerals .

    该方法采取了积极的整数,变成了罗马数字了。

    youdao

  • There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers.

    大楼中只有一个电梯,请求序列有N个正整数组成,数字表示电梯将在哪里停,按照顺序。

    youdao

  • Mathematical induction is a positive integer proved extremely relevant to the topic of effective scientific methods.

    数学归纳法是一种证明与正整数有关的命题的极为有效的科学方法。

    youdao

  • In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.

    在这个问题中,二叉树的每个节都值都为正整数,且每棵树的节点数都小于256。

    youdao

  • Returns a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object.

    如果该对象小于指定对象返回负数,等于返回0,大于返回正数。

    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

  • Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.

    比较用来排序的两个参数。根据第一个参数小于、等于或大于第二个参数分别返回负整数、零或正整数。

    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

  • 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

  • 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

  • Through the schema, a validating parser can verify that the element InvoiceNo is a positive integer and the element ProductID consists of one letter between A and Z followed by six digits.

    通过模式,验证解析器可以检查元素InvoiceNo 是否是正整数,元素ProductID 的首字符是否为A到 Z之间的字母,后面为六个阿拉伯数字。

    youdao

  • Hence, if text matched the entire pattern, the first set of parentheses would yield a string representing a positive or negative integer, such as + 49.

    因此,如果文本匹配了整个模式,第一组括号将生成表示一个正整数或负整数的的字符串,例如+49。

    youdao

  • The exponent is interpreted as a signed integer, allowing negative as well as positive exponents.

    作为有符号整数的指数可以有正负之分。

    youdao

  • When the maximum cardinality in a type definition is omitted, the sub-indexes on values of that type can range from 1 to the maximum positive value of integer type.

    省略类型定义中的最大基数时,此类型值上的子索引范围从1到整数类型的最大正值。

    youdao

  • In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.

    特别地,当D是某正整数集合,Z是整数集时,得出了整数距离图G(Z ,D)的点荫度的几个上界。

    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

  • When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT.

    当解释的论域是一个固定大小的有限集合时,一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。

    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
- 来自原声例句
小调查
请问您想要如何调整此模块?

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

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