Pagini recente » Cod sursa (job #1586535) | Cod sursa (job #143489) | Cod sursa (job #104853) | Cod sursa (job #2338469) | Cod sursa (job #571568)
Cod sursa(job #571568)
#include<fstream>
using namespace std;
int i,j,n,m,a[101],s,k,l,t,r,b[101];
int ok(int i)
{
if(b[n]-b[i]<=s)
return 1;
return 0;
}
int main()
{
ifstream f("loto.in");
ofstream g("loto.out");
f>>n>>s;
for(i=1;i<=n;i++)
f>>a[i],b[i]=b[i-1]+a[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(t=1;t<=n;t++)
for(l=1;l<=n;l++)
for(r=1;r<=n;r++)
for(k=1;k<=n;k++)
if(a[i]+a[j]+a[t]+a[l]+a[r]+a[k]==s)
{
g<<a[i]<<" "<<a[j]<<" "<<a[t]<<" "<<a[l]<<" "<<a[r]<<" "<<a[k]<<"\n";
return 0;
}
g<<-1;
return 0;
}