Cod sursa(job #2618112)
| Utilizator | Data | 23 mai 2020 18:16:16 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | 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 main()
{
int v[300001],n,i,j,k,nr;
f>>n;
nr = 0;
for(i=0; i<n; i++)
{
f>>v[i];
}
sort(v,v+n);
for(i=0; i<n; i++)
{
j=i+1;
while(j<n-i-1)
{
k=i+2;
while(v[i]+v[j]>=v[k] && k<n)
{
nr++;
k++;
}
j++;
}
}
g<<nr;
return 0;
}
