Pagini recente » Cod sursa (job #487258) | Cod sursa (job #2627680) | Cod sursa (job #881430) | Cod sursa (job #2920593) | Cod sursa (job #282939)
Cod sursa(job #282939)
#include<algorithm>
#define DIM 7001
using namespace std;
int n,f[DIM];
int calc(int a){
int i,p;
if(a<3)
return 0;
for(i=3,p=1; i<a; p*=i++);
for(i=1; i<a-2; p/=i++);
return p;}
void solve(){
int i,k,st,dr,nr;
scanf("%d",&n);
for(i=1; i<=n; ++i){
scanf("%d",&nr);
++f[nr];}
for(i=1,k=0; i<=n; ++i){
k+=f[i]*calc(f[i]);
for(st=i-1,dr=i+1; st>0&&dr<=n; --st,++dr)
if((f[st]&1)&&(f[dr]&1))
k+=f[i];}
printf("%d",k);}
int main(){
freopen("medie.in","r",stdin);
freopen("medie.out","w",stdout);
solve();
return 0;}