代码搜索：Byte
找到约 10,000 项符合「Byte」的源代码
代码结果 10,000
www.eeworm.com/read/130455/14193472
cpp sapphire.cpp
// sapphire.cpp -- modified by Wei Dai from:
/* sapphire.cpp -- the Saphire II stream cipher class.
Dedicated to the Public Domain the author and inventor:
(Michael Paul Johnson). This cod
www.eeworm.com/read/130455/14193500
h cryptlib.h
// cryptlib.h - written and placed in the public domain by Wei Dai
// This file contains the declarations for the abstract base
// classes that provide a uniform interface to this library.
#ifn
www.eeworm.com/read/130349/14197009
frm form1.frm
VERSION 5.00
Object = "{F9043C88-F6F2-101A-A3C9-08002B2F49FB}#1.2#0"; "ComDlg32.OCX"
Begin VB.Form Form2
Caption = "打开BMP图片"
ClientHeight = 7230
ClientLeft = 60
www.eeworm.com/read/130077/14209046
h buffer.h
/*! \file buffer.h \brief Multipurpose byte buffer structure and methods. */
//*****************************************************************************
//
// File Name : 'buffer.h'
// Title
www.eeworm.com/read/231698/14223056
cpp string.cpp
#include "StdAfx.h"
#include "String.h"
CString Data2HexString ( char *data, int size, int nBytesPerLine/*=16*/ )
{
CString csHexString, csTemp;
for ( int i=0; i
www.eeworm.com/read/231652/14224626
pas ac1145.pas
program ural1145;
const
size=1000;
qsize=50000;{I'm not sure how large the queue can be at most.
With this number I got AC with 989KB memory, while the limit
is
www.eeworm.com/read/231652/14224636
pas ac1174.pas
program ural1174;
const
maxn=100;
maxdigit=200;
var
p:array[1..maxn]of byte;
n,i,j,x,d:byte;
ans:array[0..maxdigit]of integer;
procedure mul(x:byte);
var
i:byte;
begin
www.eeworm.com/read/231652/14224639
pas ac1158.pas
program ural1158;
const
maxn=50;
maxp=10;
maxl=10;
maxnodes=maxl*maxp+1;
base=1000000000;
type
bignum=array[-1..10]of longint;
var
alphabet:string;
child:array[1..maxnodes,1
www.eeworm.com/read/231652/14224671
pas ac1129.pas
program ural1129;
const
maxn=100;
var
l:array[1..maxn]of byte;
list:array[1..maxn,1..maxn]of byte;
color:array[1..maxn,1..maxn]of char;
o:array[1..maxn]of boolean;
n,i,j:byte;
pro
www.eeworm.com/read/231652/14224722
pas ac1127.pas
program ural1127;
const
colors=10;
num:array['A'..'Z']of byte=(1,2,3,0,0,0,4,0,0,0,0,0,0,0,5,0,0,6,7,0,0,8,9,0,10,0);
var
count:array[1..colors,1..colors,1..colors,1..colors]of word;
n,i