因此，如果文本匹配了整个模式，第一组括号将生成表示一个正整数或负整数的的字符串，例如+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.
您还可以编写代码，用一个正整数的因子来确定它是否为素数(定义为大于1的整数，该数字仅有的因子为1和本身)。
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).
否则，任何正整数或负整数都可以用来对结果排序。
Otherwise, any positive or negative integer may be used to rank productions. Now we can run.
第一行包含两个数：一个正整数n（0
The first line contains two integers: a positive integer n (0
为了判断整数是否为拟亲和数，文章在讨论费玛数和数论函数性质的基础上，找到了一种验证一个整数是否是拟亲和数的方法，从而证明了费玛数不与其他正整数构成拟亲和数对的结论。
In this paper, we find out a kind of method of verifying whether an integer is quasi-amicable or not, and prove the Fermat numbers are never perfect or part of an quasi-amicable pair.
比较用来排序的两个参数。根据第一个参数小于、等于或大于第二个参数分别返回负整数、零或正整数。
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.
特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。
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.
数更多的数学集合中的一元，如负整数或实数，通过归纳正整数而得出。
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 an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
给出一个正整数和负整数组成的立方体，找出其中具有最大和的子立方体。
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.
原子核的幻数已被大量实验所证明是一系列的正整数，如有2，8，20，28，50，82，126等，但从理论上推导这些整数的存在并不是轻易的事情。
It has been proved by a great deal of experiments that the magic number of nuclei is a series of positive integers, such as 2,8,20,28,50,82,126, etc.
对于给定的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.
对于给定的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.
应用推荐