代码搜索:全差分
找到约 10,000 项符合「全差分」的源代码
代码结果 10,000
www.eeworm.com/read/480097/1323061
txt 王敏-2.5分.txt
#include
#include
#include
#include
#include
#include
#include
long n;//棋盘的大小
int num;//可放置战车数
char * * chessBoar
www.eeworm.com/read/480097/1323063
txt 孙锋-6分.txt
#include
#include
#include
int n;
int *data;
void readData()
{
ifstream inStream;
inStream.open("input.txt");
if(!inStream)
{
cerr
www.eeworm.com/read/480097/1323067
txt 郑凌-4.5分.txt
//计算程序的最优存储方案
#include
#include
using namespace std;
float MinTime(int, float*, float*);
float MinTime(int n, float *l, float *p)
{
int i, j;
float a=0, b=0, *t;
www.eeworm.com/read/480097/1323068
txt 周恒-6分.txt
#include
#include
#include
char *x,*y,**b;
int **c;
ofstream fout("output.txt");
void LCSLength(int m,int n,char *x,char *y,int **c,char **b)
{
int i,j
www.eeworm.com/read/480097/1323070
txt 陈星娥-6分.txt
#include < iostream.h >
#include < fstream.h >
#include < stdio.h >
ofstream myoutf("output.txt"); //输出数据到文件,
void LISlength(int m,int * x,int * y);
void main()
{
int size; //定义序列的长度
i
www.eeworm.com/read/480097/1323075
txt 谢富平-6分.txt
#include < stdio.h >
#include < fstream.h >
#include < iostream.h >
ofstream myoutf("output.txt");
int Max_Sum(int m,int n, int * a)
{
if (n < m || m < 1) return 0;
int * b = new int[n +
www.eeworm.com/read/480097/1323080
txt 陈慧-5分.txt
/*矩阵特征值问题*/
/*本程序在vc++6.0上运行通过,并用 cl.exe 编译通过*/
#include
#include
void readfile(int&,int*&);
void fpshuzhu(int,int**&);
void matrix(int*,int,int**&);
int max(int,int,int)
www.eeworm.com/read/480097/1323085
txt 林政-5分.txt
//
//学号:040000103
//姓名:林政
//
#include < iostream.h >
#include < fstream.h >
#include < stdio.h >
ofstream out_file("output.txt"); //输出文件
int MaxSum(int n,int * a);
int MaxSum2(int m,int n,i
www.eeworm.com/read/480097/1323091
txt 董凌-3分.txt
#include
#include
#include
int n,e;
int** value;
int* temporder;
int calculate()
{
int leng=0;
for (int i=1;i
www.eeworm.com/read/327496/3455307
c 四分砝码.c
#include
#include
main()
{
int weight1,weight2,weight3,weight4,d1,d2,d3,d4,x,flag;
printf("The weight is broke up as following 4 pieces:");
for(weight1=1;weight1