Cod sursa(job #2326592)
Utilizator | Data | 23 ianuarie 2019 18:22:06 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int n,cnt;
int v[816];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<n-1;i++)
for(int j=i+1;j<n;j++)
for(int k=j+1;k<=n && v[k]<=v[i]+v[j];k++)
cnt++;
out<<cnt;
return 0;
}