代码搜索：repeat
找到约 6,690 项符合「repeat」的源代码
代码结果 6,690
www.eeworm.com/read/188596/8525693
cpp 118.cpp
#include
long repeat(int m,int b[] )
{
long a;
scanf("%d",&a);
if(a==0)
{
b[0]=9;
}
m--;
if(m==0)
return a%9;
else
return ((a%9)*(1+repeat(m,b)%9))%9;
}
int
www.eeworm.com/read/288162/8649814
vwf gen_1mhz.vwf
/*
WARNING: Do NOT edit the input and output ports in this file in a text
editor if you plan to continue editing the block that represents it in
the Block Editor! File corruption is VERY likely to
www.eeworm.com/read/385171/8815366
pas max_flow.pas
const
maxn=30;
type
nodetype=record
l{标号标志,为前继节点,>0为相前路,
www.eeworm.com/read/383734/8922577
txt 算法.txt
求两个数的的公约数：
while n≠0 do
r=m mod n
m=n
n=r
return m
顺序查找
sequentiasearch(A[0...n-1],k)
i=0
while i
www.eeworm.com/read/184327/9109432
pas ac1191.pas
program tju1191;
const
maxt=1100;
maxw=101;
var
score:array[0..maxt,-1..maxw]of longint;
w,h,a,b,c,d,m,time:longint;
begin
repeat
fillchar(score,sizeof(score),0);
read(w,h)
www.eeworm.com/read/184327/9109585
pas ac1108.pas
program tju1108;
const
maxn=100000;
var
a,b:array[0..maxn+1]of longint;
n,i,x,ans,l,r:longint;
begin
repeat
read(n);
for i:=1 to n do begin
read(x);b[x]:=i;
end;
www.eeworm.com/read/184327/9109621
pas ac1175.pas
program tju1175;
const
maxwords=10000;
var
w:array[1..maxwords]of string;
a,pre:array[1..maxwords]of word;
last:array[0..26]of word;
t,u,n,i,l,r,m:longint;
s1,s2:ansistring;
c:c