Cod sursa(job #1411699)
| Utilizator | Data | 31 martie 2015 21:31:07 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n, i, j, nr, dr;
int a[801];
int cmp(int x, int y)
{ return x < y; }
int main()
{
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
sort(a+1, a+n+1, cmp);
for (i = 1; i < n-1; i++)
for (j = i+1; j < n; j++)
{
dr = n;
while (a[dr] > a[i] + a[j])
dr--;
nr += (n-dr);
}
g << nr;
return 0;
}
