Cod sursa(job #2640317)
Utilizator | Data | 6 august 2020 00:48:05 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int i,j,n,v[805],sol,k;
int main()
{
ifstream f("ntri.in");
ofstream g("ntri.out");
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for (i=1;i<=n;i++) {
k=i+1;
for (j=i+1;j<=n;j++) {
while (k<n && v[k]<v[i]+v[j])
k++;
if (v[k]<=v[i]+v[j])
sol+=k-j, k++;
}
}
g<<sol;
}