代码搜索：until
找到约 4,232 项符合「until」的源代码
代码结果 4,232
www.eeworm.com/read/455782/7365625
rpt sdf.flow.rpt
Flow report for sdf
Mon Apr 13 21:25:42 2009
Quartus II Version 8.0 Build 215 05/29/2008 SJ Full Version
---------------------
; Table of Contents ;
---------------------
1. Legal Notice
www.eeworm.com/read/455782/7365633
rpt sdf.map.rpt
Analysis & Synthesis report for sdf
Mon Apr 13 21:25:42 2009
Quartus II Version 8.0 Build 215 05/29/2008 SJ Full Version
---------------------
; Table of Contents ;
---------------------
1
www.eeworm.com/read/450999/7474063
pas rostr6.pas
var s:string;
n:integer;
begin
write('s=');
readln(s);
repeat
n:=pos(' ',s);
if n0 then delete(s,n,1);
until n=0;
write(s);
readln;
end.
www.eeworm.com/read/246404/12727371
pas ac1138.pas
program tju1138;
const
maxterms=1000;
type
term=record factor,index:longint;end;
formula=array[1..maxterms]of term;
var
a,b,c:formula;
p,la,lb,lc,i,j:longint;
s:ansistring;
fir
www.eeworm.com/read/246404/12727588
pas ac1113.pas
program tju1113;
var
n,k,m,t,i:word;
begin
repeat
read(n,k);
if n=0 then break;
m:=0;
repeat
inc(m);t:=1;
for i:=2 to n do begin
t:=(m+t) mod i;
www.eeworm.com/read/246404/12727608
pas ac1190.pas
program tju1190;
const
maxn=400;
level:array[1..9]of longint=(0,500,2000,5000,20000,40000,60000,80000,100000);
var
pay:array[1..maxn,1..12]of longint;
m,i,j,t:longint;
sum:real;
c:
www.eeworm.com/read/246404/12727715
pas ac1141.pas
program tju1141;
const
maxn=49;
var
count:array[0..maxn]of qword;
i,x,y,z:shortint;
function h(a:qword;b:byte):qword;
var
i:byte;
begin
h:=1;
for i:=1 to b do
h
www.eeworm.com/read/246404/12727735
pas ac1112.pas
program tju1112;
var
n,t:longint;
function rem(n:longint):longint;
begin
if n=1 then
rem:=1
else if odd(n) then
rem:=rem(n shr 1)*2+1
else
rem:=rem(n shr 1)
www.eeworm.com/read/246404/12727847
pas ac1138.pas
program tju1138;
const
maxterms=1000;
type
term=record factor,index:longint;end;
formula=array[1..maxterms]of term;
var
a,b,c:formula;
p,la,lb,lc,i,j:longint;
s:ansistring;
fir
www.eeworm.com/read/246404/12728056
pas ac1113.pas
program tju1113;
var
n,k,m,t,i:word;
begin
repeat
read(n,k);
if n=0 then break;
m:=0;
repeat
inc(m);t:=1;
for i:=2 to n do begin
t:=(m+t) mod i;