Search - n2-1 - CodeBus

Search - n2-1 - List

[JSP/Java] student DL : 0: Question 1 a) Determine the smallest number for a group of three numbers. Example: n1 = 5, n2 = 6 and n3 = 3 b) Count the number of positive integers from an array named numbers which has six elements. c) Convert x seconds into its equivalent value in minutes and seconds, where x is an integer number. For instance if x = 3625, then the output will be displayed as follows: 60 minutes and 25 seconds-Question 1 a) Determine the smallest number for a group of three numbers. Example: n1 = 5, n2 = 6 and n3 = 3 b) Count the number of positive integers from an array named numbers which has six elements. c) Convert x seconds into its equivalent value in minutes and seconds, where x is an integer number. For instance if x = 3625, then the output will be displayed as follows: 60 minutes and 25 seconds
Date : 2026-01-08 Size : 1kb User : hasan
[JSP/Java] l10 DL : 0: 卷积计算器，计算x(n)=1(0<=n<=N1),y(n)=0.5*n(0<=n<=N2)相卷积的结果，其中两者长度可调，并绘制出图像，计算最大值-Paint a convolution picture and find out the maximum value.
Date : 2026-01-08 Size : 20kb User : zhangcheng
[JSP/Java] sy5 DL : 0: 求n（奇数）阶幻方。n阶幻方是n×n的方阵，填入1～n2各数，使得该方阵的各行各列、对角线元素的和都相等。-Find n (odd) order magic square. magic square of order n is the n × n square, fill in the 1 ~ n2 the number, making the square of each row of the column, and diagonal elements are equal.
Date : 2026-01-08 Size : 4kb User : Kerwin_Li