I demand that you give me a positive integer.
我要求你给我一个正整数。
Set D as non square factor positive integer.
设D是无平方因子正整数。
Let D be a positive integer with square free.
设d是无平方因子正整数。
This field must contain a positive integer value.
该字段必须包含正整数。
Suppose D is a positive integer with square free.
设d是无平方因子正整数。
Given a positive integer, output its complement number.
给定一个正整数，输出其补数。
Length is a positive integer number that does not exceed 106.
一个正整数号码长度不超过106。
The method took a positive integer and turned it into roman numerals .
该方法采取了积极的整数，变成了罗马数字了。
There is only a first positive integer representing the number of departments.
第一行只有一个正整数，代表公司的部门数目。
Diophantine equation; Positive integer solution; congruence; Recurrent sequence.
丢番图方程；正整数解；同余；递归序列。
The definition of plane central curve with positive integer degree was proposed.
给出了平面正整数次中心曲线的定义和中心命题。
Every positive integer greater than 1 can be expressed as the product of prime Numbers.
每个大于1的正整数都能表示为素数的乘积。
In arithmetic the positive integer and the positive fraction were sufficient for all requirements.
在算数中，曾经正整数和正分数能够满足所有的需求。
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers.
大楼中只有一个电梯，请求序列有N个正整数组成，数字表示电梯将在哪里停，按照顺序。
Mathematical induction is a positive integer proved extremely relevant to the topic of effective scientific methods.
数学归纳法是一种证明与正整数有关的命题的极为有效的科学方法。
In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.
在这个问题中，二叉树的每个节都值都为正整数，且每棵树的节点数都小于256。
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。
Returns a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object.
如果该对象小于指定对象返回负数，等于返回0，大于返回正数。
Recapping the classifier's requirements: Given any positive integer greater than 1, you must classify it as perfect, abundant, or deficient.
我们来回顾一下分类器的要求：对于任何大于1的正整数，必须将其归为以下几个类别：完全数、过剩数或亏数。
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.
本文主要研究图的基本群的正规子群的指数何时成为任意正整数的条件。
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.
输入以一个正整数开始，它占一行，本身代表的是下面这种情形的数目，每一个都按下面的要求描述。
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.
给定一个无重复的正整数数组，计算得到一个目标正整数的所有可能组合方式的个数。
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 问题。
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 问题。
应用推荐