Pagini recente » Cod sursa (job #838205) | Cod sursa (job #3182148) | Cod sursa (job #841669) | Cod sursa (job #3174446) | Cod sursa (job #8757)
Cod sursa(job #8757)
#include<fstream.h>
int main()
{ifstream f ("loto.in");
ofstream g ("loto.out");
int v[1000],n,i,j,k,l,m,p;
long s;
f>>n>>s;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
for(l=1;l<=n;l++)
for(m=1;m<=n;m++)
for(p=1;p<=n;p++)
if(v[i]+v[j]+v[k]+v[p]+v[m]+v[l]==s)
g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[p];
return -1;}