Cod sursa(job #903687)
| Utilizator | Data | 2 martie 2013 15:05:05 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int sir[801], N;
int main()
{
in >> N; int count = 0;
for (int i = 1; i <= N; i++)
in >> sir[i];
sort(sir+1, sir+N+1);
for (int i = 1; i < N-1; i++)
{
for (int j = i+1; j < N; j++)
{
int sum = sir[i]+sir[j];
for (int k = j+1; k <= N; k++)
if (sir[k] >= sum) ++count;
else break;
}
}
out << count;
return 0;
}
