Cod sursa(job #2225320)
| Utilizator | Data | 26 iulie 2018 17:28:19 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[807];
int main()
{
int n,nrtri=0;
f>>n;
for(int i=0;i<n;i++)
f>>v[i];
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
for(int k=j+1;v[k]<=v[i]+v[j]&&k<n;k++)
nrtri++;
g<<nrtri;
f.close();
g.close();
return 0;
}
