Cod sursa(job #567250)
| Utilizator | Data | 29 martie 2011 21:38:01 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#include<iostream>
using namespace std;
long long a[10001];
int main()
{long long i,d,n,k,sub=0,nr=0;
ifstream f1("elemente.in");
ofstream f2("elemente.out");
f1>>n>>k;
for(i=1;i<=n;i++)
{f1>>a[i];
for(d=1;d<=i;d++)
{if((a[d]-a[i]<=k)&&(a[d]>k)) sub++;
}
if(a[i]<=k) nr++;
}
long long copie=nr;
nr=1;
while(copie)
{copie--;
nr=nr*2;
}
f2<<sub+nr-1;
return 0;
}
