Cod sursa(job #1423710)
| Utilizator | Data | 22 aprilie 2015 13:54:26 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int n,sol,a[803];
int main()
{
in>>n;
for(int i=1; i<=n; i++)
in>>a[i];
sort(a+1,a+n+1);
for(int i=1; i<n-1; i++)
for(int j=i+1; j<n; j++)
{
int k=j+1;
while(k<=n&&a[i]+a[j]>=a[k])k++;
sol+=k-j-1;
}
out<<sol<<'\n';
out.close();
return 0;
}
