代码搜索：Byte
找到约 10,000 项符合「Byte」的源代码
代码结果 10,000
www.eeworm.com/read/493718/6389230
pas ac1089.pas
program ural1089;
const
maxwords=100;
var
dict:array[1..maxwords]of string[8];
words:byte;
mis:integer;
s:string;
procedure processline(s:string);
var
w:string;
procedure
www.eeworm.com/read/493718/6389285
pas ac1088.pas
program ural1088;
var
d,e,f,h,s,i:byte;
dp,ep,m:longint;
function max(a,b:byte):byte;
begin
if a>b then max:=a else max:=b;
end;
begin
readln(d,e,f,dp,ep,h);
s:=(f-d)+(f-e);
www.eeworm.com/read/493718/6389297
pas ac1091.pas
{This prog will fail when s reaches 60. Luckily, the limit is 50}
program ural1091;
var
k,s,i:byte;
ans:longint;
function prime(x:byte):boolean;
var
i:byte;
begin
for i:=2 to
www.eeworm.com/read/493718/6389303
pas ac1077.pas
program ural1077;
const
maxn=200;
maxt=(maxn-1)*(maxn-2) shr 1;
var
map:array[1..maxn,1..maxn]of boolean;
lv:array[1..maxn]of byte;
path:array[1..maxn,1..maxn]of byte;
n,m,i,x,y,s:
www.eeworm.com/read/493719/6389322
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/493719/6389326
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/493719/6389327
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/493719/6389340
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/493719/6389361
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
www.eeworm.com/read/493719/6389367
pas ac1156.pas
program ural1156;
const
maxn=50;
type
solution=set of 1..maxn*2;
var
g:array[1..maxn*2,1..maxn*2]of boolean;
l:array[1..maxn*2]of byte;
ok,newok:array[0..maxn]of boolean;
way,neww