Pagini recente » Cod sursa (job #1330536) | Cod sursa (job #1279376) | Cod sursa (job #2500540) | Cod sursa (job #854547) | Cod sursa (job #1702443)
#include <bits/stdc++.h>
using namespace std;
const int MOD = 9997;
struct I3 {
int a, b, c;
inline int sum(void) {
return a+b+c;
}
};
FILE *fi = fopen("loto.in", "r");
FILE *fo = fopen("loto.out", "w");
int n, s, v[105];
vector<I3> h[MOD];
inline void search(I3 val) {
int p = (s-val.sum()) % MOD;
for(int i=0; i<h[p].size(); ++i) {
if(h[p][i].sum()==s-val.sum()) {
fprintf(fo,"%d %d %d %d %d %d\n",h[p][i].a,h[p][i].b,h[p][i].c,val.a,val.b,val.c);
exit(0);
}
}
}
inline void insert(I3 arg) {
h[arg.sum()%MOD].push_back(arg);
}
int main(void) {
fscanf(fi,"%d%d",&n,&s);
for(int i=1; i<=n; ++i)
fscanf(fi,"%d",&v[i]);
for(int i=1; i<=n; ++i) {
for(int j=i; j<=n; ++j) {
for(int k=j; k<=n; ++k) {
insert({v[i],v[j],v[k]});
search({v[i],v[j],v[k]});
}
}
}
fprintf(fo,"-1\n");
fclose(fi);
fclose(fo);
return 0;
}