Pagini recente » Cod sursa (job #1054230) | Cod sursa (job #1688454) | Cod sursa (job #1766502) | Diferente pentru tree-decompositions intre reviziile 82 si 81 | Cod sursa (job #2326214)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream out("nrtri.out");
int main()
{
int n,a[200],i,j,k,s=0;
f>>n;
for(int i=0;i<n;i++)
f>>a[i];
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;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])
s++;
out<<s;
}