Pagini recente » Cod sursa (job #1991520) | Cod sursa (job #2283313) | Cod sursa (job #749028) | Istoria paginii runda/simulare_oji_2023_clasele_11_12_11_martie/clasament | Cod sursa (job #836974)
Cod sursa(job #836974)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int N, sum[30007];
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);
for(int i = 1; i <= 30000; i++)
{
if(i == v[T]){
sum[i] = sum[i - 1] + 1;
}
else
sum[i] = sum[i - 1];
}
int S = 0 ;
for(int i = 1; i <= N; i++){
for(int j = i + 1; j <= N; j++)
{
S+=sum[ v[i] + v[j]] - sum[ abs(v[i] - v[j])];
}
}
fout << S <<'\n';
}
int main()
{
read();
fin.close();
return 0;
}