Pagini recente » Cod sursa (job #2908629) | Borderou de evaluare (job #2149076) | Cod sursa (job #2206204) | Cod sursa (job #2653501) | Cod sursa (job #18710)
Cod sursa(job #18710)
#include<stdio.h>
#define dim 101
long long unsigned n,i,j,a[dim][dim],s[dim],l1,l2,c1,c2,ordonat,aux,exista,s1;
int main()
{
freopen("zone.in","r",stdin);
freopen("zone.out","w",stdout);
scanf("%llu", &n);
for(i=1; i<=9;++i)
scanf("%llu", &s[i]);
for(i=1;i<=n; ++i)
for(j=1;j<=n;++j)
scanf("%llu", &a[i][j]);
for(l1=1; l1<n-1; ++l1)
{
if(exista==1)
break;
for(c1=1; c1<n-1; ++c1)
{
exista=0;
s1=0;
for(i=1;i<=l1;++i)
for(j=1; j<=c1; ++j)
s1+=a[i][j];
for(i=1; i<=9;++i)
if(s1==s[i])
exista=1;
if(exista==1)
break;
}
}
exista=0;
for(l2=l1; l2<n; ++l2)
{
if(exista==1)
break;
for(c2=c1+1; c2<n; ++c2)
{
exista=0;
s1=0;
for(i=l1;i<=l2;++i)
for(j=c1+1; j<=c2; ++j)
s1+=a[i][j];
for(i=1; i<=9;++i)
if(s1==s[i])
exista=1;
if(exista==1)
break;
}
}
printf("%llu %llu %llu %llu", l1-1, l2-1, c1, c2);
return 0;
}