Pagini recente » Monitorul de evaluare | Cod sursa (job #1531180) | Cod sursa (job #1024436) | Cod sursa (job #1642783) | Cod sursa (job #773075)
Cod sursa(job #773075)
#include<fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,i,x,mini,maxi,pm,pM,p,k,v[10],b[10];
int a[10000];
int main()
{f>>n;
for(i=1;i<=n;++i)
f>>x,a[x]=1;
mini=6545678;
for(i=1;i<=6;++i)
{f>>b[i];
a[b[i]]=0;
if(b[i]>maxi)
maxi=b[i],pM=i;
if(b[i]<mini)
mini=b[i],pm=i;
}
k=0;
for(i=1;i<=6;++i)
if(i!=pm&&i!=pM)
++k,v[k]=b[i];
p=1;
while(1)
{if(p+mini<=10000&&a[mini+p])
{v[5]=mini+p;a[mini+p]=0;break;}
if(mini-p>0&&a[mini-p])
{v[5]=mini-p;a[mini-p]=0;break;}
++p;
}
p=1;
while(1)
{if(p+maxi<=10000&&a[maxi+p])
{v[6]=maxi+p;a[maxi+p]=0;break;}
if(maxi-p>0&&a[maxi-p])
{v[6]=maxi-p;a[maxi-p]=0;break;}
++p;
}
sort(v+1,v+7);
for(i=1;i<=6;++i)
g<<v[i]<<' ';
g<<'\n';
return 0;
}