Pagini recente » Cod sursa (job #2811978) | Cod sursa (job #2726734) | Cod sursa (job #2118878) | Cod sursa (job #820983) | Cod sursa (job #1010411)
#include<fstream>
using namespace std;
int N,i,j,k,l,m,o;
bool ok=1;
long S;
int main()
{ifstream f("loto.in");
ofstream g("loto.out");
f>>N>>S;
for(i=1;i<=N&&ok;i++)
for(j=1;j<=N&&ok;j++)
for(k=1;k<=N&&ok;k++)
for(l=1;l<=N&&ok;l++)
for(m=1;m<=N&&ok;m++)
for(o=1;o<=N&&ok;o++)
if(i+j+k+l+m+o==S)
{g<<i<<" "<<j<<" "<<k<<" "<<l<<" "<<m<<" "<<o;
ok=0;}
if(ok)
g<<-1;
f.close();g.close();
}