Cod sursa(job #2148744)
Utilizator | Carol Luca Carol_Luca | Data | 1 martie 2018 22:45:47 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[805];
int main()
{
int n,i,j,k,cnt=0;
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&&v[k]<=(v[i]+v[j]);k++)
if(v[k]<=v[i]+v[j])
cnt++;
out<<cnt;
return 0;
}