代码搜索：until
找到约 4,232 项符合「until」的源代码
代码结果 4,232
www.eeworm.com/read/246404/12728948
pas ac1022.pas
program tju1022;
var
d:array[0..19]of byte;
s:string;
n,t,l,a,b,i:integer;
procedure getstr(var s:string;e:char);
var
c:char;
begin
s:='';
repeat
read(c);
www.eeworm.com/read/246404/12728951
pas ac1079.pas
program tju1079;
var
r:byte;
c:char;
begin
repeat
r:=0;
repeat
read(c);
r:=(r+ord(c)) mod 3;
until seekeoln;
readln;
if r=0 then
writeln('King
www.eeworm.com/read/246404/12728984
pas ac1067.pas
program tju1067;
var
count:array[0..9]of int64;
n,k:int64;
r,i:byte;
s:string;
begin
repeat
fillchar(count,sizeof(count),0);
read(n);k:=1;
repeat
r:=n mod 10;
www.eeworm.com/read/246404/12729011
pas ac1009.pas
program tju1009;
var
n,i,j:byte;
begin
repeat
read(n);
for i:=1 to n do
for j:=i to n do begin
write(j*(j+1) div 2-i+1);
if j=n then writeln else write(' ');
www.eeworm.com/read/246404/12729080
pas ac1095.pas
program tju1095;
const
maxn=100;
tail:array[0..9]of byte=(6,6,2,6,4,4,4,8,4,6);
var
a:array[0..maxn]of byte;
i,l,five,ans:byte;
s:string;
begin
repeat
readln(s);l:=length(s);
www.eeworm.com/read/246404/12729173
pas ac1093.pas
program tju1093;
const
maxn=2004;
var
x,y,l:array[0..maxn]of cardinal;
n,i,ans:cardinal;
procedure qsort(s,t:cardinal);
var
p,i,j,tx,ty:cardinal;
begin
if s>=t then exit;
www.eeworm.com/read/246404/12729178
pas ac1078.pas
program tju1078;
const
maxsize=20;
var
qx,qy:array[1..sqr(maxsize)]of byte;
step:array[1..maxsize,1..maxsize]of byte;
count:array[1..maxsize,1..maxsize]of qword;
n,m,p,c,i,j,t,f,r:wor
www.eeworm.com/read/145250/12743297
tny test1.tny
true false or and not
int bool char while do
if then else repeat until
read write , ; :=
+ - * / (
) < = > = a2c 123 'EFG'
www.eeworm.com/read/144798/12772228
asm pdown.asm
;********************************************************************
;
; Author : ADI - Apps www.analog.com/MicroConverter
;
; Date : August 2003
;
; File :
www.eeworm.com/read/139528/13150951
pas ave.pas
//求平均数
sum:=0;
s2:=4;
n:=0;
average:=0;
repeat
read x;
sum:=sum+x;
n:=n+1
until x=0; //输入0结束输入
if 1