Cod sursa(job #2658315)
Utilizator | Ioan Mihai IoanMihai | Data | 13 octombrie 2020 18:06:48 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n, k, i, j, ans, a[805];
int main() {
fin >> n;
for (int i=1;i<=n;i++){
fin >> a[i];
}
sort(a+1,a+n+1);
for (i=1;i<=n-2;i++){
k = i+2;
for (j=i+1;j<=n-1;j++){
while(k<=n && a[k] < a[i] + a[j])
++k;
}
if (a[k] < a[i] + a[j])
ans += k - j;
}
fout << ans << '\n';
return 0;
}