• The first line contains two integers: a positive integer n (0 <n <= 50) giving the length of the strings; and a positive integer m (0 number of strings.

    第一行包含两个数:一个正整数n(0<n<=50)表示字符串长度,一个正整数m(0个数。

    youdao

  • where n is an integer.

    此处 n是一个整数。

    youdao

  • Supply an integer, n, for the third argument to return only the first n matches; or supply -1 for all matches.

    给第三个参数提供整数n将只返回前 n 个匹配;或者提供-1 返回所有匹配。

    youdao

  • Each cell has a state, which you can think of as an integer between 0 and n. Listing 1 shows how to declare a cellular automaton universe in Java code.

    每个细胞都有一个状态,可以是0到n之间的任意整数。

    youdao

  • The Fibonacci numbers are an integer sequence where for a given number, the Fibonacci value can be calculated using: F(n) = F(n-1) + F(n-2).

    Fibonacci 数列是一种整数序列,可以使用以下算式计算各个 Fibonacci值:F(n) = F(n-1) + F(n-2)。

    youdao

  • Therefore, we should choose a large integer n.

    所以大家要选择大整数n。

    youdao

  • Therefore, we should choose a large integer n.

    所以大家要选择大整数n。

    youdao

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

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

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