Pagini recente » Cod sursa (job #1953878) | Cod sursa (job #969218) | Cod sursa (job #1485016) | Cod sursa (job #2228585) | Cod sursa (job #768732)
Cod sursa(job #768732)
#include <stdio.h>
#include <vector>
#include <list>
#define MAXOI 2000
#define MAXH 10007
struct grupare {
int a, b;
int sum;
};
using namespace std;
int contains(vector<list<struct grupare> > &hash, int x, int a, int b) {
list<struct grupare>::iterator it;
int result = 0;
for (it = hash[x % MAXH].begin(); it != hash[x % MAXH].end(); it++) {
if ((*it).sum == x && (*it).a != a && (*it).b != a &&
(*it).a != b && (*it).b != b) {
fprintf(stderr, "%d %d %d %d %d\n", a, b, (*it).a, (*it).b, (*it).sum);
result = 1;
}
}
return result;
}
int main() {
int C, L;
int oi[MAXOI];
int result = 0;
list<struct grupare> lst;
vector<list<struct grupare> > hash;
FILE *f = fopen("oite.in", "r");
FILE *g = fopen("oite.out", "w");
for (int i = 0; i < MAXH; i++) {
hash.push_back(lst);
}
fscanf(f, "%d%d", &C, &L);
for (int i = 0; i < C; i++) {
fscanf(f, "%d", &oi[i]);
}
struct grupare grupa;
for (int i = 0; i < C; i++) {
for (int j = i + 1; j < C; j++) {
grupa.sum = oi[i] + oi[j];
grupa.a = i;
grupa.b = j;
hash[grupa.sum % MAXH].push_back(grupa);
}
}
for (int i = 0; i < C; i++) {
for (int j = i + 1; j < C; j++) {
int sum = oi[i] + oi[j];
result += contains(hash, L - sum, i, j);
}
}
fprintf(g, "%d", result/4);
fclose(f);
fclose(g);
}