代码搜索：deep
找到约 2,600 项符合「deep」的源代码
代码结果 2,600
www.eeworm.com/read/185374/9041282
h mainpage.h
/**
* \mainpage The official libmtp documentation
*
* \section Introduction
*
* libmtp is a library for the Media Transfer Protocol (MTP)
* under various POSIX operating systems.
*
* \section
www.eeworm.com/read/280177/10350245
txt 八数码问题程序.txt
// wangdan_qifashi.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
#include
using namespace std;
#define SIZE 10
www.eeworm.com/read/348596/10882351
txt 1987.txt
#include"stdio.h"
#include"algorithm"
using namespace std;
long use[16];
long father[40010];
long queue[40010];
long lchild[40010][16];
long rchild[40010][16];
long sum[40010][16];
www.eeworm.com/read/348596/10883226
txt 1741.txt
#include"stdio.h"
#include"algorithm"
using namespace std;
long use[14];
long lchild[10010][14];
long rchild[10010][14];
long sum[510010][14];
long depth[10010][14];
long value[1
www.eeworm.com/read/416180/11038573
txt output.txt
deep 4
distance 0
estimate value 4
manipulate :
ULDR
2 8 3
1 4
7 6 5
2 3
1 8 4
7 6 5
2 3
1 8 4
7 6 5
1 2 3
8 4
7 6 5
1 2 3
8 4
7 6 5
opentable
www.eeworm.com/read/455590/7369793
cpp p1694.cpp
#include
#include
using namespace std;
const int MAXN = 210;
int g[MAXN],gl[MAXN];
int a[MAXN][MAXN];
int M,deep;
int dfs(int lv,int r){
if(g[r] == 0) return 1;
int t[MAXN];
www.eeworm.com/read/452050/7449051
cpp 2288624_ac_0ms_28k.cpp
#include
#define MAXN 101
struct node
{
int f,m;
int sex;
int deep1,deep2;
}vert[MAXN];
int temp[MAXN];
void find1(int i)
{
if(vert[i].f==i&&vert[i].m==i)
return;
if(vert[
www.eeworm.com/read/448932/7521777
cpp 4803274_wa.cpp
#include
using namespace std;
int n;
int map[22][22];
int sum,result;
bool used[22];
int get_it()
{
int re=sum,i,j;
for(i=0;i
www.eeworm.com/read/448932/7521778
cpp 4803307_ac_1250ms_280k.cpp
#include
using namespace std;
int n;
int map[22][22];
int sum,result;
bool used[22];
int get_it()
{
int re=sum,i,j;
for(i=0;i
www.eeworm.com/read/448932/7521780
cpp 4803186_wa.cpp
#include
using namespace std;
int n;
int map[22][22];
int sum,result;
bool used[22];
int get_it()
{
int re=sum/2,i,j;
for(i=0;i