Pagini recente » Cod sursa (job #2922545) | Cod sursa (job #2693242) | Cod sursa (job #1962192) | Cod sursa (job #2198768) | Cod sursa (job #2332948)
#include <iostream>
#include <fstream>
#include <algorithm>
int x[10001];
using namespace std;
int ogl(int n)
{
int ogl=0;
while(n)
{
ogl=ogl*10+n%10;
n=n/10;
}
return ogl;
}
int main()
{
int nr,a[101][101],n,m,nr1=0,i,j,r=1;
cin>>nr>>m>>n;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
{
cin>>a[i][j];
x[r]=a[i][j]%9;
r++;
}
for(int i=1; i<=r; i++)
{
for(int j=1; j<=r; j++)
if(x[i]==x[j] && i!=j)
x[j]=10;
}
nr=ogl(nr);
while(nr)
{
for(int t=1; t<=r; t++)
{
if(x[t]==nr%10)
{
cout<<x[t];
nr=nr/10;
nr1++;
}
}
}
if(nr1==0)
cout<<-1;
return 0;
}