Cod sursa(job #689073)
Utilizator | Chiriac Alexandru Alecu7 | Data | 24 februarie 2012 09:16:47 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int k,n,v[8001];
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sort (v+1, v+n+1);
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
for(int q=j+1;q<=n;q++)
if(v[i]+v[j]>=v[q])
k++;
g<<k;
}