Cod sursa(job #2326212)
Utilizator | Data | 23 ianuarie 2019 13:23:13 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int main()
{
int n,a[3000]={0},contor=0;
f>>n;
for (int i = 1; i<=n;i ++)
f>>a[i];
for (int i=1; i<n-1; i++)
for(int j=i+1; j<n;j++)
for (int k=j+i;k<=n;k++)
if (i+j>k || i+k>j || k+j>i)
contor++;
g<<contor;
return 0;
}