Cod sursa(job #2612527)
| Utilizator | Data | 9 mai 2020 10:17:40 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main(){
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
long long int n,i,j,k,betisor,counter = 0;
fin>>n;
long long int betisoare[n];
for(i=0;i<n;i++){
fin>>betisor;
betisoare[i] = betisor;
}
for (i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++)
for(k=j+1;k<n;k++)
if(betisoare[i]+betisoare[j]>=betisoare[k])
counter++;
else
break;
fout<<counter;
}
