Cod sursa(job #661490)
Utilizator | Data | 14 ianuarie 2012 16:39:26 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | winner15 | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
int nr,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];
for(int i=1;i<=n-1;i++)
for(int j=i+1;j<=n;j++)
if(v[i]>v[j])
{
int a;
a=v[i];
v[i]=v[j];
v[j]=a;
}
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
for(int l=j+1;l<=n;l++)
if(v[i]+v[j]>=v[l])
nr++;
g<<nr;
}