Pagini recente » Cod sursa (job #967103) | Cod sursa (job #953937) | Cod sursa (job #843654) | Cod sursa (job #1017009) | Cod sursa (job #675447)
Cod sursa(job #675447)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int a[1000001];
int v[101],l;
int main ()
{
int n,i,j,k,sum,c,d;
ifstream f("loto.in");
ofstream g("loto.out");
f>>n>>sum;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
l=0;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if((v[i]+v[j]+v[k])<sum) {
l++;
a[l]=v[i]+v[j]+v[k];
}
sort(a+1,a+l+1);
sort(a+1,a+l+1);
g.close();
return 0;
}