Cod sursa(job #2326318)
Utilizator | Data | 23 ianuarie 2019 13:52:20 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ntri.in");
ofstream fout("ntri.out");
int k, i, d = 2, nr = 0, cnt = 2, d1=2, nr1=0;
fin>>k;
int n[k];
for ( i = k; i > 0; --i){
fin>>n[k]
if (n [0] < n[1] + n[2] )
nr++;
}
fout<<nr;
return 0;
}