Cod sursa(job #2119812)
Utilizator | Data | 1 februarie 2018 17:47:33 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
long n,a[1000000],i,j,k,c;
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++)
for(k=j+1;k<=n;k++)
if(a[i]+a[j]>=a[k]&&a[i]+a[k]>=a[j]&&a[j]+a[k]>=a[i])
c++;
}
g<<c;
return 0;
}