给定一个正整数，输出其补数。
一个正整数号码长度不超过106。
Length is a positive integer number that does not exceed 106.
稀疏矩阵指数必须是正整数。
丢番图方程；正整数解；同余；递归序列。
Diophantine equation; Positive integer solution; congruence; Recurrent sequence.
本文论述了正整数的似二进制表示及其性质。
In the paper the similar binary representation and qualities of the positive integers are discussed.
每个大于1的正整数都能表示为素数的乘积。
Every positive integer greater than 1 can be expressed as the product of prime Numbers.
否则，任何正整数或负整数都可以用来对结果排序。
Otherwise, any positive or negative integer may be used to rank productions. Now we can run.
精度必须是小于53的正整数；如果不是，就会出错。
The precision must be a positive number less than 53; if it isn't, you get an error.
在算数中，曾经正整数和正分数能够满足所有的需求。
In arithmetic the positive integer and the positive fraction were sufficient for all requirements.
我们如何能给一个文本框，其中只有正整数可以验证？
How can we give validation for a text box in which only positive integers are allowed?
请求出所有不能表示成两个充足数的和的正整数的和。
Find the sum of all the positive integers which cannot be written as the sum of two abundant Numbers.
证明了连续正整数的立方和为素数或素数方幂仅有惟一解。
On the prime powers in sums of squares of three consecutive positive integers;
数学归纳法是一种证明与正整数有关的命题的极为有效的科学方法。
Mathematical induction is a positive integer proved extremely relevant to the topic of effective scientific methods.
给出了用其整系数线性组合表示两个正整数的最大公约数的计算机程序。
A computer program for expressing the greatest common divisor of two positive integers using their linear combination is given here.
本文主要研究图的基本群的正规子群的指数何时成为任意正整数的条件。
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 member of any of the further sets of mathematical objects, such as negative integers and real Numbers, that can be derived from the positive integers by induction.
给出一个正整数和负整数组成的立方体，找出其中具有最大和的子立方体。
Given a cube of positive and negative integers, find the sub-cube with the largest sum. The sum of a cube is the sum of all the elements in that cube.
在这个问题中，二叉树的每个节都值都为正整数，且每棵树的节点数都小于256。
In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.
给定一个无重复的正整数数组，计算得到一个目标正整数的所有可能组合方式的个数。
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.
大楼中只有一个电梯，请求序列有N个正整数组成，数字表示电梯将在哪里停，按照顺序。
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers.
对于给定的n位正整数a和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。
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.
题目：输入一个正整数数组，将它们连接起来排成一个数，输出能排出的所有数字中最小的一个。
For each test case, output the minimum number we can get after no more than M operations.
Rhino将典型的有索引的数组作为一种特殊的联合数组来对待：它们只是一些关键字是正整数的联合数组。
Rhino treats typical indexed arrays as special kinds of associative arrays. They just happen to be associative arrays with positive integers as keys.
我们来回顾一下分类器的要求：对于任何大于1的正整数，必须将其归为以下几个类别：完全数、过剩数或亏数。
Recapping the classifier's requirements: Given any positive integer greater than 1, you must classify it as perfect, abundant, or deficient.
输入以一个正整数开始，它占一行，本身代表的是下面这种情形的数目，每一个都按下面的要求描述。
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.
因此，如果文本匹配了整个模式，第一组括号将生成表示一个正整数或负整数的的字符串，例如+49。
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.
比较用来排序的两个参数。根据第一个参数小于、等于或大于第二个参数分别返回负整数、零或正整数。
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.
比较用来排序的两个参数。根据第一个参数小于、等于或大于第二个参数分别返回负整数、零或正整数。
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.
应用推荐