Cod sursa(job #1501716)
| Utilizator | Data | 13 octombrie 2015 19:30:22 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int main()
{
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,k=0;
fin>>n;
int v[n+1];
for(int i=0;i<n;i++)
fin>>v[i];
sort(v,v+n);
for(int a=0;a<n-2;a++)
for(int b=a+1;b<n-1;b++)
for(int c=b+1;c<n;c++)
if(v[c]<=v[a]+v[b])
k++;
else break;
fout<<k;
}