代码搜索：until
找到约 4,232 项符合「until」的源代码
代码结果 4,232
www.eeworm.com/read/400782/11568603
pl0 e013.pl0
PROGRAM EX01;
VAR A,B,C:INT;
BEGIN
C:=9;
A:=0;
B:=2;
REPEAT
A:=A+1;
UNTIL A=10;
FOR A:=10 DOWNTO 1
DO
B:=100;
FOR A:=1 TO 10
DO
C:=10
www.eeworm.com/read/339554/12225303
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/339554/12225385
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/339554/12225393
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/339554/12225438
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/339554/12225446
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/339554/12225468
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/339554/12225472
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/339554/12225506
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/339554/12225527
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(' ');