Pagini recente » Cod sursa (job #293241) | Cod sursa (job #629896) | Cod sursa (job #2318782) | Cod sursa (job #402900) | Cod sursa (job #2663395)
#include<fstream>
#include<map>
using namespace std;
map<int, int> m;
int v[107];
int main()
{
ifstream in("loto.in");
ofstream out("loto.out");
int n, s;
in>>n>>s;
for(int i=1; i<=n; ++i)
{
in>>v[i];
}
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
{
for(int k=1; k<=n; ++k)
{
m[s-v[i]-v[j]-v[k]]=1;
}
}
}
/*for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
{
for(int k=1; k<=n; ++k)
{
if(m[v[i]+v[j]+v[k]]==1)
{
for(int i1=1; i1<=n; ++i1)
{
for(int i2=1; i2<=n; ++i2)
{
for(int i3=1; i3<=n; ++i3)
{
if(v[i1]+v[i2]+v[i3]==s-v[i]-v[j]-v[k])
{
out<<v[i1]<<" "<<v[i2]<<" "<<v[i3]<<" "<<v[i]<<" "<<v[j]<<" "<<v[k];
return 0;
}
}
}
}
}
}
}
}*/
out<<-1;
return 0;
}