Cod sursa(job #2071250)
Utilizator | Data | 20 noiembrie 2017 15:12:30 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,a[803],nr;
int main()
{
f>>n;
for(int i=1; i<=n; i++) f>>a[i];
sort(a+1,a+n+1);
int i=1;
while(i<n-1)
{
int j=i+2;
while(a[j]<=a[i]+a[i+1] && j<=n) {nr++; j++;}
i++;
}
g<<nr<<'\n';
return 0;
}