Cod sursa(job #2398566)
Utilizator | Data | 5 aprilie 2019 18:58:10 | |
---|---|---|---|
Problema | Zone | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.72 kb |
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
ifstream g("zone.in");
ofstream h("zone.out");
int a[515][515],v[10],b[515][515],l,c,l1=0,c1=0,l2=0,c2=0,x,k,f[10];
int main()
{
int n, i, j,s=0;
g>>n;
for (i=1; i<=9; i++)
{
g>>v[i];
}
for (i=2;i<=9;i++)
{
for (j=i-1;j>=1;j--)
{
if (v[j]==v[i])
v[j]=0;
}
}
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
g>>a[i][j];
}
}
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
for (l=1; l<=i; l++)
{
for (c=1; c<=j; c++)
{
b[i][j]=a[l][c]+b[i][j]-a[l1][c1];
}
}
for (k=1; k<=9; k++)
{
if (v[k]!=0)
{
if (v[k]==b[i][j])
{
if (l1==0 && c1==0)
{
l1=i;
c1=j;
}
else
{
if (l1!=0 && i!=l1 && l2==0)
{
l2=i;
}
if (c1!=0 && j!=c1 && c2==0)
{
c2=j;
}
}
v[k]=0;
}
}
}
}
}
h<<l1<<" "<<l2<<" "<<c1<<" "<<c2<<" ";
return 0;
}