Cod sursa(job #1065683)
| Utilizator | Data | 23 decembrie 2013 16:15:03 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int a[1000],n,sol;
void citire()
{
f>>n;
for(int i=1;i<=n;i++) f>>a[i];
}
void solve()
{
for(int i=1;i<=n-2;i++)
{
for(int j=i+1;j<=n-1;j++)
{
for(int k=j+1;k<=n;k++)
{
if((a[i]+a[j]>=a[k])&&(a[i]+a[k]>=a[j])&&(a[k]+a[j]>=a[i])) {sol++;}
}
}
}
}
int main()
{
citire();
solve();
g<<sol;
return 0;
}
