片语

totally positive algebraic integer完全正的代数整数

positive primitive integer solution本原解

Positive integer resolution algorithm正整数拆分算法

positive e integer正整数

solution of positive integer整正数解

Collection of positive integer正整数集合

partition of positive integer正整数n的分拆

positive nonzero integer正非零整数

short positive integer[数]

英汉例句

• 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，设计一个算法找出剩下数字组成的新数最小的删数方案。

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

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

• 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.

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

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

  第一行包含两个数：一个正整数n（0n50）表示字符串长度，一个正整数m（0m字符串个数。

• Every positive integer greater than 1 can be expressed as the product of prime Numbers.

  每个大于1的正整数都能表示为素数的乘积。

• There is only a first positive integer representing the number of departments.

  第一行只有一个正整数，代表公司的部门数目。

• Recapping the classifier's requirements: Given any positive integer greater than 1, you must classify it as perfect, abundant, or deficient.

  我们来回顾一下分类器的要求：对于任何大于1的正整数，必须将其归为以下几个类别：完全数、过剩数或亏数。

• It must have a positive integer value.

  它必须是一个正整数。

• For each scenario, you are given a single positive integer less than 45 on a line by itself.

  对于每个情况下，您有一个单一的正整数不少于45上线的本身。

• Scale maximum must be a positive integer value.

  比例最大值必须是一个正整数。

• In this paper, we study the condition which makes the fundamental group of graph have every positive integer as the index of some normal subgroup.

  本文主要研究图的基本群的正规子群的指数何时成为任意正整数的条件。

• A composite is a positive integer with more than two divisors.

  复合数就是具有一个以上约数的正整数。

• The requirements state that, given any positive integer greater than 1, you must classify it as either perfect, abundant, or deficient.

  要求是，给出任何大于1的正整数时，必须将其分类为perfect、abundant、或者deficient。

• In arithmetic the positive integer and the positive fraction were sufficient for all requirements.

  在算数中，曾经正整数和正分数能够满足所有的需求。

• 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.

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

• 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之间的字母，后面为六个阿拉伯数字。

• Let D be a positive integer with square free.

  设d是无平方因子正整数。

• 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.

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

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

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

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

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