Cod sursa(job #2209520)
Utilizator | Data | 3 iunie 2018 18:28:46 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("gfact.in");
ofstream out("gfact.out");
int n,i,v[1000],j,ii,rez;
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<n;j++)
{
for(ii=j+1;ii<=n && v[i]+v[j]>=v[ii];ii++)
{
rez++;
out<<rez<<'\n';
}
}
}
return 0;
}