Cod sursa(job #837457)
| Utilizator | Data | 18 decembrie 2012 00:09:53 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int n, a[810], sol;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f >> n;
for (int i = 1; i <= n; i++)
f >> a[i];
sort (a + 1, a + n + 1);
f.close();
for (int i = 1; i < n ; i++)
for (int j = i + 1; j <= n ; j++)
for (int k = j + 1; k <= n && a[i] + a[j] >= a[k]; k++)
sol++;
g << sol << "\n";
g.close();
return 0;
}
