Cod sursa(job #2481221)
| Utilizator | Data | 26 octombrie 2019 17:01:03 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int i, j, k, N, a[1001], nr, aux;
int main(){
f>>N;
for(i=1; i<=N; i++)
f>>a[i];
for(i=1; i<N; i++)
for(j=i+1; j<=N; j++)
if(a[i]>a[j]){
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=1; i<=N-2; i++)
for(j=i+1; j<=N-1; j++){
k=j+1;
while(a[i]+a[j]>a[k] && k<=N){
nr++;
k++;
}
}
g<<nr;
return 0;
}
