Pagini recente » Cod sursa (job #2050971) | Cod sursa (job #461955) | Cod sursa (job #1550295) | Cod sursa (job #1222684) | Cod sursa (job #1317894)
#include <fstream>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int a[101],b[101][101][101],n,s,i,j,k,i1,j1,k1,p,q;
int main()
{
fin>>n>>s;
for(i=1;i<=n;i++)
fin>>a[i];
p=0;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
b[i][j][k]=a[i]+a[j]+a[k];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
q=s-b[i][j][k];
for(i1=1;i1<=n;i1++)
for(j1=1;j1<=n;j1++)
for(k1=1;k1<=n;k1++)
if(b[i1][j1][k1]==q)
{
fout<<i<<" "<<j<<" "<<k<<" "<<i1<<" "<<j1<<" "<<k1;
return 0;
}
}
}