• I demand that you give me a positive integer.

    我要求你给我一个正整数。

    youdao

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

    youdao

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

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

    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

  • 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

  • Set D as non square factor positive integer.

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

    youdao

  • This field must contain a positive integer value.

    该字段必须包含正整数。

    youdao

  • Given a positive integer, output its complement number.

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

    youdao

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

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

    youdao

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

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

    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

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

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

    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

  • 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

  • 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

  • Diophantine equation; Positive integer solution; congruence; Recurrent sequence.

    丢番图方程;正整数解;同余;递归序列。

    youdao

  • Diophantine equation; Positive integer solution; congruence; Recurrent sequence.

    丢番图方程;正整数解;同余;递归序列。

    youdao

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

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

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