Pagini recente » Cod sursa (job #2322173) | Cod sursa (job #793248) | Cod sursa (job #526965) | Cod sursa (job #1541496) | Cod sursa (job #1670563)
#include <stdio.h>
#define Nadejde 9000
#define Smerenie 7000
int N;
short int val[Nadejde];
short int freq[Smerenie + 1];
int main(void) {
int i, j;
FILE *f = fopen("medie.in", "r");
/* Citirea datelor. */
fscanf(f, "%d", &N);
for (i = 0; i < N; i++) {
fscanf(f, "%hd", &val[i]);
freq[val[i]]++;
}
fclose(f);
/* Calcularea solutiei. */
long long int count = 0;
for (i = 0; i < N; i++) {
for (j = i + 1; j < N; j++) {
if ((val[i] + val[j]) % 2 == 0) {
count += freq[(val[i] + val[j]) >> 1];
if (val[i] == val[j]) {
count -= 2;
}
}
}
}
/* Afisarea solutiei. */
freopen("medie.out", "w", stdout);
fprintf(stdout, "%lld\n", count);
fclose(stdout);
/// Multumim Doamne!
puts("Doamne ajuta!");
return 0;
}