Cod sursa(job #1319343)
Utilizator | Data | 16 ianuarie 2015 21:26:51 | |
---|---|---|---|
Problema | Loto | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2014, Anul I | Marime | 1.32 kb |
#include<fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,a[102],s;
bool ok=false;
int main()
{
f>>n>>s;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i1=1;i1<=n;i1++)
{
for(int i2=1;i2<=n;i2++)
{
for(int i3=1;i3<=n;i3++)
{
for(int i4=1;i4<=n;i4++)
{
for(int i5=1;i5<=n;i5++)
{
for(int i6=1;i6<=n;i6++)
{
int sum=a[i1]+a[i2]+a[i3]+a[i4]+a[i5]+a[i6];
if(sum==s)
{
g<<a[i1]<<' '<<a[i2]<<' '<<a[i3]<<' '<<a[i4]<<' '<<a[i5]<<' '<<a[i6]<<"\n";
ok=true;
break;
}
}
if(ok)
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(!ok)
g<<"-1\n";
f.close();g.close();
return 0;
}