Cod sursa(job #56813)
Utilizator | Muresan Mircea Paul Mirceamp | Data | 30 aprilie 2007 15:48:26 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
long long n,a[100],p;
int main()
{
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int i,j,k;
fin>>n;
for(i = 1; i <= n; i++)
fin>>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[k]+a[i]>=a[j] && a[j]+a[k] >=a[i])
p++;
}
}
fout<<p;
fin.close();
fout.close();
return 0;
}