Cod sursa(job #1550351)
| Utilizator | Data | 13 decembrie 2015 16:39:17 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,v[900],nr;
int main()
{
f>>n;
for(int i = 0;i<n;i++)
f>>v[i];
sort(v,v+n);
int i,j,k;
for(i = 0;i <= n-3;i++)
{
j = i+1;
k = n-1;
while(v[i]+v[j]<=v[k] && k!=j)
{
k--;
nr++;
}
}
g<<nr;
f.close();
g.close();
return 0;
}
