Програмчлалын X онлайн тэмцээний бодлогын бодолтууд

"Орлуулга"

Хонгорын бодолт.

var n,k,p,i1:longint;
a,b:array[1..2000] of longint;
procedure qsort(m,l:longint);
var i,j,x,w:longint;
begin i:=m;j:=l;x:=a[(m+l) div 2];
repeat
while a[i]while a[j]>x do dec(j);
if i<=j then begin
w:=a[i];a[i]:=a[j];
a[j]:=w;inc(i);dec(j);
end;
Until i>j;
if mif iend;
begin
readln(n,k,p);
for i1:=1 to n do
read(a[i1]);
for i1:=1 to k-1 do
b[i1]:=a[i1];
for i1:=k+1 to n do
b[i1-1]:=a[i1];
for i1:=1 to n-1 do
a[i1]:=b[i1];
a[n]:=p;
qsort(1,n);
for i1:=1 to n do
write(a[i1],' ');
end.

"Үгийн сүлжээ"

wizards-ын бодолт

#include
#include
int main(){
int n,i,j,x1,x2,k,a[20],b[5],s1,s2,s3,s4;

char s[20][20];
scanf("%d",&n);
for (k=1;k<=n;k++){
a[k]=0;
for (i=1;i<=4;i++) {
scanf("%s",s[i]);
b[i]=strlen(s[i]);
}
s1=1; s2=2; s3=3; s4=4;
if (strlen(s[s1])==strlen(s[s2]) && strlen(s[s3])==strlen(s[s4])) {
x1=strlen(s[s1])-1;
x2=strlen(s[s3])-1;
for (i=0;i<=x1/2;i++)
for (j=0;j<=x2/2;j++){
if (s[s1][i]==s[s3][j] && s[s1][x1-i]==s[s4][j] &&
s[s2][i]==s[s3][x2-j] && s[s2][x1-i]==s[s4][x2-j]) {
a[k]=1;
}
if (s[s1][i]==s[s4][j] && s[s1][x1-i]==s[s3][j] &&
s[s2][i]==s[s4][x2-j] && s[s2][x1-i]==s[s3][x2-j]) {
a[k]=1;
}
if (s[s2][i]==s[s3][j] && s[s2][x1-i]==s[s4][j] &&
s[s1][i]==s[s3][x2-j] && s[s1][x1-i]==s[s4][x2-j]) {
a[k]=1;
}
if (s[s2][i]==s[s4][j] && s[s2][x1-i]==s[s3][j] &&
s[s1][i]==s[s4][x2-j] && s[s1][x1-i]==s[s3][x2-j]) {
a[k]=1;
}

}

}


s1=1; s2=3; s3=2; s4=4;
if (strlen(s[s1])==strlen(s[s2]) && strlen(s[s3])==strlen(s[s4])) {
x1=strlen(s[s1])-1;
x2=strlen(s[s3])-1;
for (i=0;i<=x1/2;i++)
for (j=0;j<=x2/2;j++){
if (s[s1][i]==s[s3][j] && s[s1][x1-i]==s[s4][j] &&
s[s2][i]==s[s3][x2-j] && s[s2][x1-i]==s[s4][x2-j]) {
a[k]=1;
}
if (s[s1][i]==s[s4][j] && s[s1][x1-i]==s[s3][j] &&
s[s2][i]==s[s4][x2-j] && s[s2][x1-i]==s[s3][x2-j]) {
a[k]=1;
}
if (s[s2][i]==s[s3][j] && s[s2][x1-i]==s[s4][j] &&
s[s1][i]==s[s3][x2-j] && s[s1][x1-i]==s[s4][x2-j]) {
a[k]=1;
}
if (s[s2][i]==s[s4][j] && s[s2][x1-i]==s[s3][j] &&
s[s1][i]==s[s4][x2-j] && s[s1][x1-i]==s[s3][x2-j]) {
a[k]=1;
}

}

}


s1=1; s2=4; s3=3; s4=2;
if (strlen(s[s1])==strlen(s[s2]) && strlen(s[s3])==strlen(s[s4])) {
x1=strlen(s[s1])-1;
x2=strlen(s[s3])-1;
for (i=0;i<=x1/2;i++)
for (j=0;j<=x2/2;j++){
if (s[s1][i]==s[s3][j] && s[s1][x1-i]==s[s4][j] &&
s[s2][i]==s[s3][x2-j] && s[s2][x1-i]==s[s4][x2-j]) {
a[k]=1;
}
if (s[s1][i]==s[s4][j] && s[s1][x1-i]==s[s3][j] &&
s[s2][i]==s[s4][x2-j] && s[s2][x1-i]==s[s3][x2-j]) {
a[k]=1;
}
if (s[s2][i]==s[s3][j] && s[s2][x1-i]==s[s4][j] &&
s[s1][i]==s[s3][x2-j] && s[s1][x1-i]==s[s4][x2-j]) {
a[k]=1;
}
if (s[s2][i]==s[s4][j] && s[s2][x1-i]==s[s3][j] &&
s[s1][i]==s[s4][x2-j] && s[s1][x1-i]==s[s3][x2-j]) {
a[k]=1;
}

}

}



}
for (i=1;i<=n;i++) {
if (a[i]) printf("YES\n");
else printf("NO\n");
}
return 0;
}

"Давтамжийн шинжилгээ"

Hasan-ы бодолт

#include
#include
#include
#define MAX 100
char text[MAX][MAX],ch[MAX];
int a[MAX];

int main(){
int N,i,j,Counter;
N=0;
while(scanf("%s",text[N])!=EOF){N++;}
//while(N<10){scanf("%s",text[N]);N++;}
for(i=0;i if(text[i][0]!='#'){
Counter=1;
for(j=i+1;j if(strcmp(text[i],text[j])==0){
text[j][0] = '#';
Counter++;
}
}
a[i] = Counter;
}
}


for(i=40;i>0;i--){
for(j=0;j if(a[j]==i){
printf("%s(%d) ",text[j],a[j]);
}
}
}


//system("PAUSE");
return 0;
}

"Олон гишүүнт"

Хонгорын бодолт

var n:byte;p:array[0..10] of extended;
q:array[0..20] of extended;
i,j:byte;
begin
readln(n);
fillchar(q,sizeof(q),0);
for i:=0 to n do
read(p[i]);
for i:=0 to n do
for j:=0 to n do
q[i+j]:=q[i+j]+p[i]*p[j];
for i:=0 to 2*n do
write(q[i]:0:1,' ');
end.

"Булийн функц"

Энэ бодлогыг бодсон хүн одоогоор гараагүй байгаа тул бодолтыг тавихаас түдгэлзэв.