代码搜索：MAXQ
找到约 72 项符合「MAXQ」的源代码
代码结果 72
www.eeworm.com/read/266529/11221024
cpp automatic_naive.cpp
#include
#include
#include
#include
#include
using namespace std;
#define MAXN 10000
#define MAXQ 1000
string dict[MAXN];
void asser
www.eeworm.com/read/410189/6276727
cpp mou.cpp
/*
Alfonso2 Peterssen
17 - 6 - 2008
IOI 2005 "Mountains"
Very Nice Tree
*/
#include
#include
using namespace std;
const int
MAXQ = 100005,
UNUSED = -(1
www.eeworm.com/read/241438/13144288
h seldefbst.h
// binaty serch tree defined by myself
# ifndef SELF_DEFINE_BST
# define SELF_DEFINE_BST
#include
using namespace std;
template
class Queue
{
public:
Queue(int MaxQ
www.eeworm.com/read/252835/12261510
cpp graphopr.cpp
#include
#include
#define MAX 20
#define MAXQ 100
typedef struct ArcNode
{
int vex;
struct ArcNode *next;
}ArcNode,*ptrnode,ArcList[MAX];
typedef struct
{
int *
www.eeworm.com/read/484448/1270016
lua musicasyncloadimage.luac.lua
-- Decompiled using luadec 0.7 by sztupy (http://winmo.sztupy.hu)
-- Command line was: -l ;;;;;;; 3501013c_manila.luac
require("class")
require("io_svc")
ListImageLoaderClass = class()
gn_MaxQ
www.eeworm.com/read/410189/6276703
cpp farmer.cpp
/*
Alfonso2 Peterssen
6 - 10 - 2007
IOI 2004 "Farmer"
*/
#include
#include
using std::sort;
const int
MAXQ = 160000,
MAXFS = 2000;
int T, Q, S, F;
int su
www.eeworm.com/read/13898/285659
asm decoder.asm
; decoder.asm
; Decoding a DTMF tone with Goertzel Algorithm
; specify module and ROM routine definition files
$include (maxq20ms10xf.inc)
$include (utilityrom.inc)
; MCNT control bits
MSI
www.eeworm.com/read/347503/3171629
d range.d
#objdump:-dw
#name: limit checks for maxq immediate data
.*: +file format .*
Disassembly of section .text:
0+000 :
0: ff 0b [ ]*MOVE PFX\[0\], #ffh
2: ff 09 [ ]*MOVE A\[0\], #ffh
www.eeworm.com/read/447738/1697732
d range.d
#objdump:-dw
#name: limit checks for maxq immediate data
.*: +file format .*
Disassembly of section .text:
0+000 :
0: ff 0b [ ]*MOVE PFX\[0\], #ffh
2: ff 09 [ ]*MOVE A\[0\], #ffh
www.eeworm.com/read/446049/7586467
pas sap.pas
{
ID: reiny3
PROG: ditch
LANG: PASCAL
}
uses math;
const
FILI = 'ditch.in'; FILO = 'ditch.out';
INF = Trunc(2E9);
MaxN = 2000; MaxV = MaxN; MaxQ = MaxV;
type
TIndex = Longint;