Cod sursa(job #1490389)
Utilizator | Data | 23 septembrie 2015 13:37:08 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,i,v[810],j,k,nr;
int main(){
freopen("nrtri.in","r",stdin);
ofstream g ("nrtri.out");
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
for(i=1;i<=n;++i)
for(j=i+1;j<=n;++j)
for(k=j+1;k<=n;++k)
if(v[i]+v[j]>=v[k])++nr;
g<<nr;
return 0;}