Cod sursa(job #1501368)
| Utilizator | Data | 13 octombrie 2015 12:54:47 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream cin("ntri.in");
ofstream cout("ntri.out");
int n,k,a,b,c,v[801];
for(i=1;i<=n;i++)
{
cin>>v[i];
}
for(a=1;a<=n-2;a++)
{
for(b=a+1;b<=n-1;b++)
{
for(c=b+1;c<=n;c++)
{
if(v[a]+v[b]>=v[c] && v[b]+v[c]>=v[a] && v[a]+v[c]>=v[b])
{
k++;
}
}
}
}
}
