Search - n2-1 - CodeBus

Search - n2-1 - List

[Other] N2 DL : 0: n皇后问题（c++编写）-n Queen (c preparation)
Date : 2026-01-09 Size : 2kb User : 朱阳林
[Other] 128bitminus DL : 0: 128乘法模拟器 c M位乘N位不带符号整数的阵列乘法中加法---移位操作的被加数矩阵.每一部分乘积项ab叫做一个被加数.m*n个被加数可以用m*n个”与门”并行的产生. 以5位乘5位不带符号的阵列乘法器(m=n=5)为例(如下图): FA为一位全加器,FA的斜线方向为进位输出,竖线方向为和输出,而所有被加数项的排列和正常的A*B=P乘法过程中的被加数矩阵相同.图中用矩形围成的阵列中最后一行构成一个行波进位加法器,其时间延迟为(n-1)2T.当然,为了缩短加法时间,最后一行的行波进位加法器也可以用先行进位加法器来代替.这种乘法器实现n位×n位时,需要n(n-1)个全加器和n2个”与”门.-err
Date : 2026-01-09 Size : 46kb User : fred
[Other] puzz DL : 0: 重排九宫是一个古老的单人智力游戏。据说重排九宫起源于我国古时由三国演义故事 “关羽义释曹操”而设计的智力玩具“华容道”，后来流传到欧洲，将人物变成数字。原始的重排九宫问题是这样的：将数字1～8按照任意次序排在3´ 3 的方格阵列中，留下一个空格。与空格相邻的数字，允许从上，下，左，右方向移动到空格中。游戏的最终目标是通过合法移动，将数字1～8 按行排好序。在一般情况下，重排n2宫问题是将数字1～n2-1 按照任意次序排在n´ n的方格阵列中，留下一个空格。允许与空格相邻的数字从上，下，左，右 4 个方向移动到空格中。游戏的最终目标是通过合法移动，将初始状态变换到目标状态。
Date : 2026-01-09 Size : 1009kb User :
[Other] Snake2 DL : 0: 蛇形矩阵：生成一个按蛇形方式排列自然数1，2，3，4，5，……，N2的 (1<N≤10)阶方阵。-Snake-like matrix: generate a snake-like manner in accordance with natural numbers 1,2,3,4,5, ... ..., N2
Date : 2026-01-09 Size : 1kb User : alonso
[Other] 7 DL : 0: C语言：编写一个程序，检查所用的计算机系统的C编译在执行右移时是按照逻辑右移的原则，还是按照算术右移的原则进行操作。如果是逻辑右移，请编一个函数实现算术右移；如果是算术右移，请编一个函数实现逻辑右移。编一个函数getbits，从一个16位的单元中取出某几位（即该几位保留原值，其余位为0）。函数调用形式为：getbits(value，n1，n2)，其中value位该十六位数的值，n1为欲取出的起始位，n2位欲取出的结束位。（要求：把这几位数用八进制数打印出来。注意，应当将这几位数右移到最右端，然后用八进制形式输出。）-C language: write a program to check the computer systems used by the C compiler when shifted to the right in the implementation of the principle of logical right shift, or shifted to the right in accordance with the principles of arithmetic operations. If it is logically shifted to the right, please compile a function to achieve an arithmetic shift to the right if it is an arithmetic shift to the right, please compile a function to achieve the logical shift to the right.
Date : 2026-01-09 Size : 1kb User : peter
[Other] qishiyouliProblem DL : 0: C/c++实现著名“骑士游历问题”~ 【问题描述】给出一块具有n2个格子的n×n棋盘（如图3-14所示），一位骑士从初始位置(x0, y0)开始，按照“马跳日”规则在棋盘上移动。问：能否在n2? 1步内遍历棋盘上的所有位置，即每个格子刚好游历一次，如果能，请找出这样的游历方案来 -C/c++ to achieve the famous " knight tour problem" ~ 【】 given a problem description with a grid of n2 n × n board (as shown in Figure 3-14), a knight from the initial position (x0, y0) started , in accordance with the " horse jumping at" moving the board rules. Q: Can you step in the n2 ? 1 traverse the board in all locations, that is just the travel time for each grid, if possible, please find these travel programs
Date : 2026-01-09 Size : 1kb User : 肖煜东
[Other] matlabPBG DL : 0: matlab透射率随入射角变化的程序 na=2.10 nb=1.46 n1=1 n2=1 d=1064 for c5=0:0.5:90 c3=c5*pi/180 c1=asin(n1*sin(c3)/na) c2=asin(na*sin(c1)/nb) c4=asin(nb*sin(c2)/n2) d1=1064 a=d1/(4*na) b=d1/(4*nb) Ba=2*pi*na*a*cos(c1)/d Bb=2*pi*nb*b*cos(c2)/d f=4*pi*1e-7 e=1e-9/(36*pi) -matlab transmittance with the angle of incidence change program na = 2.10 nb = 1.46 n1 = 1 n2 = 1 d = 1064 for c5 = 0:0.5:90 c3 = c5* pi/180 c1 = asin ( n1* sin (c3)/na) c2 = asin (na* sin (c1)/nb) c4 = asin (nb* sin (c2)/n2) d1 = 1064 a = d1/(4* na ) b = d1/(4* nb) Ba = 2* pi* na* a* cos (c1)/d Bb = 2* pi* nb* b* cos (c2)/d f = 4* pi* 1e-7 e = 1e-9/(36* pi)
Date : 2026-01-09 Size : 10kb User : 汪
[Other] d2conv DL : 0: 二维信号卷积，若x为N1*M1的二维信号，y为N2*M2的二维信号，则卷积为(N1+N2-1)*(M1+M2-1)的信号-Two demension signal convolution.
Date : 2026-01-09 Size : 1kb User : raymond
[Other] Matlab-HW1 DL : 0: 信号与系统matlab作业，实现卷积操作，供学习信号与系统的同学们参考-1. Define two signals as: x1[n] =   n, 0 < n N1+1 2 N1 − n+ 1, N1+1 2 < n N1 0, elsewhere and x2[n] = 1, 0 < n N2 0, elsewhere We let N1 = 999 and N2 = 500. (a) (30 )Write a MATLAB function myconv to compute x1[n]x2[n] where denotes the convolution sum. You have to plot your result and attach it in your report. You may use the MATLAB function conv to check whether your result is correct.
Date : 2026-01-09 Size : 46kb User : onion
[Other] tide_uv DL : 0: 潮流准调和分析 Dd.m [DO1 dO1 DK1 dK1 DM2 dM2 DS2 dS2 DM4 dM4 DMS4 dMS4]=Dd(y,D,Y,tm,A1) 计算6个准调和分潮的振幅系数和初相角公式 aM.m [N n aa liu_u liu_v]=aM() 基础系数矩阵，目前D和d值是取用的各段数据的中间时间值，t是以中间为0左右对称取；视差潮龄A1需要预先得知同时本程序负责读取原始测流数据，格式为站位名称观测数据段数N（即大中小潮）第一段起始时间YYYY MM DD HH mm ss 第一段个数n1 speed direction speed direction ... 第二段起始时间 YYYY MM DD HH mm ss 第二段个数n2 speed direction speed direction ... 第三段起始时间 YYYY MM DD HH mm ss 第三段个数n3 speed direction speed direction ... UVg.m [U V Ug Vg]=UVg() 求调和常数U V和迟角Ug Vg Tuoyuan.m 计算各准调和分潮的椭圆要素W theta K k -The quasi harmonic analysis of tidal current Dd.m [DO1 dO1 DK1 dK1 DM2 dM2 DS2 dS2 DM4 dM4 DMS4 dMS4]=Dd (y, D, Y, TM, A1) calculation of 6 quasi harmonic division of amplitude and initial phase angle formula of the coefficient of tide AM.m [N n AA liu_u liu_v]=aM () foundation coefficient matrix, the current D and D values are the middle time of each section of data taken the value of T is in the middle for symmetric about 0 Age of parallax A1 need to know in advance At the same time, this program is responsible for reading the original flow measurement data, format for Site name The observation data segment number N (that is, in the low tide) The first section of the YYYY MM DD HH mm the starting time of SS The first section number N1 Speed direction Speed direction ... The second section starting time YYYY MM DD HH mm SS The second section number N2 Speed direction Speed direction ... The third section starting time YYYY MM DD HH mm SS The third section number
Date : 2026-01-09 Size : 32kb User : 帅阳
[Other] Debug DL : 0: 输入包含多个问题的实例。输入的第一行包含一个整数问题实例的数量。每个实例都包含一个单一的形式M N1 N2 N3线…nm M集与N1的整数…nm的整数。所有的整数是正躺在一个32位整数范围。每个问题的实例，输出一行包含相应的LCM。所有的结果都会躺在一个32位的整数范围。-Enter the instance contains multiple issues. The first line of input contains an integer number of problem instances. Each instance consists of a single line in the form of M N1 N2 N3 ... integer nm M set and N1, ... nm integer. All integers are lying a 32-bit integer range. Each instance of the problem, the output line contains the corresponding LCM. All results will be lying in a range of 32-bit integers.
Date : 2026-01-09 Size : 179kb User : 李顿名
[Other] A1002 DL : 0: pat advance level 1002 A+B for Polynomials-This time, you are supposed to find A+B where A and B are two polynomials. Input Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 ... NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < ... < N2 < N1 <=1000. Output For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place. Sample Input 2 1 2.4 0 3.2 2 2 1.5 1 0.5 Sample Output 3 2 1.5 1 2.9 0 3.2
Date : 2026-01-09 Size : 3.34mb User : Alice Lee
[Other] G DL : 0: 2．采用相邻矩阵表示一个有向图G，写一个算法确定G是否有一个漏(即入度为n-1，出度为0的顶点)，要求该算法的时间复杂度是o(n2)。-2. Using adjacency matrix represents a directed graph G, G wrote an algorithm to determine whether there is a leak (ie, the degree of n-1, a degree of a vertex is 0), the requirements of the algorithm time complexity is o (n2).
Date : 2026-01-09 Size : 1kb User : 郑小晴
[Other] sortcompare DL : 0: 问题描述基于教材内容，任选两种排序算法，实现并比较性能。基本要求（1）至少要有一种排序算法的性能优于O(n2) （2）对实现的排序算法进行实验比较，实验比较数据参见教材7.8。 -Problem descriptionBased on the teaching material content, choose two kinds of sort algorithm, and compare the performance. The basic requirements(1) should have at least a sorting algorithm performance is better than that of O (n2)(2) to realize the sorting algorithms are compared, and the experiment of see the comparative data of the experiment teaching material of 7.8.
Date : 2026-01-09 Size : 1kb User : 程悦
[Other] initialoy__status DL : 0: This file is the series of two groups of random gaussian distribution, the mean to 0, mean square error as the N2,
Date : 2026-01-09 Size : 501kb User : rdmviuq
[Other] 8puzzle DL : 0: 算法 Board类用来表示一个n?n的网格，其中有n2?1个方块，每个从1标记到n2?1，还有一个方块是空。这里提供了计算Hamming距离和Manhattan距离的方法。也提供了计算其“双胞胎”Board的方法。(there is nothing but a test)
Date : 2026-01-09 Size : 2kb User : hahaha2000
[Other] 2.2 DL : 0: 晶格振动（声子）和光的相互作用模型。使用计算机绘制100 cm-1 <ν<500 cm-1的以下图形。包括ε1和ε2对ν，n1和n2对ν，吸收光谱α（cm-1）对ν，反射谱R对ν，色散曲线（ω对k1）和ω对 k2。(a model for the interaction of lattice vibrations (phonons) and light. Use a computer to graph the following for 100 cm-1 to 500 cm-1 Include 1. Dielectric constant 2. refractive index 3. the absorption spectrum 4. the reflectivity spectrum 5. the dispersion curve)
Date : 2026-01-09 Size : 89kb User : lxjjj
[Other] guangbo DL : 0: 当光波由光疏介质进入到光密介质时，即n1<n2，随着入射角发生变化，其振幅反射系数、振幅反射率（透过率）强度反射率（透过率）和能流反射率（透过率）均会发生相应的变化。例子给出平面光波从空气（折射率n1=1）入射到石英玻璃中（折射率n2=1.45)时，用matlab作出p、s分量的振幅反射率和振幅透射率以及它们的绝对值随入射角度的变化曲线。(When the light waves from the light medium into the light medium, that is, n1<n2, as the incident angle changes, the amplitude reflection coefficient, the amplitude reflectivity (transmittance) intensity reflectivity (transmittance) and the energy flow reflectivity (transmittance) change correspondingly. In this example, when a plane light wave is incident from an air (refractive index n1=1) into a quartz glass (refractive index n2=1.45), the amplitude reflectivity and amplitude transmittance of the P, s components and their absolute values with the angle of incidence are calculated by MATLAB.)
Date : 2026-01-09 Size : 1kb User : lulu810
[Other] 菲涅尔系数计算Matlab DL : 0: 基于MATLAB软件，使用者在交互界面GUI上输入入射介质、反射介质的折射系数n1、n2，可算得不同入射角条件下线偏光/自然光的菲涅尔透反射系数及透反射比(Based on the MATLAB software, the user can input the refraction coefficients N1 and N2 of the incident medium and the reflecting medium on the GUI of the interactive interface, and calculate the Fresnel transmittance and reflectance of the line polarized light / natural light under different incident angle conditions)
Date : 2026-01-09 Size : 50kb User : 小王快写作业
[Other] N2Linewidth DL : 0: 大气分子的转动散射光谱计算，斯托克斯，反斯托克斯谱支，碰撞加宽和多普勒加宽(Rotational Raman spectrum of N2)
Date : 2026-01-09 Size : 3kb User : 很猪的AmyLee

« 12 »