Cod sursa(job #2612058)
| Utilizator | Data | 8 mai 2020 13:51:48 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
#include<vector>
#include <algorithm>
using namespace std;
int main(){
ifstream f("nrti.in");
ofstream f1("nrti.out");
int n;
f>>n;
int v[n];
for (int i=0;i<n;i++)
f>>v[i];
int nr=0;
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] && v[i]+v[k]>=v[j] && v[j]+v[k]>=v[i])
nr++;
f1<<nr;
}
