Cod sursa(job #2339079)
Utilizator | Data | 8 februarie 2019 12:45:10 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[801];
int main()
{
int N,T=0,i,j,k;
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-1; j++)
{
for(k=j+1; k<=N; k++)
{
if(v[i]+v[j]>=v[k])
{
T++;
}
else
{
break;
}
}
}
}
out<<T;
return 0;
}