Given a positive integer, output its complement number.
给定一个正整数，输出其补数。
Length is a positive integer number that does not exceed 106.
一个正整数号码长度不超过106。
A composite is a positive integer with more than two divisors.
复合数就是具有一个以上约数的正整数。
The method took a positive integer and turned it into roman numerals .
该方法采取了积极的整数，变成了罗马数字了。
Theorem 3 If, and, then there exists a positive integer, such that, for every.
定理3如果，且，那么存在正整数，当时，都有。
Diophantine equation; Positive integer solution; congruence; Recurrent sequence.
丢番图方程；正整数解；同余；递归序列。
Every positive integer greater than 1 can be expressed as the product of prime Numbers.
每个大于1的正整数都能表示为素数的乘积。
For each scenario, you are given a single positive integer less than 45 on a line by itself.
对于每个情况下，您有一个单一的正整数不少于45上线的本身。
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.
数学归纳法是一种证明与正整数有关的命题的极为有效的科学方法。
I print out — and this is only wrapping - because of the big font — I print out, "I demand that you give me a positive integer."
我打印出来——这个字符相互覆盖了，因为用的是大字体-，我打印：“我需要你给我一个正整数。”
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 问题。
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.
比较用来排序的两个参数。根据第一个参数小于、等于或大于第二个参数分别返回负整数、零或正整数。
The first line contains two integers: a positive integer n (0
第一行包含两个数：一个正整数n（0
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）的点荫度的几个上界。
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的网格中提取的列数。
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和本身)。
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之间的字母，后面为六个阿拉伯数字。
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，设计一个算法找出剩下数字组成的新数最小的删数方案。
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。
Otherwise, any positive or negative integer may be used to rank productions. Now we can run.
否则，任何正整数或负整数都可以用来对结果排序。
Otherwise, any positive or negative integer may be used to rank productions. Now we can run.
否则，任何正整数或负整数都可以用来对结果排序。
应用推荐