Cod sursa(job #2552146)
| Utilizator | Data | 20 februarie 2020 16:58:04 | |
|---|---|---|---|
| Problema | Loto | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 1.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,s,v[101],i,i1,i2,i3,j,j1,j2,l,x,ok,k;
int main()
{
f>>n;
f>>s;
for(i=1; i<=n; i++)
{
f>>x;
v[x]=1;
}
for(i=1; i<s; i++)
for(j=1; j<s; j++)
for(l=1; l<s; l++)
{
if(i+j+l==s and v[l]==1 and ok==0 )
{
for(i1=1; i1<i; i1++)
for(i2=1; i2<i; i2++)
for(i3=1; i3<i; i3++)
if(v[i1]==1 and v[i2]==1 and v[i3]==1 and i1+i2+i3==i)
{
for(j1=1; j1<j; j1++)
for(j2=1; j2<j; j2++)
if(v[j1]==1 and v[j2]==1 and j1+j2==j)
{
v[1]=i1;
v[2]=i2;
v[3]=i3;
v[4]=j1;
v[5]=j2;
v[6]=l;
sort(v+1,v+6+1);
for(k=1; k<=6; k++)g<<v[k]<<" ";
ok=1;
}
}
}
}
}
