Cod sursa(job #1239513)
Utilizator | Data | 9 octombrie 2014 09:47:42 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int main()
{
int v[805],n,i,j,cnt,S,k;
in>>n;
for(i=1; i<=n; i++)in>>v[i];
sort(&v[1],&v[n+1]);
cnt=0;
for(i=1; i<n-1; i++)
{
for(j=i+1; j<n; j++)
{
S=v[i]+v[j];
for(k=j+1; k<=n && S>=v[k] ; k++)cnt++;
}
}
out<<cnt;
return 0;
}