Cod sursa(job #455748)
| Utilizator | Data | 14 mai 2010 10:03:40 | |
|---|---|---|---|
| Problema | Loto | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<iostream>
using namespace std;
long n,st,x[10001],i,rez[7],cont,m,s;
int main()
{
cin>>n>>st;
for (i=1;i<=n;i++)
cin>>x[i];
if (x[n]*6<st)
{
cout<<"-1";
return 0;
}
if (st<6)
{
for (i=1;i<=st;i++)
rez[i]=1;
}
else
{
for (i=1;i<=6;i++)
rez[i]=1;
}
cont=6;
s=6;
m=x[n];
while (s!=st)
{
rez[cont]++;
s++;
if (rez[cont]==m)
cont--;
}
for (i=1;i<=6;i++)
cout<<rez[i]<<" ";
return 0;}