复赛1Word文件下载.docx
- 文档编号:21138342
- 上传时间:2023-01-27
- 格式:DOCX
- 页数:11
- 大小:16.40KB
复赛1Word文件下载.docx
《复赛1Word文件下载.docx》由会员分享,可在线阅读,更多相关《复赛1Word文件下载.docx(11页珍藏版)》请在冰豆网上搜索。
>
'
0'
theninc(ans,p);
k:
=k*10+ord(s[i])-48;
writeln(ansmod32749);
endit;
end.
2.f91
vari,n:
longint;
f.in'
f.out'
read(n);
whilen>
0do
ifn<
=100thenwriteln('
f91('
n,'
)='
91)
elsewriteln('
n-10);
3.H数问题
programex1(input,output);
constmark:
array[1..4]ofinteger=(2,3,5,7);
vari,h,k,n,order:
h.in'
reset(input);
h.out'
rewrite(output);
h:
=1;
order:
whileorder<
ndo
=h+1;
=h;
=1to4do
whilekmodmark[i]=0dok:
=kdivmark[i];
ifk=1thenorder:
=order+1
writeln(h);
close(output);
4.n的阶乘值问题
vara:
array[1..160]oflongint;
n,i,j,ans:
functionprime(n:
longint):
boolean;
vari:
ifn=1thenexit(false);
=2toround(sqrt(n))do
ifnmodi=0thenexit(false);
exit(true);
end;
test3.in'
test3.out'
fillchar(a,sizeof(a),0);
a[1]:
=2tondo
forj:
=1to159do
a[j]:
=a[j]*i;
ifa[j]>
=10then
a[j+1]:
=a[j+1]+a[j]div10;
=a[j]mod10;
ans:
=0;
=1to160do
=ans+a[i];
write(ans,'
'
ifprime(ans)thenwriteln('
T'
)
F'
5.N皇后问题
programzmc_151(input,output);
vara,b,c:
array[-100..100]ofboolean;
z:
array[1..100]ofinteger;
n,tot:
integer;
procedurewr;
vari:
=1tondowrite(z[i]:
5);
writeln;
inc(tot);
proceduretry(x:
integer);
=1tondo
if(a[i])and(b[i+x])and(c[i-x])then
z[x]:
=i;
a[i]:
=false;
b[i+x]:
c[i-x]:
ifx=nthenwr
elsetry(x+1);
=true;
fillchar(a,sizeof(a),#1);
fillchar(b,sizeof(b),#1);
fillchar(c,sizeof(c),#1);
word.in'
word.out'
readln(input,n);
try
(1);
iftot=0thenwriteln('
nosolute!
6.阿姆斯特朗数
constmaxlen=7;
vari,j,currentnumber,highest,sum,total:
digit:
array[0..maxlen+1]ofinteger;
power:
array[0..9,0..maxlen]oflongint;
arms.out'
=0to9do
power[i,0]:
=1tomaxlendopower[i,j]:
=power[i,j-1]*i
=1tomaxlendodigit[i]:
digit[3]:
highest:
=3;
currentnumber:
=100;
total:
whiledigit[maxlen+1]=0do
sum:
=1tohighestdosum:
=sum+power[digit[i],highest];
ifsum=currentnumber
thenbegintotal:
=total+1;
write(currentnumber:
maxlen+5);
iftotalmod6=0thenwritelnend;
digit[1]:
=digit[1]+1;
i:
whiledigit[i]=10do
begindigit[i+1]:
=digit[i+1]+1;
digit[i]:
=i+1end;
ifi>
highestthenhighest:
=currentnumber+1
7.比身高
programnum;
var
a:
array[1..1000]ofinteger;
n,i,j,t1,t2,sum:
num.in'
num.out'
readln(a[i]);
t1:
=1toi-1do
ifa[i]<
a[j]
theninc(t1);
t2:
=i+1tondo
theninc(t2);
ift1=t2
theninc(sum);
writeln(sum);
8.纯粹化信息
array['
A'
..'
Z'
]ofboolean;
temp:
char;
PD:
BOOLEAN;
krunch.in'
krunch.out'
fillchar(a,sizeof(a),true);
A['
]:
=FALSE;
E'
I'
O'
U'
='
;
whilenot(eoln)do
read(temp);
=((temp='
)and(temp<
s[length(s)]))OR((TEMP<
)AND(temp<
'
.'
?
)and(A[TEMP]))or((temp='
)or(temp='
));
ifPDthenbegins:
=s+temp;
IF(TEMP<
)and(temp<
)THENa[temp]:
=1tolength(s)do
if((s[i]='
)or(s[i]='
))and(s[i-1]='
)thendelete(s,i-1,1);
ifs[1]='
thendelete(s,1,1);
ifs[length(s)]='
thendelete(s,length(s),1);
writeln(s);
9.打印日历
constmonth:
array[1..12]ofstring[10]
=('
Janu'
Fabr'
Marc'
Apri'
May'
June'
July'
Augu'
Sept'
Octo'
Nove'
Dece'
day:
array[0..6]ofstring[10]
SUN'
MON'
TUE'
WEN'
THU'
FRI'
SAT'
vari,j,k,y,first:
ds,ts:
array[1..12]oflongint;
cal.in'
readln(y);
first:
=(y+(y-1)div4-(y-1)div100+(y-1)div400)mod7;
ds[1]:
=31;
ds[2]:
=28;
ds[3]:
ds[4]:
=30;
ds[5]:
ds[6]:
ds[7]:
ds[8]:
ds[9]:
ds[10]:
ds[11]:
ds[12]:
if(ymod400=0)or(ymod4=0)and(ymod100<
0)theninc(ds[2]);
ts[1]:
=first;
=2to12dots[i]:
=ts[i-1]+ds[i-1];
cal.out'
write('
:
3);
=1to12dowrite(month[i]:
6);
=1to3do
=0to6do
write(day[j]);
fork:
=1to12do
if(i-1)*7+j+1-ts[k]mod7>
=1
thenwrite((i-1)*7+j+1-ts[k]mod7:
3)
elsewrite('
if(i+2)*7+j+1-ts[k]mod7<
=ds[k]
thenwrite((i+2)*7+j+1-ts[k]mod7:
close(output)
10.到天宫做客
programheaven;
constday:
array[1..11]oflongint
=(31,29,31,30,31,30,31,31,30,31,30);
vari,j,n,m,d,t,max:
array[1..367]ofboolean;
heaven.in'
heaven.out'
fillchar(s,sizeof(s),false);
s[367]:
read(m,d);
{writeln(m,'
d);
}
t:
=1tom-1dot:
=t+day[j];
=t+d;
s[t]:
max:
=1to367do
ifs[i]then
ifi-t-1>
maxthenmax:
=i-t-1;
=i
writeln((max*24*60*60+183)div366);
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 复赛