代码搜索：移相法
找到约 10,000 项符合「移相法」的源代码
代码结果 10,000
www.eeworm.com/read/482925/6616251
dsw 迭代回溯法.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/482925/6616252
opt 迭代回溯法.opt
www.eeworm.com/read/482925/6616253
plg 迭代回溯法.plg
Build Log
--------------------Configuration: 迭代回溯法 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\ADMINI~
www.eeworm.com/read/482925/6616254
pdb 迭代回溯法.pdb
www.eeworm.com/read/482925/6616256
obj 迭代回溯法.obj
www.eeworm.com/read/482925/6616257
exe 迭代回溯法.exe
www.eeworm.com/read/482925/6616258
ncb 迭代回溯法.ncb
www.eeworm.com/read/482925/6616259
cpp 迭代回溯法.cpp
#include
#include
#include
using namespace std;
class Queen
{
public:
Queen(int n)
{
size=n;
x=new int[size+1];
sum=0;
}
bool place(int row)
www.eeworm.com/read/482925/6616260
dsp 迭代回溯法.dsp
# Microsoft Developer Studio Project File - Name="迭代回溯法" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Con
www.eeworm.com/read/482386/6623793
txt 高斯消去法.txt
#include
#include
using namespace std;
int main()
{
int i,j,n,k;
// float A[n][n],m[n-1],B[n],x[n];
float A[500][500],m[500],B[300],x[300];
while(1)
{