Pagini recente » Cod sursa (job #1093790) | Cod sursa (job #421083) | Cod sursa (job #146817) | Cod sursa (job #2799206) | Cod sursa (job #101616)
Cod sursa(job #101616)
#include<fstream.h>
ifstream f("castel.in");
ofstream g("castel.out");
int a[40000],n,m,k,i,s,p,x[40000],u,nm,j,nr;
int main()
{
f>>n>>m>>k;
nm=n*m;
for(i=1;i<=nm;i++) f>>a[i];
f.close();
p=u=1;
x[p]=k;
while(p<=u)
{
s=x[p];
for(i=1;i<=nm;i++) if(a[i]==s)
{
u++;
x[u]=i;
a[i]=-1;
}
p++;
}
nr=0;
for(i=1;i<=nm;i++) if(a[i]==-1) nr++;
g<<nr;
g.close();
return 0;
}