Cod sursa(job #836977)
| Utilizator | Data | 16 decembrie 2012 22:49:27 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int N;
int v[822];
void read(){
fin >>N;
for(int i = 1; i <= N; i++){
fin >> v[i];
}
int T = 1;
sort(v + 1 , v + 1 + N);
int S = 0 ;
for(int i = 1; i <= N - 2; i++){
for(int j = i + 1; j <= N - 1; j++)
{
for(int k = j + 1; k <= N && v[i] + v[j] >= v[k]; k++)
S++;
}
}
fout << S <<'\n';
}
int main()
{
read();
fin.close();
return 0;
}
