Cod sursa(job #2613310)
| Utilizator | Data | 9 mai 2020 15:45:35 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int main()
{
int n, v[801], nr = 0;
f>>n;
for (int i=0;i<n;i++)
f>>v[i];
sort(v, v+n);
for(int i = 0; i<n-2; i++)
for(int j = i+1; j<n-1; j++)
for(int k = j+1; k<n; k++)
if(v[i]+v[j] >= v[k])
nr++;
else break;
g<<nr;
return 0;
}
