Cod sursa(job #1523792)
| Utilizator | Data | 13 noiembrie 2015 11:48:02 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int NMax = 810;
int N;
int a[NMax];
int main()
{
ifstream f ("nrtri.in");
f >> N;
for (int i = 1; i <= N; ++ i)
f >> a[i];
f.close();
sort(a+1, a+N+1);
int ans = 0;
for (int i = 1; i <= N; ++ i)
for (int j = i + 1; j <= N; ++ j)
ans += (int)(upper_bound(a+j+1, a+N+1, a[i]+a[j]) - (a+j+1));
ofstream g ("nrtri.out");
g << ans << "\n";
g.close();
return 0;
}
