Cod sursa(job #1474295)
Utilizator | Data | 21 august 2015 18:29:34 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n,v[805],i,j,k,tr;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
i=j=1;
for(i=1;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
k=j+1;
while(v[i]+v[j]>=v[k] && k<=n) tr++,k++;
}
}
g<<tr;
f.close();
g.close();
return 0;
}