text stringlengths 49 983k |
|---|
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
typedef long long ll;
int n,l,r;
ll a[100],c[100][100];
using namespace std;
map<ll,int> S;
bool cmp(ll x,ll y){return x>y;}
int main()
{
#ifdef Kay
freopen ("code.in","r",stdin);
freopen ("code.out","w",stdout);
#endif
cin>>n>>l>>r;
int i,j;
for (i=1;i<=n;i++)
cin>>a[i],S[a[i]]++;
sort(a+1,a+1+n,cmp);
ll sum=0;
for (i=1;i<=l;i++) sum+=a[i];
c[0][0]=1;
for (i=1;i<100;i++)
{
c[i][0]=c[i][i]=1;
for (j=1;j<i;j++)
c[i][j]=c[i-1][j]+c[i-1][j-1];
}
for (i=1;a[i]!=a[l];i++);
if (i!=1) printf ("%.6lf\n%lld",(double)sum/l,c[S[a[l]]][l-i+1]);
else
{
ll tmp=0;
for (i=l;i<=r;i++) tmp+=c[S[a[l]]][i];
printf ("%.6lf\n%lld",(double)sum/l,tmp);
}
return 0;
}
|
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)
const int N=51;
lint cc[N][N];
void init(){
cc[0][0]=1;
rep(i,N-1){
cc[i+1][0]=1;
rep(j,N-1){
cc[i+1][j+1]=cc[i][j]+cc[i][j+1];
}
}
}
int main(){
init();
int n,a,b;
cin>>n>>a>>b;
vector<lint>v(n);
rep(i,n)cin>>v[i];
sort(v.rbegin(),v.rend());
lint ma=0;
int maxi=-1;
lint tot=0;
rep(i,a){
tot+=v[i];
}
ma=tot;
maxi=a;
printf("%.15f\n",(double)ma/maxi);
rep(i,n)v[i]=maxi*v[i]-ma;
int c=1;
rep(i,a-1){
if(v[a-i-1]!=v[a-i-2])break;
c++;
}
int d=0;
while(d+a-c<n){
if(v[a-c]!=v[d+a-c])break;
d++;
}
lint ans=0;
if(c==a){
for(int j=a;j<=b;++j)ans+=cc[d][j];
}else{
ans=cc[d][c];
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
vector<vector<ll>> C(100, vector<ll>(100, 0));
C[0][0] = 1;
C[1][0] = 1;
for (int i = 1; i < 100; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++) {
C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
}
}
ll n, a, b;
cin >> n >> a >> b;
vector<ll> v(n);
map<ll, ll> mp;
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
mp[v[i]]++;
}
sort(all(v), greater<ll>());
double mean = 0;
for (int i = 0; i < a; i++) {
mean += v[i];
}
cout << fixed << setprecision(12) << mean / a << endl;
if (v[0] == v[a - 1]) {
for (int i = a; i <= b; i++) {
ans += C[mp[v[0]]][i];
}
} else {
int k = 0;
for (int i = 0; i < a; i++) {
k += v[i] == v[a - 1];
}
ans += C[mp[v[a - 1]]][k];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(),V.end()
using ll = long long;
double same(double x, double y) {
return abs(x - y) < pow(10, -20);
}
ll nCk(ll n, ll k) {
ll ans = 1;
for (ll i = 0;i < k;i++) {
ans *= (ll)n - i;
ans /= i + 1;
}
return ans;
}
int main() {
int N, A, B, cnt = 0, k = 0;
cin >> N >> A >> B;
vector<ll> X(N);
ll V = 0, ans = 0, C = 0;
for (int i = 0;i < N;i++)cin>>X[i];
sort(all(X));
reverse(all(X));
for (int i = 0;i < A;i++) {
V += X[i];
if (X[i] == X[0])cnt++;
}
if (cnt >= A) {
cnt = 0;
for (int i = 0;i < N;i++)if (X[i] == X[0])cnt++;
for (int i = min(cnt, B);i >= A;i--) {
ans += nCk(cnt, i);
}
}
else {
cnt = 0;
for (int i = 0;i < A;i++)
if (X[i] == X[A - 1])cnt++;
k = cnt;
for (int i = A;i < N;i++)
if (X[i] == X[A - 1])k++;
ans = nCk(k, cnt);
}
printf("%.8f\n", (double)V / A);
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
long long value[51];
long long dp[51][51];
int N,A,B;
bool comp(long long a,long long b)
{
return a>b?true:false;
}
void init()
{
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=50;i++)
{
dp[i][0]=1;
for(int j=1;j<=i;j++)
dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
}
}
int main()
{
init();
while(cin>>N>>A>>B)
{
double ave=0;
for(int i=0;i<N;i++)
cin>>value[i];
sort(value,value+N,comp);
// reverse(value,value+N);//大->小
for(int i=0;i<A;i++)
ave+=value[i];
ave/=A;
int num=0,k=0;
for(int i=0;i<N;i++)
{
if(value[i]==value[A-1])
{
num++;
if(i<A)
k++;
}
}
long long ans=0;
if(k==A)//前A个相同,可以增加个数
{
for(int i=A;i<=B;i++)
ans+=dp[num][i];
}
else
ans+=dp[num][k];
printf("%.15f\n",ave);
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[100], dp[100][100];
int calc(int l, int r, int n){
int ans = 0;
for(int i = l;i <= r;i++)ans += dp[n][i];
return ans;
}
void init(){
dp[0][0] = 1;
for(int i = 1;i <= 51;i++){
dp[i][0] = 1;
for(int j = 1;j <= 51;j++)
dp[i][j] = dp[i-1][j-1]+dp[i-1][j];
}
}
signed main(){
init();
int n, l, r;
scanf("%lld%lld%lld", &n, &l, &r);
for(int i = 1;i <= n;i++)scanf("%lld", &a[i]);
sort(a+1, a+n+1, greater<int>());
int sum = 0, s1 = 0, s2 = 0;
double d = 0;
for(int i = 1;i <= n;i++){
if(i <= l)sum += a[i];
if(a[i] > a[l])s1++;
if(a[i] == a[l])s2++;
}
printf("%lf\n", (double)sum/l);
if(s1 == 0){
int ans = calc(l, r, s2);
printf("%lld\n", ans);
}else{
printf("%lld\n", dp[s2][l-s1]);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
ll c[55][55];
ll com(int n,int k){
if(c[n][k]>0){
return c[n][k];
}
if(n<k||n<0||k<0){
return 0;
}
if(k==0||k==n){
return 1;
}
return c[n][k]=com(n-1,k-1)+com(n-1,k);
}
int main(){
ld n,a,b;
cin >> n >> a >> b;
vector<ld> v(n);
map<ld,ll> mp1;
map<ld,ll> mp2;
for(int i=0;i<n;i++){
cin >> v[i];
mp1[v[i]]++;
}
sort(v.begin(),v.end(),greater<ld>());
ld ans=0;
for(int i=0;i<a;i++){
ans+=v[i];
mp2[v[i]]++;
}
cout << fixed << setprecision(15) << ans/a << endl;
ll res;
if(v[0]!=v[a-1]){
res=com(mp1[v[a-1]],mp2[v[a-1]]);
}
else{
res=0;
int t=min(mp1[v[a-1]],(ll)b);
for(int i=a-1;i<t;i++){
if(i!=a-1){
mp2[v[a-1]]++;
}
res+=com(mp1[v[a-1]],mp2[v[a-1]]);
}
}
cout << res << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
typedef long long lint;
int N, A, B;
lint dp[55][55], cnt[55][55];
int main() {
cin >> N >> A >> B;
memset(dp, 0, sizeof(dp));
memset(cnt, 0, sizeof(cnt));
cnt[0][0] = 1;
for_(i,0,N) {
lint v; cin >> v;
for_(j,0,i+1) {
if (cnt[i][j] == 0) continue;
for_(b,0,2) {
lint &pre = dp[i+1][j+b], nxt = dp[i][j] + b * v, &pre_c = cnt[i+1][j+b];;
if (pre <= nxt) {
pre_c = (pre == nxt ? pre_c : 0) + cnt[i][j];
pre = nxt;
}
}
}
}
long double ans_v = 0;
lint ans_c = 0;
for_(i,A,B+1) {
long double val = (long double)dp[N][i] / i;
if (ans_v <= val) {
ans_c = (ans_v == val ? ans_c : 0) + cnt[N][i];
ans_v = val;
}
}
printf("%.9Lf\n%Ld\n", ans_v, ans_c);
} |
#include <iostream>
#include <assert.h>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
ll c[60][60];
int main() {
int n, l, r;
cin >> n;
cin >> l >> r;
assert(l <= r);
vector <ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
c[0][0] = 1;
for (int i = 0; i < 59; i++) {
for (int j = 0; j < 59; j++) {
c[i+1][j] += c[i][j];
c[i+1][j+1] += c[i][j];
}
}
int x = l-1;
int y = l-1;
while (x && a[x-1] == a[x]) x--;
while (y+1 < n && a[y] == a[y+1]) y++;
ll cnt = 0;
int all = y - x + 1;
if (!x) {
for (int i = l; i <= r; i++) {
cnt += c[all][i];
}
} else {
cnt = c[all][l-x];
}
cout << fixed << setprecision(10) << (double) accumulate(a.begin(), a.begin() + l, 0LL) / l << "\n";
cout << cnt << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
long long nCr(long long n,long long r){
long long ans=1;
rep(i,r) ans=ans*(n-i)/(i+1);
return ans;
}
int main(){
long long n,a,b,c,v[50],ans=0;
double ave=0,x;
map<long long,int> num;
cin>>n>>a>>b;
rep(i,n) cin>>v[i],num[v[i]]++;
sort(v,v+n,greater<long long>());
rep(i,a) ave+=v[i];
ave=ave/a;
for(int i=a;i<=b;i++){
if(i>a&&v[0]!=v[i-1]) break;
c=0;
rep(j,i) if(v[j]==v[i-1]) c++;
ans+=nCr(num[v[i-1]],c);
}
cout<<setprecision(10)<<ave<<endl<<ans;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,L,R,a[55],ans1,ans2,cnt1,cnt2;
bool cmp(ll a,ll b){return a>b;}
ll C[55][55];
int main()
{
C[0][0]=1;
for(ll i=1;i<=50;i++)
{
C[i][0]=1;
for(ll j=1;j<=i;j++)
C[i][j]=C[i-1][j]+C[i-1][j-1];
}
cin>>n>>L>>R;
for(ll i=1;i<=n;i++) scanf("%lld",&a[i]);
sort(a+1,a+1+n,cmp);
for(ll i=1;i<=L;i++) ans1+=a[i];
for(ll i=1;i<=n;i++) if(a[i]==a[L]) cnt1++;
for(ll i=1;i<=L;i++) if(a[i]==a[L]) cnt2++;
if(a[1]==a[L])
for(ll i=L;i<=R;i++)
ans2+=C[cnt1][i];
else
ans2=C[cnt1][cnt2];
printf("%lf\n%lld",(double)ans1/L,ans2);
return 0;
} |
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include<iostream>
using namespace std;
typedef long long ll;
ll com[60][60];
int main()
{
int num, lb, ub;
scanf("%d%d%d", &num, &lb, &ub);
vector<ll>v;
for (int i = 0; i < num; i++)
{
ll z;
scanf("%lld", &z);
v.push_back(z);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < 60; i++)
{
com[i][0] = 1;
for (int j = 1; j <= i; j++)com[i][j] = com[i - 1][j - 1] + com[i - 1][j];
}
double s = 0;
for (int i = 0; i < lb; i++)s += v[i];
printf("%lf\n", s / lb);
int c = 0, d = 0;
for (int i = 0; i < num; i++)
{
if (v[lb - 1] == v[i])
{
c++;
if (i <= lb - 1)d++;
}
}
ll ans = 0;
if (v[0] == v[lb - 1])
{
for (int i = lb; i <= ub; i++)
{
ans += com[c][i];
}
}
else ans = com[c][d];
printf("%lld\n", ans);
} |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
const ld eps=1e-9;
ll dp[64][64];
ll dp2[64][64];
int main(){
int n,a,b; cin>>n>>a>>b;
vector<ll> v(n);
for(int i=0;i<n;i++) cin>>v[i];
dp2[0][0]=1;
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++){
if(dp[i+1][j]<dp[i][j]){
dp[i+1][j]=dp[i][j];
dp2[i+1][j]=dp2[i][j];
}
else if(dp[i+1][j]==dp[i][j]){
dp2[i+1][j]+=dp2[i][j];
}
if(dp[i+1][j+1]<dp[i][j]+v[i]){
dp[i+1][j+1]=dp[i][j]+v[i];
dp2[i+1][j+1]=dp2[i][j];
}
else if(dp[i+1][j+1]==dp[i][j]+v[i]){
dp2[i+1][j+1]+=dp2[i][j];
}
}
}
ld ret=0;
for(int i=a;i<=b;i++) ret=max(ret,(ld)dp[n][i]/i);
printf("%.15Lf\n",ret);
ll pattern=0;
for(int i=a;i<=b;i++){
if(fabs(ret-(ld)dp[n][i]/i)<eps) pattern+=dp2[n][i];
}
printf("%Ld\n",pattern);
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, s, n) for (int i=(s); i<(n); i++)
#define ll long long
using namespace std;
ll com[52][52];
void nCr() {
com[0][0]=1;
rep(i, 1, 52) {
rep(j, 0, i+1) {
com[i][j]+=com[i-1][j];
if (j>0) com[i][j]+=com[i-1][j-1];
}
}
}
int main() {
int n, a,b;
cin>>n>>a>>b;
vector<ll> v(n);
rep(i, 0, n) cin>>v[i];
nCr();
sort(v.begin(), v.end(), greater<ll>());
ll sum=0;
rep(i, 0, a) sum+=v[i];
double res1=(double)(sum)/a;
ll res2=0;
int cnt=0;
rep(i, 0, n) if (v[a-1]==v[i]) cnt++;
if (v[0]==v[a-1]) rep(i, a, b+1) res2+=com[cnt][i];
else {
int tmp=0;
rep(i, 0, a) if (v[a-1]==v[i]) tmp++;
res2=com[cnt][tmp];
}
cout<<setprecision(10)<<res1<<endl;
cout<<res2<<endl;
} |
// D - Maximum Average Sets
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using DBL = double;
#define allr(x) (x).rbegin(),(x).rend()
#define rp(i,s,e) for(ll i=(s);i<(e);++i)
#define rpz(i,e) rp(i,0,e)
#define MAX 50
vvl nCr(MAX+1, vl(MAX+1, 0));
void nCr_table_create(ll N){
rp(n, 0, N+1) rp(r, 0, n+1){
if(r==0 || n==r) nCr[n][r] = 1;
else nCr[n][r] = nCr[n-1][r-1] + nCr[n-1][r];
}
}
int main(){
ll N,A,B; cin>>N>>A>>B;
vl V(N); rpz(i, N) cin>>V[i];
sort(allr(V));
nCr_table_create(N);
DBL maxave = 0.0;
rpz(i, A) maxave += V[i];
maxave /= A;
int n = 0, r = 0;
rpz(i, N){
if(V[A-1] == V[i]){
n++;
if(i < A) r++;
}
}
ll maxcnt = 0;
if(r == A) rp(r, A, B+1) maxcnt += nCr[n][r];
else maxcnt = nCr[n][r];
printf("%.6f\n", maxave);
cout<< maxcnt <<endl;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long n, a, b, s, x, c, v[55], d[55][55]={1};
int main() {
int i, j;
cin>>n>>a>>b;
for(i=0; i<n; i++) cin>>v[i];
sort(v, v+n);
for(i=n-1; i>=n-a; i--) s += v[i];
x = upper_bound(v, v+n, v[n-a]) - lower_bound(v, v+n, v[n-a]);
for(i=1; i<=x; i++) {
d[i][0] = 1;
for(j=1; j<=x; j++) d[i][j] = d[i-1][j-1] + d[i-1][j];
}
if(v[n-a] < v[n-1]) {
i = upper_bound(v+n-a, v+n, v[n-a]) - lower_bound(v+n-a, v+n, v[n-a]);
c = d[x][i];
} else {
for(i=a, c=0; i<=b; i++) c += d[x][i];
}
printf("%.9f\n%lld", 1.*s/a, c);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+20;
long long v[N], c[51][51];
void init()
{
memset(c, 0, sizeof(c));
c[0][0] = 1;
for (int i = 1; i <= 50; i++)
{
c[i][0] = 1;
for (int j = 1; j <= i; j++)
c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
}
}
int main()
{
int n, a, b;
init();
while(cin >> n >> a >> b)
{
double ave;
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
reverse(v, v + n);
for (int i = 0; i < a; i++)
ave += v[i];
ave /= a;
int num = 0, k = 0;
for (int i = 0; i < n; i++)
{
if (v[i] == v[a - 1])
{
num++;
if (i < a) k++;
}
}
long long ans = 0;
if (k == a)
{
for (int i = a; i <= b; i++)
ans += c[num][i];
}
else ans += c[num][k];
cout.precision(20);
cout << fixed << ave << endl << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
ll power(ll x,ll n){
if(n==0) return 1;
ll res=power(x*x%mod,n/2);
if(n&1) res=res*x%mod;
return res;
}
int main(){
int n,a,b;
cin>>n>>a>>b;
ll v[n];
rep(i,0,n){
cin>>v[i];
}
sort(v,v+n);
reverse(v,v+n);
ll sum=0;
rep(i,0,a){
sum+=v[i];
}
cout<<fixed<<setprecision(10)<<(sum+0.0)/a<<endl;
int c=0;
int d=0;
int e=0;
rep(i,0,n){
if(v[i]>v[a-1]) c++;
else if(v[i]==v[a-1]) d++;
else e++;
}
if(c!=0){
ll cur=1;
rep(i,1,a-c+1){
cur=cur*(d+1-i)/i;
}
cout<<cur<<endl;
}
else{
ll ans=0;
ll cur=1;
rep(i,1,min(d,b-c)+1){
cur=cur*(d+1-i)/i;
if(i>=a-c) ans+=cur;
}
cout<<ans<<endl;
}
} |
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
ll v[55];
ll ans=0;
void cnt(int a,int b){
double sum=1;
if(a>b/2)
a=b-a;
for(int i=b,j=1;i>=b-a+1;i--,j++){
sum*=i*1.0/j;
}
ans+=sum;
}
bool cmp(ll a,ll b){
return a>b;//从大到小排序
}
int main(){
int n,min_,max_;
scanf("%d %d %d",&n,&min_,&max_);
for(int i=1;i<=n;i++){
scanf("%lld",&v[i]);
}
sort(v+1,v+n+1,cmp);
int num=min_;
double ave=0;
ave+=v[1];
int same=1,dsam;
for(int i=2;i<=min_;i++){
ave+=v[i];
if(v[i]==v[i-1]){
same++;
}
else {
same=1;
}
}
ave/=num;//计算选最少的数时最大平均值
dsam=min_-same;//已选择的不同的数
for(int i=min_+1;v[i]==v[min_]&&i<=n;i++){
same++;//已选择+未选择的相同的数
}
if(dsam==0){//如果所有的数都相同
for(int k=min_;k<=max_;k++){
if(k>same)
break;
cnt(k,same);
}
}
else {
cnt(min_-dsam,same);
}
printf("%.6lf\n%lld\n",ave,ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long long N,A,B;
long long value[51];
long long dp[51][51];
bool comp(long long a,long long b)
{
return a>b?true:false;
}
void init()
{
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=50;i++)
{
dp[i][0]=1;
for(int j=1;j<=i;j++)
dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
}
}
int main(void)
{
cin>>N>>A>>B;
init();
for(int i=0;i<N;i++)
{
cin>>value[i];
}
sort(value,value+N,comp);
double sum=0.0;
for(int i=0;i<=A-1;i++)
{
sum+=value[i];
}
long long num=0,k=0;
for(int i=0;i<N;i++)
{
if(value[i]==value[A-1])
{
num++;
if(i<A)
k++;
}
}
long long ans=0;
if(k==A)//前A个相同,可以增加个数
{
for(int i=A;i<=B;i++)
ans+=dp[num][i];
}
else
ans+=dp[num][k];
printf("%.15f\n",sum/A);
cout <<ans <<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
ll com[51][51];
void init(){
for (int i = 0; i < 51; i++) {
com[i][0] = 1;
com[i][i] = 1;
}
for (int j = 1; j < 51; j++) {
for (int k = 1; k < j; k++) {
com[j][k] = (com[j-1][k-1] + com[j-1][k]);
}
}
}
int main(){
init();
int n, a, b;
cin >> n >> a >> b;
ll v[n];
rep(i,n){
ll c;
cin >> c;
v[i] = -c;
}
sort(v,v+n);
double ave = 0;
rep(i,a) ave += -v[i];
ave /= a;
int s = upper_bound(v, v+n, v[a-1]) - lower_bound(v, v+n, v[a-1]);
int u = a - (lower_bound(v, v+n, v[a-1]) - v);
ll ans = 0;
if(v[0] != v[a-1]) ans = com[s][u];
else {
for(int i = a; i <= min(b,a+s-u); i++) ans += com[s][u+i-a];
}
printf("%.8f\n",ave);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 55
using namespace std;
typedef long long ll;
ll n, mn, mx, s, a[N], c[N][N]{1};
int main()
{
ll i, j, k;
for (i = 1; i < N; i++) {
c[i][0] = 1;
for (j = 1; j < N; j++) c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
}
cin >> n >> mn >> mx;
for (i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(a, a + n);
for (i = n - 1; i >= n - mn; i--) s += a[i];
printf("%.9f\n", 1.0 * s / mn);
for (i = n - mn - 1; a[i] == a[n - mn] && i >= 0; i--); i++;
mx = min(mx, n - i);
for (j = n - 1; a[j] > a[i]; j--); j++;
if (j < n) cout << c[j - i][mn - n + j];
else {
for (k = mn, s = 0; k <= mx; k++) s += c[j - i][k];
cout << s;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
long v[50];
long c(long a,long b)
{
if(a<b)return 0;
long ans=1;
for(long i=1;i<=b;i++)ans=ans*(a-i+1)/i;
return ans;
}
int n,a,b;
int main()
{
cin>>n>>a>>b;
for(int i=0;i<n;i++)cin>>v[i];
sort(v,v+n);
double m=0;
for(int i=0;i<a;i++)m+=v[n-i-1];
m/=a;
cout<<fixed<<setprecision(9)<<m<<endl;
int cnt=0,upp=0;
for(int i=0;i<n;i++)cnt+=v[i]==v[n-a],upp+=v[i]>v[n-a];
long ans=0;a-=upp;b-=upp;
for(int i=a;i<=(v[n-1]==v[n-a-upp]?b:a);i++)ans+=c(cnt,i);
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 55;
ll v[maxn];
ll C[maxn][maxn];
void init(){
memset(C,0,sizeof(C));
C[0][0]=1;
for(int i=1;i<=50;i++){
C[i][0]=1;
for(int j=1;j<=i;j++)
C[i][j]=C[i-1][j-1]+C[i-1][j];
}
}
int main(){
int n,a,b;
init();
scanf("%d%d%d",&n,&a,&b);
double ave=0;
for(int i=0;i<n;i++){
scanf("%lld",&v[i]);
}
sort(v,v+n);
reverse(v,v+n);
for(int i=0;i<a;i++){
ave+=v[i];
}
ave/=a;
printf("%.6f\n",ave);
int num=0,k=0;
for(int i=0;i<n;i++){
if(v[i]==v[a-1]){
num++;
if(i<a)
k++;
}
}
ll ans=0;
if(k==a){
for(int i=a;i<=b;i++){
ans+=C[num][i];
}
}
else
ans+=C[num][k];
printf("%lld\n",ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll comp(ll n,ll r){
if(r>n||r<0) return 0;
ll i;
ll c=1;
for(ll i=1;i<=r;i++){
c=c*(n+1-i)/i;
}
return c;
}
int main(){
ll N,A,B; cin >> N >> A >> B;
ll v[N+1];
map<ll,ll> ma;
for(ll i=1;i<=N;i++){
cin >> v[i];
ma[v[i]]++;
}
sort(v+1,v+N+1,greater<ll>());
double ave=0;
for(int i=1;i<=A;i++){
ave+=v[i];
//cout << v[i] << endl;
}
ave/=A;
cout << setprecision(20) << ave << endl;
ll ans=0;
if(v[1]!=v[A]){
ll cnt=0;
for(ll i=1;i<=A;i++){
if(v[i]==v[A]) cnt++;
}
ans=comp(ma[v[A]],cnt);
}else{
for(ll i=A;i<=B;i++){
if(v[i]==v[A]){
ans+=comp(ma[v[A]],i);
}
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
ll combi(ll n, ll r){
ll a=1, b=1;
for(int i = 0; i < r; i++) {
a*=(n-i);
b*=(i+1);
if(a%b==0){
a/=b;
b=1;
}
}
return a/b;
}
int main(){
int N;
cin >> N;
int A, B;
cin >> A >> B;
vector<ll> v(N);
for(int i=0; i<N; i++) cin >> v[i];
sort(v.rbegin(), v.rend());
ll sum = 0;
for (int i = 0; i < A; i++) sum += v[i];
printf("%f\n", sum/(A+.0));
ll ans=0;
int n = count(v.begin(), v.end(), v[A-1]);
if(v[0]==v[A-1]){
for(int i=A; i<=B && i<=n; i++) ans += combi(n, i);
}else{
int c=0;
while(v[c] != v[A-1]) c++;
ans = combi(n, A-c);
}
cout << ans;
} |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define INF 2147483647
#define LINF 9223372036854775807
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<ll, int> P;
int n,a,b;
ll v[50];
ll c[51][51];
void comb() {
REP(i,n+1) {
REP(j,i+1) {
if(j==0||j==i) c[i][j]=1LL;
else c[i][j]=c[i-1][j-1]+c[i-1][j];
}
}
}
int main(){
//cin.tie(0);
//ios::sync_with_stdio(false);
cin>>n>>a>>b;
REP(i,n) cin>>v[i];
comb();
sort(v,v+n); reverse(v,v+n);
double avr=0;
REP(i,a) avr+=v[i];
avr/=a;
int num=0,pos=0;
REP(i,n) {
if(v[i]==v[a-1]) {
num++;
if(i<a) pos++;
}
}
ll cnt=0;
if(pos==a) {
FOR(pos,a,b+1) cnt+=c[num][pos];
}
else cnt+=c[num][pos];
printf("%f %lld\n",avr,cnt);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#define llint long long
using namespace std;
llint N, A, B;
llint v[55];
llint comb[55][55];
int main(void)
{
comb[0][0] = 1;
for(int i = 1; i < 55; i++){
for(int j = 0; j < 55; j++){
comb[i][j] = comb[i-1][j];
if(j > 0) comb[i][j] += comb[i-1][j-1];
}
}
cin >> N >> A >> B;
for(int i = 0; i < N; i++){
cin >> v[i];
v[i] *= -1;
}
sort(v, v+N);
double avg = 0.0;
for(int i = 0; i < A; i++) avg += v[i];
avg /= A;
printf("%.8f\n", -avg);
llint ans, num = upper_bound(v, v+N, v[A-1]) - lower_bound(v, v+N, v[A-1]);
if(v[A-1] == v[0]){
ans = 0;
for(int i = A; i <= min(num, B); i++) ans += comb[num][i];
}
else{
ans = 0;
int p = lower_bound(v, v+N, v[A-1]) - v;
ans = comb[num][A-p];
}
cout << ans << endl;
return 0;
} |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL C(LL n,LL m)
{
LL sum=1;
for(LL i=1;i<=m;i++)
sum=sum*(n+1-i)/i;
return sum;
}
LL foo[56];
int cmp(LL a,LL b)
{
return a>b;
}
int main()
{
LL n,a,b;
cin>>n>>a>>b;
for(int i=0;i<n;i++)
cin>>foo[i];
sort(foo,foo+n,cmp);
LL goo=0;
LL koo=0;
LL soo=0;
for(LL i=0;i<a;i++)
{
soo+=foo[i];
}
for(LL i=0;i<n;i++)
{
if(foo[i]==foo[a-1])
{
goo++;
if(i<a)
koo++;
}
}
LL sum=0;
if(koo==a)
{
for(int i=a;i<=b;i++)
{
sum+=C(goo,i);
}
}
else
{
sum+=C(goo,koo);
}
cout<<fixed<<setprecision(15)<<(double)soo/a<<endl;
cout<<sum<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
const ll mod = 1000000007;
ll C[55][55];
void cominit()
{
for (int i=0; i<=50; i++) {
for (int j=0; j<=i; j++) {
if (j==0 || j==i) C[i][j] = 1LL;
else C[i][j] = (C[i-1][j-1] + C[i-1][j]);
}
}
}
int main()
{
ll n, a, b; cin >> n >> a >> b;
vector<ll> v(n);
rep(i, n) cin >> v[i];
sort(v.rbegin(),v.rend());
cominit();
double sum = 0;
rep(i, a) sum += v[i];
double ave = sum / a;
ll x = 0;
ll p = 0;
for (int i=0; i<n; i++) {
if (v[i] == v[a-1]) {
x++;
if (i < a) p++;
}
}
ll ans = 0;
if (p == a) {
for (; p<=b; p++) {
ans += C[x][p];
}
} else {
ans += C[x][p];
}
printf("%.6lf\n", ave);
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int64_t comb(int x,int y){
int64_t z=1;
for(int j=1;j<=y;j++) z=z*(x+1-j)/j;
return z;
}
int main(){
int n,a,b,j,k;
cin>>n>>a>>b;
vector<int64_t> v(n),w(n);
for(j=0;j<n;j++) cin>>v.at(j);
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
w.at(0)=v.at(0);
for(j=1;j<n;j++) w.at(j)=w.at(j-1)+v.at(j);
set<int> z={a-1};
for(j=a;j<b;j++){
k=*z.begin();
if(w.at(j)*(k+1)==w.at(k)*(j+1)) z.insert(j);
else if(w.at(j)*(k+1)>w.at(k)*(j+1)) z={j};
}
k=*z.begin();
cout<<fixed<<setprecision(10)<<(double)w.at(k)/(k+1)<<endl;
int l=-1,r=-1;
for(j=0;j<n;j++){
if(v.at(j)==v.at(*z.begin())&&l==-1) l=j;
else if(v.at(j)<v.at(*z.begin())&&r==-1) r=j-1;
}
if(r==-1) r=n-1;
int64_t ans=0;
for(auto j:z) ans+=comb(r-l+1,j-l+1);
cout<<ans<<endl;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll Conbi(int a, int b) {
if (b > a)
return 0;
b = min(b, a - b);
if (b == 0)
return 1;
ll ans = 1;
for (int i = 1; i <= b; i++, a--) {
ans *= a;
ans /= i;
}
return ans;
}
int main(void) {
int num, l, r, i, m = 0, s;
ll ans = 0;
double ave = 0.0;
cin >> num >> l >> r;
vector<ll> d(num);
for (i = 0; i < num; i++)
scanf("%lld", &d[i]);
sort(d.begin(), d.end(), greater<ll>());
for (i = 0; i < l; i++) {
ave += (double)d[i];
if (d[i] == d[l - 1])
m++;
}
for (s = m; i < num; i++) {
if (d[i] == d[l - 1])
s++;
}
if (d[0] != d[l - 1])
r = l;
for (i = 0; i <= r - l; i++)
ans += Conbi(s, m + i);
ave /= (double)l;
printf("%.9lf\n%lld\n", ave, ans);
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
using ll=long long;
using R=double;
// Combination Table
ll C[51][51]; // C[n][k] -> nCk
void comb_table(int N){
for(int i=0;i<=N;++i){
for(int j=0;j<=i;++j){
if(j==0 or j==i){
C[i][j]=1LL;
}else{
C[i][j]=(C[i-1][j-1]+C[i-1][j]);
}
}
}
}
int main(void){
int N,A,B;
cin >> N >> A >> B;
const int NMAX=50;
ll v[NMAX];
for(int i=0;i<N;++i){
cin >> v[i];
}
comb_table(N);
sort(v,v+N);
reverse(v,v+N);
R max_average=0.0;
for(int i=0;i<A;++i){
max_average+=v[i];
}
max_average/=A;
int a_th_val_num=0,a_th_val_pos=0;
for(int i=0;i<N;++i){
if(v[i]==v[A-1]){
a_th_val_num++;
if(i<A){
a_th_val_pos++;
}
}
}
ll cnt=0LL;
if(a_th_val_pos==A){
for(a_th_val_pos=A;a_th_val_pos<=B;++a_th_val_pos){
cnt+=C[a_th_val_num][a_th_val_pos];
}
}else{
cnt+=C[a_th_val_num][a_th_val_pos];
}
cout.precision(20);
cout << fixed << max_average << endl;
cout << cnt << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
int n,a,b;
long long c[60];
long long V(int x,int y){
long long ret=1;
for(int i=1;i<=x;i++){
ret*=y;ret/=i;
y--;
}
return ret;
}
int main(){
cin>>n>>a>>b;
for(int i=0;i<n;i++)cin>>c[i];
sort(c,c+n,greater<long long>());
long long cnt=0,ans;
for(int i=0;i<a;i++)cnt+=c[i];
long long x=0;
for(int i=0;i<n;i++){
if(c[i]==c[a-1])x++;
}
if(c[0]==c[a-1]){
ans=0;
for(int i=a;i<=b;i++){
ans+=V(i,x);
}
}
else{
int r=0;
for(int i=a-1;i>=0;i--){
if(c[i]!=c[a-1])break;
r++;
}
ans=V(r,x);
}
cout<<fixed<<setprecision(10)<<cnt/(a+0.0)<<endl;
cout<<ans<<endl;
return 0;
}
|
// D - Maximum Average Sets
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using DBL = double;
#define allr(x) (x).rbegin(),(x).rend()
#define rp(i,s,e) for(ll i=(s);i<(e);++i)
#define rpz(i,e) rp(i,0,e)
#define MAX 50
vvl nCr(MAX+1, vl(MAX+1, 0));
void nCr_table_create(ll N){
rp(n, 0, N+1) rp(r, 0, n+1){
if(r==0 || n==r) nCr[n][r] = 1;
else nCr[n][r] = nCr[n-1][r-1] + nCr[n-1][r];
}
}
int main(){
int N,A,B; cin>>N>>A>>B;
vl V(N); rpz(i, N) cin>>V[i];
sort(allr(V));
nCr_table_create(N);
DBL maxave = 0.0;
rpz(i, A) maxave += V[i];
maxave /= A;
int n = 0, r = 0;
rpz(i, N){
if(V[A-1] == V[i]){
n++;
if(i < A) r++;
}
}
ll maxcnt = 0;
// if(r == A) rp(r, A, B+1) maxcnt += nCr[n][r];
if(r == A) rp(r, A, min(n, B)+1) maxcnt += nCr[n][r];
else maxcnt = nCr[n][r];
printf("%.6f\n", maxave);
cout<< maxcnt <<endl;
} |
#include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
long long comb(int n, int r) {
if (r < 0 || n < r) return 0;
long long ret = 1;
for (int i = 1; i <= r; i++) (ret *= n--) /= i;
return ret;
}
#include <iomanip>
int main() {
cout << fixed << setprecision(12);
int n; cin >> n;
int a, b; cin >> a >> b;
vector<long long> v(n);
for (auto &vi: v) cin >> vi;
sort(v.rbegin(), v.rend());
auto sum = accumulate(begin(v), begin(v) + a, 0.0);
cout << sum / a << endl;
int l = a - 1, r = a - 1;
while (l > 0 && v[l - 1] == v[a - 1]) l--;
while (r + 1 < n && v[r + 1] == v[a - 1]) r++;
if (l == 0) {
long long cnt = 0;
for (int i = a; i <= b; i++) cnt += comb(r + 1, i);
cout << cnt << endl;
} else {
cout << comb(r - l + 1, a - l) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long long
using namespace std;
signed main() {
cout<<fixed<<setprecision(12);
double N,B,x,box,a,b,ans;
int c;
float ave,A;
ave=0.0;
ans=0;
cin >>N >>A >>B;
vector<int> v(N);
for(int i=0;i<N;i++){
cin >>v[i];
}
sort(v.begin(),v.end());
for(int i=N-1;i>N-A-1;i--){
ave=ave+v[i];
}
ave=ave/A;
cout <<ave <<endl;
for(a=0;v[N-A]==v[N-A+a+1];a++){
if(a+1>A-1){break;}
}
for(b=0;v[N-A]==v[N-A-b-1];b++){
if(N-A-b-1<0){break;}
}
if(v[N-A]<v[N-1]){
c=1;
for(int i=0;i<a+1;i++){
c=c*(a+1+b-i)/(i+1);
}
ans=ans+c;
}else{
for(int j=0;j<b+1;j++){
if(A+j>B){
break;
}
c=1;
for(int i=0;i<a+1+j;i++){
c=c*(a+1+b-i)/(i+1);
}
ans=ans+c;
}
}
cout<<ans <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
lint com[52][52], v[52];
map<lint, int> cnt;
void combination(int n){
for(int i=0;i<=n;i++) com[i][0] = 1;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) com[i][j] = com[i-1][j] + com[i-1][j-1];
}
int main(){
int n, a, b; cin >> n >> a >> b;
for(int i=0;i<n;i++){
cin >> v[i];
auto it = cnt.find(v[i]);
if(it==cnt.end()) cnt[v[i]] = 1;
else it->second++;
}
sort(v, v+n); reverse(v, v+n);
combination(n);
if(a <= cnt[v[0]]){
lint ans = 0;
for(int i=a;i<=min(cnt[v[0]], b);i++) ans += com[cnt[v[0]]][i];
cout << v[0] << '\n' << ans << endl;
return 0;
}
int need = 0;
double sum = 0;
for(int i=0;i<a;i++){
sum += v[i];
if(v[i]==v[a-1]) need++;
}
printf("%.8lf\n%lld", sum / a, com[cnt[v[a-1]]][need]);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n,a[55],l,r;
ll c[55][55];
bool cmp(ll a,ll b){
return a>b;
}
void init(){
c[0][0]=1;
for(ll i=1;i<=55;i++){
c[i][0]=1;
for(ll j=1;j<=i;j++)
c[i][j]=c[i-1][j-1]+c[i-1][j];
}
}
int main()
{
init();
scanf("%lld%lld%lld",&n,&l,&r);
ll sum1=0,sum2=0;
ll cnt1=0,cnt2=0;
for(ll i=1;i<=n;i++)
scanf("%lld",&a[i]);
sort(a+1,a+n+1,cmp);
for(ll i=1;i<=l;i++)
sum1+=a[i];
for(ll i=1;i<=n;i++)
if(a[i]==a[l])
cnt1++;
for(ll i=1;i<=l;i++)
if(a[i]==a[l])
cnt2++;
if(a[1]==a[l])
for(ll i=l;i<=r;i++)
sum2+=c[cnt1][i];
else
sum2=c[cnt1][cnt2];
printf("%lf\n%ld",(double)sum1/l,sum2);
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 60;
int n, l, r;
ll S, a[N], c[N][N];
int main() {
c[0][0] = 1;
for(int i = 1; i <= 50; ++i) {
c[0][i] = c[i][i] = 1;
for(int j = 1; j < i; ++j) {
c[j][i] = c[j][i - 1] + c[j - 1][i - 1];
}
}
scanf("%d%d%d", &n, &l, &r);
for(int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for(int i = 1; i <= l; ++i) S += a[i];
printf("%.15Lf\n", (long double)S / l);
int cnt = 0, tot = 0;
for(int i = l; i; --i)
if(a[i] == a[l]) ++cnt;
for(int i = 1; i <= n; ++i)
if(a[i] == a[l]) ++tot;
if(a[1] == a[l]) {
ll ans = 0;
for(int i = l; i <= r; ++i) ans += c[i][tot];
printf("%lld\n", ans);
} else printf("%lld\n", c[cnt][tot]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
long long int c[55][55],v[55];
int n,A,B;
long long int sum, num, val;
int main(){
cin>>n>>A>>B;
for(int i=0; i<=n; i++)
for(int j=0; j<=i; j++)
c[i][j] = j==0||j==i?1:c[i-1][j]+c[i-1][j-1];
for(int i=0; i<n; i++)
cin>>v[i];
sort(v,v+n);
reverse(v,v+n);
sum = 0;
num = 1;
val = 0;
for(int i=A; i<=B; i++){
long long int tot = 0;
long long int AA = 0, BB = 0;
for(int j=0; j<n; j++)
if(v[j] == v[i-1])AA++;
for(int j=0; j<i; j++){
tot += v[j];
if(v[j] == v[i-1])BB++;
}
long long int qq = c[AA][BB];
if(tot * num > sum * i){
sum = tot;
num = i;
val = qq;
}else
if(tot * num == sum * i){
val += qq;
}
}
printf("%lf\n", (double)(sum) / num);
fflush(stdout);
cout<<val<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long comb(int t, int a){
long long c = 1;
for(int i = 0; i < a; i++) c = c*(t-i)/(i+1);
return c;
}
int main(){
int n, a, b, i, s, t;
double ave = 0;
long long v[55], ans = 0;
scanf("%d%d%d", &n, &a, &b);
for(i = 0; i < n; i++){
scanf("%lld", &v[i]);
}
sort(v, v+n, greater<long long>());
for(i = 0; i < a; i++) ave += v[i];
ave /= a;
printf("%f\n", ave);
for(i = 0; ; i++) if(v[i] == v[a-1]) break;
s = i;
for(i = a; i < n; i++) if(v[i] != v[a-1]) break;
t = i;
if(!(s)) for(i = a; i <= b; i++) ans += comb(t, i);
else ans = comb(t-s, a-s);
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
signed main () {
int n, a, b;
cin >> n >> a >> b;
vector < long long > v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.rbegin(), v.rend());
long long m = 0;
for (int i = 0; i < a; ++i)
m += v[i];
cout << fixed << setprecision(15) << double(m) / double(a) << '\n';
long long l = lower_bound(v.begin(), v.end(), v[a - 1], greater<long long>()) - v.begin();
long long r = upper_bound(v.begin(), v.end(), v[a - 1], greater<long long>()) - v.begin();
long long len = r - l;
vector < long long > c(len + 1, 1), wa(len + 1, 1);
for (long long i = 1; i <= len; ++i) {
c[i] = (c[i - 1] * (len - i + 1)) / i;
wa[i] = wa[i - 1] + c[i];
}
if (v[a - 1] < v[0])
cout << c[a - l] << '\n';
else if (v[a - 1] == v[b - 1])
cout << wa[b - l] - wa[a - l - 1] << '\n';
else
cout << wa[len] - wa[a - l - 1] << '\n';
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
typedef long long ll;
ll comb[51][51];
int main()
{
int n, a, b;
cin >> n >> a >> b;
ll v[50];
for(int i = 0; i < n; i++){
cin >> v[i];
}
for(int i = 1; i <= n; i++){
for(int j = 0; j <= n; j++){
if(i == j || j == 0) comb[i][j] = 1;
else comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
}
}
sort(v, v+n, greater<ll>());
ll sum = 0;
for(int i = 0; i < a; i++){
sum += v[i];
}
double ansm = (double)sum / a;
ll ansc = 0;
int c = 0;
for(int i = 0; i < n; i++){
if(v[i] == v[a-1]) c++;
}
if(v[0] == v[a-1]){
for(int i = a; i <= b; i++){
ansc += comb[c][i];
}
}else{
int c1 = 0;
for(int i = 0; i < a; i++){
if(v[i] == v[a-1]) c1++;
}
ansc += comb[c][c1];
}
printf("%.6f\n%lld\n", ansm, ansc);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
vector<vector<ll>> v;
vector<vector<ll>> comb(ll n){
for(int i=0; i<v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(int j=1; j<v.size(); j++){
for(int k=1; k<j; k++){
v[j][k]=(v[j-1][k-1]+v[j-1][k]);
}
}
return v;
}
int main(){
ll N,A,B,V; cin>>N>>A>>B;
v.assign(N+1,vector<ll>(N+1,0));
vector<ll>Z(N);
for(int i=0; i<N; i++){cin>>V; Z[i]=V;}
sort(Z.begin(), Z.end());
ll a=upper_bound(Z.begin(), Z.end(), Z[N-A])-lower_bound(Z.begin(), Z.end(), Z[N-A]);
ll b=Z.end()-upper_bound(Z.begin(), Z.end(), Z[N-A]);
if(Z[N-1]!=Z[N-A]) B=A;
double ans=0; ll num=0;
for(int i=0; i<A; i++) ans+=Z[N-1-i];
ans/=A;
comb(N);
for(int i=A-b; i<=B-b; i++){
num+=v[a][i];
}
cout<<fixed<<setprecision(10)<<ans<<endl;
cout<<fixed<<setprecision(0)<<num<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for(int i=n;i>0;i--)
ll d=0;
ll nC[300010]={1};
ll comb(ll r){
if(nC[r]==0) nC[r]=comb(r-1)*(d-r+1)/r;
return nC[r];
}
int main(){
ll n,a,b,v[55];
cin>>n>>a>>b;
fr(i,n) cin>>v[i];
sort(v,v+n);reverse(v,v+n);
db s=0;
fr(i,a) s+=v[i];
printf("%.12f\n",s/a);
if(v[0]==v[a-1]){
ll ans=0;
fr(i,n) if(v[i]==v[0]) d++;
for(int i=a;i<=min(d,b);i++) ans+=comb(i);
cout<<ans<<endl;
}
else{
int c=0;
fr(i,n){
if(v[i]==v[a-1]){
if(i<a) c++;
d++;
}
}
cout<<comb(c)<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
long long c[55][55] = {0};
void f() {
c[0][0] = 0;
for(int i = 1; i < 55; i++) {
for(int j = 0; j <= i; j++) {
if(j == 0 || j == i) c[i][j] = 1;
else c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
f();
int n, a, b;
cin >> n >> a >> b;
vector<long long> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.rbegin(), v.rend());
long long last, rem = 0, sum = 0;
map<long long, int> mp;
for(int i = 0; i < n; i++) {
if(i < a) {
sum += v[i];
last = v[i];
mp[last]++;
} else if(last == v[i]) {
rem++;
}
}
cout << setprecision(6) << fixed << 1.0 * sum / a << endl;
int total = rem + mp[last];
if(mp.size() == 1) {
long long cnt = 0;
for(int i = a; i <= b; i++) {
cnt += c[total][i];
}
cout << cnt << endl;
} else {
cout << c[total][mp[last]] << endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define int long long
const int inf=1145141919;
const int dd[]={0,-1,0,1,0};
using namespace std;
int p[50],q[51],r[51];
signed main(){
int n,a,b;
int i,j;
cin>>n>>a>>b;
for(i=0;i<n;i++)
cin>>p[i];
q[0]=1;
for(i=0;i<n;i++)
for(j=i;j>=0;j--){
int x=r[j]+p[i];
if(x>r[j+1])
q[j+1]=q[j],r[j+1]=x;
else if(x==r[j+1])
q[j+1]+=q[j];
}
int x=0,y=-1;
for(i=a;i<=b;i++){
if(y!=-1&&r[i]*(i-1)!=y*i)
break;
x+=q[i];
y=r[i];
}
cout<<fixed<<setprecision(15)<<(double)r[a]/a<<endl<<x<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll C[51][51]; // C[n][k] -> nCk
void comb_table(int N) {
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
C[i][j]=1;
}
else {
C[i][j] = C[i-1][j-1]+C[i-1][j];
}
}
}
}
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<ll> v(N);
for(int i=0; i<N; i++) cin >> v[i];
comb_table(N);
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
double Mave=0;
for(int i=0; i<A; i++) Mave += v[i];
Mave /= A;
int n=0, p=0;
for (int i = 0; i < N; i++) {
if (v[i] == v[A - 1]) {
n++;
if(i<A) p++;
}
}
ll cnt=0;
if (p == A) {
for (p = A; p <= B; p++) {
cnt += C[n][p];
}
}
else {
cnt += C[n][p];
}
cout.precision(20);
cout << fixed << Mave << endl;
cout << cnt << endl;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <cmath>
using Int = long long;
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
Int comb(Int x, Int y)
{
if (y == 0) return 1;
if (x - y < y) return comb(x, x - y);
return comb(x-1, y-1) * x / y;
}
int main()
{
int N, A, B; cin >> N >> A >> B;
vector<Int> V(N);
for(auto& i : V) cin >> i;
sort(V.begin(), V.end(), [](Int x, Int y){ return x > y; });
Int sum = 0;
REP(i, A) sum += V[i];
int cnt = 0, cntin = 0;
REP(i, N) if (V[i] == V[A-1]) cnt++;
REP(i, A) if (V[i] == V[A-1]) cntin++;
if (cntin == A) {
Int c = 0;
for (int i = A; i <= min(B, cnt); i++) c += comb(cnt, i);
cout << V[0] << '\n' << c << endl;
} else {
cout << setprecision(20) << (1.0 * sum / A) << '\n' << comb(cnt, cntin) << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int nCm(int n,int m){
m=min(m,n-m);
if( m==0)return 1;
else return nCm(n-1,m-1)*n/m;
}
signed main(){
int n,a,b;cin>>n>>a>>b;
vector<int> v(n);
for(auto&& w:v)cin>>w;
sort(v.begin(),v.end(),greater<int>());
int a0=v[a-1];
int sm=accumulate(v.begin(),v.begin()+a,0ll);
double avg=(double)sm/a;
int x=count(v.begin(),v.end(),a0);
int y=count(v.begin(),v.begin()+a,a0);
// cerr<<x<<" "<<y<<" "<<nCm(x,y)<<endl;
int cnt=0;int b0=min(b,y-x+a);
if(v[0]>a0){cnt=nCm(x,y);}
else {
for(int i=0;i+a<=b && y+i<=x;i++){
cnt+=nCm(x,(y+i));}
}
cout<<setprecision(10);
cout<<avg<<endl;
cout<<cnt<<endl;
} |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
const int M=100010;
int INF=1000000007;
using ll=long long;
ll C[51][51];
void comb_table(int N){
rep(i,0,N+1){
rep(j,0,i+1){
if(j==0||j==i)C[i][j]=1LL;
else C[i][j]=(C[i-1][j-1]+C[i-1][j]);
}
}
}
int main(){
int n,a,b;
double ave=0.0;
vector<ll> v(55);
cin>>n>>a>>b;
rep(i,0,n)cin>>v[i];
comb_table(n);
sort(ALL(v),greater<ll>());
rep(i,0,a)ave+=v[i];
ave/=a;
//v[a-1]と同じ値を持つ数の個数をl,
//大きい方から,v[a-1]を使った個数をcur_lとする.
int l=0,cur_l=0;
rep(i,0,n){
if(v[i]==v[a-1]){
l++;
if(i<a)
cur_l++;
}
}
ll cnt=0;
//大きい方から並べてa個までの数が全て同じ時.
if(cur_l==a)
rep(i,a,b+1)cnt+=C[l][i];
//そうでないとき(最後に使った文字の総数)C(最後に使った文字の使った文字数);
else cnt+=C[l][cur_l];
cout.precision(20);
cout<<fixed<<ave<<endl;
cout<<cnt<<endl;;
} |
#include <bits/stdc++.h>
using namespace std;
long long a[100];
long long C[55][55];
void init()//排列数
{
C[0][0]=1;
for(int i=1;i<=50;i++)
{
C[i][0]=1;
for(int j=1;j<=i;j++)
C[i][j]=C[i-1][j-1]+C[i-1][j];
}
}
int main()
{
init();
int n,A,B;
cin>>n>>A>>B;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1);
long long sum=0,ans=0;
for(int i=n-A+1;i<=n;i++)
sum+=a[i];
long long cot=0,tot=0;
for(int i=n-A+1;i<=n;i++) if(a[i]==a[n-A+1]) cot++;
for(int i=1;i<=n;i++) if(a[i]==a[n-A+1]) tot++;
if(a[n]==a[n-A+1])//特判
for(int i=A;i<=B;i++)
ans+=C[tot][i];
else ans=C[tot][cot];
printf("%lf\n%lld",(double)sum/A,ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n;
int a,b;
long long arr[55];
long long nck[55][55];
int main()
{
cin >> n >> a >> b;
assert(a<=b);
for(int i=0;i<n;i++) cin >> arr[i];
sort(arr,arr+n);
long double ans=0;
for(int i=0;i<a;i++)
ans+=arr[n-i-1];
cout << fixed << setprecision(10) << ans/a << endl;
for(int i=0;i<=n;i++)
{
nck[i][0]=1;
for(int j=1;j<=i;j++) nck[i][j]=nck[i-1][j-1]+nck[i-1][j];
}
int comn=0,comnt=0;
for(int i=n-a;i<n;i++)
{
comn+=arr[i]==arr[n-a];
}
for(int i=0;i<n;i++)
comnt+=arr[i]==arr[n-a];
if(arr[n-a]==arr[n-1])
{
long long ans=0;
for(int i=a;i<=min(b,comnt);i++)
ans+=nck[comnt][i];
cout << ans << endl;
return 0;
}
//cout << comn << " " << comnt << endl;
cout << nck[comnt][comn] << endl;
} |
#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
int N_MAX=50;
typedef long long ll;
int main()
{
int n,a,b,m,k,t=0,i;
ll c=1,res;
ll v[N_MAX];
long double s=0;
cin >> n >> a >> b;
for(i=0;i<n;i++)
cin >> v[i];
sort(v,v+n,greater<ll>());
for(i=0;i<a;i++){
s+=v[i];
if(i>0&&v[i]<v[i-1])
t=i;
}
s/=a;
for(;i<n;i++)
if(v[i]<v[t])
break;
m=i-t;
k=a-t;
for(i=1;i<=k;i++){
c*=m+1-i;
c/=i;
}
res=c;
if(t==0)
for(;i<=min(m,b);i++){
c*=m+1-i;
c/=i;
res+=c;
}
cout << setprecision(10) << s << endl;
cout << res << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N, A, B;
long long int v[505];
long long comb[100][100];
void init()
{
comb[0][0] = 1;
for(int i=1; i<70; ++i)
{
comb[i][0] = comb[i][i] = 1;
for(int j=1; j<i; ++j)
comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
}
}
long long solve(int x)
{
--x;
int r = 0;
int n = 0;
for(int i=0; i<=x; ++i) if(v[x]==v[i]) ++r;
for(int i=0; i<N; ++i) if(v[x]==v[i]) ++n;
return comb[n][r];
}
int main()
{
init();
scanf("%d%d%d", &N, &A, &B);
for(int i=0; i<N; ++i) scanf("%lld", v+i);
sort(v, v+N); reverse(v, v+N);
double y = 0;
for(int i=0; i<A; ++i) y += v[i];
printf("%.12f\n", y/A);
long long ans = solve(A);
for(int i=A+1; i<=B; ++i)
if(v[i-1] == v[0]) ans += solve(i);
printf("%lld\n", ans);
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn=1e6;
ll k[maxn];
ll n,ans=0,q[100][100];
int c,d;
int a,b;
ll way;
void yang()
{
q[0][0]=1;
q[1][0]=1;
q[1][1]=1;
for (int i=2;i<=50;i++)
{
q[i][0]=1;
for(int j=1;j<=i;j++)
q[i][j]=q[i-1][j]+q[i-1][j-1];
}
}
bool cmp(ll x,ll y)
{
return x>y;
}
int main()
{
yang();
cin>>n>>a>>b;
for(int i=1;i<=n;i++)
{
scanf("%lld",&k[i]);
}
sort(k+1,k+n+1,cmp);
if(k[1]==k[a])
{
c=a;
for(int i=a;i<n;i++)
{
if(k[i]==k[i+1])
c++;
else break;
}
for(int i=a;i<=min(b,c);i++)
{
way+=q[c][i];
}
}
if(k[1]!=k[a])
{
for(int i=1;i<=n;i++)
{
if(k[i]==k[a])
{
c++;
}
}
for(int i=1;i<=a;i++)
{
if(k[i]==k[a])d++;
}
way=q[c][d];
}
for(int i=1;i<=a;i++)
{
ans+=k[i];
}
printf("%.6lf\n",(double)ans/a);
cout<<way;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long long value[51];
long long dp[51][51];
int N,A,B;
bool comp(long long a,long long b)
{
return a>b?true:false;
}
void init()
{
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=50;i++)
{
dp[i][0]=1;
for(int j=1;j<=i;j++)
dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
}
}
int main()
{
init();
cin>>N>>A>>B;
{
double sum=0;
for(int i=0;i<N;i++)
cin>>value[i];
sort(value,value+N,comp);
// reverse(value,value+N);//大->小
for(int i=0;i<A;i++)
sum+=value[i];
sum/=A;
int num=0,k=0;
for(int i=0;i<N;i++)
{
if(value[i]==value[A-1])
{
num++;
if(i<A)
k++;
}
}
long long ans=0;
if(k==A)//前A个相同,可以增加个数
{
for(int i=A;i<=B;i++)
ans+=dp[num][i];
}
else
ans+=dp[num][k];
printf("%.15f\n",sum);
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, a, b, e = 0, f = 0;
ll c[55] = {}, d = 0, g[55][55] = {1};
for (int i = 1; i <= 50; i++) {
g[i][0] = 1;
for (int j = 1; j <= i; j++) g[i][j] = g[i - 1][j] + g[i - 1][j - 1];
}
cin >> n >> a >> b;
for (int i = 0; i < n; i++) cin >> c[i];
sort(c, c + n); reverse(c, c + n);
for (int i = 0; i < a; i++) d += c[i];
for (int i = 0; i < n; i++) {
if (c[i] == c[a - 1]) e++;
if (c[i] > c[a - 1]) f++;
}
ll z = 0;
if (c[0] == c[a - 1]) for (int i = a; i <= b; i++) z += g[e][i - f];
else z = g[e][a - f];
cout << fixed << setprecision(13) << d * 1.0 / a << '\n';
cout << z << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
long N, A, B;
cin >> N >> A >> B;
vector<pair<long,long>> data(N + 1);
data.at(0).first = 1;
long a;
for(long i = 0; i < N; i++){
cin >> a;
for(long j = N - 1; j >= 0; j--){
if(data.at(j).first >= 1){
if(data.at(j + 1).second == data.at(j).second + a){
data.at(j + 1).first += data.at(j).first;
} else if(data.at(j + 1).second < data.at(j).second + a){
data.at(j + 1).second = data.at(j).second + a;
data.at(j + 1).first = data.at(j).first;
}
}
}
}
map<double, long> mp;
for(long i = A; i <= B; i++){
if(data.at(i).second % i == 0)mp[data.at(i).second / i] += data.at(i).first;
else mp[data.at(i).second / ((double)i)] += data.at(i).first;
}
auto c = mp.end();
c--;
cout << setprecision(100) << c->first << endl;
cout << c->second << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const long long maxn=100+5;
long long n,m,d,ans1,ans2=0,cnt1,cnt2;
long long a[maxn],C[maxn][maxn];
bool cmp(long long x,long long y)
{
return x>y;
}
void init()
{
C[0][0]=1;
C[1][0]=1;
C[1][1]=1;
for(int i=1;i<=50;i++)
{
C[i][0]=1;
for(int j=1;j<=i;j++)
C[i][j]=C[i-1][j]+C[i-1][j-1];
}
}
int main()
{
init();
cin>>n>>m>>d;
for(long long i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a+1,a+n+1,cmp);
for(long long i=1;i<=m;i++)
{
ans1+=a[i];
}
for(long long i=1;i<=n;i++)
{
if(a[i]==a[m])
{
cnt1++;
}
}
for(long long i=1;i<=m;i++)
{
if(a[i]==a[m])
{
cnt2++;
}
}
if(a[1]==a[m])
{
for(long long i=m;i<=min(cnt1,d);i++)
{
ans2+=C[cnt1][i];
}
}
if(a[1]!=a[m]) ans2=C[cnt1][cnt2];
printf("%.6lf\n%lld",(double)ans1/m,ans2);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long long nCr(int n, int r){
if(r == 0) return 1;
return nCr(n,r-1) * (n-(r-1)) / r;
}
int main(){
int n,a,b;
cin >> n >> a >> b;
long long v[100];
for(int i = 0;i < n;i++){
cin >> v[i];
}
sort(v,v+n,greater<long long>());
long long tmp = 0;
for(int i = 0;i < a;i++){
tmp += v[i];
}
printf("%.8lf\n",(double)tmp/(double)a);
int cnt = 0;
long long ans = 0;
for(int i = 0;i < n;i++){
if(v[0] == v[i]){
cnt++;
}
}
if(v[a] == v[0]){
for(int i = a;i <= min(cnt,b);i++){
ans += nCr(cnt,i);
}
}else{
int cnt2 = 0;
int tmp2 = 0;
for(int i = 0;i < n;i++){
if(v[a-1] == v[i]){
cnt2++;
}else if(v[a-1] < v[i]){
tmp2++;
}
}
ans = nCr(cnt2,a-tmp2);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long ncr(long n,long r) {
long re=1;
for(long i=1;i<=r;i++) {
re*=n-i+1;
re/=i;
}
return re;
}
int main() {
long double n,a,b,ans1=0,ans2=0;
cin >> n >> a >> b;
vector<long double> v(n);
map<long double,long double> aaa;
for(long i=0;i<n;i++) {
cin >> v[i];
aaa[v[i]]++;
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
for(long i=0;i<a;i++) ans1+=v[i];
ans1/=a;
if(aaa[v[0]]>a) {
for(long i=a;i<=min(b,aaa[v[0]]);i++) ans2+=ncr(aaa[v[0]],i);
} else {
for(long i=0;true;i++) {
if(v[i]==v[a-1]) {
ans2=ncr(aaa[v[a-1]],a-i);
break;
}
}
}
cout << fixed << setprecision(10);
cout << ans1 << endl;
cout << fixed << setprecision(0);
cout << ans2 << endl;
} |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long ll;
//using ll=long long;
using vll=vector<ll>;
ll nCr(int n, int r)
{
ll ret=1;
if(r*2>n) r=n-r;
for(int i=0;i<r;i++)
{
ret*=(n-i);
ret/=(i+1);
}
return ret;
}
int main(void)
{
int n, a, b;
while(scanf("%d%d%d", &n, &a, &b)==3)
{
vll v(n);
for(int i=0;i<n;i++) scanf("%lld", &v[i]);
sort(v.begin(), v.end(), greater<ll>());
if(v[0]!=v[a-1]) b=a;
ll sum=0;
for(int i=0;i<a;i++) sum+=v[i];
int l, r;
for(r=a-1;r<n;r++)
{
if(v[r]<v[a-1]) break;
}
for(l=a;l>0;l--)
{
if(v[l-1]>v[a-1]) break;
}
ll ans=0;
for(int i=a-1;i<min(r,b);i++)
{
ans+=nCr(r-l, i-l+1);
}
printf("%.8f\n", (double)sum/a);
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=55;
int n,a,b;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>a>>b;
vector<ll> arr(n);
for(ll& x:arr) cin>>x;
sort(arr.begin(),arr.end(),greater<ll>());
double res=1.0*accumulate(arr.begin(),arr.begin()+a,0LL)/a;
cout<<fixed<<setprecision(7)<<res<<'\n';
ll C[55][55];
for(int i=0;i<=50;++i)
C[i][0]=1;
C[1][1]=1;
for(int i=2;i<=50;++i)
for(int j=1;j<=50;++j)
C[i][j]=C[i-1][j-1]+C[i-1][j];
int num=0,need=0;
for(int i=0;i<n;++i){
if(arr[i]==arr[a-1]){
++num;
if(i<a) ++need;
}
}
ll ways=C[num][need];
for(int i=a;i<b;++i){
if(arr[i]==arr[0])
ways+=C[num][i+1];
}
cout<<ways<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin>>N>>A>>B;
vector<int64_t> p(N);
for(int i=0;i<N;i++){
cin>>p[i];
}
sort(p.begin(),p.end());
reverse(p.begin(),p.end());
int X=0;
for(int i=1;i<A;i++){
if(p[i]!=p[i-1]){
X=i;
}
}
int64_t Z=0,ans=1;
for(int i=0;i<A;i++){
Z+=p[i];
}
double potato=Z;
potato/=A;
cout<<fixed<<setprecision(20);
cout<<potato<<endl;
if(X){
int S=A;
while(S<N){
if(p[S]!=p[S-1]){
break;
}
S++;
}
S-=A;
for(int i=0;i<S;i++){
ans*=(A-X+S-i);
ans/=(i+1);
}
}
else{
int S=A;
while(S<N){
if(p[S]!=p[S-1]){
break;
}
S++;
}
ans--;
for(int i=A;i<=min(B,S);i++){
int64_t L=1;
for(int j=0;j<i;j++){
L*=(S-j);
L/=(j+1);
}
ans+=L;
}
}
cout<<ans<<endl;
} |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, A, B, SUM = 0, count = 0, ans = 0, v[50], C[60][60] = {};
cin >> N >> A >> B;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= i; ++j) {
if (j == 0 or j == i) {
C[i][j] = 1;
}
else {
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]);
}
}
}
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v, v + N, greater<long long>());
for (int i = 0; i < A; i++) {
SUM += v[i];
}
printf("%.8f\n", (double)SUM / (double)A);
if (v[0] == v[A - 1]) {
for (int i = 0; i < N; i++) {
if (v[i] == v[0]) count++;
}
for (int i = A; i <= B; i++) {
ans += C[count][i];
}
cout << ans;
}
else {
for (int i = 0; i < N; i++) {
if (v[A - 1] == v[i]) {
count++;
if (i < A) ans++;
}
}
cout << C[count][ans];
}
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define REP(i,n) FOR(i,0,n)
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using ll = long long;
ll C[51][51];
void comb(int n){
REP(i,n+1) REP(j,i+1) {
if (j == 0 || j==i) C[i][j] = 1;
else C[i][j] = C[i-1][j-1] + C[i-1][j];
}
}
int main() {
ll n, a, b; cin >> n >> a >> b;
vector<ll> v(n); REP(i,n) cin >> v[i];
whole(sort,v,greater<ll>());
comb(n);
double ave = 0.0; REP(i,a) ave += v[i];
ave /= (double)a;
ll cnt1 = 0, cnt2 = 0;
REP(i,n) {
if (v[i] == v[a-1]) {
cnt1++;
if (i < a) cnt2++;
}
}
ll ans = 0;
if (cnt2 == a) {
FOR(i,a,b+1) ans += C[cnt1][i];
} else {
ans += C[cnt1][cnt2];
}
cout << setprecision(20);
cout << ave << endl;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int combination(int n, int r) {
if (n < r)return 0;
r = min(r, n - r);
int ret = 1;
for (int i = 1; i <= r; i++) {
ret *= n + 1 - i;
ret /= i;
}
return ret;
}
signed main() {
int n, a, b, v[60];
cin >> n >> a >> b;
for (int i = 0; i < n; i++)cin >> v[i];
sort(v, v + n);
int cnt = 0;
for (int i = 0; i < a; i++)cnt += v[n - 1 - i];
if (cnt / (a * 10) > 0)cout << cnt / (a * 10);
cnt %= a * 10;
printf("%.6f\n", (double)cnt / a);
cnt = 0; int cnt1 = 0;
for (int i = 0; i < n; i++) {
if (v[i] == v[n - a]) {
cnt++;
if (i >= n - a)cnt1++;
}
}
int ans = 0; int p = (v[n - 1] == v[n - a] ? b - a + 1 : 1);
for (int i = 0; i < p; i++)ans += combination(cnt, cnt1 + i);
cout << ans << endl;
cin >> n;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long n, a, b, s, x, y, v[55], c[55][55]={1};
int main() {
int i, j;
cin>>n>>a>>b;
for(i=0; i<n; i++) cin>>v[i];
sort(v, v+n);
for(i=n-1; i>=n-a; i--) s += v[i];
printf("%.9f\n", 1.*s/a);
x = upper_bound(v, v+n, v[n-a]) - lower_bound(v, v+n, v[n-a]);
for(i=1; i<=x; i++) {
c[i][0] = 1;
for(j=1; j<=x; j++) c[i][j] = c[i-1][j-1] + c[i-1][j];
}
if(v[n-a] != v[n-1]) {
y = upper_bound(v+n-a, v+n, v[n-a]) - lower_bound(v+n-a, v+n, v[n-a]);
cout<<c[x][y];
} else {
s = 0;
for(i=a; i<=min(x, b); i++)
s += c[x][i];
cout<<s;
}
return 0;
} |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
LL comb(LL n, LL k){
LL r=1;
for(LL d=1; d<=k; d++){
r*=n;
n--;
r/=d;
}
return r;
}
int main(){
LL N, A, B;
cin >> N >> A >> B;
vector<double> v(N);
rep(i,N) cin >> v[i];
sort(v.begin(),v.end(),greater<double>());
double sum=0;
rep(i,A) sum+=v[i];
double ans=sum/A;
LL num=0, n=0;
rep(i,N) if(v[i]==v[0]) n++;
if(n>=A) for(LL k=A; k<=min(n,B); k++) num+=comb(n,k);
else{
n=0;
rep(i,N) if(v[i]==v[A-1]) n++;
LL k=0;
rep(i,A) if(v[i]==v[A-1]) k++;
num+=comb(n,k);
}
cout << fixed << setprecision(15) << ans << endl;
cout << num << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
long long com[55][55];
void c_set()
{
com[0][0]=1;
for(int i=1;i<=50;i++)
{
for(int j=0;j<=i;j++)
{
com[i][j]=(j!=0 ? com[i-1][j-1] : 0) + (j!=i ? com[i-1][j] : 0);
}
}
}
int main()
{
int n,a,b;
cin >> n >> a >> b;
vector<long long> v(n);
for(int i=0;i<n;i++)
cin >> v[i];
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
long double ans=0;
for(int i=0;i<a;i++)
ans+=v[i];
ans/=a;
cout << fixed << setprecision(9) << ans << endl;
c_set();
long long x=v[a-1];
int c=0;
int bc=0;
bool flag=false;
for(int i=0;i<n;i++)
{
if(v[i]==x)
{
c++;
flag=true;
}
else
{
if(flag==false)bc++;
else break;
}
}
long long an=0;
if(bc==0)
{
for(int i=a;i<=min(b,c);i++)
{
long long tmp=com[c][i];
an+=tmp;
}
}
else
{
an+=com[c][a-bc];
}
cout << an << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, A, B;
ll v[50];
ll comb[51][51];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> A >> B;
for (int i = 0; i <= N; i++) {
comb[i][0] = comb[i][i] = 1;
for (int j = 1; j < i; j++) {
comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
}
}
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v, v + N);
reverse(v, v + N);
double ave = 0;
for (int i = 0; i < A; i++) {
ave += v[i];
}
ave /= A;
ll cnt = 0;
int p = 0, q = 0;
for (int i = 0; i < N; i++) {
if (i < A) p += v[i] == v[A - 1];
q += v[i] == v[A - 1];
}
if (v[0] == v[A - 1]) {
for (int i = A; i <= min(B, q); i++) {
cnt += comb[q][i];
}
} else {
cnt = comb[q][p];
}
cout << ave << endl;
cout << cnt << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cm[51][51];
ll comb(ll n,ll r){
if(cm[n][r]!=-1) return cm[n][r];
if(r==0||r==n) return cm[n][r]=1;
return cm[n][r]=(comb(n-1,r-1)+comb(n-1,r));
}
int main(){
ll n,a,b,max_n=0,cnt=0,tmp_num,bc,ac;
cin >> n >> a >> b;
vector<ll> v(n);
for(int i=0;i<=50;i++){
for(int j=0;j<=50;j++){
cm[i][j]=-1;
}
}
for(int i=0;i<n;i++){
cin >> v[i];
}
sort(v.begin(),v.end(),greater<ll>());
for(int i=0;i<a;i++){
max_n+=v[i];
}
tmp_num=max_n;
tmp_num-=v[a-1];
printf("%.7lf\n",(double)max_n/a);
for(int i=0;i<=b-a;i++){
tmp_num+=v[a+i-1];
if(tmp_num*a==max_n*(a+i)){
bc=ac=0;
for(int k=0;k<n;k++){
if(v[a+i-1]==v[k]){
if(k<=a+i-1)bc++;
else ac++;
}
}
cnt+=comb(ac+bc,ac);
}
}
cout << cnt << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define bg begin()
#define ed end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++);
ll C[51][51];//nCk=C[n][k]
void comb_table(ll N){
for(int i=0;i<=N;++i){
for(int j=0;j<=i;++j){
if(j==0 or j==i){
C[i][j]=1LL;
}else{
C[i][j]=(C[i-1][j-1]+C[i-1][j]);
}
}
}
}
//a,b x
int main(){
comb_table(50);
ll N,A,B; cin>>N>>A>>B;
vector<ll> V(N);
rep(i,N) cin>>V[i];
sort(V.bg,V.ed,greater<ll>());
ll sum=0,mem;
rep(i,A){
sum+=V[i];
mem=V[i];
}
double ave=(double)sum/A;
if(mem==V[0]){
ll cnt=0,ans=0;
rep(i,N){
if(V[i]==mem) cnt++;
}
for(int i=A;i<=min(B,cnt);i++){
ans+=C[cnt][i];
}
printf("%.8f\n",ave);
cout<<ans;
}
else{
ll cnt=0,memcnt=0;
rep(i,N){
if(V[i]>mem) cnt++;
else if(V[i]==mem) memcnt++;
}
printf("%.8f\n",ave);
cout<<C[memcnt][A-cnt];
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+20;
const int M=2e2+20;
ll v[N];
ll C[M][M];
void init()
{
memset(C,0,sizeof(C));
C[0][0]=1;
for(int i=1;i<=50;i++)
{
C[i][0]=1;
for(int j=1;j<=i;j++)
C[i][j]=C[i-1][j-1]+C[i-1][j];
}
}
int main()
{
int n,A,B;
init();
while(cin>>n>>A>>B)
{
double ave=0;
for(int i=0;i<n;i++)
cin>>v[i];
sort(v,v+n);
reverse(v,v+n);//大->小
for(int i=0;i<A;i++)
ave+=v[i];
ave/=A;
int num=0,k=0;
for(int i=0;i<n;i++)
{
if(v[i]==v[A-1])
{
num++;
if(i<A)
k++;
}
}
ll ans=0;
if(k==A)//前A个相同,可以增加个数
{
for(int i=A;i<=B;i++)
ans+=C[num][i];
}
else
ans+=C[num][k];
cout.precision(20);
cout<<fixed<<ave<<endl;
cout<<ans<<endl;
}
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<map>
#include<numeric>
#include<functional>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
ll nCr[51][51];
int main(){
nCr[0][0] = 1;
rep(i, 50) rep(j, 50){ nCr[i + 1][j] += nCr[i][j]; nCr[i + 1][j + 1] += nCr[i][j]; }
int n, a, b; scanf("%d %d %d", &n, &a, &b);
ll v[50]; map<ll, int> c, u;
rep(i, n){ scanf("%lld", &v[i]); c[v[i]]++; }
sort(v, v + n, greater<ll>());
rep(i, a) u[v[i]]++;
double avg = (double)accumulate(v, v + a, 0LL) / a;
printf("%.30f\n", avg);
if(u.size() > 1) printf("%lld\n", nCr[c[v[a - 1]]][u[v[a - 1]]]);
if(u.size() == 1) printf("%lld\n", accumulate(nCr[c[v[a - 1]]] + a, nCr[c[v[a - 1]]] + b + 1, 0LL));
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<map>
using namespace std;
typedef long long ll;
ll COM(ll n, ll k) {
if (k < 0 || n < k) return 0;
int64_t ret = 1;
for (int64_t i = 1; i <= k; ++i) {
ret *= n--;
ret /= i;
}
return ret;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
reverse(v, v + n);
ll sum = 0;
for (int i = 0; i < a; i++) {
sum += v[i];
}
map<ll, ll>mp1;
map<ll, ll>mp2;
printf("%lf\n", (double)sum / a);
sum = 0;
if (v[0] == v[a - 1]) {
int num = 0;
for (int i = 0; i < n; i++) {
if (v[i] == v[0])num++;
}
for (int i = a; i <= b; i++) {
sum += COM(num, i);
}
cout << sum << endl;
}
else {
for (int i = 0; i < a; i++) {
mp1[v[i]]++;
}
for (int i = 0; i < n; i++) {
mp2[v[i]]++;
}
cout << COM(mp2[v[a - 1]], mp1[v[a - 1]]) << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<iomanip>
using lint=int64_t;
using namespace std;
int Cnt(lint *ar,int l,int r,lint val)
{
int ret=0;
for(int i=l;i<=r;i++)
if(ar[i]==val)
ret++;
return ret;
}
lint com[55][55];
int main()
{
com[0][0]=1;
for(int i=0;i<55;i++)
{
for(int j=0;j<=i;j++)
{
if(j==0 || j==i)
com[i][j]=1;
else
com[i][j]=com[i-1][j]+com[i-1][j-1];
}
}
int N,A,B;
lint v[55]={};
cin >> N >> A >> B;
for(int i=0;i<N;i++)
cin >> v[i];
sort(v,v+N,greater<lint>());
double ave=0;
for(int i=0;i<A;i++)
ave+=(double)v[i]/A;
lint ans=0;
if(v[0]==v[A-1])
{
int cnt=Cnt(v,0,N-1,v[0]);
for(int i=A;i<=min(B,cnt);i++)
ans+=com[cnt][i];
}
else
{
int cnt=Cnt(v,0,N-1,v[A-1]);
int acnt=Cnt(v,0,A-1,v[A-1]);
ans=com[cnt][acnt];
}
cout << fixed << setprecision(10);
cout << ave << endl;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, a, b, cnt = 0;
vector<long long> v;
vector< vector<long long> > c;
long long sum = 0, num = 0;
cin >> n >> a >> b;
v.assign(n, 0);
for(int i=0;i<n;i++) cin >> v[i];
sort(v.begin(), v.end(), greater<long long>());
for(int i=0;i<a;i++) sum += v[i];
for(int i=0;i<n;i++){
if(v[i] == v[a-1]) cnt++;
}
c.assign(cnt+1, vector<long long>());
for(int i=1;i<=cnt;i++){
c[i].assign(i+1, 1);
for(int j=1;j<i;j++){
c[i][j] = c[i-1][j] + c[i-1][j-1];
}
}
int d = 0;
for(int i=0;i<b;i++){
if(v[i] == v[a-1]) d++;
if(i >= a && v[i] != v[0]) break;
if(i >= a-1) num += c[cnt][d];
}
cout << fixed << setprecision(8) << (double) sum / a << endl;
cout << num << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,a,b,i,j;
map <long long, int> cnt;
long long v[55],ncr[55][55];
int main(){
scanf("%d%d%d", &n, &a, &b);
for(i = 0; i < n; i++){
scanf("%lld", &v[i]);
cnt[v[i]]++;
}
ncr[0][0] = 1;
for(i = 1; i <= n; i++){
ncr[i][0] = 1;
for(j = 1; j <= n; j++)
ncr[i][j] = ncr[i - 1][j] + ncr[i - 1][j - 1];
}
sort(v, v + n);
reverse(v, v + n);
long long pre = -1;
int now = 0;
long long cur = 0;
pair <long long, int> res = {1, 1};
long long ways = 0;
for(i = 0; i < n; i++){
if(v[i] != pre)
now = 0;
now++;
cur += v[i];
if(i + 1 >= a && i + 1 <= b){
if(cur * res.second > res.first * (i + 1)){
res = {cur, i + 1};
ways = ncr[cnt[v[i]]][now];
}
else if(cur * res.second == res.first * (i + 1))
ways += ncr[cnt[v[i]]][now];
}
pre = v[i];
}
printf("%.12lf\n%lld\n", res.first * 1.0 / res.second, ways);
}
|
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<functional>
using namespace std;
long long convination(int n, int r) {
if (r == 0)
return 1;
else
return convination(n, r - 1)*(n - r + 1) / r;
}
int main() {
long long n, a, b, v[60], c = 0, d, ans = 0;
double amax, sum = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++)cin >> v[i];
sort(v, v + n, greater<long long>());
for (int i = 0; i < a; i++) {
sum += v[i];
if (v[c] > v[i])c = i;
}
amax = sum / a;
d = a - 1;
for (int i = a; i < n; i++) {
if (v[i] == v[c])d = i;
else break;
}
if (c != 0) {
ans = convination(d - c + 1, a - c);
}
else {
for (int i = a; i <= min(d + 1, b); i++) {
ans += convination(d + 1, i);
}
}
printf("%.8lf ", amax);
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 64;
ll com[MAX][MAX];
void COMinit() {
for(int i=0;i<MAX;i++){
com[i][0]=1;
com[i][i]=1;
}
for(int i=1;i<MAX;i++){
for(int j=0;j<=i;j++){
com[i][j]=com[i-1][j-1]+com[i-1][j];
}
}
}
ll COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return com[n][k];
}
int main(){
COMinit();
int n,a,b;
cin >> n >> a >> b;
vector<ll> x(n);
for(int i=0;i<n;i++) cin >> x[i];
sort(x.rbegin(),x.rend());
double ave=0;
ll num=0;
for(int i=0;i<a;i++) ave+=double(x[i]);
ave/=a;
int l=100,r=0;
for(int i=0;i<n;i++){
if(x[i]==x[a-1]){
l=min(l,i);
r=max(r,i);
}
}
int m=r-l+1;
if(r == a-1) num=1;
else if(l == 0){
for(int i=a;i<=b;i++){
num+=COM(m,i);
}
}
else{
num+=COM(m,a-l);
}
cout << fixed << setprecision(8) << ave << endl << num << endl;
} |
#include <iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
int main() {
int n,a,b;cin>>n>>a>>b;
vector<long long> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v.begin(),v.end(),greater<long long>());
long long sum=0;
long long ex=0;
long long count=0;
for(int i=0;i<a;i++){
sum+=v[i];
}
int first,last;
for(int i=0;i<n;i++){
if(v[a-1]==v[i]){
if(i==0){
first=i;
}else if(v[i-1]!=v[i]){
first=i;
}
if(i==n-1){
last=i;
}else if(v[i+1]!=v[i]){
last=i;
}
}
}
long long ans2=0;
for(int j=a;j<=b;j++){
long long r=last-first+1;
long long k=j-1-first+1;
if(r<k)continue;
long long anst=1;
for(int i=0;i<k;i++){
anst*=r-i;
anst/=i+1;
}
ans2+=anst;
if(first!=0)break;
// cout<<anst<<endl;
}
double ans=double(sum)/a;
cout<<setprecision(10)<<ans<<endl<<ans2<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
vector<long long> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v.begin(),v.end(),greater<long long>());
long long sum=0;
long long ex=0;
long long count=0;
for(int i=0;i<a;i++){
sum+=v[i];
}
int first,last;
for(int i=0;i<n;i++){
if(v[a-1]==v[i]){
if(i==0){
first=i;
}else if(v[i-1]!=v[i]){
first=i;
}
if(i==n-1){
last=i;
}else if(v[i+1]!=v[i]){
last=i;
}
}
}
long long ans2=0;
for(int j=a;j<=b;j++){
long long r=last-first+1;
long long k=j-1-first+1;
if(r<k)continue;
long long anst=1;
for(int i=0;i<k;i++){
anst*=r-i;
anst/=i+1;
}
ans2+=anst;
if(first!=0)break;
}
double ans=double(sum)/a;
cout<<setprecision(10)<<ans<<endl<<ans2<<endl;
return 0;
}
|
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
long long fact(int x){
if(x==0)return 1ll;
return fact(x-1)*x;
}
long long comb(int x, int y){
long long ret=1ll;
for(int i = 1;i <= y;i ++){
ret=ret*(x+1-i)/i;
}
return ret;
}
int main(){
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
vector <long long> v(n);
for(auto&i:v)
scanf("%lld", &i);
sort(v.begin(), v.end());
long double sum=0.0l;
for(int i = n;i > n-a;i --){
sum+=v[i-1];
}
printf("%.10Lf\n", sum/a);
if(v[n-a]!=v[n-1]){//must pick a
printf("%lld\n", comb(count(v.begin(), v.end(), v[n-a]),count(v.begin()+(n-a), v.end(), v[n-a])));
}else{//can pick any number
long long ans=0ll;
for(int i = a;i <= b;i ++){
if(v[n-i]!=v[n-1])
break;
ans+=comb(count(v.begin(), v.end(), v.back()), i);
}
printf("%lld\n", ans);
}
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int n,a,b;
double v[60];
ll comb[60][60];
ll Comb(int n,int k){
if(k<0||n<k)return 0;
if(n==0)return 1;
if(comb[n][k])return comb[n][k];
if(k<n)comb[n][k]+=Comb(n-1,k);
if(k)comb[n][k]+=Comb(n-1,k-1);
return comb[n][k];
}
int main(){
cin>>n>>a>>b;
rep(i,n)cin>>v[i];
sort(v,v+n,greater<double>());
double ave=0.0;
rep(i,a)ave+=v[i];
printf("%.10f\n",ave/a);
int x=a-1,j=a-1;
while(x&&v[x-1]==v[x])x--;
while(j+1<n&&v[j]==v[j+1])j++;
if(x){
cout<<Comb(j-x+1,a-x)<<endl;
return 0;
}
ll ans=0;
for(int i=a;i<=b;i++)ans+=Comb(j+1,i);
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
long long value[51];
long long dp[51][51];
void init()
{
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=50;i++)
{
dp[i][0]=1;
for(int j=1;j<=i;j++)
dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
}
}
int main()
{
int N,A,B;
init();
while(cin>>N>>A>>B)
{
double ave=0;
for(int i=0;i<N;i++)
cin>>value[i];
sort(value,value+N);
reverse(value,value+N);//大->小
for(int i=0;i<A;i++)
ave+=value[i];
ave/=A;
int num=0,k=0;
for(int i=0;i<N;i++)
{
if(value[i]==value[A-1])
{
num++;
if(i<A)
k++;
}
}
long long ans=0;
if(k==A)//前A个相同,可以增加个数
{
for(int i=A;i<=B;i++)
ans+=dp[num][i];
}
else
ans+=dp[num][k];
printf("%.15f\n",ave);
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[100], dp[100][100];
int calc(int l, int r, int n){
int ans = 0;
for(int i = l;i <= r;i++)ans += dp[n][i];
return ans;
}
void init(){
dp[0][0] = 1;
for(int i = 1;i <= 51;i++){
dp[i][0] = 1;
for(int j = 1;j <= 51;j++)
dp[i][j] = dp[i-1][j-1]+dp[i-1][j];
}
}
signed main(){
init();
int n, l, r;
scanf("%lld%lld%lld", &n, &l, &r);
for(int i = 1;i <= n;i++)scanf("%lld", &a[i]);
sort(a+1, a+n+1, greater<int>());
int sum = 0, s1 = 0, s2 = 0;
for(int i = 1;i <= n;i++){
if(i <= l)sum += a[i];
if(a[i] > a[l])s1++;
if(a[i] == a[l])s2++;
}
printf("%lf\n", (double)sum/l);
if(s1 == 0)printf("%lld\n", calc(l, r, s2));
else printf("%lld\n", dp[s2][l-s1]);
return 0;
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll n,a,b,v[55],c[55][55],ans2;
double sum,ans;
int main(){
scanf("%lld%lld%lld",&n,&a,&b);
for(ll i=1;i<=n;i++) c[i][0]=c[i][i]=1;
for(ll i=2;i<=n;i++) for(ll j=1;j<i;j++) c[i][j]=c[i-1][j-1]+c[i-1][j];
for(ll i=0;i<n;i++) scanf("%lld",&v[i]);
sort(v,v+n,greater<ll>());
for(ll i=0;i<a;i++) sum+=v[i];
ans=sum/a;
printf("%lf\n",ans);
int all=0,x=0,y=0;
for(ll i=0;i<n;i++) if(v[i]==v[a-1]) all++;
for(ll i=0;i<a;i++) if(v[i]==v[a-1]) x++;
for(ll i=0;i<b;i++) if(v[i]==v[a-1]) y++;
if(v[a-1]!=v[0]) ans2=c[all][x];
else for(ll i=x;i<=y;i++) ans2+=c[all][i];
printf("%lld\n",ans2);
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
int n, a, b; long long v[55], dp[55][55];
long long ncr(long long p1, long long p2) {
if (p2 < 0 || p1 < p2)return 0;
return dp[p1 - p2][p2];
}
int main() {
cin >> n >> a >> b;
for (int i = 0; i < n; i++)cin >> v[i];
sort(v, v + n);
long long T = v[n - a];
long long H = 0; for (int i = n - a; i < n; i++)H += v[i];
for (int i = 0; i < 55; i++) {
for (int j = 0; j < 55; j++) {
if (i == 0 || j == 0)dp[i][j] = 1;
else dp[i][j] += dp[i - 1][j] + dp[i][j - 1];
}
}
int L = n, R = 0; long long ret = 0;
for (int i = 0; i < n; i++) { if (v[i] == T) { L = min(L, i); R = max(R, i); } }
for (int i = a; i <= b; i++) {
if (i != a && R != n - 1)continue;
ret += ncr(R - L + 1, i - (n - R - 1));
}
printf("%.25Lf\n", 1.0L*H / a);
cout << ret << endl;
return 0;
} |
#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <cmath>
#include <tuple>
#include <time.h>
#include <random>
using namespace std;
int64_t comb(int n, int k){
static int64_t memo[51][51];
if(k==0||k==n) return 1;
if(memo[n][k]) return memo[n][k];
return memo[n][k]=comb(n-1,k-1)+comb(n-1,k);
}
int main(){
int64_t N,A,B;
cin>>N>>A>>B;
vector<int64_t> V(N);
for(auto &v:V) cin>>v;
sort(V.begin(), V.end(), greater<int64_t>());
double sum=0;
for(int i=0;i<A;i++) sum+=V[i];
printf("%.10f\n",sum/A);
int64_t cnt = 0;
int n=0,k=0;
if(V[0]!=V[A-1]){
for(int i=0;i<N;i++)n+=V[i]==V[A-1];
for(int i=0;i<A;i++)k+=V[i]==V[A-1];
cnt=comb(n,k);
}else{
for(int i=0;i<N;i++)n+=V[i]==V[0];
for(int k=A;k<=n&&k<=B;k++)cnt+=comb(n,k);
}
cout<<cnt<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
long long v[50];
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v,v+n);
double ans=0;
for(int i=0;i<a;i++){
ans+=v[n-1-i];
}
ans/=a;
long long tmp=v[n-a];
int cnt1=0;
int cnt2=0;
for(int i=0;i<n;i++){
if(v[n-1-i]==tmp){
cnt1++;
if(i<a)cnt2++;
}
}
// cout<<cnt1<<" "<<cnt2<<endl;
printf("%lf\n",ans);
long long k=1;
for(long long i=0;i<cnt2;i++)k*=cnt1-i,k/=i+1;
if(a==cnt2){
for(int i=a+1;i<=b;i++){
//cout<<k<<endl;
long long tk=1;
for(long long j=0;j<i;j++)tk*=cnt1-j,tk/=j+1;
k+=tk;
}
}
cout<<k<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
int main(){
int N,A,B;
cin>>N>>A>>B;
vector<ll> V(N);
rep(i,N) cin>>V[i];
sort(all(V));
ll sum=0;
rep(i,A) sum+=V[N-1-i];
double ans=(double)sum/A;
int U=upper_bound(all(V),V[N-A])-V.begin()-1,L=lower_bound(all(V),V[N-A])-V.begin();
int S=U-(N-A)+1;
ll COM[51][51];
rep(i,51){
COM[i][0]=1;
COM[i][i]=1;
}
rep(i,51) rep(j,51) if(i&&j&&i>j) COM[i][j]=COM[i-1][j-1]+COM[i-1][j];
ll C=COM[U-L+1][S];
if(V[N-A]==V[N-1]) rep(i,min(N-A-L,B-A)) C+=COM[U-L+1][S+i+1];
cout.precision(10);
cout<<ans<<endl;
cout<<C<<endl;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
ll C[51][51]={};
void comb(int n){
for(int i=0;i<=n;i++){
for(int j=0;j<=i;j++){
if(j==0||j==i) C[i][j]=1LL;
else C[i][j]=C[i-1][j-1]+C[i-1][j];
}
}
}
int main(){
int n,a,b;
cin >> n >> a >> b;
ll v[50];
for(int i=0;i<n;i++) cin >> v[i];
sort(v,v+n);
reverse(v,v+n);
comb(n);
double ans=0;
for(int i=0;i<a;i++) ans+=v[i];
ans/=a;
ll num=0LL;
int nn=0,rr=0;
for(int i=0;i<n;i++){
if(v[i]==v[a-1]){
nn++;
if(i<a) rr++;
}
}
if(rr==a){
for(rr;rr<=b;rr++) {
num+=C[nn][rr];
}
}else num+=C[nn][rr];
cout.precision(20);
cout << fixed << ans << endl;
cout << num << endl;
}
|
#include "cstdio"
#include "algorithm"
using namespace std;
long long s[55],sss,maxx,i,a,b,n,ss[55][55],ss1,ss2,j;
bool cmp(long long a,long long b){
return a>b;
}
int main(){
scanf("%lld",&n);scanf("%lld%lld",&a,&b);ss[0][0]=1;
for(i=1;i<=50;i++){
ss[i][0]=1;
for(j=1;j<=i;j++)ss[i][j]=ss[i-1][j]+ss[i-1][j-1];
}
for(i=1;i<=n;i++)scanf("%lld",&s[i]);
sort(s+1,s+1+n,cmp);
for(i=1;i<=a;i++)sss+=s[i];
for(i=1;i<=n;i++){
if(s[i]==s[a])ss1++;if(s[i]==s[a]&&i<=a)ss2++;
}
if(s[1]==s[a])
for(i=a;i<=b;i++)maxx+=ss[ss1][i];
else maxx=ss[ss1][ss2];
printf("%lf %lld\n",sss*1.0/a,maxx);
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int INF = 1e9;
int main(){
int n, a, b;
cin >> n >> a >> b;
ll v[n];
vector<vector<ll>> comb(51,vector<ll>(51));
rep(i,51) comb[i][0] = 1;
for(int i = 1; i < 51; i++) {
for(int j = 1; j <= i; j++) comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
}
rep(i,n) cin >> v[i];
sort(v,v+n,greater<ll>());
map<ll,int> m;
rep(i,n) m[v[i]]++;
double ave = 0;
rep(i,a) ave += v[i];
ave /= a;
ll ans;
if(v[0] != v[a-1]) {
int p = INF;
rep(i,a) {
if(v[i] == v[a-1]) p = min(p,i);
}
ans = comb[m[v[a-1]]][a-p];
} else {
ans = 0;
for(int i = a; i <= min(b,m[v[0]]); i++) ans += comb[m[v[0]]][i];
}
printf("%.9lf\n",ave);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
cout.precision(10);
int i,n,a,b,d=0,g;
cin >> n >> a >> b ;
long long c[n],ans=0,e = 0,comb=1;
long long f[55][55];
for(i=0;i<n;i++){
cin >> c[i];
}
sort(c,c+n);
for(i=0;i<a;i++){
ans += c[n-1-i];
}
cout << (long double)ans/(long double)a << endl;
for(i=0;i<n;i++){
if(c[i] == c[n-a]){
d++;
}
if(c[i] > c[n-a]){
e += 1;
}
}
if(c[n-1-a]==c[n-1]){
f[d][0]=1;
for(i=1;i<=n;i++){
f[d][i] = (f[d][i-1]*(d+1-i))/i ;
}
g = min(b,d);
for(i=a;i<=g;i++){
e += f[d][i];
}
cout << e << endl;
return 0;
}
for(i=1;i<=(a-e);i++){
comb = ((d+1-i)*comb)/i;
}
cout << comb << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
vector<vector<lint>> nCr;
void binom(int n){
nCr.assign(n+1,vector<lint>(n+1));
rep(i,n+1) nCr[i][0]=1;
rep(i,n) rep(j,i+1) nCr[i+1][j+1]=nCr[i][j+1]+nCr[i][j];
}
int main(){
binom(50);
int n,a,b; cin>>n>>a>>b;
lint v[50];
rep(i,n) cin>>v[i];
sort(v,v+n);
lint ans1=0,ans2=1;
for(int m=a;m<=b;m++){
lint sum=accumulate(v+n-m,v+n,0LL);
if(sum*ans2>m*ans1){
ans1=sum;
ans2=m;
}
}
lint cnt=0;
for(int m=a;m<=b;m++){
lint sum=accumulate(v+n-m,v+n,0LL);
if(sum*ans2==m*ans1){
cnt+=nCr[count(v,v+n,v[n-m])][count(v+n-m,v+n,v[n-m])];
}
}
cout<<setprecision(9)<<1.0*ans1/ans2<<'\n'<<cnt<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.setf(ios::fixed); cout.precision(17);
int n, a, b;
double z[51];
long long c[51][51];
cin >> n >> a >> b;
for(int i = 0; i < n; i++){
cin >> z[i];
}
sort(z, z + n);
double mean = 0.0, last;
for(int i = n - 1; i >= n - a; i--){
mean += z[i];
last = z[i];
}
int x = 0, k = 0, cnt = 0;
for(int i = n - 1; i >= 0; i--){
cnt++;
if(z[i] != last) continue;
if(z[i] < last) break;
x++;
if(cnt <= a) k++;
}
//cout << x << " " << k<< endl;
for(int i = 0; i <= n; i++){
for(int j = 0; j <= i; j++){
if(i == j || j == 0){
c[i][j] = 1ll;
continue;
}
c[i][j] = c[i-1][j] + c[i-1][j-1];
}
}
long long ans = 0ll;
if(k == a){
for(k = a; k <= b; k++){
ans += c[x][k];
}
}
else ans += c[x][k];
cout << mean/ (1.0 * a) << "\n" << ans << "\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.