Cod sursa(job #2283610)
| Utilizator | Data | 15 noiembrie 2018 18:05:50 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[805];
int main()
{
int n,rez=0;
in>>n;
for(int i=1; i<n+1; i++)
{
in>>v[i];
}
sort(v+1,v+n+1);
int k;
for(int i=1; i<=n; i++)
{
k=i+1;
for(int j=i+1; j<n; j++)
{
while(k<=n && v[k]<=v[i]+v[j])
{
k++;
}
if(k>j)
{
rez+=k-j-1;
}
}
}
out<<rez;
return 0;
}
