Question

C语言程序翻译为pascal问题

#include<cstdio>
#include<memory.h>
using namespace std;
int x[100001];//每行分别属于哪个集合
int y[100001];//每列分别属于哪个集合
int n,m,p;
int a,b,ans;
int ba[200001];//每个集合属于哪个集合
int nm=0;
int t1,t2;
int roo(int w){//并查集
int rt;
rt=w;
while(ba[rt]!=0)rt=ba[rt];
return rt;
}
int rof(int w,int s){//路径压缩
int rt,q;
rt=w;
while(rt!=0){q=rt;rt=ba[rt];if((rt==0 && q!=s) || rt!=0)ba[q]=s;}
}
int main(){
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
scanf("%d%d%d",&n,&m,&p);
int i;
for(i=1;i<=p;i++){
　　scanf("%d%d",&a,&b);
　　if(x[a]!=0 && y!=0){//合并
t1=roo(x[a]);
rof(y,t1);
}
　　else{
　　if(x[a]!=0)y=x[a];
　　else
　　if(y!=0)x[a]=y;
　　else{
nm++;x[a]=nm;y=nm;//新建一个集合
　　}
}
}
ans=0;
　　for(i=1;i<=nm;i++){
　　if(ba[i]==0)ans++;
}
　　printf("%d",ans-1);
return 0;
}

求翻译..

Answer 1

dim x[100001] as long//每行分别属于哪个集合
dim y[100001] as long//每列分别属于哪个集合
dim n as long,m as long,p as long
dim a as long,b as long,ans as long
dim ba[200001];//每个集合属于哪个集合
dim nm as long
nm=0
dim t1 as long,t2 as long
function roo(w as long) as long//并查集
dim rt as long
rt=w
do while ba(rt)<>0
rt=ba(rt)
loop
roo=rt
end function
function rof(w as long, s as long) as long //路径压缩
dim rt as long,q as long
rt=w
do while(rt!=0)
q=rt
rt=ba(rt)
if (( rt=0 and q<>s) or rt<>0) then
ba[q]=s
end if
end function
Sub main()
n=inputbox("n=")
m=inputbox("m=")
p=inputbox("p=")
dim i as long
for i=1 to p
a=inputbox("a=")
b=inputbox("b=")
if(x(a)<>0 and y<>0) then//合并
t1=roo(x(a))
rof y,t1
elseif (x(a)<>0) then
y=x(a)
elseif(y<>0) then
x(a)=y
else
nm=nm+1
x(a)=nm
y=nm//新建一个集合
end if
ans=0
for i=1 to nm
if(ba(i)=0) then ans=ans+1
msgbox ans-1
end sub