text stringlengths 49 983k |
|---|
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
char s[200010];
long long ans, cnt[2000];
int main() {
scanf("%s", s);
int n = strlen(s);
for(int i = 0; i < n; i++) {
ans += i - cnt[s[i]];
cnt[s[i]]++;
}
printf("%lld", ans + 1);
} |
#include<bits/stdc++.h>
using namespace std;
char s[500000],c[500000];
long long sum[30];
int main() {
scanf("%s",s);
long long n=strlen(s),ans=n*(n-1)/2+1;
for(int j=0;j<n;j++)
sum[s[j]-'a'+1]++;
for(int i=1;i<=26;i++)
ans-=sum[i]*(sum[i]-1)/2;
cout<<ans;
} |
#include <iostream>
#include <map>
using namespace std;
int main(){
string A;
cin >> A;
long long int N = A.length(), ans = N*(N-1)/2 + N + 1;
map<char, int> M;
for(int i = 0; i < N; ++i){
++M[A[i]];
ans -= M[A[i]];
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char s[222222];
long long ans,cnt[33],n;
int main()
{
scanf("%s",s);
n=strlen(s);
for (int i=0;i<n;i++)
{
ans=ans+i-cnt[s[i]-'a'];
cnt[s[i]-'a']++;
}
printf("%lld\n",ans+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
unsigned long long a[30]={},ans=0,l=0;
char c[200010]={};
int main(){
scanf("%s",c+1),l=strlen(c+1);
for(int i=1;i<=l;i++) a[c[i]-'a'+1]++;
for(int i=1;i<26;i++) for(int j=i+1;j<=26;j++) ans+=a[i]*a[j];
printf("%lld\n",ans+1);
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
int n = s.size();
ll ans = 1;
ans += (ll)n *(n-1) /2;
map<char,int> mp;
for(int i=0; i<n; ++i){
ans -= mp[s[i]];
++mp[s[i]];
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long ans=1;
string s;
cin >> s;
map<char, int> mp;
for(int i=s.size()-1;i>=0;i--){
mp[s[i]]++;
ans+=s.size()-i-mp[s[i]];
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
char s[2000500];
int n;
LL F[30],ans;
int main() {
scanf("%s",s+1);
n = strlen(s+1);
for (int i=1;i<=n;i++) {
F[ s[i]-'a' ]++;
for (int j=0;j<26;j++) if (j != s[i]-'a') ans += F[j];
}
cout << ans+1 << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int c[26];
int main()
{
string s;
cin >> s;
for (char x : s)
c[x-'a']++;
long long ans = 1;
for (int i = 0; i < 26; ++i)
for (int j = i + 1; j < 26; ++j)
ans += c[i] * 1LL * c[j];
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
string s;
cin>>s;
map<char,ll> m;
for(int i=0;i<s.size();i++){
m[s[i]]++;
}
ll c=0;
for(int i=0;i<26;i++){
ll j=m[(char)('a'+i)];
c+=j*(j+1)/2;
}
ll j=(ll)s.size();
cout<<j*(j+1)/2+1-c;
} |
#include <bits/stdc++.h>
using namespace std;
char s[200005];
int a[256];
int main()
{
scanf("%s",s);
int l=strlen(s);
long long ans=1;
for(int i=0;i<l;i++)
ans+=i-a[s[i]],a[s[i]]++;
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
//bool dp[2][4000001];
signed main(){
string a;
cin >>a;
int k[26]={};
for(int i=0;i<a.size();i++){
k[a[i]-'a']++;
}
int ans=2;
for(int i=0;i<26;i++)ans+=k[i]*(a.size() -k[i]);
cout << ans/2;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
string s;
int main(){
cin>>s;
N=s.size();
ll ans=N*(N-1)/2;
ll cnt[26]={};
for(int i=0;i<N;i++)cnt[ s[i]-'a' ]++;
for(int i=0;i<26;i++){
ans-= cnt[i]*(cnt[i]-1)/2;
}
cout<<ans+1<<endl;
return 0;
}
|
#include <cstdio>
char s[200001];
long long a[26], S = 1;
int main()
{
scanf("%s", s);
for (int i = 0; s[i]; i++)
a[s[i] - 'a']++;
for (int i = 0; i < 26; i++)
for (int j = i + 1; j < 26; j++)
S += a[i] * a[j];
printf("%lld\n", S);
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
long long a[26]={0},n;
string s;
cin>>s;
n=s.length();
for(int i=0;i<n;i++){
a[s[i]-'a']++;
}
n=n*(n-1)/2;
for(int i=0;i<26;i++){
n-=a[i]*(a[i]-1)/2;
}
cout<<n+1<<endl;
return 0;
} |
#include<cstdio>
#include<ctype.h>
#include<string.h>
#define ll long long
int n, tot, a[26];
ll ans=1;
char s[200005];
int main() {
n=fread(s, 1, 200000, stdin);
while(!islower(s[n-1])) --n;
for(register int i=0; i<n; ++i) ans+=tot++-a[s[i]-'a']++;
return printf("%lld", ans), 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
long long ans = 0;
long long cnt[33] = {};
for(long long i=0;i<n;i++){
ans+=(i-cnt[s[i]-'a']);
cnt[s[i]-'a']++;
}
cout<<ans+1ll<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200000 + 10;
char s[N]; int c[30];
int main() {
scanf("%s",s+1);
for(int i=1;s[i];i++) c[s[i]-'a']++;
LL n=strlen(s+1);
LL tot=n*(n-1)/2;
for(int i=0;i<26;i++){
tot=tot-1LL*c[i]*(c[i]-1)/2;
}
tot++;
cout<<tot<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+50;
char ch[N];
int n,cnt[26],s;
LL ans;
int main() {
scanf("%s",ch+1); n=strlen(ch+1);
for(int i=1;i<=n;i++)
ans+=s-cnt[ch[i]-'a'], ++s, ++cnt[ch[i]-'a'];
cout<<ans+1<<'\n';
} |
#include<string>
#include<iostream>
using namespace std;
int main() {
string a;
cin >> a;
int count[26] = {0};
long long ans = 1;
for(int i=0;i<a.size();i++) {
int c = a[i] - 'a';
ans += i - count[c];
count[c]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
string s;
int cnt[30];
signed main(){
cin>>s;
rep(i,s.size()){
cnt[s[i]-'a']++;
}
int ans=s.size()*(s.size()-1)/2+1;
rep(i,26){
ans-=cnt[i]*(cnt[i]-1)/2;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int ct[26];
int main(){
string s;
cin >> s;
long long ans = 1;
for (int i = 0; i < s.size(); i++){
ans += i-ct[s[i]-'a'];
ct[s[i]-'a']++;
}
printf("%lld",ans);
}
|
#include <bits/stdc++.h>
using namespace std;
char s[200010];
int cnt[26];
typedef long long LL;
int main()
{
scanf("%s",s);
int len = strlen(s);
LL ans = 1;
LL sum = 0;
for (int i=0;i<len;i++)
{
ans += sum - LL(cnt[s[i] - 'a']);
cnt[s[i] - 'a']++;
sum++;
}
printf("%lld\n",ans);
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
char s[N];
int cnt[26];
int main() {
scanf("%s", s);
int n = strlen(s);
long long ans = 1;
for (int i = n - 1; i >= 0; i--) {
ans += (n - i - 1) - cnt[s[i] - 'a'];
cnt[s[i] - 'a']++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string a;
cin >> a;
int n = a.size();
std::map<char, int> m;
ll ans = 1;
m[a[0]] += 1;
for (int i = 1; i < n; ++i)
{
ans += i - m[a[i]];
m[a[i]] += 1;
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
string a;
long long ans,n,c[26];
int main(){
cin>>a;
n=a.size();
ans=n*(n-1)/2;
for(int i=0;i<n;i++)c[a[i]-'a']++;
for(int i=0;i<26;i++)ans-=(c[i]-1)*c[i]/2;
cout<<ans+1<<endl;
} |
#include <iostream>
using namespace std;
int main() {
string s;
long long cnt[30] = {0}, sum = 0;
cin >> s;
for(char c: s)
++cnt[c - 'a'];
for(int i = 0; i < 30; ++i)
sum += (cnt[i] * (cnt[i] + 1)) / 2;
cout << 1 + (s.size() * (s.size() + 1)) / 2 - sum << endl;
} |
#include <bits/stdc++.h>
using namespace std;
string s;
long long sum;
map<char,int> col;
int main(){
cin >> s;
for(int i = 0; i < (int)s.size(); i++){
sum += (i - col[s[i]]);
col[s[i]]++;
}
cout << sum + 1;
return 0;
} |
#include <iostream>
using namespace std;
using ll = long long;
int cnt[256];
int main() {
string A;
cin >> A;
ll dame = 0;
for (char c: A) {
++cnt[c];
dame += cnt[c];
}
ll n = A.size();
ll res = n * (n + 1) / 2 + 1 - dame;
cout << res << endl;
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define MN 200005
int c[26],n;
long long ans=0;
char str[MN];
int main(){
scanf("%s",str+1); n=strlen(str+1);
for(int i=1;i<=n;i++)
ans+=i-(++c[str[i]-'a']);
printf("%lld",ans+1);
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll p = 998244353;
string s;
ll n, ct[26], ans;
int main() {
cin >> s;
n = s.length();
ans = n*(n-1)/2;
for (int i = 0; i < n; ++i)
ct[s[i]-'a']++;
for (int i = 0; i < 26; ++i)
ans -= ct[i]*(ct[i]-1)/2;
cout << ans+1 << endl;
} |
#include <iostream>
#include <string>
using namespace std;
int main(){
string A;
cin >> A;
int cnt[27];
for(char i='a';i<='z';i++) cnt[i-'a']=0;
long long ptn=1;
for(int i=0;i<A.size();i++){
ptn+=i-cnt[A[i]-'a'];
cnt[A[i]-'a']++;
}
cout << ptn << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string s;
cin >> s;
int ans = 0;
map<char, int> mp;
for(auto c: s) mp[c]++;
for(auto p: mp) {
ans += p.second * (s.size()-p.second);
}
cout << ans/2+1 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long ans=1;
string s;
cin >> s;
map<char, int> mp;
for(int i=0;i<s.size();i++){
mp[s[i]]++;
}
for(size_t i=0;i<s.size();i++){
ans+=s.size()-i-mp[s[i]];
mp[s[i]]--;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define in long long
using namespace std;
string s;
in ans=1;
in cnt[200011]={};
int main()
{
cin >>s;
for(in i=0;i<s.size();i++)
{
ans+=i-cnt[s[i]];
cnt[s[i]]++;
}
cout<<ans<<endl;
return 0;
} |
#include <stdio.h>
char S[200200];
int main()
{
long long l = 0, c[26] = { 0, };
scanf("%s", S);
while (S[l]) {
c[S[l] - 'a']++;
l++;
}
long long ans = 1 + l * (l + 1) / 2;
for (int i = 0; i < 26; i++) ans -= c[i] * (c[i] + 1) / 2;
printf("%lld\n", ans);
return 0;
} |
#include <iostream>
#include <map>
using namespace std;
int main() {
string A;
cin >> A;
long long N = A.length();
map<char, long long> Nums;
for (char c : A) Nums[c]++;
long long ans = N * (N - 1) / 2 + 1;
for (auto& p : Nums) ans -= p.second * (p.second - 1) / 2;
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
long long n = s.length();
map<char, long long> cnt;
long long ans = 0;
for(int i = n-1; i >= 0; i--){
ans += n-1-i-cnt[s[i]];
cnt[s[i]]++;
}
cout << ans+1 << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n;
char s[200005];
long long cnt[50];
int main() {
int i;
long long ans;
scanf(" %s",s);
n = strlen(s); ans = (long long)n*(n+1)/2;
for(i=0;i<n;i++) cnt[s[i]-'a']++;
for(i=0;i<26;i++) ans -= cnt[i]*(cnt[i]+1)/2;
printf("%lld",ans+1);
}
|
#include<bits/stdc++.h>
using namespace std;
string s,t;
int x[26];
long long a;
int main(){
cin>>s;
for(int i=0;i<s.size();++i)
x[s[i]-'a']++;
for(int i=0;i<s.size()-1;++i){
a+=s.size()-i-x[s[i]-'a'];
x[s[i]-'a']--;
}
cout<<a+1<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int mar[200000];
int main() {
ios_base::sync_with_stdio(0);
cin >> s;
long long ans = 1;
for (int i = 0; i < s.size(); i++) {
ans += i - mar[s[i]];
mar[s[i]]++;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int frc[1000];
int sum;
long long ans = 1;
int main()
{
string s;
cin >> s;
for (auto i : s) {
ans += sum - frc[i];
frc[i]++, sum++;
}
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
typedef long long lli;
using namespace std;
string s;
lli ans=1;
lli sum[26];
int main()
{
cin>>s;
for(int i=0;i<s.length();i++) sum[s[i]-'a']++;
for(int i=1;i<26;i++) for(int j=0;j<i;j++) ans+=sum[i]*sum[j];
printf("%lld",ans);
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
char s[200009];
LL cnt[26], n, ans;
int main(){
scanf("%s", &s);
n = strlen(s);
for (int i=0; s[i]; i++)
cnt[s[i]-'a']++;
ans = n*(n-1)/2+1;
for (int i=0; i<26; i++)
ans -= cnt[i]*(cnt[i]-1)/2;
printf("%lld\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
long long n=s.size();
vector<long long> c(26);
for(int i=0;i<n;i++){
c[s[i]-'a']++;
}
long long sum=0;
for(int i=0;i<26;i++){
sum+=c[i]*(c[i]-1)/2;
}
cout << n*(n-1)/2-sum+1 << endl;
} |
#include <stdio.h>
char s[200005];
int cnt[1005];
int main(){
scanf("%s", s);
int N;
for(N=0; s[N]; N++);
long long res = 1LL*N*(N+1)/2;
for(int i=0; i<N; i++){
res -= cnt[s[i]]+1;
cnt[s[i]]++;
}
printf("%lld", res+1);
return 0;
} |
#include<cstdio>
#include<cstring>
using namespace std;
char c[200005];int cnt[27];
long long ans;
int main(){
scanf("%s",c+1);int n=strlen(c+1);
for(int i=n;i>=1;--i) ans+=(n-i)-cnt[c[i]-'a']++;
printf("%lld",ans+1);
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
ll n;
ll f[26];
ll res;
int main(){
cin >> s;
n=s.size();
for(int i=0;i<s.size();i++)f[s[i]-'a']++;
res=(n*(n-1))/2+1;
for(int i=0;i<26;i++)res-=(f[i]*(f[i]-1))/2;
cout << res << endl;
} |
#include<bits/stdc++.h>
using namespace std;
long long len;
long long f[30];
char a[200010];
int main() {
scanf("%s",a);
long long len=strlen(a);
for (int i=0;i<len;i++)
f[a[i]-'a']++;
long long ans=len*(len-1)/2;
for (int i=0;i<26;i++)
ans-=f[i]*(f[i]-1)/2;
printf("%lld\n",ans+1);
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
vector<int> cnt(26);
ll ans =0;
for(auto c:s)
{
for(int i =0 ;i<26;i++)
{
if(i+'a'==c)continue;
ans+=cnt[i];
}
cnt[c-'a']++;
}
cout<<ans+1<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int A[1001];
int main(){
long long sum=0;
string s;
cin >> s;
for(int i=0;i<s.size();i++){
sum+=i-A[s[i]];
A[s[i]]++;
}
cout << sum+1 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
string s;
long long k[30],ans=1;
int main() {
cin>>s;
for(int i=0;i<s.length();++i){
++k[s[i] - 'a'];
}
for (int i = 0; i < 26; ++i) {
for (int j = i + 1; j < 26; ++j) {
ans += k[i] * k[j];
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
char s[1000000];
int l,ans,a[200];
signed main(){
ios::sync_with_stdio(false);
cin>>s;l=strlen(s);
for (int i=0;i<l;i++)
ans+=i-a[s[i]],a[s[i]]++;
cout<<ans+1<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string A;
cin >> A;
int N=A.size();
long long ans=(long long)N*(N-1)/2+1;
for(int i=0;i<26;i++){
char t='a'+i;
int c=0;
for(auto a:A)if(a==t)c++;
ans-=(long long)c*(c-1)/2;
}
cout << ans << endl;
return 0;
} |
#include<iostream>
using namespace std;
typedef long long ll;
#define fr(i,n) for(int i=0;i<n;i++)
int main(){
char a[200010],b;
ll n=0,c[26]={},d;
for(;cin>>b;){
a[n++]=b;
c[b-'a']++;
}
d=(n*(n-1))/2+1;
fr(i,26) d-=(c[i]*(c[i]-1))/2;
cout<<d<<endl;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
char p[301000];
long long S = 1;
int C[26];
int main(){
int i, j;
scanf("%s",p);
for(i=0;p[i];i++)C[p[i]-'a']++;
for(i=0;i<26;i++)for(j=i+1;j<26;j++)S += 1ll*C[i]*C[j];
printf("%lld\n",S);
} |
#include<cstdio>
#include<cstring>
char s[500000];
int a[26];
int len;
long long ans;
int main()
{
scanf("%s",s);
len=strlen(s);
ans=1ll*len*(1ll*len-1ll)/2;
for(int i=0;i<len;i++)
ans-=a[s[i]-'a'],a[s[i]-'a']++;
printf("%lld",ans+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long ar[26]={0},i,j,n;
string s;
cin>>s;
n=s.length();
long long ans=1+n*(n-1)/2;
for(i=0;i<n;++i)
++ar[s[i]-97];
for(i=0;i<26;++i)
ans=ans-ar[i]*(ar[i]-1)/2;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a;
long long l, c[30], ans;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a;
l = a.size();
for(int i=0; i<l; ++i)
++c[a[i]-'a'];
ans = l * (l - 1) / 2;
for(int i=0; i<26; ++i)
ans -= c[i] * (c[i] - 1) / 2;
cout << 1 + ans << "\n";
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
long long c[100];
int main()
{
string str;
long long s,i,n;
cin >> str;
s=str.size();
n=s*(s-1)/2;
for(i=0; i<s; i++)
c[str[i]-97]++;
for(i=0; i<26; i++)
{
n-=c[i]*(c[i]-1)/2;
}
cout << n+1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
map<char, int> cnt;
long long ans = 1;
int total = 0;
for (auto &c : s) {
ans += total - cnt[c];
++cnt[c];
total += 1;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
char s[200010];
int cnt[26];
int main () {
scanf("%s",s+1);
for(int i=1;s[i];i+=1) cnt[s[i]-'a'] += 1;
LL ans = strlen(s+1); ans = ans * (ans-1) / 2;
for(int i=0;i<26;i+=1) ans -= (LL)cnt[i] * (cnt[i]-1) / 2;
cout << ans+1;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x[26];
int main() {
string s;
cin >> s;
long long n = s.size(), ans = n * (n - 1) / 2 + 1;
for (char c : s)
x[c - 'a']++;
for (int i = 0; i < 26; i++)
ans -= x[i] * (x[i]- 1) / 2;
cout << ans << '\n';
} |
#include <bits/stdc++.h>
using namespace std;
string a;
int ctr[26] = {};
int main()
{
cin >> a;
int64_t n = a.length();
for (char c : a) ctr[c-'a']++;
int64_t r = 1LL*n*(n-1)/2;
for (int x : ctr) r -= 1LL*x*(x-1)/2;
cout << r+1 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
string s;
cin>>s;
ll ans=s.size()*(s.size()-1)/2+1,alp[26]={0};
rep(i,s.size()) alp[s[i]-'a']++;
rep(i,26) ans-=alp[i]*(alp[i]-1)/2;
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll am[300];
ll n;
char str[300000];
int main()
{
ll ans = 1;
scanf(" %s", str);
n = strlen(str);
for (ll i = 0; i < n; i++)
{
ans+=i-am[str[i]];
am[str[i]]++;
}
printf("%lld\n", ans);
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 200000 + 10;
char s[N];
int a[N];
int main(){
scanf("%s",s);
int n = strlen(s);
long long ans = 0;
for(int i=n-1;i>=0;i--){
ans += n-1-i-a[s[i]-'a'];
a[s[i]-'a']++;
}
printf("%lld\n",ans+1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin>>a;
map<char, int> m;
for (char c: a) {
++m[c];
}
long long ans = 0;
int n = a.length();
for (int i=0; i<n; i++) {
ans += n - i - m[a[i]];
--m[a[i]];
}
cout<<ans+1<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,a[30];long long ans;char s[222222];
int main(){
cin>>s+1,n=strlen(s+1);
for(int i=1;i<=n;i++)a[s[i]-'a'+1]++;
for(int i=1;i<26;i++)for(int j=i+1;j<=26;j++)ans+=1ll*a[i]*a[j];
printf("%lld",ans+1);
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
cin>>s;
ll c[256]={},n=s.size(),ans=1;
for(ll i=0;i<n;i++){
c[s[i]]++;
ans+=i+1-c[s[i]];
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long cnt[26];
int main(void){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string str;
cin>>str;
long long ans = 1;
for(long i = 0; i < str.size(); i++){
ans = ans + i - cnt[str[i]-'a'];
cnt[str[i]-'a']++;
}
cout<<ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
string s;
unordered_map <char, int> m;
int main() {
cin >> s;
int n = s.length();
long long ans = n * 1LL * (n - 1) / 2 + 1;
for (auto z : s) {
ans -= m[z];
m[z]++;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
char s[200005];
int n,cnt[200005];
long long ans;
int main(){
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++) cnt[s[i]-'a']++;
for(int i=0;i<26;i++) for(int j=i+1;j<26;j++) ans+=1ll*cnt[i]*cnt[j];
printf("%lld",ans+1);
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
typedef long long ll;
ll com[55][55];
int main(){
int n,a,b; cin >> n >> a >> b;
rep(i, 55){
rep(j, i+1){
if(i == 0 || j == i) com[i][j] = 1LL;
else com[i][j] = com[i-1][j-1] + com[i-1][j];
}
}
double amax = 0;
ll cnt = 0;
vector<double> v(n);
rep(i,n) cin >> v[i];
sort(RALL(v));
double sum = 0.0;
rep(i,a) sum += v[i];
amax = sum / (double)a;
int var = 0, num = 0;
rep(i,a) if(v[i] == v[a-1]) var++;
rep(i,n) if(v[i] == v[a-1]) num++;
cnt = com[num][var];
if(v[0] == v[a-1]){
cnt = 0;
FOR(i,a,b+1) cnt += com[num][i];
}
cout << setprecision(10);
cout << fixed << amax << endl;
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long c[51][51], ans;
int n, a, b;
vector<double> v;
double avg;
int main() {
scanf("%d%d%d",&n,&a,&b);
c[0][0] = 1;
for(int i = 1; i <= n; 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];
}
v.resize(n);
for(int i = 0; i < n; i++) scanf("%lf",&v[i]);
sort(v.begin(), v.end(), greater<double>());
for(int i = 0; i < a; i++) avg += v[i];
avg /= a;
int x = 0, y = 0;
for(int i = 0; i < n; i++) if(v[i] == v[a-1]) {
x++;
if(i < a) y++;
}
if(v[0] != v[a-1]) ans = c[x][y];
else {
for(int k = a; k <= min(x, b); k++) ans += c[x][k];
}
printf("%lf\n%lld\n", avg, ans);
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll C[55][55];
void CombTable(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<double> v(N + 1, 0);
for (int i = 1; i <= N; i++){
cin >> v[i];
}
sort(v.begin(), v.end(), greater<double>());
double sum = 0;
for (int i = 0; i < A; i++){
sum += v[i];
}
double average = sum/A;
ll n = 0, k = 0;
for (int i = 0; i < N; i++){
if (v[i] == v[A - 1]){
n++;
if (i < A) k++;
}
}
CombTable(N);
ll cnt = 0;
if (k == A){
for (k = A; k <= B; k++){
cnt += C[n][k];
}
} else {
cnt += C[n][k];
}
cout.precision(20);
cout << fixed << average << endl;
cout << cnt << endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=50+5;
ll v[maxn],C[maxn][maxn];
void init() {
for(int i=0;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;
scanf("%d%d%d",&N,&A,&B);
for(int i=1;i<=N;i++) scanf("%lld",&v[i]);
sort(v+1,v+N+1);
ll sum=0;
int need=0,cnt=0;
for(int i=N;i>=N-A+1;i--) {
sum+=v[i];
if(v[i]==v[N-A+1]) ++need;
}
for(int i=1;i<=N;i++) if(v[i]==v[N-A+1]) ++cnt;
init();
ll ans=0;
if(need==A) for(int i=A;i<=B;i++) ans+=C[cnt][i];
else ans=C[cnt][need];
printf("%.6lf\n%lld\n",1.*sum/A,ans);
return 0;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 55
using namespace std;
typedef long long ll;
ll n, a, b, s, c1, c2, ans, v[N], c[N][N];
int main()
{
ll i, j;
cin >> n >> a >> b;
for (i = 0; i <= n; i++) {
c[i][0] = 1;
for (j = 1; j <= i; j++) {
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
}
for (i = 0; i < n; i++) scanf("%lld", &v[i]);
sort(v, v + n, greater<ll>());
for (i = 0; i < a; i++) s += v[i];
for (; i < n; i++) {
if (v[i] == v[a - 1]) c1++;
else break;
}
for (i = a - 1; i >= 0; i--) {
if (v[i] == v[a - 1]) c1++, c2++;
else break;
}
if (v[0] != v[a - 1]) {
printf("%.9f\n%lld", 1.0 * s / a, c[c1][c2]);
} else {
for (i = a; i <= b; i++) ans += c[c1][i];
printf("%.9f\n%lld", 1.0 * s / a, ans);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
ll comb[51][51];
int main(){
for(int i=0;i<=50;i++){
for(int j=0;j<=i;j++){
if(j==0||j==i){
comb[i][j]=1;
}else{
comb[i][j]=comb[i-1][j-1]+comb[i-1][j];
}
}
}
int n,a,b;
cin>>n>>a>>b;
ll v[n];
for(int i=0;i<n;i++){
cin>>v[i];
v[i]=-v[i];
}
sort(v,v+n);
ll ans=0;
for(int i=0;i<a;i++){
ans-=v[i];
}
ll res=0;
int ub=upper_bound(v,v+n,v[a-1])-v;
int lb=lower_bound(v,v+n,v[a-1])-v;
if(v[0]!=v[a-1]){
res=comb[ub-lb][a-lb];
}
else{
for(int i=a;i<=min(b,ub);i++){
res+=comb[ub-lb][i];
}
}
cout<<fixed<<setprecision(25)<<(double)ans/a<<endl;
cout<<res<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N, A, B, v[50], c[51][51], ans;
double acc;
int main() {
for(int i{}; i <= 50; ++i)
for(int j{}; j <= i; ++j)
c[i][j] = (!j || i == j ? 1ll : c[i - 1][j - 1] + c[i - 1][j]);
cin >> N >> A >> B;
for(int i{}; i < N; ++i)
cin >> v[i];
sort(v, v + N, greater<ll>());
cout.precision(10); cout << fixed;
for(int i{}; i < A; ++i) acc += v[i];
acc /= A;
if(v[0] == v[A - 1]) {
int cnt = count(v, v + N, v[0]);
cout << acc << endl;
for(int i = A; i <= B; ++i)
ans += c[cnt][i];
cout << ans << endl;
}
else {
int cnt = count(v, v + N, v[A - 1]), z = count(v, v + A, v[A - 1]);
cout << acc << endl;
cout << c[cnt][z] << endl;
}
}
|
#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;
long long C(long long A,long long B){
long long ans=1;
for(int i=0;i<B;i++){
ans=ans*(A-i)/(i+1);
}
return ans;
}
int main() {
long long N,a,b,c,ans=0;
long double sum=0;
cin>>N>>a>>b;
vector<long long> V(N);
for(int i=0;i<N;i++){
cin>>V.at(i);
}
sort(V.begin(),V.end());
reverse(V.begin(),V.end());
for(int i=0;i<a;i++){
sum+=V.at(i);
}
cout<<fixed<<setprecision(10)<<sum/a<<endl;
if(V.at(0)==V.at(a-1)){
c=count(V.begin(),V.end(),V.at(0));
b=min(b,c);
for(long long i=a;i<=b;i++){
ans+=C(c,i);
}
}
else{
c=count(V.begin(),V.end(),V.at(a-1));
b=count(V.begin(),V.begin()+a,V.at(a-1));
ans=C(c,b);
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int N;
int A, B;
ll v[52];
ll ave;
ll com[52][52];
ll ans;
int main() {
com[0][0] = 1;
for(int i = 0; i < 52; i++){
com[i][i] = com[i][0] = 1;
}
for(int i = 1; i < 52; i++){
for(int j = 1; j < i; j++){
com[i][j] = com[i-1][j-1] + com[i-1][j];
}
}
cin >> N >> A >> B;
for(int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v,v+N,greater<ll>());
for(int i = 0; i < A; i++){
ave += v[i];
}
cout << fixed << ave / (double)A << endl;
int k = 0; int t = 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++){
ans += com[k][i];
}
}
else {
ans += com[k][t];
}
cout << ans <<endl;
return 0;
} |
# include <iostream>
# include <algorithm>
# include <unordered_map>
# include <iomanip>
using namespace std;
typedef long long int ll;
typedef long double ld;
unordered_map<ll,ll>cnt,f;
ll C[53][53];
int main()
{
ll v[53];
int n,a,b;
cin>>n>>a>>b;
for(int i=0;i<=n;i++)
for(int j=0;j<=i;j++)
{
if(i==j or j==0)
C[i][j]=1;
else
C[i][j]=C[i-1][j]+C[i-1][j-1];
}
for(int i=0;i<n;i++)
cin>>v[i],cnt[v[i]]++;
sort(v,v+n,greater<ll>());
ld mean=0,sum=0;
for(int i=0;i<a;i++)
{
sum+=v[i];
f[v[i]]++;
}
mean=sum/a;
ll res=0;
n=cnt[v[a-1]];
int r=f[v[a-1]];
if(r==a)
{
for(int i=a;i<=b;i++)
res+=C[n][i];
}
else
res+=C[n][r];
cout<<setprecision(20)<<fixed<<mean<<"\n"<<res<<"\n";
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, st, en, x1, x2, ans, d[55], s[55];
ll f(ll p1, ll q1, ll p2, ll q2) {
if (q1 * p2 < q2 * p1) return 1;
else if (q1 * p2 == q2 * p1) return 2;
else return 3;
}
int main()
{
ll i, j, a;
cin >> n >> st >> en;
s[0] = 1;
for (i = 1; i <= n; i++) {
scanf("%lld", &a);
for (j = i; j >= 1; j--) {
if (d[j - 1] + a > d[j]) s[j] = s[j - 1];
else if (d[j - 1] + a == d[j]) s[j] += s[j - 1];
d[j] = max(d[j], d[j - 1]+ a);
}
}
x1 = st;
x2 = d[st];
ans = s[st];
for (i = st + 1; i <= en; i++) {
ll t= f(x1, x2, i, d[i]);
if (t == 1) {
x1 = i;
x2 = d[i];
ans = s[i];
} else if (t == 2) ans += s[i];
}
printf("%.10f\n%lld", (double)x2 / x1, ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=x;i<=y;i++)
long long C[100][100];
int n,a,b;
long long f[100];
int cmp(long long a,long long b)
{
return a>b;
}
int main()
{
C[0][0]=1;
rep(i,1,50) rep(j,0,i) C[i][j]=C[i-1][j-1]+C[i-1][j];
scanf("%d%d%d",&n,&a,&b);
rep(i,1,n) cin>>f[i];
sort(f+1,f+n+1,cmp);
long long ans=0;
rep(i,1,a) ans+=f[i];
long double pp=ans;
pp/=a;
printf("%.8Lf\n",pp);
int x=0,y=0;
rep(i,1,n) if (f[i]==f[a]) y++;
rep(i,1,a) if (f[i]==f[a]) x++;
ans=0;
if (x!=a) ans+=C[y][x]; else rep(i,x,b) ans+=C[y][i];
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
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 ans = 0;
for (int i = 0; i < A; i++) ans += v[i];
cout << setprecision(30) << (double)ans / A << endl;
ll comb[51][51] = {};
for (int i = 1; i <= 50; i++) {
comb[i][0] = comb[i][i] = 1;
for (int j = 1; j <= i - 1; j++) {
comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];
}
}
int cnt = 0, x = -1;
for (int i = 0; i < N; i++) {
if (v[i] == v[A - 1]) {
cnt++;
if (x == -1) x = i;
}
}
ll ans2 = comb[cnt][A - x];
if (v[0] == v[A - 1]) {
for (int i = A; i < B; i++) {
if (v[i] != v[A - 1]) continue;
ans2 += comb[cnt][i - x + 1];
}
}
cout << ans2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int64_t binomial(int64_t N, int64_t 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(){
int N,A,B;
cin>>N>>A>>B;
vector<int64_t> v(N);
for(int i=0;i<N;++i) cin>>v[i];
sort(v.begin(),v.end(),greater<int64_t>());
double av=0;
for(int i=0;i<A;++i) av += v[i];
av /= A;
cout<<fixed<<setprecision(10);
cout<<av<<endl;
int n=0,m=0;
for(int i=0;i<N;++i){
if(v[i]==v[A-1]){
++n;
if(i<A) ++m;
}
}
int64_t ans=0;
ans += binomial(n,m);
if(m==A){
for(int i=A+1;i<=B;++i) ans += binomial(n,i);
}
cout<<ans<<endl;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
int n,L,R,a[55],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];
}
}
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++;//1~L中临界值数个数
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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
//library----------------------------------------------
#define NMAX 50
ll comb(int n,int k){
ll ans = 1;
Rep(i,1,k+1){
ans*=n-i+1;
ans/=i;
}
return ans;
}
int main(){
int N,A,B; cin>>N>>A>>B;
ll v[NMAX];
rep(i,N) cin>>v[i];
sort(v,v+N,greater<ll>());
double ave = 0.0;
rep(i,A) ave += v[i];
ave /= A;
printf("%.10f\n",ave);
ll ans = 0LL;
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(int i=A; i<=(x?A:B); i++){
ans += comb(y-x+1,i-x);
}
printf("%lld",ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n, a, b;
vector<ll> v;
ll comb(ll n, ll m){
ll ret = 1;
for(ll i=1;i<=m;i++) ret = ret * (n-m+i) / i;
return ret;
}
int main(void){
cin >> n >> a >> b;
for(int i=0;i<n;i++) {ll tmp; cin >> tmp; v.push_back(-tmp);}
sort(v.begin(), v.end());
ll thesum = 0;
for(int i=0;i<a;i++) thesum += (-v[i]);
printf("%.7f\n",((double)(thesum)) / a);
ll ans = 0;
if (v[0]==v[a-1]){
int i;
for(i=a-1;i<n;i++) if (v[0] != v[i]) break;
ll m = i;
for(ll i=a;i<=min(m,b);i++) ans += comb(m,i);
}else{
int mi, ma;
for(mi=0;mi<n;mi++) if (v[mi]==v[a-1]) break;
for(ma=a-1;ma<n;ma++) if (v[ma]!=v[a-1]) break;
ll m = ma - mi;
ans += comb(m, a-mi);
}
cout << ans << 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()
{
long long n, a, b, num = 0, k = 0, ans = 0;
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;
for (int i = 0; i < n; i++)
{
if (v[i] == v[a - 1])
{
num++;
if (i < a) k++;
}
}
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;
long long nCk(int n,int k){
long long r=1;
for(int i=1;i<=k;++i){
r*=n+1-i;
r/=i;
}
return r;
}
int N,A,B,l,r;
long long v[50],p;
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)p+=nCk(r-l+1,i-l);
printf("%.15f\n%lld",s/A,p);
}
|
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
ll v[55];
ll ans=0;//必须开long long，否则在极限情况下会数据超限
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<iostream>
#include<vector>
#include <algorithm>
#include <string>
#include <utility>
#include <set>
#include <map>
#include<cmath>
#include <queue>
#include <numeric>
using lli = long long int;
int inf = 1000000007;
using namespace std;
int N, A, B;
lli nCr(lli n, lli r) {
lli a = 1, b = 1;
for (lli i = 0; i < r; i++) {
a *= (n - i);
b *= (i + 1);
if (a % b == 0) { a /= b; b = 1; }
}
return a / b;
}
int main()
{
cin >> N >> A >> B;
vector<lli> v(N);
for (int i = 0; i < N; i++)cin >> v[i];
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
lli sum = 0;
for (int i = 0; i < A; i++)sum += v[i];
lli ans = 0;
lli n = count(v.begin(), v.end(), v[A - 1]);
//全部同じときはA-B個ok
if (v[0] == v[A - 1]) {
for (lli i = A; i <= B && i <= n; i++) ans += nCr(n, i);
}
else {
int c = 0;
while (v[c] != v[A - 1])c++;
ans = nCr(n, A - c);
}
printf("%f\n", sum / (A + .0));
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
#define rep(i, m, n) for (int i = m; i < n; ++i)
int64_t nCk(int N, int K) {
if(K < 0 || N < K) return 0;
int64_t ret = 1;
for(int i = 1; i <= K; ++i) {
ret *= N--;
ret /= i;
}
return ret;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<double> v(N);
rep(i, 0, N) cin >> v[i];
sort(v.begin(), v.end(), greater<double>());
double sum = 0;
rep(i, 0, A) sum += v[i];
int X = 0;
rep(i, 0, N) if(v[i] == v[A - 1]) X++;
int64 ans = 0;
if(v[0] == v[A - 1]) {
rep(i, A, B + 1) ans += nCk(X, i);
} else {
int Y = 0;
rep(i, 0, A) if(v[A - 1] == v[i]) Y++;
ans = nCk(X, Y);
}
printf("%.10lf\n", sum / A);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int 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()
{
cin>>N>>A>>B;
{
init();
for(int i=0;i<N;i++)
cin>>value[i];
sort(value,value+N,comp);
// reverse(value,value+N);//大->小
double sum=0;
for(int i=0;i<A;i++)
sum+=value[i];
sum/=A;
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);
cout<<ans<<endl;
}
return 0;
} |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
LL v[50];
LL comb[51][51];
int main() {
comb[0][0] = 1;
for (int i = 1; i <= 50; 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];
}
}
int N, A, B;
cin >> N >> A >> B;
rep(i, N) cin >> v[i];
sort(v, v + N);
LL sum = 0;
rep(i, A) sum += v[N - 1 - i];
printf("%.15lf\n", (double)sum / A);
int cnt = 0;
rep(i, N) if (v[i] == v[N - A]) cnt++;
LL ans = 0;
if (v[N - A] == v[N - 1]) {
for (int i = A; i <= B; i++) ans += comb[cnt][i];
}
else {
int cnt2 = 0;
rep(i, A) if (v[N - 1 - i] == v[N - A]) cnt2++;
ans += comb[cnt][cnt2];
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,L,R,a[55],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];
}
}
signed main(){
init();
cin>>n>>L>>R;
for(int i=1;i<=n;i++) cin>>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 <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
int main(){
int n,a,b;
cin>>n>>a>>b;
vector<ll> v(n);
for(auto&i:v)cin>>i;
sort(rall(v));
ll aval=-1, ax=1;
ll anum=0, c[51][51];
rep(i,n+1)rep(j,i+1) if(!j or j==i){
c[i][j]=1;
}else c[i][j]=c[i-1][j-1]+c[i-1][j];
for(int i=a;i<=b;i++){
ll val=0;
int w=0;
for(int j=0;j<i;j++){
val+=v[j];
w++;
if(j and v[j]!=v[j-1]) w=1;
}
if(val*ax>aval*i){
aval=val;
anum=0;
ax=i;
}
if(val*ax==aval*i) {
int x=count(all(v),v[i-1]);
anum+=c[x][w];
}
}
cout<<fixed<<setprecision(7)<<(double)aval/ax<<endl;
cout<<anum<<endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.