text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
long l=s.length(),pat=l*(l-1)/2+1,res=0,c;
map<int,int> m;
for(int i=0;i<l;++i)m[s[i]]++;
for(auto itr=m.begin();itr!=m.end();itr++){
c=(*itr).second;
res+=c*(c-1)/2;
}
cout<<pat-res<<endl;
return 0;
} |
#include <iostream>
#include<cstring>
using namespace std;
char s[200005];
int vc[28];
int main()
{
char c;
long long sm=1;
int n=1;
cin>>(s+1);
while(s[n]!=0)
{
vc[s[n]-'a']++;
sm+=n-vc[s[n]-'a'];
n++;
}
cout<<sm;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
string A;
long long C[26] = {}, ans;
cin >> A;
ans = A.size() * (A.size() - 1) / 2;
for (int i = 0; i < A.size(); i++) {
C[A[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
ans -= C[i] * (C[i] - 1) / 2;
}
cout << ans + 1;
} |
#include<iostream>
using namespace std;
int main(){
char a[222222];
long i,c[1000],ans=0;
cin>>a;
for(i=0;i<1000;i++)
c[i]=0;
for(i=0;a[i]!='\0';i++){
ans-=c[a[i]];
c[a[i]]++;
}
ans+=i*(i-1)/2+1;
cout<<ans<<endl;
} |
#include<cstdio>
#include<cstring>
using namespace std;
long long n,ans,sum[26];
char a[200005];
int main()
{
scanf("%s",a+1);n=strlen(a+1);
ans=n*(n+1)/2;
for(int i=1;i<=n;++i) sum[a[i]-'a']++;
for(int i=0;i!=26;++i) ans-=sum[i]*(sum[i]+1)/2;
printf("%lld",ans+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
map<char, int> c;
string s; cin >> s;
long long ans = 0;
for(auto v : s){
for(auto e : c) if(e.first != v) ans += e.second;
c[v]++;
}
cout << 1+ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int n = s.size();
long long ans = n*(n+1LL)/2+1;
for(char c='a'; c<='z'; c++){
int cnt = count(s.begin() ,s.end() ,c);
ans -= cnt*(cnt+1LL)/2;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int ap[26];
int32_t main() {
string s;
cin >> s;
long long ans = 0;
for(int i = 0; i < s.size(); ++i)
{
++ap[s[i] - 'a'];
ans += (i + 1) - ap[s[i] - 'a'];
}
cout << ans + 1;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
map<char,int> mp;
long long ans = 0;
for(int i=0;i<S.size();i++){
ans += i - mp[S[i]];
mp[S[i]]++;
}
cout << ans + 1 << endl;
} |
#include <cstdio>
#pragma warning(disable : 4996)
int c[29]; long long ret; char s[200009];
int main() {
scanf("%s", s);
for (int i = 0; s[i]; i++) ret -= c[s[i] - 97], c[s[i] - 97]++, ret += i;
printf("%lld\n", ret + 1);
return 0;
} |
#include <iostream>
using namespace std;
int const nmax = 200000;
int frec[30];
char line[5 + nmax];
int main()
{
char c;
long long sum = 1;
int n = 1;
cin>>(line + 1);
while(line[n] != 0){
frec[line[n] - 'a']++;
sum += n - frec[line[n] - 'a'];
n++;
}
cout<<sum;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long cnt[1233],ans;
int main(){
string s; cin>>s;
for(char c:s)++cnt[c];
ans=s.size()*1ll*(s.size()-1)/2;
for(int i=0;i<333;++i)ans-=cnt[i]*1ll*(cnt[i]-1)/2;
cout<<ans+1<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int A[26];
int main(){
long long n,sum;
string s;
cin >> s;
n=s.size();
sum=1ll*n*(n-1)/2;
for(int i=0;i<n;i++){
A[s[i]-'a']++;
}
for(int i=0;i<26;i++){
sum-=1ll*A[i]*(A[i]-1)/2;
}
cout << sum+1 << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
ll ans,cnt[30];
char s[200010];
int main()
{
scanf("%s",s);
ll len=strlen(s);
ans=(len-1)*len/2+1;
for(int i=0;i<len;i++) cnt[s[i]-'a']++;
for(int i=0;i<26;i++) ans-=cnt[i]*(cnt[i]-1)/2;
printf("%lld",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 = (int) strlen(s);
long long ans = 0;
for (int i = 0; i < n; ++ i) {
ans += i - cnt[s[i] - 'a'];
cnt[s[i] - 'a'] ++;
}
cout << ans + 1 << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
long long num[30];
int main()
{
long long i,j,ans=0;
string s;
cin >> s;
for(i=0;i<s.size();i++)
num[s[i]-'a']++;
for(i=0;i<s.size();i++)
for(num[s[i]-'a']--,j=0;j<26;j++)
if(j!=s[i]-'a') ans+=num[j];
printf("%lld\n",ans+1);
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long ans;
string s;
cin >> s;
ans=s.size()*(s.size()+1)/2+1;
vector<long> c(26);
for(long i=0;i<s.size();i++) c[s[i]-'a']++;
for(long i=0;i<26;i++) ans-=c[i]*(c[i]+1)/2;
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S; cin>>S;
int N=S.size();
long long ans=(S.size()*(S.size()-1))/2;
vector<long long>al(26);
for(int i=0;i<N;i++)al[S[i]-97]++;
for(int i=0;i<26;i++)ans-=al[i]*(al[i]-1)/2;
cout<<ans+1<<endl;
} |
#include <iostream>
#include <cstdio>
using namespace std;
long long n, ans, c[150];
string a;
int main()
{
int i;
cin >> a;
n = a.size();
for (i = 0; i < n; i++) c[a[i]]++;
ans = n * (n - 1) / 2 + 1;
for (i = 'a'; i <= 'z'; i++) ans -= c[i] * (c[i] - 1) / 2;
cout << ans << endl;
return 0;
} |
#include <iostream>
using namespace std;
int cnt[26];
long long f(long long x)
{
return x*(x+1)/2;
}
int main()
{
string s;
cin >> s;
long long ans=f(s.size());
for (char c:s)
cnt[c-'a']++;
for (int i=0;i<26;i++)
ans-=f(cnt[i]);
cout << ans+1;
} |
#include<bits/stdc++.h>
char s0[200007];
int t[417];
int main(){
scanf("%s",s0+1);
int n=strlen(s0+1);
long long ans=1ll*n*(n+1)/2+1;
for(int i=1;i<=n;++i)++t[s0[i]-'a'];
for(int i=0;i<26;++i)ans-=1ll*t[i]*(t[i]+1)/2;
printf("%lld\n",ans);
return 0;
} |
#include <iostream>
using namespace std;
string a;
long long s, c[30];
int main() {
int i;
cin>>a;
for(i=0; a[i]; i++) c[a[i]-97]++;
s = a.size();
s = s * (s-1) / 2;
for(i=0; i<26; i++) s -= c[i] * (c[i]-1) / 2;
cout<<s+1;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn=200009;
int c[29];
long long ret;
char s[maxn];
int main()
{
cin>>s;
for(int i=0;s[i];i++)
{
ret-=c[s[i]-97];
c[s[i]-97]++;
ret+=i;
}
cout<<ret+1<<endl;
return 0;
} |
#include<cstdio>
#include<cstring>
const int N=200005;
int n,cnt[26];
char a[N];
int main(){
scanf("%s",a+1);
n=strlen(a+1);
long long ans=n*(n-1ll)/2;
for(int i=1;i<=n;i++)cnt[a[i]-'a']++;
for(int i=0;i<26;i++)ans-=cnt[i]*(cnt[i]-1ll)/2;
printf("%lld\n",ans+1);
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
string S; long long N, r, c[29];
int main() {
cin >> S;
N = S.size();
for (int i = 0; i < N; i++) c[S[i] - 'a']++;
r = N * (N - 1) / 2LL;
for (int i = 0; i < 26; i++) r -= c[i] * (c[i] - 1LL) / 2LL;
cout << r + 1LL << endl;
return 0;
} |
#include <iostream>
#include <string.h>
using namespace std;
char c[200001];
long tmp,a[27],all,ans,longs;
int main()
{
cin>>c;
longs=strlen(c);
for(int i=0;i<longs;i++)
{
tmp=c[i]-'a';
ans+=all-a[tmp];
all++,a[tmp]++;
}
cout << ans+1<<"\n";
} |
#include<bits/stdc++.h>
using namespace std;
set<string> st;
long long frek[203];
int main()
{
string a,s;
long long i,j,z=0;
cin>>a;
z=1;
for(i=0;i<a.length();++i)
{
frek[a[i]]++;
z+=i-frek[a[i]]+1;
}
cout<<z<<endl;
}
|
#include<cstdio>
#include<cstring>
using namespace std;
long long l,ans,sum[200001]['z'+1];
char s[200001];
int main()
{
scanf("%s",s);
l=strlen(s);
for (int i=l-1;i;i--)
for (char j='a';j<='z';j++)sum[i][j]=sum[i+1][j]+(s[i]==j);
for (int i=0;i<l;i++)ans+=l-1-i-sum[i+1][s[i]];
printf("%lld\n",++ans);
} |
#include<bits/stdc++.h>
#define neko 200010
#define f(i,a,b) for(register int i=(a);i<=(b);i=-(~i))
int cnt[30],len;
typedef long long ll;
ll ans=1;
char s[neko];
int main()
{
scanf("%s",s),len=strlen(s)-1;
f(i,0,len)ans+=i-cnt[s[i]-'a'],++cnt[s[i]-'a'];
return printf("%lld\n",ans),0;
} |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
string A;
cin >> A;
map<char, LL> cnt;
for(auto& i: A) ++cnt[i];
LL N = A.size();
auto res = 1 + N * (N - 1) / 2;
for(auto i: cnt) res -= i.second * (i.second - 1) / 2;
cout << res << endl;
}
|
#include <iostream>
#include <map>
using namespace std;
int main() {
string a;
cin >> a;
map<char, int> count;
long long result = 1;
for (int i = 0; i < a.size(); i++) {
auto current = count[a[i]]++;
result += i - current;
}
cout << result;
return 0;
} |
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int num[27];char c[300100];
long long ans=0;
int main()
{
scanf("%s",c+1);int n=strlen(c+1);
for(int i=n;i>=1;i--)ans+=(n-i)-num[c[i]-'a']++;
printf("%lld",ans+1);return 0;
} |
#include<bits/stdc++.h>
char str[200005];
int num[40],n;
long long ans;
int main(){
scanf("%s",str+1); n=strlen(str+1);
for(int i=n;i>=1;--i) ans+=(n-i)-num[str[i]-'a']++;
printf("%lld",ans+1);
return 0;
} |
#include<cstdio>
#include<iostream>
#include<cstring>
#define ll long long
using namespace std;
ll ans;
int len;
char ch[202020];
int doe[33];
int main()
{
scanf("%s",ch+1);
len=strlen(ch+1);
for (int i=1;i<=len;++i)
{
++doe[ch[i]-'a'];
ans+=(i-doe[ch[i]-'a']);
}
printf("%lld\n",ans+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string A;
cin >> A;
vector<ll> cs(26);
ll n = A.size();
for (char c : A)
cs[c - 'a']++;
ll res = n * (n - 1) / 2 + 1;
for (ll x : cs) {
res -= x * (x - 1) / 2;
}
cout << res << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL ans,cnt[28];
string str;
int main(){
cin>>str;
for (LL i=0;str[i];i++) ans+=i-cnt[str[i]-'a']++;
printf("%lld",ans+1);
return 0;
} |
#include <iostream>
using namespace std;
long pos[26];
int main() {
string s; cin >> s;
long n = s.size();
long ans = n * (n - 1) / 2 + 1;
for(int i = 0; i < n; ++i) ++pos[s[i]-'a'];
for(int i = 0; i < 26; ++i) ans -= pos[i] * (pos[i] - 1) / 2;
cout << ans;
return 0;
} |
#include<cstdio>
#include<cstring>
const int N=200005;
typedef long long ll;
int n;
ll cnt[26];
char s[N];
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++)
cnt[s[i]-'a']++;
ll ans=1ll*n*(n-1)/2+1;
for(int i=0;i<26;i++)
ans-=cnt[i]*(cnt[i]-1)/2;
printf("%lld\n",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
int n,A[100];
char s[201000];
int main(){
scanf("%s",s+1);
n=strlen(s+1);
long long ans=1ll*n*(n-1)/2;
for(int i=1;i<=n;++i)A[s[i]-97]++;
for(int i=0;i<26;++i)ans-=1ll*A[i]*(A[i]-1)/2;
printf("%lld",ans+1);
} |
#include <bits/stdc++.h>
using namespace std;
int i, n, cnt[1000]; string a;
long long ans = 0;
int main()
{
cin >> a;
for(i=0; i<a.size(); ++i)
{
ans += i - cnt[a[i]];
++cnt[a[i]];
}
cout << ans + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<long long> a(30, 0);
long long ans = (long long)n*(n+1)/2;
for (auto c : s) ++a[c-'a'];
for (auto c : a) ans -= c*(c+1)/2;
cout << ++ans << endl;
return 0;
} |
#include<iostream>
#include<string.h>
using namespace std;
int main(){
char s[200020];
cin>>s;
long long int ar[26]={0},l = strlen(s);
for(int i=0;i<l;i++) ar[s[i]-'a']++;
long long int ans = l*(l-1)/2;
for(int i=0;i<26;i++){
ans -= ar[i]*(ar[i]-1)/2;
}
cout<<ans+1;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
char s[N];int n,cnt[210];
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
long long ans=1ll*n*(n+1)/2+1;
for (int i=1;i<=n;i++) cnt[s[i]-'a']++;
for (int i=0;i<26;i++) ans-=1ll*cnt[i]*(cnt[i]+1)/2;
printf("%lld\n",ans);
return 0;
} |
#include <cstdio>
int c[29]; long long ret; char s[200009];
int main() {
scanf("%s", s);
for (int i = 0; s[i]; i++) ret -= c[s[i] - 97], c[s[i] - 97]++, ret += i;
printf("%lld\n", ret + 1);
} |
#include <cstdio>
#include <cstring>
using namespace std;
const int N=2000010;
char s[N];
int a[N];
int main(){
scanf("%s",s);
int n=strlen(s);
long long mmh=1LL*n*(n+1)/2;
for (int i=0;i<n;i++){
a[s[i]]++;
mmh-=a[s[i]];
}
printf("%lld\n",mmh+1);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
char S[200005];
int C[26];
int main() {
scanf("%s", S);
ll ans = 1;
int len = strlen(S);
for (int i = 0; i < len; ++i) {
ans += i - C[S[i] - 'a'];
++C[S[i] - 'a'];
}
printf("%lld\n", ans);
}
|
#include<bits/stdc++.h>
using namespace std;
string A;
int len,cnt[30];
long long Ans;
int main()
{
cin>>A;
len=A.length();
Ans=1ll*(len-1)*len/2;
for(int i=0;i<len;i++)cnt[A[i]-'a']++;
for(int i=0;i<26;i++)
{
Ans-=1ll*(cnt[i]-1)*cnt[i]/2;
}
cout<<Ans+1;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
char s[N];
int num[100];
int main(){
scanf("%s", s);
int n = strlen(s);
long long ans = 1;
for (int i = 0; i < n; i++){
ans += i - num[s[i] - 'a'];
num[s[i] - 'a']++;
}
printf("%lld", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
ll ret;
ll num[26];
int main() {
cin >> s;
for(int i=0;i<s.size();i++)
num[s[i]-'a']++;
for(int i=0;i<26;i++)
ret += num[i] * (s.size() - num[i]);
cout << ret / 2 + 1 << endl;
return 0;
} |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
char ch[210000];
int A[30];
int main(){
scanf("%s",ch+1); int n=strlen(ch+1); long long ans=1;
for (int i=1;i<=n;i++){
ans+=i-1-A[ch[i]-'a']; A[ch[i]-'a']++;
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
static char s[200010];
scanf("%s",s);
int n=strlen(s);
int c[26]={0};
long long ans=1;
for(int i=0;i<n;i++){
ans+=i-c[s[i]-'a'];
c[s[i]-'a']++;
}
printf("%lld\n",ans);
return 0;
}
|
#include<cstring>
#include<cstdio>
using namespace std;
int n,kk[27];char s[200005];long long ans;
int main()
{
scanf("%s",s);n=strlen(s);
for(int i=n-1;i>=0;i--){ans+=(n-i-1)-kk[s[i]-'a']++;}
printf("%lld",ans+1);
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll cnt[30];
int main(){
string s;
cin>>s;
ll n=s.size();
for(int i=0;i<n;i++){
cnt[s[i]-'a']++;
}
ll ans=n*(n-1)/2+1;
for(int i=0;i<26;i++)ans-=cnt[i]*(cnt[i]-1)/2;
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long N = S.size();
map<char, long> MA;
for (long i = 0; i < N; i++) {
MA[S.at(i)]++;
}
long ans = 0;
for (long i = 0; i < N; i++) {
ans += N - MA[S.at(i)];
}
cout << ans / 2 + 1 << "\n";
} |
#include<cstdio>
#include<cstring>
#include<iostream>
typedef long long ll;
char a[2000010];
ll cnt[26];
int main(){
scanf("%s",a);
ll len=strlen(a),ans=len*(len-1)/2ll+1ll;
for(int i=0;i<len;i++)cnt[a[i]-'a']++;
for(int i=0;i<26;i++)ans-=cnt[i]*(cnt[i]-1ll)/2ll;
std::cout<<ans<<std::endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
string s;
int fr[26];
int main() {
int st, dr, cent;
long long rez;
cin >> s;
rez = (long long)s.size() * (s.size() + 1) / 2;
for(int i = 0; i < s.size(); ++i) {
fr[s[i] - 'a']++;
rez -= fr[s[i] - 'a'];
}
cout << rez + 1;
return 0;
}
|
#include <cstdio>
typedef long long int lli;
lli cnt[26];
char s[200002];
int main()
{
scanf("%s", s);
lli i = 0;
while (s[i] != '\0') {
cnt[s[i] - 'a']++;
i++;
}
lli ans = 1 + i * (i - 1) / 2;
for (int j = 0; j < 26; j++) {
ans -= cnt[j] * (cnt[j] - 1) / 2;
}
printf("%lld\n", ans);
} |
#include <cstring>
#include <iostream>
using namespace std;
char s[200005];
long long t[35];
int main()
{
cin>>s;
long long n=strlen(s);
long long ans=1+n*(n-1)/2;
for(int i=0;i<n;i++)
t[s[i]-'a']++;
for(int i=0;i<26;i++)
ans-=t[i]*(t[i]-1)/2;
cout<<ans<<endl;
return 0;
} |
#include <algorithm>
#include <cstdio>
#include <cstring>
const int N = 200050;
typedef long long LL;
char s[N];
int oc[26];
int main() {
scanf("%s", s);
int n;
LL ans = 0;
for (n = 0; s[n]; ++n)
ans += (++oc[s[n] - 'a']);
printf("%lld\n", (LL)n * (n + 1) / 2 - ans + 1);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string A;
cin>>A;
long long n = A.length();
map<char, long long> cnt;
for (int i=0; i<n; i++)
cnt[A[i]]++;
long long ans = n*(n+1)/2 + 1;
for (auto p: cnt)
ans -= p.second*(p.second+1)/2;
cout<<ans;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll ans=1;
char s[200005];
int t[27];
int main (){
scanf ("%s",s+1);
int len=strlen(s+1),i;
for (i=len;i>=1;i--)
{ans+=(len-i-t[s[i]-'a']);
t[s[i]-'a']++;
}
printf ("%lld\n",ans);
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long n,i,j,sol,cnt[27];
char s[200005];
int main()
{
cin>>s;
n=strlen(s);
for(i=0;i<n;i++) cnt[s[i]-'a']++;
sol=1+((n*(n+1))/2);
for(i=0;i<26;i++) sol-=(cnt[i]*(cnt[i]+1))/2;
cout<<sol<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char ch[200010];
int p[30];
long long ans;
int main()
{
scanf("%s",ch+1);
for(int i=1;i<=strlen(ch+1);i++){
p[ch[i]-'a']++;
ans+=i-p[ch[i]-'a'];
}
printf("%lld\n",ans+1);
return 0;
} |
#include <string>
#include <iostream>
using namespace std;
string s; int c[26];
int main() {
cin >> s;
for (char i : s) c[i - 97]++;
long long ret = 1LL * s.size() * (s.size() - 1) / 2 + 1;
for (int i = 0; i < 26; i++) ret -= 1LL * c[i] * (c[i] - 1) / 2;
cout << ret << endl;
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int ch[26];
int main() {
string A; cin >> A;
for(int i=0; i<A.size(); ++i) ++ch[A[i]-'a'];
long ans=(long) 1+A.size()*(A.size()-1)/2;
for(int i=0; i<26; ++i) ans -= (long) ch[i]*(ch[i]-1)/2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int cnt[26];
int main() {
cin >> s;
long long ans = 1;
for (char c : s) {
for (int i = 0; i < 26; i++) {
if (c ^ (i + 'a')) ans += cnt[i];
}
cnt[c - 'a']++;
}
cout << ans << endl;
return 0;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
long long num[26],tot,ans;
int main(){
string a;
cin>>a; ans=1;
for(int i=0;i<a.size();i++){
ans+=tot-num[a[i]-'a'];
num[a[i]-'a']++; tot++;
}
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <map>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
long long ans = 1;
map < char, int > cnt;
for (int i = n - 1; i >= 0; i--) {
cnt[s[i]]++;
ans += i + 1;
ans -= cnt[s[i]];
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, cnt[26];
string s;
int main(){
cin >> s; N = s.size();
for(char c : s) cnt[c-'a']++;
ll ans = N * (N-1) / 2 + 1;
for(ll d : cnt) ans -= d * (d-1) / 2;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MN 200005
char c[MN];
int n,num[26];
long long ans;
int main(){
scanf("%s",c+1);
n=strlen(c+1);
for(int i=n;i>=1;i--) ans+=(n-i)-num[c[i]-'a']++;
ans++;
printf("%lld",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long long cnt[26];
int main() {
string a; cin >> a;
long long n=a.size();
for(int i=0;i<n;++i)
++cnt[a[i]-'a'];
long long ans=n*(n-1)/2+1;
for(int i=0;i<26;++i)
ans-=cnt[i]*(cnt[i]-1)/2;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[255],ans;
char s[205050];
int main(){
scanf("%s",s);
ans = 0;
for (LL i=0;s[i];i++) {
ans+=i-a[s[i]];
a[s[i]]++;
}
printf("%lld\n",ans+1);
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
ll ans = 0;
vector<int> v(26,0);
for(auto c:s)
{
//cout<<c-'a'<<endl;
v[c-'a']++;
for(int i = 0;i<26;i++)
{
if(i+'a'==c)continue;
ans += v[i];
}
//cout<<ans<<endl;
}
cout<<ans+1<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
ll cnt[26];
void solve()
{
const int n = s.length();
ll ans = 1LL*n*(n-1)/2;
for(int i=0;i<n;++i){
ans -= cnt[s[i]-'a'];
cnt[s[i]-'a']++;
}
cout << ans+1 << '\n';
}
int main()
{
cin >> s;
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e1+10;
string s;
int a[N];
int main()
{
cin>>s;
ll ans=s.length();
ans=(ans+1)*ans/2+1;
for(int i=0;i<s.length();i++)
ans-=++a[s[i]-'a'];
cout<<ans;
return 0;
}
|
#include<iostream>
std::string s;
long long a,x[26],i,j;
int main(){
for(std::cin>>s;i<s.size();)x[s[i++]-'a']++;
for(;j<s.size();x[s[j++]-'a']--)a+=s.size()-j-x[s[j]-'a'];
std::cout<<a+1<<'\n';
}
|
#include<bits/stdc++.h>
using namespace std;
long long ans,len;
int c[30];
string s;
int main(){
cin>>s;
len=s.length();
ans=len*(len-1)/2;
for(int i=0;i<len;i++) c[s[i]-'a']++;
for(int i=0;i<26;i++) ans-=1ll*c[i]*(c[i]-1)/2;
ans++;
printf("%lld",ans);
} |
#include<iostream>
#include<string>
#define ll long long
using namespace std;
ll cnt[30];
int main(){
string s;
cin>>s;
ll l=s.size();
ll ans=l*(l-1);
for(int i=0;i<l;i++) cnt[s[i]-'a']++;
for(int i=0;i<26;i++) ans-=cnt[i]*(cnt[i]-1);
cout<<ans/2+1<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;cin>>s;
map<char,ll> mp;
ll ans=0;
for(ll i=0;i<s.size();i++){
ans+=i-mp[s[i]];
mp[s[i]]++;
}
cout<<ans+1<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
map<char, long long> memo;
int main(){
string S;
cin >> S;
for(int i = 0; i < S.size(); i++){
memo[S[i]]++;
}
long long ans = S.size() * (S.size() - 1)/2 + 1;
for(auto me: memo){
ans -= me.second * (me.second - 1)/2;
}
cout << ans << endl;
}
|
#include<cstdio>
char c[200005];
int n;
long long ans,t[26];
int main()
{
scanf("%s",c);
for(int i=0;c[i]!='\0';++i)++n,t[c[i]-'a']++;
for(int i=0;i<26;++i)ans+=t[i]*(n-t[i]);
printf("%lld\n",ans/2+1);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
int f[26];
int main(){
string s;
cin>>s;
int n=s.size();
uli ans=1;
for(int i=0;i<n;i++){
ans+=i-f[s[i]-'a'];
f[s[i]-'a']++;
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int64_t a[26]{};
for(char c:s) a[c - 'a']++;
int64_t n = s.size(), ans = n * (n - 1) / 2 + 1;
for(int i = 0; i < 26; i++){
ans -= a[i] * (a[i] - 1) / 2;
}
cout << ans << endl;
} |
#include<iostream>
#include<cstring>
using namespace std;
int n, i;
long long sol;
int ff[200];
char s[200005];
int main(){
cin>> s + 1;
n = strlen(s + 1);
sol = 1;
for(i = 1; i <= n; i++){
ff[ s[i] ]++;
sol += i - ff[ s[i] ];
}
cout<< sol;
}
|
#include<iostream>
#include<cstring>
#include<set>
#define ll long long
using namespace std;
string s,temp,y;
ll len,ans,cnt[30],sum;
int main()
{
cin>>s,len=s.length();
ans=len*(len-1)/2,s=" "+s;
for(int i=1;i<=len;i++) sum+=cnt[s[i]-'a'+1],cnt[s[i]-'a'+1]++;
printf("%lld\n",ans-sum+1);
return 0;
} |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
string S;
cin>>S;
int ans=(int)(S.size())*((int)(S.size())-1)/2+1;
vector<int> A(26);
for(char c:S){
ans-=A[c-'a'];
A[c-'a']++;
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
string s;
cin>>s;
ll ans = 1, cnt[256]={};
for(int i=0;i<s.size();i++){
ans += i - cnt[s[i]];
cnt[s[i]]++;
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,i,ans,cnt[200010];
char s[200010];
int main(){
scanf("%s",s+1);
n=strlen(s+1);
for(i=1;i<=n;i++){
cnt[s[i]-'a']++;
}
for(i=0;i<26;i++)ans+=cnt[i]*(cnt[i]-1)/2;
ans=n*(n-1)/2+1-ans;
printf("%lld",ans);
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
string s;
cin>>s;
int N=s.size();
int ans=N*(N-1)/2+1;
std::vector<int> v(26,0);
for(int i=0;i<N;i++)v[s[i]-'a']++;
for(int i=0;i<26;i++)ans-=v[i]*(v[i]-1)/2;
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
string a;
long long s=1, c[30];
int main() {
cin>>a;
for(int i=0; a[i]; i++) s += i - c[a[i]-97]++;
cout<<s;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf=1e12;
string s;
int h[26];
int main(){
cin>>s;
ll ans=1;
for(int i=0;i<s.length();i++){
h[s[i]-'a']++;
ans+=i+1-h[s[i]-'a'];
}
cout<<ans;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int n,i,j,k,cnt[1005];
char s[200005];
long long ans;
int main()
{
scanf("%s",s+1);n=strlen(s+1);
ans=(long long)n*(n+1)/2+1;
for(i=1;i<=n;++i)ans-=++cnt[s[i]];
printf("%lld\n",ans);
} |
#include<cstdio>
#include<cstring>
using namespace std;
int m[26];char s[200005];
int main()
{
scanf("%s",s);
int n=strlen(s);
long long ans=1ll*n*(n+1)/2;
for(int i=0;i<n;++i)
++m[s[i]-'a'];
for(int i=0;i<n;++i)
ans-=(m[s[i]-'a']--);
printf("%lld\n",ans+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int64_t F[200];
string s;
int main()
{
cin>>s;
for(int i=0;i<s.size();i++)
F[s[i]]++;
int64_t res=int64_t(s.size())*int64_t(s.size()-1)/2+1;
for(int i='a';i<='z';i++)
res-=F[i]*(F[i]-1)/2;
cout<<res;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
string s;
cin >> s;
map<int,int> a;
LL n = s.size();
LL ans = n*(n-1)/2;
for(int i = 0; i < s.size(); i++){
ans -= a[s[i]-'a'];
a[s[i]-'a']++;
}
cout << ans + 1 << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
ll ans = n * 1LL * (n - 1) / 2;
unordered_map <char, int> m;
for (char z : s) {
ans -= m[z];
m[z]++;
}
ans++;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
char s[555333];
long long br[555];
int main() {
scanf("%s", s);
int n = strlen(s);
for(int i=0; i<n; i++) br[s[i]]++;
long long res = 0;
for(int i='a'; i<='z'; i++) res += br[i] * (n-br[i]);
printf("%lld\n", res/2 + 1);
return 0;
} |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
string s;
ll cnt[28];
int main(void){
cin >> s;
ll n=s.size();
ll res=1LL;
for(int i=0;i<n;i++){
res+=(ll)i-cnt[s[i]-'a'];
cnt[s[i]-'a']++;
}
printf("%lld\n",res);
return 0;
} |
#include<cstdio>
#include<cstring>
long long cnt[200];
char s[300000];
int main()
{
scanf("%s",s);
long long n=strlen(s);
for(int i=0;i<n;i++)cnt[s[i]]++;
long long tot=0;
for(int i='a';i<='z';i++)tot+=cnt[i]*(cnt[i]-1)/2;
printf("%lld\n",n*(n-1)/2-tot+1);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Nmax=200010;
int main() {
string A;
cin >> A;
ll S[26]={};
ll l=A.length();
ll ans=(l*(l-1))/2+1;
for(int i=0;i < l;i++)
S[A[i]-'a']++;
for(int i=0;i < 26;i++)
ans -= S[i]*(S[i]-1)/2;
cout << ans << endl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.