Cod sursa(job #1059769)
| Utilizator | Data | 16 decembrie 2013 22:22:18 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[805];
int functie(int v[],int n)
{
int s=0;
for(int i=1;i<=n-2;++i)
for(int j=i+1;j<=n-1;++j)
for(int k=j+1;k<=n;++k)
if(v[i]+v[j]>=v[k])
++s;
else
k=n+1;
return s;
}
int main()
{
int n;
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
sort(v+1,v+n+1);
g<<functie(v,n);
return 0;
}
