代码搜索:编程问题
找到约 10,000 项符合「编程问题」的源代码
代码结果 10,000
www.eeworm.com/read/380188/9158180
pdf 烙饼问题.pdf
www.eeworm.com/read/380093/9165195
txt java问题.txt
www.eeworm.com/read/183353/9167234
doc 问题描述.doc
www.eeworm.com/read/183353/9167264
doc 问题描述.doc
www.eeworm.com/read/182772/9191612
c 背包问题.c
/* 0/1背包问题的分支定界法算法*/
#include
#include
#define MAXNUM 100
struct node{
int step;
int price;
int weight;
int max, min;
unsigned long po;
};
www.eeworm.com/read/181921/9226902
txt 迷宫问题.txt
#include"time.h"
#include "stdio.h"
#include "graphics.h"
#include "conio.h"
#define null 0
int a[11][15]={ {1,0,1,1,1,0,0,1,1,1,0,0,0,0,0},
{0,1,1,1,0,0,1,0,0,0,0,1,1,0,0
www.eeworm.com/read/378404/9232277
cpp 迷宫问题.cpp
#include
#include //文件输入/输出(文件流)
#include
using namespace std;
class TStatus
{
public:
int step,i,j,d;
TStatus *next;
void assign(int step=0, int i=0, in
www.eeworm.com/read/376627/9311662
c 灯塔问题.c
//灯塔问题
#include
#include
#include
int sz[11][11],cf=1,k,n,a[20],b[20],c[20];
void shuru(void);
void shuchu(void);
bool panduan(void);
void goujian(void);
vo
www.eeworm.com/read/376627/9311791
c 迷宫问题.c
#include
#define r 64
#define m2 8
#define n2 10
int m=m2-2,n=n2-2;
typedef struct
{
int x,y; //行列坐标
int pre;
}sqtype;
sqtype sq[r];
struct moved
{
int x, y; //坐标增量,取值-1
www.eeworm.com/read/375847/9348125
cpp 金币问题.cpp
#include
#include
int a[101][101]; //存储初始状态
int b[101][101]; //存储目标状态
int row[101]; //存储目标状态每一行的和
int s[101]; //调整列用到的状态数组
int n,m; //n 行 m 列
int MinMv; //最小