代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/486654/6524520
cpp 1018.cpp
/* This Code is Submitted by wywcgs for Problem 1018 on 2005-12-26 at 15:54:05 */
#include
#include
#include
using namespace std;
const int MAX = 5120;
const int
www.eeworm.com/read/484555/6579703
c clrange.c
/***************************************************************
*
* Range find based closest point finding
*
* Code
*
* Author: Jan Kybic
*
* Language: C
*
* 25/11/96
*
**********
www.eeworm.com/read/482399/6624185
cpp railqk.cpp
#include
class queue;
class node
{
friend queue;
public:
int data;
node *next;
};
class queue
{
node *first,*tail;
public:
int top,last;
queue() {first=0;tail=0;top=0;}
www.eeworm.com/read/482399/6624215
cpp rail.cpp
#include
#include
#include
using namespace std;
int solve(queue in,queue &from,queue &to,int n,int k)
{
stack *s=new stack[k];
int i,j,temp1,te
www.eeworm.com/read/481966/6633729
cpp 1121.cpp
/* This Code is Submitted by wywcgs for Problem 1121 on 2005-12-11 at 16:30:38 */
#include
#include
#include
#include
using namespace std;
const int MAX = 1
www.eeworm.com/read/481966/6633819
cpp 1018.cpp
/* This Code is Submitted by wywcgs for Problem 1018 on 2005-12-26 at 15:54:05 */
#include
#include
#include
using namespace std;
const int MAX = 5120;
const int
www.eeworm.com/read/480344/6672756
cpp sy7.cpp
#include
using namespace std;
//***********检查位置是否合法的函数Place(int k,int *x)*****************
bool Place(int k,int *x)
{
for(int i=1;i
www.eeworm.com/read/476996/6744073
cpp eightpuzzle.cpp
#include
#include
using namespace std;
static const char fINP[] = "EightPuzzle.INP";
static const char fOUT[] = "EightPuzzle.OUT";
static const int dx[4] = {-1, 0, 1,
www.eeworm.com/read/410353/11292181
c quc.c
/*************************************************************************/
/* */
/* Copyright (c) 1993-1998 Accelerated
www.eeworm.com/read/409089/11358526
c messagetimers.c
/*
Timer Message Example
This example shows:
1. A task that waits on a message queue for information or a timeout.
2. Shows how to build messages that contain data
3.