Cod sursa(job #2401695)
| Utilizator | Data | 9 aprilie 2019 22:17:45 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int a[900],r,n;
int main()
{
f>>n;
for (int i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+1+n);
for (int i=1;i<n-1;i++)
for (int j=i+1;j<n;j++)
{
int k=j+1;
while (a[i]+a[j]>=a[k] && k<=n)
{r++;
//cout<<a[i]<<" "<<a[j]<<" "<<a[k++]<<endl;
}
}
g<<r;
}
