text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, A, B;
ll v[51];
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++) {
cin >> v[i];
}
for (int n = 0; n <= N; n++) {
comb[n][0] = comb[n][n] = 1;
for (int k = 1; k < n; k++) {
comb[n][k] = comb[n - 1][k - 1] + comb[n - 1][k];
}
}
sort(v, v + N);
reverse(v, v + N);
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];
}
cout << accumulate(v, v + A, 0.0) / A << endl;
if (v[0] == v[A - 1]) {
ll ans = 0;
for (int i = A; i <= B; i++) {
ans += comb[q][i];
}
cout << ans << endl;
} else {
cout << comb[q][p] << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,a,b,v[51];
int C[51][51];
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]=1LL;
}else{
C[i][j]=(C[i-1][j-1]+C[i-1][j]);
}
}
}
}
signed main(){
cin>>n>>a>>b;
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v,v+n);
reverse(v,v+n);
comb_table(n);
double temp=0;
for(int i=0;i<a;i++){
temp+=v[i];
}
cout<<fixed<<setprecision(10)<<temp/a<<endl;
int ans=0;
int x=0;
if(v[a-1]==v[0]){
for(int i=0;i<n;i++){
if(v[i]==v[0])
x++;
}
for(int i=a;i<=b;i++){
ans+=C[x][i];
}
cout<<ans<<endl;
return 0;
}
int a_num=0;
for(int i=0;i<n;i++){
if(v[a-1]==v[i])a_num++;
}
int a_num2=0;
for(int i=0;i<a;i++){
if(v[a-1]==v[i])a_num2++;
}
ans=C[a_num][a_num2];
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
long long v[n];
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v,v+n,greater<long long>());
long long m=0;
for(int i=0;i<a;i++)m+=v[i];
cout<<m/a<<".";
m%=a;
m*=1000000000;
cout<<m/a<<endl;
a--,b--;
int l=lower_bound(v,v+n,v[a],greater<long long>())-v,r=upper_bound(v,v+n,v[a],greater<long long>())-v;
int vali=r-l;
long long c[vali+1];//combination
//MAX = 50 C 25 < 1.3*10^14
long long wa[vali+1];
c[0]=1;
wa[0]=1;
for(int i=1;i<=vali;i++){
c[i]=c[i-1]*(vali-i+1)/i;
wa[i]=wa[i-1]+c[i];
}
if(v[a]<v[0])cout<<c[a-l+1]<<endl;
else{
if(v[a]==v[b]){//vali C a～b
cout<<wa[b-l+1]-wa[a-l]<<endl;
}
else{//vali C a～vali
cout<<wa[vali]-wa[a-l]<<endl;
}
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=51;
int n,a,b;
ll c[N][N],v[N],sum[N],ans;
ll son,par;
void init()
{
for(int i=1;i<=50;++i)
{
c[i][0]=c[i][i]=1;
for(int j=1;j<i;++j)
c[i][j]=c[i-1][j-1]+c[i-1][j];
}
}
int main()
{
init();
scanf("%d%d%d",&n,&a,&b);
for(int i=1;i<=n;++i)
scanf("%lld",&v[i]);
sort(v+1,v+n+1,greater<ll>());
son=par=1;
for(int i=1;i<=n;++i)
sum[i]=sum[i-1]+v[i];
for(int i=a;i<=b;++i)
{
if(sum[i]*par>son*i)
{
son=sum[i];
par=i;
}
}
for(int i=a;i<=b;++i)
{
if(sum[i]*par==son*i)
{
int my=1,all=0;
for(int j=i-1;j>=1;--j)
if(v[j]==v[j+1])my++;
else break;
all=my;
for(int j=i+1;j<=n;++j)
if(v[j]==v[j-1])all++;
else break;
ans+=c[all][min(all-my,my)];
}
}
printf("%.6lf\n",1.0*son/par);
printf("%lld\n",ans);
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
ll a[100];
ll C(int x,int y){
ll ret=1;
for(int i=1;i<=y;i++)
ret=ret*(x-i+1)/i;
return ret;
}
int main(){
int n,l,r,bk,ss,i,j;
double ans=0;
ll sum=0;
scanf("%d %d %d",&n,&l,&r);
for(i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+n+1,greater<ll>());
bk=n+1;
for(i=2;i<=n;i++) if(a[i]!=a[i-1]){bk=i;break;}
ss=bk-1;
ans=0;
for(i=1;i<=l;i++) ans+=a[i];
ans/=l;
printf("%.6lf\n",ans);
for(i=l;i&&a[i]==a[l];i--);i++;
for(j=l;j<=n&&a[j]==a[l];j++);j--;
sum=C(j-i+1,l-i+1);
for(i=l+1;i<=r&&i<bk;i++) sum+=C(ss,i);
printf("%lld\n",sum);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long comb(long long x,long long y){
long long z = 1;
for(long long i=0;i<y;i++) z = z*(x-i)/(i+1);
return z;
}
int main(){
cout << fixed << setprecision(10);
long long n,a,b,i,ans = 0,al,c = 0;cin >> n >> a >> b;
long long v[n];
for(i=0;i<n;i++) cin >> v[i];
sort(v,v+n,greater<long long>());
for(i=0;i<a;i++) ans += v[i];
cout << double(ans)/a << "\n";
ans = 0;al = count(v,v+n,v[a-1]);
for(i=0;i<a;i++) c += (v[i]==v[a-1]);
ans += comb(al,c);
if(v[0] != v[a-1]){
cout << ans << "\n";return 0;
}
for(i=a;i<b;i++){
if(v[i]==v[a-1]){
c++;ans += comb(al,c);
} else break;
}
cout << ans << "\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
// nCk
int64_t nCk(int64_t a, int64_t b){
int64_t c = 1;
for(int i=1; i<=b; i++){
c *= a +1 - i;
c /= i;
}
return c;
}
int main(){
int64_t N, A, B;
cin >> N >> A >> B;
vector<int64_t> vec(N);
for(int i=0; i<N; i++){
cin >> vec.at(i);
}
sort(vec.rbegin(),vec.rend());
int64_t sum = 0;
int64_t cnt = 0;
int64_t begin = 100;
int64_t end = -1;
for(int64_t i=0; i<N; i++){
if(i < A){
sum += vec.at(i);
}
if(vec.at(i) == vec.at(A-1)){
cnt++;
begin = min(begin,i);
end = i+1;
}
}
cout << setprecision(20) << (double)sum / (double)A << endl;
int64_t ans = 0;
if(vec.at(0) != vec.at(A-1)){
ans = nCk(cnt,A-begin);
}
else{
for(int i=A; i<=B; i++){
if(vec.at(i-1) != vec.at(A-1)){
break;
}
ans += nCk(end,i);
}
}
cout << ans << endl;
} |
/* m
组合数：Cn （从n个中取m个）
*/
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a,b;
long long c[55][55],ans2,v[55],sum;
double ans1;
bool cmp(long long x,long long y)
{
return x>y;
}
void pre()
{
for(int i=0;i<=n;i++)
{
c[i][0]=1;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
c[i][j]=c[i-1][j-1]+c[i-1][j];
}
}
}
int main()
{
int num=0,num1=0,tot=0;
scanf("%d%d%d",&n,&a,&b);
for(int i=1;i<=n;i++)
{
scanf("%lld",&v[i]);
}
pre();
sort(v+1,v+n+1,cmp);
for(int i=1;i<=a;i++)
{
sum+=v[i];
if(v[i]==v[a])
{
num1++;
}
}
for(int i=1;i<=n;i++)
{
if(v[i]==v[a])
{
num++;
}
if(v[i]==v[1])
{
tot++;
}
}
if(v[a]==v[1])
{
for(int i=a;i<=min(b,tot);i++)
{
ans2+=c[tot][i];
}
}
else
{
ans2=c[num][num-num1];
}
ans1=(double)sum/a;
printf("%.6lf\n%lld",ans1,ans2);
return 0;
} |
#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)
{
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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,a,b;
cin>>n>>a>>b;
map<ll,ll>c;
for(ll i=0;i<n;i++){
ll x;
cin>>x;
x*=-1;
c[x]++;
}
ll ans=0;
auto itr=c.begin();
if(a<=itr->second){
ll ans1=(itr->first)*(-1)*a;
double A=a;
printf("%.9f\n",ans1/A);
ll lim=min(itr->second,b);
//cout << lim<<endl;
ll val=itr->second;
ll now=itr->second;
for(ll i=2;i<=a;i++){
now*=(val-i+1);
now/=i;
}
a++;
ans=now;
while(a<=lim){
now*=(val-a+1);
now/=a;
ans+=now;
a++;
}
cout <<ans;
return 0;
}
ll sum=0;
double num=a;
while(a>itr->second){
a-=itr->second;
sum+=(itr->first)*(-1)*(itr->second);
itr++;
//cout <<sum;
}
sum+=(itr->first)*(-1)*a;
printf("%.9f\n",sum/num);
ll now=1;
for(ll i=1;i<=a;i++){
now*=(itr->second-i+1);
now/=i;
}
cout<<now;
// your code goes here
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll c[51][51];
void comb_table(int n) {
for (int i = 0; i <= n; i++) {
c[i][0] = 1LL;
c[i][i] = 1LL;
for (int j = 1; j < i; j++) {
c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
}
}
}
int main(void) {
int n, a, b;
cin >> n >> a >> b;
vector<ll> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end(), greater<ll>());
double sum = 0.0;
for (int i = 0; i < a; i++) {
sum += v[i];
}
cout.precision(20);
cout << sum / a << endl;
int cnt1 = 0, cnt2 = 0;
for (int i = 0; i < n; i++) {
if (v[i] == v[a - 1]) {
cnt1++;
if (i < a) {
cnt2++;
}
}
}
comb_table(n);
ll ans = 0LL;
if (cnt2 != a) {
ans = c[cnt1][cnt2];
} else {
for (int i = a; i <= b; i++) {
ans += c[cnt1][i];
}
}
cout << ans << 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];
int ct[51][51];
int combi(int n,int m){
if(ct[n][m]==-1)
ct[n][m]=combi(n-1,m)+combi(n-1,m-1);
return ct[n][m];
}
signed main(){
fill((int*)ct,(int*)ct+51*51,-1);
for(int i=0;i<51;i++){
ct[i][0]=1;
ct[i][i]=1;
}
int n,a,b;
int i;
cin>>n>>a>>b;
for(i=0;i<n;i++)
cin>>p[i];
sort(p,p+n);
reverse(p,p+n);
int u,v;
for(i=a-1;i>=0;i--)
if(p[i]!=p[a-1])
break;
u=i+1;
for(i=a;i<n;i++)
if(p[i]!=p[a-1])
break;
v=i;
int x=0;
for(i=0;i<a;i++)
x+=p[i];
cout<<fixed<<setprecision(15)<<(double)x/a<<endl;
if(u==0){
x=0;
for(i=a;i<=min(v,b);i++)
x+=combi(v,i);
cout<<x<<endl;
}else
cout<<combi(v-u,a-u)<<endl;
}
|
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll c[51][51];
void comb(int x){
for(int i=0;i<=x;i++){
c[i][0]=1;
c[i][i]=1;
}
for(int i=1;i<=x;i++){
for(int j=1;j<=i;j++){
c[i][j]=c[i-1][j-1]+c[i-1][j];
}
}
return ;
}
int main(void){
comb(50);
ll n,a,b,ans=0;
cin>>n>>a>>b;
ll s[n];
for(int i=0;i<n;i++){
cin>>s[i];
}
ll cnt1=0,cnt2=0;
sort(s,s+n);
reverse(s,s+n);
ll lim=s[a-1];
ll tot=0;
for(int i=0;i<n;i++){
if(i<a)tot+=s[i];
if(s[i]>lim)cnt1++;
else if(s[i]==lim)cnt2++;
}
cout<<setprecision(25)<<(double)tot/(double)a<<endl;
if(cnt1){
cout<<c[cnt2][a-cnt1]<<endl;
}
else{
for(int i=a;i<=min(b,cnt2);i++){
ans+=c[cnt2][i];
}
cout<<ans<<endl;
}
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
int n,L,R,a[100100],ans1,ans2,cnt1,cnt2;
bool cmp(int a,int b){return a>b;}
int 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]+C[i-1][j-1];
}
// for(int i=0;i<=10;i++,puts(""))
// for(int j=0;j<=i;j++) cout<<C[i][j]<<" ";
}
signed main(){
init();
cin>>n>>L>>R;
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
sort(a+1,a+1+n,cmp);
for(int i=1;i<=L;i++) ans1+=a[i];
for(int i=1;i<=n;i++) if(a[i]==a[L]) cnt1++;
for(int i=1;i<=L;i++) if(a[i]==a[L]) cnt2++;
if(a[1]==a[L])
for(int i=L;i<=R;i++) ans2+=C[cnt1][i];
else ans2=C[cnt1][cnt2];
printf("%lf\n%lld",(double)ans1/L,ans2);
} |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cmath>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
ll GCD(ll a, ll b) {
if (b == 0)return a;
return GCD(b, a%b);
}
ll LCM(ll a, ll b) {
return a / GCD(a, b)*b;
}
ll c[51][51];
void comb(int n) {
rep(i, 51) {
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];
}
}
}
ll n, a, b, v[50], cnt = 0, k = 0, s = 0, ans = 0;
int main() {
cin >> n >> a >> b;
rep(i, n)cin >> v[i];
sort(v, v + n);
reverse(v, v + n);
rep(i, n)if (v[i] == v[a - 1])k++;
rep(i, a)if (v[a - 1] == v[i])s++;
rep(i, a)cnt += v[i];
printf("%.12lf\n", 1.0*cnt / a);
comb(n);
if (v[0] == v[a - 1]) {
for (int i = a; i <= min(b, k); i++)ans += c[k][i];
cout << ans << endl;
}
else cout << c[k][s] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvl = vector<vll>;
vvl C;
void comb_table(int N) {
C.resize(N + 1, vll(N + 1));
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() {
int N, A, B; cin >> N >> A >> B;
vll v(N); rep(i, N) cin >> v[i];
comb_table(N);
sort(v.begin(), v.end(), greater<ll>());
double maxave = 0.0;
rep(i, A) maxave += v[i];
maxave /= A;
int x = 0, y = 0;
rep(i, N) {
if (v[i] == v[A - 1]) {
x++;
if (i < A) {
y++;
}
}
}
ll cnt = 0LL;
if (y == A) {
for (int i = A; i <= B; i++) cnt += C[x][i];
} else {
cnt += C[x][y];
}
cout << fixed << setprecision(6) << maxave << endl;
cout << cnt << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const int inf = 1001001001;
lint Combination(lint n, lint k) {
lint res = 1;
for (lint i = 1; i <= k; ++i) {
res *= n--;
res /= i;
}
return res;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<lint> v(n);
for (auto &u : v) cin >> u;
sort(v.rbegin(), v.rend());
double ave = 0;
for (int i = 0; i < a; ++i) {
ave += v[i];
}
ave /= a;
int u = -1;
while (v[u] != v[a - 1]) u++;
int d = u;
while (v[d] == v[a - 1]) d++;
d -= u;
int l = a - u, r = (u != 0 ? a : b) - u;
lint ans = 0;
for (int i = l; i <= r; ++i) {
ans += Combination(d, i);
}
cout.precision(8);
cout << fixed << ave << endl;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 200003
#define MOD 1000000007
int main(){
int N,A,B;
cin>>N>>A>>B;
vector<ll> v(N);
for(int i=0;i<N;i++){
cin>>v.at(i);
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
ll sum=0;
for(int i=0;i<A;i++){
sum+=v.at(i);
}
ll V=v.at(A-1);
ll count1=0;
ll count2=0;
for(int i=0;i<N;i++){
if(v.at(i)==V){
count1++;
if(i<A){
count2++;
}
}
}
ll ans=0;
ll com=1;
for(int i=0;i<count2;i++){
com*=(count1-i);
com/=(i+1);
}
ans+=com;
if(v.at(0)==V){
for(ll i=count2;i<min<ll>(B-A+count2,count1);i++){
com*=(count1-i);
com/=(i+1);
ans+=com;
}
}
printf("%lf\n",(double)sum/(double)A);
cout<<ans<<endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n, A, B, v[55], ans;
double res;
ll com(ll x, ll y){
ll res = 1;
for (ll i = 0; i < y; i++) {
res *= (x - i);
res /= i + 1;
}
return res;
}
int main(void){
// Your code here!
cin >> n >> A >> B;
for (ll i = 0; i < n; i++) cin >> v[i];
sort(v, v + n);
reverse(v, v + n);
for (ll i = 0; i < A; i++) {
res += v[i];
}
cout << fixed << res / A << endl;
if (v[0] == v[A - 1]) {
ll k = A;
while(v[k] == v[k - 1]) k++;
for (ll i = A; i <= k && i <= B; i++) {
ans += com(k, i);
}
cout << ans << endl;
} else {
ll k = 1, l = 1, i = A, j = A;
while(v[i - 1] == v[i - 2]){
i--, k++, l++;
}
while(v[j - 1] == v[j]){
j++, k++;
}
cout << com(k, l) << endl;
}
}
|
#include <stdio.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
using namespace std;
unsigned long long combi(int n,int k){
unsigned long long r = 1;
for (unsigned long long d = 1; d <= k; ++d) {
r *= n--;
r /= d;
}
return r;
}
int main(void){
int n,a,b,c,d;
scanf("%d%d%d",&n,&a,&b);
vector<unsigned long long> v(n);
for(int i=0;i<n;i++) scanf("%llu",&v[i]);
sort(v.begin(),v.end());
unsigned long long su=0;
for(int i=a;i>0;i--) su+=v[n-i];
double ans1=(double)su/(double)a;
for(c=n-1;c>=0;c--) if(v[c]==v[n-a])break;
c=n-1-c;
d=count(v.begin(),v.end(),v[n-a]);
unsigned long long ans2=combi(d,a-c);
for(int i=a+1;i<=b;i++){
if(v[n-1]==v[n-i]){
ans2+=combi(d,i-c);
}else{break;}
}
printf("%f\n%llu\n",ans1,ans2);
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n, l, r;
long long a[55];
long long c(int y, int x) {
long long ans = 1LL;
for(int i=y;i>x;i--) {
ans = ans * i;
ans = ans/(y-i+1);
}
return ans;
}
int main() {
cin>>n>>l>>r;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
long long s=0;
for(int i=n-l;i<n;i++)
s+=a[i];
printf("%.10lf\n", 1.*s/l);
fflush(stdout);
int x = 1;
for(int i=n-l+1;i<n && a[i]==a[i-1];i++) x++;
int y = x;
for(int i=n-l;i>0 && a[i]==a[i-1];i--) y++;
long long ans = 0LL;
if(a[n-1] != a[n-l]) ans = c(y, x);
else {
for(int i=x;i<=min(y, r);i++)
ans += c(y, i);
}
cout<<ans<<endl;
return 0;
} |
#include<stdio.h>
#include <math.h>
#include <stdlib.h>
int main (){
long long int c[52],v[52],i,j,k,e,g,h;
int n,a,b;
double d,f;
f=0;
g=0;
scanf("%d %d %d",&n, &a, &b);
for(i=1;i<=n;i++){
scanf("%lld",&v[i]);
if (v[i]>f) {
f=v[i];
g=0;
}
if (v[i]==f) g=g+1;
}
if (g>=b){
printf("%f\n",f);
e=0;
c[0]=1;
for(i=1;i<=g;i++){
c[i]=c[i-1]*(g-i+1)/i;
}
for(i=a;i<=b;i++){
e=e+c[i];
}
printf("%lld\n",e);
return 0;
}
if (g>=a){
printf("%f\n",f);
e=0;
c[0]=1;
for(i=1;i<=g;i++){
c[i]=c[i-1]*(g-i+1)/i;
}
for(i=a;i<=g;i++){
e=e+c[i];
}
printf("%lld\n",e);
return 0;
}
if (g<a) {
for(i=1;i<=n-1;i++){
for(j=i+1;j<=n;j++){
if (v[i]<v[j]) {
e=v[i];
v[i]=v[j];
v[j]=e;
}
}
}
d=0;
for(i=1;i<=a;i++){
d=d+v[i];
}
d=d/a;
printf("%f\n",d);
for(i=a;i>1;i--){
if (v[i-1] != v[i]){
g=i;
break;
}
}
for(i=a;i<=n;i++){
if (v[i+1] != v[i]){
h=i;
break;
}
}
c[0]=1;
for(i=1;i<=h-g+1;i++){
c[i]=c[i-1]*(h-g+1-i+1)/i;
}
e=c[a-g+1];
printf("%lld\n",e);
}
return 0;
} |
#include <cstdio>
#include <numeric>
#include <algorithm>
#include <iostream>
using namespace std;
long long C(int n, int k) {
long long ans = 1;
for (int i = 0; i < k; i++) ans = ans * (n - i) / (i + 1);
return ans;
}
int main(int argc, char** argv) {
int n, a, b; cin >> n >> a >> b;
long long v[n]; for (int i = 0; i < n; i++) cin >> v[i];
sort(v, v+n);
long long numer = 0, denom = 1, count = 0;
for (int k = a; k <= b; k++) {
long long x = v[n-k];
int left = lower_bound(v, v+n, x) - v;
int right = upper_bound(v, v+n, x) - v;
long long sum = accumulate(v+n-k, v+n, 0LL);
if (numer * k < sum * denom) {
numer = sum; denom = k; count = C(right - left, right - n + k);
}
else if (numer * k == sum * denom) count += C(right - left, right - n + k);
}
printf("%.6f\n%lld\n", (double)numer/denom, count);
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+20;
const int m = 2e2+20;
long long v[N], 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;
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 <iostream>
#include <cstdio>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<long long> dp(n + 1, -1e18);
vector<long long> way(n + 1);
dp[0] = 0;
way[0] = 1;
for (int i = 0; i < n; i++) {
long long v;
cin >> v;
for (int j = n - 1; j >= 0; j--) {
if (dp[j + 1] < dp[j] + v) {
dp[j + 1] = dp[j] + v;
way[j + 1] = way[j];
} else if (dp[j + 1] == dp[j] + v) {
way[j + 1] += way[j];
}
}
}
printf("%.8f\n", 1.0 * dp[a] / a);
long long ans = 0;
for (int i = a; i <= b; i++) {
if (dp[i] * a == dp[a] * i) {
ans += way[i];
}
}
cout << ans << endl;
} |
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
int main() {
long long n,a,b,v[50],m=0,c=0,f[51],e=0;
cin>>n>>a>>b;
long double d=0;
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v,v+n,greater<long long>());
for(int i=0;i<n;i++){
if(i<a){
d+=v[i];
}
if(v[i]>v[a-1]){
m++;
}else if(v[i]==v[a-1]){
c++;
}
}
d/=a;
f[0]=1;
for(int i=1;i<=c;i++){
f[i]=f[i-1]*(c-i+1)/i;
}
if(m==0){
for(int i=a-m;i<=min(b-m,c);i++){
e+=f[i];
}
}else{
e=f[a-m];
}
cout<<setprecision(20)<<d<<endl;
cout<<e<<endl;
return 0;
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#define ll long long
#define maxn 55
using namespace std;
ll a[maxn];
ll f[maxn][maxn];
ll ans1,ans2,n,m,k,js,jsq;
ll cmp(ll a,ll b)
{
return a>b;
}
int main()
{
f[0][0]=1;
for(int i=1;i<=50;i++)
{
f[i][0]=1;
f[i][i]=1;
for(int j=1;j<=i;j++)
{
f[i][j]=f[i-1][j]+f[i-1][j-1];
}
}
scanf("%lld%lld%lld",&n,&m,&k);
for(ll i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
sort(a+1,a+n+1,cmp);
for(ll i=1;i<=m;i++)
{
ans1+=a[i];
}
for(ll i=1;i<=n;i++)
{
if(a[m]==a[i])
{
js++;
}
}
for(ll i=1;i<=m;i++)
{
if(a[m]==a[i])
{
jsq++;
}
}
if(a[m]==a[1])
{
for(ll i=m;i<=min(k,js);i++)
{
ans2+=f[js][i];
}
}
if(a[m]!=a[1])
{
ans2=f[js][jsq];
}
printf("%lf\n%lld",(double)ans1/m,ans2);
return 0;
} |
#include <stdio.h>
#include <algorithm>
#include <functional>
typedef long long ll;
ll min(ll a, ll b) {
return a < b ? a : b;
}
int main(void) {
ll i, j, n, a, b, f, l, ans = 0;
scanf("%lld%lld%lld", &n, &a, &b);
ll v[n], cmb[52][52];
for(i = 0; i < 52; ++i) for(j = 0; j < 52; ++j) cmb[i][j] = 0;
for(i = 0; i < 52; ++i) cmb[i][0] = 1;
for(i = 1; i <= 50; ++i) for(j = 1; j <= 50; ++j) cmb[i][j] = cmb[i - 1][j - 1] + cmb[i - 1][j];
for(i = 0; i < n; ++i) scanf("%lld", &v[i]);
std::sort(v, v + n, std::greater<ll>());
for(i = a - 1; i >= 0; --i) if(v[i] == v[a - 1]) f = i;
for(i = a - 1; i < n; ++i) if(v[i] == v[a - 1]) l = i;
for(i = 0; i < a; ++i) ans += v[i];
printf("%.6lf\n", (double)ans / (double)a);
ans = 0;
if(!f) {
for(i = a; i <= min(b, l + 1); ++i) ans += cmb[l + 1][i];
} else {
ans = cmb[l - f + 1][a - f];
}
printf("%lld", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N,A,B;
ll v[55];
long double S,D;
ll comb(int n,int r){
if(r==0) return 1;
return (n-r+1)*comb(n,r-1)/r;
}
int main(){
cin>>N>>A>>B;
for(int i=0; i<N; i++) scanf("%lld",&v[i]);
sort(v,v+N);
int i=N; int C=B-A; int E=A;
while(E){
i--;
S+=v[i];
E--; D++;
}
if(v[i]==v[N-1]){
double ans=v[i]; ll cnt=0;
int k=i; int Z=A;
while(1){
k--;
if(v[k]!=v[i]) break;
Z++;
}
if(Z>=B) for(int j=A;j<=B;j++) cnt+=comb(Z,j);
else for(int j=A;j<=Z;j++) cnt+=comb(Z,j);
printf("%.16f\n",ans);
cout<<cnt<<endl;
return 0;
}
else{
ll p=v[i];
int k=i; int X=1;
while(1){
k++;
if(v[k]!=p) break;
X++;
}
int Z=X; //cout<<p<<endl;
k=i;
while(1){
k--;
if(v[k]!=p) break;
X++;
}
ll cnt=0;
double ans=S/D;
printf("%.16f\n",ans); //cout<<Z<<" "<<X<<endl;
cout<<comb(X,Z)<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
ll C[51][51];
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]=1LL;
}else{
C[i][j]=(C[i-1][j-1]+C[i-1][j]);
}
}
}
}
int main(){
int n,a,b;
cin>>n>>a>>b;
comb_table(n);
vector<ll> v(n);
for(int i=0;i<n;i++) cin>>v[i];
sort(v.rbegin(),v.rend());
double ans1=0.0;
for(int i=0;i<a;i++){
ans1+=v[i];
}
ans1/=a;
ll ans2=0;
int num=0,pos=0;
for(int i=0;i<n;i++){
if(v[i]==v[a-1]){
num++;
if(i<a) pos++;
}
}
if(pos==a){
for(int i=a;i<=b;i++) ans2+=C[num][i];
}else{
ans2+=C[num][pos];
}
printf("%.10f\n",ans1);
printf("%lld\n",ans2);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int N, A, B;
typedef long long ll;
ll v[51];
ll com[53][53];
void init(int N) {
for(int i = 0; i <= N; i++) {
com[i][i] = com[i][0] = 1;
}
for(int i = 2; i <= N; i++) {
for(int j = 1; j < i; j++) {
com[i][j] = com[i-1][j-1] + com[i-1][j];
}
}
}
ll nCr(int n, int r) {
return com[n][r];
}
int main() {
cin >> N >> A >> B;
init(N);
for(int i = 0; i < N; i++) cin >> v[i];
sort(v,v+N,greater<ll>());
int c = 0;
ll ans = 0;
for(int i = 0; i < A; i++) ans += v[i];
cout <<fixed<< ans /(double)A<<endl;
int k = 0; int t = 0;
ll ans2 = 0;
for(int i = 0; i < N; i++) {
if(v[i] == v[A-1]) {
k++;
if(i < A) t++;
}
}
if(t == A) {
for(int i = A; i <= B; i++) {
ans2 += nCr(k,i);
}
}
else {
ans2 += nCr(k,t);
}
cout << ans2 << endl;
}
|
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
long long int V[60] = {};
for(int i = 0; i < N; i++){
cin >> V[i];
}
sort(V, V+N, greater<long long int>());
long long int sum = 0;
for(int i = 0; i < A; i++){
sum += V[i];
}
cout.precision(20);
cout << (double) sum / (double) A << endl;
long long int P[60][60] = {};
P[0][0] = 1;
for(int i = 0; i <= 52; i++){
P[i][0] = 1;
for(int j = 1; j <= i; j++){
P[i][j] = P[i-1][j] + P[i-1][j-1];
}
}
int X = 0, Y = 0;
for(int i = 0; i < N; i++){
if(V[i] > V[A-1]){X ++;}
else if(V[i] == V[A-1]){Y ++;}
}
if(V[0] != V[A-1]){
cout << P[Y][A-X] << endl;
}
else{
long long int ans = 0;
for(int i = A-X; i <= min(B-X, Y); i++){
ans += P[Y][i];
}
cout << ans << endl;
}
} |
#include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
const int NMAX = 50;
ll gBinom[NMAX + 1][NMAX+1];
void CalcBinom(int n)
{
for (int i = 1; i <= n; i++)
{
gBinom[i][1] = i;
for (int j = 2; j <= i; j++)
{
gBinom[i][j] = gBinom[i - 1][j] + gBinom[i - 1][j - 1];
}
}
}
int main()
{
int N, A, B;
scanf("%d%d%d", &N, &A, &B);
CalcBinom(N);
ll nums[NMAX];
for (int i = 0; i < N; ++i)
{
scanf("%lld", &nums[i]);
}
sort(nums, nums + N, greater<ll>());
double s = 0.0;
for (int i = 0; i < A; ++i)
s += nums[i];
printf("%.20lf\n", s / A);
const ll val = nums[A - 1];
int ccc[2] = { 0, 0 };
for (int i = 0; i < N; ++i)
{
if (nums[i] == val)
++ccc[i >= A];
}
int u = ccc[0] + ccc[1];
ll cnt = 0;
if (val == nums[0])
{
for (int i = A; i <= B; ++i)
cnt += gBinom[u][i];
}
else
cnt = gBinom[u][ ccc[0] ];
printf("%lld\n", cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define local
//if you find any bug in my code, please tell me.
ll comb(int n, int m)
{
ll ans=1;
for(int i=1; i<=m; i++)
{
ans*=n-i+1;
ans/=i;
}
return ans;
}
int main()
{
#ifdef local
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
int n,a,b,i,j;
double sum=0;
ll v[55],cnt=0;
cin>>n>>a>>b;
for(i=0; i<n; i++)
cin>>v[i];
sort(v,v+n);
reverse(v,v+n);
for(i=0; i<a; i++)
sum+=1.0*v[i];
int x=a-1,y=a-1;
while(v[x-1]==v[x]&&x-1>=0) x--;
while(v[y]==v[y+1]&&y+1<n) y++;
for(i=a; i<=(x?a:b); i++)
cnt+=comb(y-x+1,i-x);
printf("%.10f\n%lld",sum/a,cnt);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long 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(){
int n,a,b;
cin>>n>>a>>b;
double v[n];
for(int i=0;i<n;i++){
cin>>v[i];
}
double mean;
long long ans=0;
sort(v,v+n,greater<double>());
double sum=0;
for(int i=0;i<a;i++){
sum+=v[i];
}
mean=sum/(double)a;
printf("%07f",mean);
cout<<endl;
int cntl=0,cnt=0;
for(int i=0;i<n;i++){
if(v[a-1]<v[i]) cntl++;
if(v[a-1]==v[i]) cnt++;
}
comb_table(50);
ans=C[cnt][a-cntl];
if(mean==v[a-1]){
for(int i=a+1;i<=min(b,cnt);i++){
ans+=C[cnt][i];
}
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
int N,A,B;
ll v[51],sum=0;
ll C[51][51];
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]=1ll;
else C[i][j]=(C[i-1][j-1]+C[i-1][j]);
}
}
}
int main(){
cin >> N >> A >> B;
for(int i=0;i<N;i++) cin >> v[i];
comb_table(N);
sort(v,v+N,greater<ll>() );
for(int i=0;i<A;i++)sum+=v[i];
double ans=sum;
ans/=A;
printf("%f\n",ans);
int num=0,pos=0;
for(int i=0;i<N;i++){
if(v[i]==v[A-1]){
num++;
if(i<A){
pos++;
}
}
}
ll cnt=0;
if(pos!=A){
cnt=C[num][pos];
}
else{
for(pos=A;pos<=B;pos++){
cnt+=C[num][pos];
}
}
cout << cnt << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long nCk(int n,int k){
long r=1;
for(int i=1;i<=k;++i){
r*=n+1-i;
r/=i;
}
return r;
}
long N,A,B,l,r,v[50],c;
double s;
int main(){
cin>>N>>A>>B;
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)s+=v[i];
l=r=A-1;
while(l-1>=0&&v[l-1]==v[A-1])--l;
while(r+1<N&&v[r+1]==v[A-1])++r;
for(int i=A;i<=(l?A:B);++i)c+=nCk(r-l+1,i-l);
printf("%.15f\n%ld",s/A,c);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const int INF = 1<<30;
ll comb(ll n, ll r){
ll ret=1;
for(ll i=n;i>n-r;i--){
ret*=i;
ret/=n+1-i;
}
return ret;
}
int main(){
int n, a, b;cin>>n>>a>>b;
vector<ll> v(n);for(auto& e: v)cin>>e;
sort(v.begin(), v.end(), greater<ll>());
double avg;ll sum=0;
for(int i=0;i<a;i++){
sum += v[i];
}
avg = sum/(double)a;
cout<<fixed<<setprecision(10)<<avg<<endl;
int count=0, inner_count=0;
for(int i=0;i<n;i++){
if(v[i]==v[a-1]){
count++;
if(i<a)inner_count++;
}
}
ll ans=0;
if(double(abs(avg-v[a-1]))<(1e-8)){
for(int i=inner_count;i<=min(count,b-(a-inner_count));i++){
ans += comb((ll)count, (ll)i);
// printf("%d, %llu\n", i, comb((ll)count, (ll)i));
}
}else{
ans = comb((ll)count, (ll)inner_count);
}
cout<<ans<<endl;
} |
#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);
printf("%.15f\n",ave);
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=55;
ll ncr[55][55];
void init(){
for(ll i=0;i<N;i++){
for(ll j=0;j<=i;j++){
if(j==0 || j==i)ncr[i][j]=1;
else ncr[i][j] = ncr[i-1][j-1] + ncr[i-1][j];
}
}
}
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
init();
ll n,A,B;cin>>n>>A>>B;
ll a[n];for(ll i=0;i<n;i++)cin>>a[i];
sort(a,a+n,greater<ll>());
long double avg=0;for(ll i=0;i<A;i++)avg+=a[i];
avg/=(A*1.0);
ll tot=0,req=0;
for(ll i=0;i<n;i++){
if(a[i]!=a[A-1])continue;
tot++;
if(i<A)req++;
}
ll cnt=0;
if(req==A)for(ll take=A;take<=B;take++)cnt+=ncr[tot][take];
else cnt=ncr[tot][req];
cout<<fixed<<setprecision(18)<<avg<<"\n";
cout<<cnt;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=100+50;
ll n,a,b,f[maxn],ans=0,cnt=0,bif=0,minn=1e15+5;
ll xyz,s[105][105],acl=0;
int main()
{
for(int i=0;i<100;i++)
{
s[i][0]=1;
for(int j=1;j<=i;j++)
{
s[i][j]=s[i-1][j]+s[i-1][j-1];
}
}
cin>>n>>a>>b;
for(int i=0;i<n;i++)
{
cin>>f[i];
}
sort(f,f+n);
for(int i=n-1;i>=n-a;i--)
{
ans+=f[i];
minn=min(minn,f[i]);
}
printf("%.6lf\n",(double)ans/a);
for(int i=n-1;i>=n-a;i--)
{
if(minn==f[i])
{
acl++;
}
}
if(minn==f[n-1])
{
for(int i=0;i<n;i++)
{
if(f[i]==f[n-1])
bif++;
}
for(int i=a;i<=b&&i<=bif;i++)
{
cnt+=s[bif][i];
}
cout<<cnt;
}
if(minn!=f[n-1])
{
for(int i=0;i<n;i++)
{
if(f[i]==minn)
bif++;
}
cnt=s[bif][acl];
cout<<cnt;
}
return 0;
} |
#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) {
if (dp[i+1][j+b] < dp[i][j] + b * v) {
cnt[i+1][j+b] = cnt[i][j];
dp[i+1][j+b] = dp[i][j] + b * v;
} else if (dp[i+1][j+b] == dp[i][j] + b * v) {
cnt[i+1][j+b] += cnt[i][j];
}
}
}
}
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) {
if (ans_v < val) ans_c = cnt[N][i];
else ans_c += cnt[N][i];
ans_v = val;
}
}
printf("%.9Lf\n%Ld\n", ans_v, ans_c);
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N,A,B;
ll v[50];
ll mem[100][100];
ll nCr(ll n,ll r){
if(mem[n][r]>0)return mem[n][r];
if(r==n)return 1;
if(r==0)return 1;
return mem[n][r]=nCr(n-1,r-1)+nCr(n-1,r);
}
int main(){
cin>>N>>A>>B;
for(int i=0;i<N;i++){
cin>>v[i];
v[i]*=-1;
}
sort(v,v+N);
ll sum=0;
ll p=v[A-1];
for(int i=0;i<A;i++){
sum-=v[i];
}
printf("%.10f\n", (double)sum / (double)A );
ll si=lower_bound(v,v+N,p) - v;
ll ti=upper_bound(v,v+N,p) - v;
ll ans=0;
for(ll i=A;i<=B;i++){
if(ti<i)break;
if(si>0&&i>A)break;
ll j=i-si;
ans+= nCr(ti-si, j);
}
cout<< ans <<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
long C[51][51];
int main(int argc, char *argv[]) {
int N, A, B;
cin >> N >> A >> B;
vector<long> v(N);
for (int i = 0; i < N; i++) cin >> v[i];
sort(begin(v), end(v), greater<long>());
for (int n = 0; n <= N; n++) C[n][0] = 1;
for (int n = 1; n <= N; n++)
for (int k = 1; k <= n; k++)
C[n][k] = C[n-1][k-1] + C[n-1][k];
long sum = 0;
for (int i = 0; i < A; i++) sum += v[i];
double avg = (double)sum / A;
long cnt = 0;
if (v[0] != v[A - 1]) {
int n = 0, k = 0;
for (int i = 0; i < N; i++) {
if (v[i] != v[A - 1]) continue;
n++;
if (i < A) k++;
}
cnt = C[n][k];
} else {
int n = 0;
for (int i = 0; i < N; i++)
if (v[0] == v[i])
n++;
for (int k = A; k <= B && k <= n; k++)
cnt += C[n][k];
}
cout << fixed << setprecision(20) << avg << endl;
cout << cnt << endl;
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();
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;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
map<ll,int>mp,g;
ll f[N];
ll C[N][N];
void solve(int n){
for(int i=1;i<=n;i++) C[i][0]=C[i][i]=1;
for(int i=2;i<=n;i++)
for(int j=1;j<i;j++)
C[i][j]=C[i-1][j]+C[i-1][j-1];
}
int main(){
ll n;int a,b;
solve(50);
cin>>n>>a>>b;
map<ll,int>::reverse_iterator it;
for(int i=1;i<=n;i++){
cin>>f[i],mp[f[i]]++;
}
sort(f+1,f+n+1,greater<ll>());
ll cnt=0,x=0;
for(int i=1;i<=a;i++){
x+=f[i];
if(f[i]==f[a]) cnt++;
}
printf("%.6f\n",(double)x/a);
ll c=0;
x=f[a];
if(cnt<a) c=C[mp[x]][cnt];
else {
for(int i=a;i<=b&&mp[x]>=i;i++){
c+=C[mp[x]][i];
}
}
cout<<c<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define r double
int n,a,b;
ll v[51];
ll c[51][51];
void comb_table(void){
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(){
cin>>n>>a>>b;
for(int i=0;i<n;i++)
cin>>v[i];
comb_table();
sort(v,v+n);
reverse(v,v+n);
r max = 0.0;
for(int i=0;i<a;i++)
max += v[i];
max /= a;
int num=0,pos=0;
for(int i=0;i<n;i++){
if(v[i]==v[a-1]){
num++;
if(i<a)
pos++;
}
}
ll cnt = 0LL;
if(pos==a){
for(pos=a;pos<=b;pos++)
cnt+=c[num][pos];
}
else
cnt+=c[num][pos];
cout.precision(20);
cout<<fixed<<max<<endl;
cout<<cnt<<endl;
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll INF = 1e18;
int MOD = 1e9+7;
ll combi(ll n,ll r){
ll num = 1;
for(ll i = 1;i <= r;i++){
num = (n-i+1)*num / i;
}
return num;
}
int main(){
int N,A,B;
cin >> N >> A >> B;
vector<ll> V(N);
map<ll,int> mp;
for(int i = 0;i < N;i++){
cin >> V[i];
mp[V[i]]++;
}
sort(V.rbegin(),V.rend());
ll sum = 0,ans = 0;
for(int i = 0;i < A;i++)sum += V[i];
for(int i = A;i <= B;i++){
map<ll,int>tmp;
ll minv = INF;
for(int j = 0;j < i;j++){
tmp[V[j]]++;
minv = min(minv,V[j]);
}
if(i != A && tmp.size() != 1)break;
ans += combi(mp[minv],tmp[minv]);
}
printf("%.6lf\n",1. * sum / A);
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(n);i++)
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
int c[51][51];
void comb(){
rep(i,51){
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 n,a,b,v[50],cnt=0,k=0,s=0,ans=0;
signed main(){
comb();
cin>>n>>a>>b;
rep(i,n)cin>>v[i];
sort(v,v+n);
reverse(v,v+n);
rep(i,n)if(v[i]==v[a-1])k++;
rep(i,a)if(v[a-1]==v[i])s++;
rep(i,a)cnt+=v[i];
printf("%.12lf\n",1.0*cnt/a);
if(v[0]==v[a-1]){
for(int i=a;i<=min(b,k);i++)ans+=c[k][i];
cout<<ans<<endl;
}
else cout<<c[k][s]<<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];
ll pow(ll x, int n){
if(n == 0) return 1;
return x * pow(x, n - 1);
}
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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long i=0;i<n;i++)
int main(){
long n,a,b;
cin >> n >> a >> b;
long v[n];
rep(i,n) cin >> v[i];
sort(v,v+n);
long c[n+1][n+1];
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];
}
}
double res=0.0;
rep(i,a) res+=v[n-1-i];
res/=double(a);
auto x=upper_bound(v,v+n,v[n-a])-lower_bound(v,v+n,v[n-a]);
if(v[n-1]!=v[n-a]) {
auto y=upper_bound(v+(n-a),v+n,v[n-a])-lower_bound(v+(n-a),v+n,v[n-a]);
cout << setprecision(24) << res << endl;
cout << c[x][y] << endl;
}
else {
long com=0;
rep(i,b-a+1) {
if(a+i>x) continue;
com+=c[x][a+i];
}
cout << setprecision(24) << res << endl;
cout << max(long(1),com) << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n; scanf("%d", &n);
ll c[55][55];
for (int i = 0; i <= n; ++ i) {
for (int j = 0; j <= n; ++ j) {
c[i][j] = 0;
}
c[i][0] = c[i][i] = 1;
for (int j = 1; j < i; ++ j) {
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
}
int a, b; scanf("%d%d", &a, &b);
ll v[55];
for (int i = 0; i < n; ++ i) scanf("%lld", &v[i]);
sort(v, v + n); reverse(v, v + n);
ll ans = 0;
for (int i = 0; i < a; ++ i) ans += v[i];
printf("%.10Lf\n", (long double) ans / a);
if (v[0] == v[a - 1]) {
int lst = 0;
for (int i = 0; i < n; ++ i) if (v[i] == v[0]) lst = i + 1;
ll cnt = 0;
for (int i = a; i <= b; ++ i) cnt += c[lst][i];
printf("%lld\n", cnt);
} else {
int fst = -1, lst = 0;
for (int i = 0; i < n; ++ i) if (v[i] == v[a - 1]) {
if (!~fst) fst = i;
lst = i + 1;
}
printf("%lld\n", c[lst - fst][a - fst]);
}
return 0;
}
|
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
long com[51][51] = {};
//降順
int des(const void *a, const void *b)
{
return *(long *)b - *(long *)a;
}
void com_init() {
for (int i=0; i<=50; i++)
com[i][0] = 1;
for (int i=1; i<=50; i++) {
for (int j=1; j<=i; j++) {
com[i][j] = com[i-1][j] + com[i-1][j-1];
}
}
return ;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
long v[N];
double sum = 0.0;
int ca = 0, ct = 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++) {
sum += v[i];
if (v[i] == v[A-1])
ca++;
}
printf("%.6lf\n", sum/A);
for (int i=0; i<N; i++)
if (v[i] == v[A-1])
ct++;
long ans = 0;
com_init();
if (ca == A)
for (int i=A; i<=B; i++)
ans += com[ct][i];
else
ans += com[ct][ca];
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;
long long C(long long n,long long r){
if(r<0 || n<r) return 0;
if(r==0||r==n) return 1;
if(r==1) return n;
return C(n,r-1)*(n-r+1)/r;
}
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,greater<long long>());
double ave=0;
long long val;
for(int i=0;i<A;i++) ave+=v[i];
ave/=0.0+A;
cout << fixed << setprecision(6) << ave << endl;
val=v[A-1];
int cnt=0,icnt=0;
for(int i=0;i<A || v[i]==val;i++){
if(v[i]==val) cnt++;
if(v[i]==val && i<A) icnt++;
}
if(v[0]==val){
long long r=0;
for(int i=A;i<=B && v[i-1]==val;i++)r+=C(cnt,i);
cout << r << endl;
}else{
cout << C(cnt,icnt) << endl;
}
return 0;
} |
#include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
ll gBinom[51][51];
void CalcBinom()
{
gBinom[1][1] = 1;
for (int i = 2; i <= 50; i++)
{
gBinom[i][1] = i;
for (int j = 2; j <= i; j++)
{
gBinom[i][j] = gBinom[i - 1][j] + gBinom[i - 1][j - 1];
}
}
}
int main()
{
CalcBinom();
ll nums[52];
int N, A, B;
scanf("%d%d%d", &N, &A, &B);
for (int i = 0; i < N; ++i)
{
scanf("%lld", &nums[i]);
}
sort(nums, nums + N, greater<ll>());
double avg = 0.0;
for (int i = 0; i < A; ++i)
avg += nums[i];
avg /= A;
const ll val = nums[A - 1];
int ccc[2] = { 0, 0 };
for (int i = 0; i < N; ++i)
{
if (nums[i] == val)
++ccc[i >= A];
}
int u = ccc[0] + ccc[1];
ll cnt = 0;
if (val == nums[0])
{
for (int i = A; i <= B; ++i)
cnt += gBinom[u][i];
}
else
cnt = gBinom[u][ ccc[0] ];
printf("%.20lf\n", avg);
printf("%lld\n", cnt);
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#define maxn 55
#define ll long long
using namespace std;
ll n,l,r,js1=0,js2=0,ans1,ans2=0;
ll a[maxn],s[maxn][maxn];
bool cmp(ll a,ll b)
{
return a>b;
}
int main()
{
s[0][0]=1;
for(int i=1;i<=50;i++)
{
s[i][0]=1;
for(int j=1;j<=i;j++)
{
s[i][j]=s[i-1][j]+s[i-1][j-1];
}
}
cin>>n>>l>>r;
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++)
{
ans2+=a[i];
}
for(ll i=1;i<=n;i++)
{
if(a[i]==a[l])
{
js1++;
}
}
for(ll i=1;i<=l;i++)
{
if(a[i]==a[l])
{
js2++;
}
}
if(a[1]==a[l])
{
for(ll i=l;i<=r;i++)
{
ans1+=s[js1][i];
}
}
else
{
ans1=s[js1][js2];
}
printf("%lf\n%lld",(double)ans2/l*1.0,ans1);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int64_t Con(int a, int b){
int64_t Ans=1;
for(int i=0; i<b; i++){
Ans*=a-i;
Ans/=i+1;
}
return Ans;
}
int main(){
int N, A, B;
cin >> N >> A >> B;
vector<int64_t> V(N);
for(int i=0; i<N; i++){
cin >> V.at(i);
V.at(i)*=-1;
}
sort(V.begin(), V.end());
for(int i=0; i<N; i++){
V.at(i)*=-1;
}
double Ave=0;
for(int i=0; i<A; i++){
Ave+=(double)V.at(i)/(double)A;
}
cout << setprecision(20) << Ave << endl;
int first=0;
int count=0;
int t=0;
for(int i=0; i<N; i++){
if(V.at(i)==V.at(A-1)){
if(t==0){
first=i;
t=1;
}
count++;
}
}
int64_t Ans=0;
for(int i=A-first; i<=B-first; i++){
Ans+=Con(count, i);
}
if(V.at(0)==V.at(A-1)){
cout << Ans << endl;
}
else{
cout << Con(count, A-first) << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
string a;
int ans=0;
int main()
{
cin>>a;
for(int i=1;i<a.size();++i)
if(a[i]!=a[i-1])
ans++;
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string S;
cin>>S;
S.erase(unique(S.begin(),S.end()),S.end());
cout<<S.size() - 1 << endl;
} |
#include<iostream>
#include<cstring>
using namespace std;
int main(){
char ch[1000000];
int p=0;
cin>>ch;
for(int i=0;i<strlen(ch)-1;i++){
if(ch[i]!=ch[i+1])p++;
}
cout<<p<<endl;
return 0;
} |
#include <cstdio>
#include <cstring>
long long a,b,c,d,i,j,k,x,y,z,ans;
char f[100005];
int main(){
scanf("%s",f);
for (i=1;i<=strlen(f)-1;i++){
if (f[i]!=f[i-1]) ans++;
}
printf("%lld",ans);
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,ans=0;
string f;
cin>>f;
for(i=0;i<f.size()-1;i++)
{
if(f[i]!=f[i+1])ans++;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
char a[1000001];
int la,ans;
int main()
{
cin>>a;
la=strlen(a);
for(int i=1;i<la;i++)
{
if(a[i]!=a[i-1])
ans++;
}
cout<<ans<<endl;
return 0;
} |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
cout << unique(begin(S),end(S)) - begin(S) - 1 << endl;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string S;
int i,ans=0;
cin>>S;
for(i=1;i<S.size();i++){
if(S[i]!=S[i-1])ans++;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
string s;
long long ans=0,len;
int main()
{
cin>>s;
len=s.length();
for(int i=1;i<len;i++)
if(s[i]!=s[i-1])
ans++;
cout<<ans<<endl;
return 0;
} |
#include<iostream>
using namespace std;
string a;
int ans;
int main()
{
cin>>a;
for(int i=1;i<a.length();i++)
if(a[i]!=a[i-1])
ans++;
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int ans=0;
cin>>s;
for(int i=1;i<s.size();i++)
if(s[i-1]!=s[i])ans++;
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int x=s.size();
int cnt=0;
for (int i=0;i<x-1;++i){
if (s[i]!=s[i+1]) cnt++;
}
cout << cnt << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int cnt=0;
int n=s.size();
for(int i=1;i<n;i++)if(s[i]!=s[i-1])cnt++;
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int ans=0;
for (int i=0;i<s.size()-1;++i)if(s[i]!=s[i+1])ans++;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int a=s.size();
int ans=0;
for(int i=1;i<a;i++){
if(s[i-1] !=s[i]){ans++;}
}
cout << ans << endl;
} |
#include<iostream>
#include<cstring>
using namespace std;
int main(){
char a[100010];
int ans=0;
cin>>a;
for(int i=1;i<=strlen(a);i++){
if(a[i]!=a[i-1]) ans++;
}
cout<<ans-1;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
char c[100005];
int ans;
int main(){
scanf("%s",c);
int l=strlen(c);
for(int i=1;i<l;++i)
if(c[i]!=c[i-1])
++ans;
printf("%d\n",ans);
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int ans=0;
char s,c;
cin>>c;
while(cin>>s)if(s!=c){ans++;c=s;}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int i,s;
string a;
int main(){
cin>>a;
for(i=1;i<a.size();i++){
if(a[i-1]!=a[i]){
s++;
}
}
cout<<s<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int ans=0;
string s;cin>>s;
for(int i=1;i<s.size();i++)
if(s[i]!=s[i-1])ans++;
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
string s;
int ans;
int main() {
int i;
cin >> s;
for(i=1; i<s.size(); i++) {
if(s[i] != s[i-1]) ans++;
}
cout << ans;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
char i[100001]="0";
int c=0;
cin>>i;
for(int j=1;i[j]!='\0';j++) if(i[j]!=i[j-1]) c++;
cout<<c;
return 0;
} |
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
string n;
int s=0;
cin>>n;
for(int i=1;i<n.length();i++)
{
if(n[i]!=n[i-1])
s++;
}
cout<<s<<endl;
} |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int s;
string st;
int main()
{
cin>>st;
for(int i=1;i<st.size();i++)
{
if(st[i]!=st[i-1])s++;
}
cout<<s;
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
string s;
int ans;
int main()
{
cin>>s;
int l=s.length();
for(int i=1;i<l;i++)
if(s[i]!=s[i-1]) ans++;
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int count=0;
for(int i=1;i<s.size();i++){
if(s[i]!=s[i-1])count++;
}
cout<<count<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int i,ans=0;
string s;
getline(cin,s);
for(i=1;i<s.size();i++){
if(s[i-1]!=s[i])
ans++;
}
cout<<ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int ans=0;
for(int i=0; i<str.size()-1; i++){
if(str.at(i) != str.at(i+1)) ans++;
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int ans=0;
string s;
getline(cin,s);
for(int i=0;i<s.size()-1;i++){
if(s[i]!=s[i+1])ans++;
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string a;
int s;
int main()
{
cin>>a;
for(int i=1;i<a.size();i++)if(a[i-1]!=a[i])s++;
cout<<s<<endl;
} |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int ans = 0;
for(int i = 0; i + 1 < s.size(); i++) ans += s[i] != s[i + 1];
cout << ans << endl;
} |
#include <iostream>
using namespace std;
int main() {
char last = '1';
char c;
int ans = -1;
while (cin >> c) {
ans += c != last;
last = c;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int ans=0;
for(int i=0;i<s.size()-1;++i)
{
if(s.at(i)!=s.at(i+1)) ans++;
}
cout << ans;
return 0;} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S; cin>>S;
long long ans=0;
for(int i=1;i<S.size();i++){
if(S.at(i)!=S.at(i-1))ans++;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int ans=0;
for(int i=0;i<s.length()-1;i++)
if(s[i]!=s[i+1])
ans++;
cout<<ans<<"\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
char a[100005];
int main()
{
cin>>a;
int len=strlen(a),ans;
for(int i=1;i<len;i++)
if(a[i]!=a[i-1])
ans++;
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
string a;
cin>>a;
int g=0;
for(int i=1;i<=a.length()-1;i++)
if(a[i]!=a[i-1])
g++;
cout<<g<<endl;
return 0;
} |
#include<iostream>
#include<cstring>
using namespace std;
int main(){
string s;
cin>>s;
int ans=0;
for(int i=1;i<s.length();i++){
if(s[i]!=s[i-1])ans++;
}
cout<<ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
char a[100001];
int main()
{
int b=0,i;gets(a);
for(i=1;i<strlen(a);i++)
if(a[i]!=a[i-1])b++;
printf("%d\n",b);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int ans=0;
cin>>s;
int size=s.size();
for(int i=0;i<size-1;i++){
if(s[i]!=s[i+1])ans++;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int ans;
char s[100001];
int main()
{
cin>>s;
for(int i=1;i<=strlen(s);i++)
if(s[i]!=s[i-1])ans++;
cout<<ans-1<<endl;
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int ans=0;
string n;
cin>>n;
for(int i=0;i<n.length();i++)
{
if(n[i]!=n[i-1])
{
ans++;
}
}
cout<<ans-1<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main (){
string s;
cin>>s;
int t=0;
for(int i=0;i<s.size()-1;i++){
if(s[i]!=s[i+1]){
t++;
}
}
cout<<t<<endl;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.