text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int N; cin >> N;
map<char, ll> cnt;
for (int i = 0; i < N; ++i) {
string s; cin >> s;
cnt[s[0]]++;
}
string P = "MMMMMMAAAR";
string Q = "AAARRCRRCC";
string R = "RCHCHHCHHH";
ll ans = 0;
for (int i = 0; i < 10; ++i) {
ans += cnt[P[i]] * cnt[Q[i]] * cnt[R[i]];
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
string M = "MARCH";
int main() {
int N;
long long cnt[5] = {};
cin >> N;
for(int i = 0; i < N; i++) {
string s;
cin >> s;
for(int j = 0; j < 5; j++) {
if(s[0] == M[j]) {
cnt[j]++;
break;
}
}
}
long long res = 0;
for(int i = 0; i < 3; i++) {
for(int j = i + 1; j < 4; j++) {
for(int k = j + 1; k < 5; k++) {
res += cnt[i] * cnt[j] * cnt[k];
}
}
}
cout << res << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
int main(){
long long int n;
cin>>n;
vector<long long int> a(5,0);
for(long long int i=0;i<n;i++){
string s;
cin>>s;
if(s[0]=='M')a[0]++;
if(s[0]=='A')a[1]++;
if(s[0]=='R')a[2]++;
if(s[0]=='C')a[3]++;
if(s[0]=='H')a[4]++;
}
long long int ans=0;
for(int i=0;i<3;i++){
for(int j=i+1;j<4;j++){
for(int k=j+1;k<5;k++)ans+=a[i]*a[j]*a[k];
}
}
cout<<ans<<endl;
}
|
#include"bits/stdc++.h"
using namespace std;
long long C[9], V[99];
long long N;
long long cnt;
char A[15];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
while(N--){
cin >> A;
V[A[0]]++;
}
C[0] = V['M'];
C[1] = V['A'];
C[2] = V['R'];
C[3] = V['C'];
C[4] = V['H'];
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++)
for (int k = j + 1; k < 5; k++) {
cnt += C[i] * C[j] * C[k];
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void){
long n,ans,a,r,c,h,m;
a = r = c = h = m = 0;
string b;
cin >> n;
for(int i = 0;i < n;i ++){
cin >> b;
if(b[0] == 'A')a ++;
else if(b[0]=='R')r ++;
else if(b[0]=='C')c ++;
else if(b[0]=='M')m ++;
else if(b[0]=='H')h ++;
}
cout << a*r*c + a*r*m + a*r*h + a*c*m + a*c*h + a*m*h + r*c*m +r*c*h + r*m*h + c*m*h << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n;
cin>>n;
string s[n];
for(int i=0;i<n;i++)
cin>>s[i];
ll m=0,a=0,r=0,c=0,h=0;
for(int i=0;i<n;i++)
{
if(s[i][0]=='M')
m++;
else if(s[i][0]=='A')
a++;
else if(s[i][0] =='R')
r++;
else if(s[i][0]=='C')
c++;
else if(s[i][0]=='H')
h++;
}
ll ways = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;
cout<<ways<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
long f(vector<long>& C, int n, int i, long acc) {
if (n == 3) return acc;
else if (acc == 0 || i == 5) return 0;
return f(C, n + 1, i + 1, acc * C[i]) + f(C, n, i + 1, acc);
}
int main() {
int N;
cin >> N;
string XX = "MARCH";
vector<long> C(XX.size(), 0);
string S;
for (int i = 0; i < N; i++) {
cin >> S;
auto tmp = XX.find(S[0]);
if (tmp != string::npos) C[tmp]++;
}
cout << f(C, 0, 0, 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll cnt[256] {};
for (int i = 0; i < n; i++) {
string s;
cin >> s;
cnt[s[0]]++;
}
string ma = "MARCH";
ll ans = 0;
for (int i = 0; i < 3; i++)
for (int j = i+1; j < 4; j++)
for (int k = j+1; k < 5; k++)
ans += cnt[ma[i]] * cnt[ma[j]] * cnt[ma[k]];
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
map<char,long long int> mp;
string s;
for(int i=0;i<n;i++){
cin >> s;
mp[s[0]]++;
}
long long int ans=0;
vector<char> v = {'M','A','R','C','H'};
for(auto u:v){
for(auto x:v){
for(auto y:v){
if(u!=x && u!=y && x!=y)ans += mp[u]*mp[x]*mp[y];
}
}
}
ans /= 6;
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mp[1000];
long long res;
int n;
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
char ch[1000];
scanf("%s", ch);
mp[ch[0]]++;
}
int P[6] = {0, 'M', 'A', 'R', 'C', 'H'};
for(int i = 1; i <= 3; i++)
for(int j = i + 1; j <= 4; j++)
for(int k = j + 1; k <= 5; k++)
res += mp[P[i]] * mp[P[j]] * mp[P[k]];
printf("%lld\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int x[5],ans;
signed main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s[0]=='M')x[0]++;
else if(s[0]=='A')x[1]++;
else if(s[0]=='R')x[2]++;
else if(s[0]=='C')x[3]++;
else if(s[0]=='H')x[4]++;
}
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
for(int k=j+1;k<5;k++){
ans+=x[i]*x[j]*x[k];
}
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
int N;cin>>N;
string s;
ll m,a,r,h,c;m=0;a=0;r=0;h=0;c=0;
for(int i=0;i<N;i++){
cin>>s;
if(s[0]=='M')m++;
if(s[0]=='A')a++;
if(s[0]=='R')r++;
if(s[0]=='C')c++;
if(s[0]=='H')h++;
}
cout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
long long s[100] = {0};
for(int i=0; i<n; i++){
string v;
cin >> v;
s[v[0]]++;
}
long long ss[5] = {s['M'], s['A'], s['R'], s['C'], s['H']};
long long ans = 0;
for(int i=0; i<3; i++){
for(int j=i+1; j<4; j++){
for(int k=j+1; k<5; k++){
ans+=ss[i] * ss[j] * ss[k];
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[6];
int main ()
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
string s;
cin >> s;
if(s[0] == 'M') a[0]++;
if(s[0] == 'A') a[1]++;
if(s[0] == 'R') a[2]++;
if(s[0] == 'C') a[3]++;
if(s[0] == 'H') a[4]++;
}
long long ans = 0;
for(int i = 0; i < 5; i++)
{
for(int j = i + 1; j < 5; j++)
{
for(int k = j + 1; k < 5; k++)
{
ans += (1LL * a[i] * a[j] * a[k]);
}
}
}
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll n;
cin >> n;
ll po[5] = {};
string s = "MARCH";
map<char, ll> m;
for(ll i = 0; i < 5; i++) m[s[i]] = i;
for(ll i = 0; i < n; i++){
string yo;
cin >> yo;
if(m.find(yo[0]) == m.end()) continue;
po[m[yo[0]]]++;
}
ll ans = 0;
for(ll i = 0; i < 5; i++)for(ll j = i + 1; j < 5; j++)for(ll k = j + 1; k < 5; k++) ans += po[i] * po[j] * po[k];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
using namespace std;
string T="MARCH";
string S;
ll N,C[5],ans;
int main(void){
cin >> N;
rep(i,N){
cin >> S;
rep(i,5)if(T[i] == S[0])C[i]++;
}
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
for(int k=j+1;k<5;k++) ans+=C[i]*C[j]*C[k];
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int64_t cnt = 0;
cin >> n;
map<char,int64_t>mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
char a = s.at(0);
mp[a]++;
}
int64_t c = mp['M'];
int64_t b = mp['A'];
int64_t e = mp['R'];
int64_t d = mp['C'];
int64_t f = mp['H'];
cnt += b*(c*d + c*e + c*f + d*e + d*f + e*f)+c*(d*e + d*f + e*f) + d*e*f;
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long M=0;
long A=0;
long R=0;
long C=0;
long H=0;
cin >>N;
for (int i=0; i<N; i++) {
string S;
cin >>S;
char s=S.at(0);
if ('M'==s)
M++;
else if ('A'==s)
A++;
else if ('R'==s)
R++;
else if ('C'==s)
C++;
else if ('H'==s)
H++;
}
long SS=0;
SS +=M*A*(R+C+H);
SS +=M*R*(C+H);
SS +=M*C*H;
SS +=A*R*(C+H);
SS +=A*C*H;
SS +=R*C*H;
cout << SS << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s[100100];
long m=0,a=0,r=0,c=0,h=0;
for (int i=0; i<n; i++){
cin >> s[i];
if(s[i][0]=='M') m++;
else if(s[i][0]=='A') a++;
else if(s[i][0]=='R') r++;
else if(s[i][0]=='C') c++;
else if(s[i][0]=='H') h++;
}
long sum=0;
sum= m*a*r+ m*a*c+ m*a*h+ m*r*c+ m*r*h+ m*c*h+ c*a*r+ h*a*r+ c*a*h+ c*h*r;
cout << sum << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin>>N;
vector<int64_t> A(5,0);
for(int i=0;i<N;i++){
string s;
cin>>s;
char x=s.at(0);
if(x=='M') A.at(0)++;
if(x=='A') A.at(1)++;
if(x=='R') A.at(2)++;
if(x=='C') A.at(3)++;
if(x=='H') A.at(4)++;
}int64_t ans=0;
for(int i=0;i<3;i++){
for(int j=i+1;j<4;j++){
for(int k=j+1;k<5;k++)
ans+=A.at(i)*A.at(j)*A.at(k);
}
}
cout<<ans<<endl;
return 0;
}
|
# include <iostream>
# include <map>
using namespace std;
const int N=6;
map <char,int> a;
long long b[N];
string c;
long long s;
int n;
void work (void)
{
int i,j,k;
for (i=1;i<=3;i++)
for (j=i+1;j<=4;j++)
for (k=j+1;k<=5;k++)
s+=b[i]*b[j]*b[k];
cout<<s;
}
int main (void)
{
int i;
a['A']=1;
a['C']=2;
a['H']=3;
a['M']=4;
a['R']=5;
cin>>n;
for (i=1;i<=n;i++)
{
cin>>c;
b[a[c[0]]]++;
}
work ();
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N; cin>>N;
map<char,int> dic;
for(int i=0;i<N;i++){
string S; cin>>S;
dic[S[0]]++;
}
int ans=0;
ans+=dic['M']*dic['A']*(dic['R']+dic['C']+dic['H']);
ans+=dic['M']*dic['R']*(dic['C']+dic['H']);
ans+=dic['M']*dic['C']*dic['H'];
ans+=dic['A']*dic['R']*(dic['C']+dic['H']);
ans+=dic['C']*dic['H']*(dic['A']+dic['R']);
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
string s;
ll a[5],ans;
int n;
int main()
{
cin>>n;
while(n--)
{
cin>>s;
switch(s[0])
{
case 'M':a[0]++;break;
case 'A':a[1]++;break;
case 'R':a[2]++;break;
case 'C':a[3]++;break;
case 'H':a[4]++;break;
}
}
for(int i=0;i<5;i++)
for(int j=i+1;j<5;j++)
for(int k=j+1;k<5;k++)
ans+=a[i]*a[j]*a[k];
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
long long int m=0,a=0,r=0,c=0,h=0;
vector<string> S(N);
for(int i=0;i<N;i++){
cin>>S.at(i);
switch (S.at(i).at(0)){
case 'M':m++;break;
case 'A':a++;break;
case 'R':r++;break;
case 'C':c++;break;
case 'H':h++;break;
default:break;
}
}
cout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long m[5]={0,0,0,0,0};
long sum=0;
for(int i=0;i<N;i++){
string S;
cin >> S;
if(S[0]=='M')m[0]+=1;
else if(S[0]=='A')m[1]+=1;
else if(S[0]=='R')m[2]+=1;
else if(S[0]=='C')m[3]+=1;
else if(S[0]=='H')m[4]+=1;
}
for(int i=0;i<5;i++){
for(int j=0;j<i;j++){
for(int k=0;k<j;k++){
sum+=m[i]*m[j]*m[k];
}
}
}
cout << sum;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
string t = "MARCH";
int cnt[5] = {};
for(int i = 0; i < n ; i++ ){
string s;
cin >> s;
for(int j = 0 ; j < 5 ; j++ )if(s[0] == t[j])cnt[j]++;
}
int ans=0;
for(int i=0;i<5;i++)
for(int j=i+1;j<5;j++)
for(int k=j+1;k<5;k++)
ans+=cnt[i]*cnt[j]*cnt[k];
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mark[30], n;
string s;
char ch[5] = {'M', 'A', 'R', 'C', 'H'};
long long ans;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++){
cin >> s;
mark[s[0] - 'A']++;
}
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++)
for (int k = j + 1; k < 5; k++)
ans += (1LL * mark[ch[k] - 'A'] * mark[ch[j] - 'A'] * mark[ch[i] - 'A']);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n,ans;
cin >> n;
ll m = 0,a = 0,r = 0,c = 0,h = 0;
for(int i = 0;i < n;i++){
string s;
cin >> s;
if(s[0] == 'M') m++;
if(s[0] == 'A') a++;
if(s[0] == 'R') r++;
if(s[0] == 'C') c++;
if(s[0] == 'H') h++;
}
ans = m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<string> S(N);
int64_t M=0,A=0,R=0,C=0,H=0;
for(int i=0;i<N;++i){
cin>>S.at(i);
if(S.at(i).at(0)=='M'){++M;}
if(S.at(i).at(0)=='A'){++A;}
if(S.at(i).at(0)=='R'){++R;}
if(S.at(i).at(0)=='C'){++C;}
if(S.at(i).at(0)=='H'){++H;}
}
int64_t sum=M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H;
cout<<sum<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
string z;
int M,A,R,C,H;
int main(){
while(cin>>z){
if(z[0]=='M')M++;
if(z[0]=='A')A++;
if(z[0]=='R')R++;
if(z[0]=='C')C++;
if(z[0]=='H')H++;
}
long long int a=C+H,b=A+R,c=A*R,d=C*H;
cout<<c*(M+a)+d*(M+b)+(M*a*b)<<endl;
}
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
int main(){
ll n,m=0,a=0,r=0,c=0,h=0;
cin >>n;
string s;
for(ll i=0;i<n;i++) {
cin >>s;
if(s[0]=='M') m++;
if(s[0]=='A') a++;
if(s[0]=='R') r++;
if(s[0]=='C') c++;
if(s[0]=='H') h++;
}
cout <<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;
}
|
#include <iostream>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,k,n) for(int i=k;i<n;i++)
using namespace std;
int main(){
int N;
long long ans = 0;
cin >> N;
int C[6]={};
string dict = "MARCH";
rep(i,N){
string S;
cin >> S;
C[dict.find(S[0])+1]++;
}
REP(i,1,4){
REP(j,i+1,5){
REP(k,j+1,6){
ans += (long long)C[i]*C[j]*C[k];
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll cnt[5]={};
while(n--)
{
string x;
cin >> x;
if(x[0]=='M')cnt[0]++;
else if(x[0]=='R')cnt[1]++;
else if(x[0]=='A')cnt[2]++;
else if(x[0]=='C')cnt[3]++;
else if(x[0]=='H')cnt[4]++;
}
ll ans = 0;
for(ll i = 0;i<5;i++)
{
for(ll j = i+1;j<5;j++)
{
for(ll k = j+1;k<5;k++)
{
ans += cnt[i]*cnt[j]*cnt[k];
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long h[5],n,i,j,k,num;
int main()
{
string s;
cin>>n;
for (i=0;i<n;i++)
{
cin>>s;
if(s[0]=='M') h[0]++;
if(s[0]=='A') h[1]++;
if(s[0]=='R') h[2]++;
if(s[0]=='C') h[3]++;
if(s[0]=='H') h[4]++;
}
for (i=0;i<3;i++)
for (j=i+1;j<4;j++)
for (k=j+1;k<5;k++)
num+=h[i]*h[j]*h[k];
cout<<num;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,M=0,A=0,R=0,C=0,H=0; cin >> n;
vector<string> s(n);
for(int i=0;i<n;i++){
cin >> s[i];
if(s[i][0]=='M'){
M++;
}
if(s[i][0]=='A'){
A++;
}
if(s[i][0]=='R'){
R++;
}
if(s[i][0]=='C'){
C++;
}
if(s[i][0]=='H'){
H++;
}
}
long long ans=M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;string s;map<char,long>d;
int main(){
cin>>n;
while(n--)cin>>s,d[s[0]]++;
long m=d['M'],a=d['A'],r=d['R'],c=d['C'],h=d['H'];
cout<<m*a*(r+c+h)+(m+a+r)*c*h+(m+a)*r*(c+h);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long cnt=0,n,d[5];
cin >> n;
int c[26]={};
for(int i=0;i<n;i++){
string s;
cin >> s;
c[s.at(0)-65]++;
}
d[0]=c[0];
d[1]=c[2];
d[2]=c[7];
d[3]=c[12];
d[4]=c[17];
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
for(int k=j+1;k<5;k++){
cnt += d[i]*d[j]*d[k];
}
}
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long ans;
int a[5];
string m = "MARCH";
int main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> n;
for(int i=0; i<n; ++i){
string s;
cin >> s;
for(int j=0; j<5; ++j)
if(m[j] == s[0])
++a[j];
}
for(int i=0; i<3; ++i)
for(int j=i+1; j<4; ++j)
for(int k=j+1; k<5; ++k)
ans += (long long)a[i] * a[j] * a[k];
cout << ans << "\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<char> x={'M','A','R','C','H'};
vector<int64_t> c(x.size(),0);
for(int i=0;i<n;i++){
string s;
cin>>s;
for(int j=0;j<x.size();j++)
if(s.at(0)==x.at(j))
c.at(j)++;
}
int64_t a=0;
for(int i=0;i<c.size();i++)
for(int j=i+1;j<c.size();j++)
for(int k=j+1;k<c.size();k++)
a+=c.at(i)*c.at(j)*c.at(k);
cout<<a<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
scanf("%d",&N);
vector<long long> A(5);
char c[5] = {'M','A','R','C','H'};
for(int i=0; i<N; i++){
char name[100];
scanf("%s",name);
for(int j=0; j<5;j++){
if(name[0]==c[j]){
A[j]++;
break;
}
}
}
long long ans = A[0]*A[1]*(A[2]+A[3]+A[4])+(A[0]+A[1])*A[2]*(A[3]+A[4])+(A[0]+A[1]+A[2])*A[3]*A[4];
printf("%lld\n", ans);
return 0;
}
|
#include<cstdio>
int main(){
unsigned N;
scanf("%u\n", &N);
unsigned long long a=0, b=0, c=0, d=0, e=0;
for (unsigned i = 0; i < N; ++i) {
char tmp[15];
scanf("%s", tmp);
if(tmp[0] == 'M') a++;
if(tmp[0] == 'A') b++;
if(tmp[0] == 'R') c++;
if(tmp[0] == 'C') d++;
if(tmp[0] == 'H') e++;
}
unsigned long long answer = a*(b*(c+d+e)+c*(d+e)+d*e)+b*(c*(d+e)+d*e)+c*d*e;
printf("%llu\n", answer);
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
long long n, s, c[9], v[99];
char a[15];
int main() {
int i, j, k;
cin>>n;
while(n--) {
scanf("%s", a);
v[a[0]]++;
}
c[0] = v['M'];
c[1] = v['A'];
c[2] = v['R'];
c[3] = v['C'];
c[4] = v['H'];
for(i=0; i<5; i++) for(j=i+1; j<5; j++) for(k=j+1; k<5; k++) {
s += c[i] * c[j] * c[k];
}
cout<<s;
return 0;
}
|
// C - March
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string T{"MARCH"};
vector<int>
A{0,0,0,0,0,0,1,1,1,2},
B{1,1,1,2,2,3,2,2,3,3},
C{2,3,4,3,4,4,3,4,4,4};
int main(){
int N; cin>>N;
map<char,ll> S; for(auto c:T) S[c] = 0;
while(N--){
string s; cin>>s;
for(auto c:T) if(s[0]==c) S[c]++;
}
ll ans = 0;
for(int i=0; i<10; ++i)
ans += S[T[A[i]]] * S[T[B[i]]] * S[T[C[i]]];
cout<< ans <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
char P[100001][110];
int main()
{
long long int N,M=0,A=0,R=0,C=0,H=0;
scanf("%lld",&N);
for(int i=0;i<N;i++)
{
scanf("%s",P[i]);
if(P[i][0]=='M') M++;
if(P[i][0]=='A') A++;
if(P[i][0]=='R') R++;
if(P[i][0]=='C') C++;
if(P[i][0]=='H') H++;
}
long long int sum=0;
sum=(M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+R*C*H+A*C*H);
printf("%lld\n",sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<string> s(n);
rep(i,n)cin>>s[i];
string t="MARCH";
vector<ll> cnt(5);
rep(i,n){
rep(j,5){
if(t[j]==s[i][0])cnt[j]++;
}
}
ll ans=0;
rep(i,5)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++){
ans+=cnt[i]*cnt[j]*cnt[k];
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <map>
using namespace std;
int main() {
int N;
char Heads[5] = { 'M','A','R','C','H' };
cin >> N;
map<char, int>Nums;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
Nums[s[0]]++;
}
long long ans = 0;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
for (int k = j + 1; k < 5; k++) {
ans += (long long)Nums[Heads[i]] * Nums[Heads[j]] * Nums[Heads[k]];
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define ll long long
int main(){
ll N;
cin>>N;
string A[N+1];
string M="MARCH";
ll X[6]={0};
rep(i,N){
cin>>A[i];
rep(j,5) if(A[i][0]==M[j]) X[j]++;
}
ll ans=0;
rep(i,3) rep(j,3-i) rep(k,3-i-j) ans+=X[i]*X[i+j+1]*X[i+j+k+2];
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m,a,r,c,h;
string s;
int main(){
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>s;
if(s[0]=='M') m++;
if(s[0]=='A') a++;
if(s[0]=='R') r++;
if(s[0]=='C') c++;
if(s[0]=='H') h++;
}
cout<<m*a*r+m*a*c+m*a*h+a*r*c+a*r*h+r*c*h+m*r*c+m*r*h+m*c*h+a*c*h;
return 0;
}
//68871358
//76140264
//25446011
//200841159
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
map<char,long long int>q;
int main()
{
int n;
scanf("%d",&n);
char str[16];
for(int i=0;i<n;i++)
{
scanf("%s",str);
q[str[0]]++;
}
long long int sum=0;
sum+=q['M']*q['A']*(q['R']+q['C']+q['H'])+q['A']*q['R']*(q['C']+q['H'])+q['R']*q['C']*q['H']+q['M']*q['R']*(q['C']+q['H'])+q['M']*q['C']*q['H']+q['A']*q['C']*q['H'];
printf("%lld",sum);
}
|
#include <iostream>
using namespace std;
typedef long long ll;
char a[15];
ll v[100], cnt[10];
ll n, ans;
int main()
{
ll i, j, k;
cin >> n;
for(i=0; i<n; i++)
{
cin >> a;
v[a[0]]++;
}
cnt[0]=v['M'];
cnt[1]=v['A'];
cnt[2]=v['R'];
cnt[3]=v['C'];
cnt[4]=v['H'];
for(i=0; i<5; i++)
for(j=i+1; j<5; j++)
for(k=j+1; k<5; k++)
ans+=cnt[i]*cnt[j]*cnt[k];
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
long long m=0,r=0,c=0,h=0,a=0;
cin>>n;
vector<string>s(n);
for(int i=0;i<n;i++)cin>>s[i];
for(int i=0;i<n;i++)
{
if(s[i][0]=='M')m++;
if(s[i][0]=='A')a++;
if(s[i][0]=='R')r++;
if(s[i][0]=='C')c++;
if(s[i][0]=='H')h++;
}
long long ans=(m*a*r)+(m*a*c)+(m*a*h)+(m*r*c)+(m*r*h)+(m*c*h)+(a*r*c)+(a*r*h)+(a*c*h)+(r*c*h);
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
long long cnt[5] = {};
string tag = "MARCH";
for(int i = 0; i < N; ++i){
string s;
cin >> s;
auto id = tag.find(s[0]);
if(id == string::npos) continue;
++cnt[id];
}
long long ans = 0;
for(int i = 0; i < 5; ++i){
for(int j = 0; j < i; ++j){
for(int k = 0; k < j; ++k){
ans += cnt[i]*cnt[j]*cnt[k];
}
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
int_fast64_t n, ans, march[5];
char s[16];
int main(){
scanf("%ld", &n);
for(int i=0; i<n; i++){
scanf("%s", s);
if(s[0]=='M') march[0]++;
if(s[0]=='A') march[1]++;
if(s[0]=='R') march[2]++;
if(s[0]=='C') march[3]++;
if(s[0]=='H') march[4]++;
}
for(int i=0; i<5; i++) for(int j=i+1; j<5; j++) for(int k=j+1; k<5; k++){
ans += march[i] * march[j] * march[k];
}
printf("%ld\n", ans);
}
|
#prag\
ma GCC optimize("O3")
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> v;
map<char,int> m;
char ch[5]={'M','A', 'R', 'C','H'};
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=1;i<=n;i++){
string s;
cin>>s;
m[s[0]]++;
}
ll ans=0;
for(int i=0;i<=2;i++)
for(int j=i+1;j<=3;j++)
for(int k=j+1;k<=4;k++)
{
ans+=(ll)m[ch[i]]*(ll)m[ch[j]]*(ll)m[ch[k]];
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main()
{
long long i,j,n,ans=0;
long m=0,a=0,r=0,c=0,h=0;
string s[100001];
cin >> n;
for(i=0;i<n;i++){
cin >> s[i];
}
for(i=0;i<n;i++){
if(s[i][0]=='M'){
m++;
}
if(s[i][0]=='A'){
a++;
}
if(s[i][0]=='R'){
r++;
}
if(s[i][0]=='C'){
c++;
}
if(s[i][0]=='H'){
h++;
}
}
ans=(m*a*r)+(m*a*c)+(m*a*h)+(m*r*c)+(m*r*h)+(m*c*h)+(a*r*c)+(a*r*h)+(a*c*h)+(r*c*h);
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long i, j, k, Sum=0, N;
cin>>N;
map<char, long long> S;
string s;
vector<char> I={'M', 'A', 'R', 'C', 'H'};
for(i=0; i<N; i++){
cin>>s;
S[s[0]]++;
}
for(i=0; i<5; i++){
for(j=i+1; j<5; j++){
for(k=j+1; k<5; k++){
Sum+=S[I[i]]*S[I[j]]*S[I[k]];
}
}
}
cout << Sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n,m=0,a=0,r=0,c=0,h=0;cin>>n;string s[n];
for(int i=0;i<n;i++){
cin>>s[i];
if(s[i].at(0)=='M')m++;
else if(s[i].at(0)=='A')a++;
else if(s[i].at(0)=='R')r++;
else if(s[i].at(0)=='C')c++;
else if(s[i].at(0)=='H')h++;
}
// cout<<m<<a<<r<<c<<h;
cout<<m*a*r +m*a*c +m*a*h +m*r*c +m*r*h +m*c*h +a*r*c +a*r*h +a*c*h +r*c*h;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll f[30];
ll n;
char x[30];
ll ans=0;
int main(){
ios::sync_with_stdio(false);
cin>>n;
for (ll i=1;i<=n;i++){
cin>>x; f[x[0]-'A']++;
}
ll m=f[12],a=f[0];
ll r=f[17],c=f[2];
ll h=f[7];
//cout<<m<<a<<r<<c<<h<<endl;
ans=r*c*h+a*c*h+a*r*h+a*r*c+m*c*h+m*r*h+m*r*c+m*a*h+m*a*c+m*a*r;
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
array<int, 128> cnt={};
int n; cin>>n;
for(string s; n--; ) {
cin>>s;
cnt[s[0]]++;
}
long res=0;
for(int i=0; i<(1<<5); ++i) if (__builtin_popcount(i)==3) {
long c=1;
for(int j=0; j<5; ++j) if ((i>>j)&1) c*=cnt["MARCH"[j]];
res+=c;
}
cout<<res<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
string z;
int M,A,R,C,H;
int main(){
while(cin>>z){
switch(z[0]){
case 'M':M++;break;
case 'A':A++;break;
case 'R':R++;break;
case 'C':C++;break;
case 'H':H++;break;
}
}
long long int x=C+H,y=A+R,v=A*R,t=C*H;
cout<<v*(M+x)+t*(M+y)+(M*x*y)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
string t="MARCH";
vector<int> cnt(5);
rep(i,n){
string s;cin>>s;
rep(j,5){
if(s[0]==t[j])cnt[j]++;
}
}
ll ans=0;
rep(i,3)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++){
ans+=(ll)cnt[i]*cnt[j]*cnt[k];
}
cout<<ans<<endl;
}
|
#include <string>
#include <vector>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> c(5);
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
if (string("MARCH").find(s[0]) != string::npos) {
++c[string("MARCH").find(s[0])];
}
}
long long ans = 0;
for (int i = 0; i < 5; ++i) {
for (int j = 0; j < i; ++j) {
for (int k = 0; k < j; ++k) {
ans += 1LL * c[i] * c[j] * c[k];
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a[105];
long long n,cnt;
int main()
{
string s,r="MARCH";
scanf("%d",&n);
for(int i=0;i<n;i++)
{
cin>>s;
a[s[0]]++;
}
for(int i=0;i<3;i++)
{
for(int j=i+1;j<4;j++)
{
for(int k=j+1;k<5;k++)
{
cnt+=1ll*a[r[i]]*a[r[j]]*a[r[k]];
}
}
}
printf("%lld",cnt);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=1e5;
int N;
string march="MARCH";
ll cnt['Z'-'A'+1];
int main(){
cin>>N;
REP(i,N){
string s;
cin>>s;
cnt[s[0]-'A']++;
}
ll ans=0;
REP(bit,1<<5){
int c=0;
ll a=1;
REP(i,5){
if (bit&(1<<i)){
c++;
a*=cnt[march[i]-'A'];
}
}
if (c==3){
ans+=a;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main() {
string a;
unsigned long long b,h=0;
unsigned long long c = 0, d = 0, e = 0, f = 0, g = 0;
cin >> b;
for (int i = 0;i < b;i++)
{
cin >> a;
if (a[0] == 'M')c++;
if (a[0] == 'A')d++;
if (a[0] == 'R')e++;
if (a[0] == 'C')f++;
if (a[0] == 'H')g++;
}
h = c * d * e + c * d * f + c * d*g + c * e*f + c * e*g + c * f*g + d * e*f + d * e*g + d * f*g + e * f*g;
cout << h << endl;
return 0;
}
|
#include<cstdio>
int main(){
unsigned N;
scanf("%u\n", &N);
unsigned long long a=0, b=0, c=0, d=0, e=0;
for (unsigned i = 0; i < N; ++i) {
char tmp[15];
scanf("%s", tmp);
if(tmp[0] == 'M') a++;
if(tmp[0] == 'A') b++;
if(tmp[0] == 'R') c++;
if(tmp[0] == 'C') d++;
if(tmp[0] == 'H') e++;
}
printf("%llu\n", a*(b*(c+d+e)+c*(d+e)+d*e)+b*(c*(d+e)+d*e)+c*d*e);
return 0;
}
|
#include <cstdio>
#include <map>
using namespace std;
int N; long long ans;
char c[10]; map<char, long long> m;
char I[5] = {'M', 'A', 'R', 'C', 'H'};
int main() {
scanf("%d", &N);
for(int i = 0; i < N; i++) {
scanf("%s", c); m[c[0]]++;
}
for(int i = 0; i < 3; i++) {
for(int j = i+1; j < 4; j++) {
for(int k = j+1; k < 5; k++) {
ans += m[I[i]]*m[I[j]]*m[I[k]];
}
}
}
printf("%ld", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<string> s(n);
rep(i,n)cin>>s[i];
string t="MARCH";
vector<int> cnt(5);
rep(i,n){
rep(j,5){
if(t[j]==s[i][0])cnt[j]++;
}
}
ll ans=0;
rep(i,5)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++){
ans+=(ll)cnt[i]*cnt[j]*cnt[k];
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N,M=0,A=0,R=0,C=0,H=0;
cin>>N;
for(ll i=0;i<N;i++){
string s;
cin>>s;
if(s.at(0)=='M'){M++;}
if(s.at(0)=='A'){A++;}
if(s.at(0)=='R'){R++;}
if(s.at(0)=='C'){C++;}
if(s.at(0)=='H'){H++;}
}
cout<<M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H<<endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int lli;
int main(){
int n;
cin >> n;
vector<lli> num(256, 0);
for(int i=0; i<n; i++){
string s;
cin >> s;
num[s[0]]++;
}
lli ans = 0;
vector<int> per{'M','A','R','C','H'};
sort(per.begin(), per.end());
do{
ans += num[per[0]] *num[per[1]] *num[per[2]];
}while(next_permutation(per.begin(), per.end()));
cout << ans/(2*3*2) << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int n, p[5];
int main(){
long long ans = 0;
char s[15], ch[] = "MARCH";
cin >> n;
while(n--){
cin >> s;
for(int k=0; k<5; ++k)
if(s[0] == ch[k]) ++p[k];
}
for(int i=0; i<3; ++i){
for(int j=i+1; j<4; ++j){
for(int k=j+1; k<5; ++k){
ans += (long long)p[i] * p[j] * p[k];
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, H[5];
int main(){
long long res = 0;
cin >> N;
for(int i = 0; i < N; i++){
string s;
cin >> s;
if(s[0] == 'M') H[0]++;
else if(s[0] == 'A') H[1]++;
else if(s[0] == 'R') H[2]++;
else if(s[0] == 'C') H[3]++;
else if(s[0] == 'H') H[4]++;
}
for(int i = 0; i < 3; i++)
for(int j = i + 1; j < 4; j++)
for(int k = j + 1; k < 5; k++)
res += (long long)H[i] * H[j] * H[k];
printf("%lld\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans=0;
cin >> n;
vector<char> march={'M','A','R','C','H'};
vector<long> a(5);
for(int i=0;i<n;i++) {
string s;
cin >> s;
for(int j=0;j<5;j++) {
if(s[0]==march[j]) {
a[j]++;
break;
}
}
}
for(int i=0;i<5;i++) {
for(int j=i+1;j<5;j++) {
for(int k=j+1;k<5;k++) {
ans+=a[i]*a[j]*a[k];
}
}
}
cout << ans << endl;
}
|
#include <iostream>
int main(){
char name[11];
int n;
long int m=0,a=0,r=0,c=0,h=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",name);
if(name[0]=='M'){
m++;
}else if(name[0]=='A'){
a++;
}else if(name[0]=='R'){
r++;
}else if(name[0]=='C'){
c++;
}else if(name[0]=='H'){
h++;
}
}
printf("%ld\n",m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h);
return 0;
}
|
#include <iostream>
using namespace std;
int n;
string s;
int k[30];
int w[] = {0, 2, 7, 12, 17};
int main () {
cin >> n;
for (int i = 0; i < n; i ++) {
cin >> s;
k[ s[0]-'A' ] ++;
//cout << s[0]-'A' << "\n";
}
long long int sol = 0;
for (int i = 0; i < 5; i ++) {
for (int j = i+1; j < 5; j ++) {
for (int l = j+1; l < 5; l ++) {
sol += 1LL * k[ w[i] ] * k[ w[j] ] * k[ w[l] ];
}
}
}
cout << sol;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
vector<long long> num(5,0);
string x="MARCH";
for(int i=0;i<n;i++){
string s; cin>>s;
for(int j=0;j<5;j++){
if(s[0]==x[j]) num[j]++;
}
}
long long ans=0;
for(int i=0;i<3;i++){
for(int j=i+1;j<4;j++){
for(int k=j+1;k<5;k++){
ans+=num[i]*num[j]*num[k];
}
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
typedef long long ll;
int main(){
int N;
cin >> N;
vector<string> s(N);
rep(i,N) cin >> s[i];
string match = "MARCH";
map<char,ll> m;
rep(i,N) m[s[i][0]]++;
ll res = 0;
rep(i,5) for(int j = i + 1; j < 5 ; j++) for(int k = j + 1; k < 5 ; k++) {
res += m[match[i]] * m[match[j]] * m[match[k]];
}
cout << res << endl;
return 0;
}
|
#include<cstdio>
int main(){
int n;
scanf("%d",&n);
long long int m=0;
long long int a=0;
long long int r=0;
long long int c=0;
long long int h=0;
for(int i=0;i<n;i++){
char s[20]={};
scanf("%s",s);
if(s[0]=='M')m++;
if(s[0]=='A')a++;
if(s[0]=='R')r++;
if(s[0]=='C')c++;
if(s[0]=='H')h++;
}
printf("%lld\n",m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h);
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
cin >> N;
string t = "MARCH";
vector<ll> cnt(5, 0);
REP(i, 0, N) {
string S;
cin >> S;
REP(j, 0, 5) if(S[0] == t[j]) cnt[j]++;
}
ll ans = 0;
REP(i, 0, 5) REP(j, i + 1, 5) REP(k, j + 1, 5) {
ans += cnt[i] * cnt[j] * cnt[k];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll N,ans=0;
cin>>N;
vector<ll> v(5,0);
vector<string> S(N);
for(ll i=0;i<N;i++){
string s;
cin>>s;
char c=s[0];
if(c=='M') v[0]++;
else if(c=='A') v[1]++;
else if(c=='R') v[2]++;
else if(c=='C') v[3]++;
else if(c=='H') v[4]++;
}
for(ll i=0;i<5;i++){
for(ll j=i+1;j<5;j++){
for(ll k=j+1;k<5;k++) ans+=v[i]*v[j]*v[k];
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> S(100009);
for(int i=0;i<N;i++){cin >> S[i];}
long long m=0,a=0,r=0,c=0,h=0;
for(int i=0;i<N;i++){
if(S[i][0]=='M'){m++;}
if(S[i][0]=='A'){a++;}
if(S[i][0]=='R'){r++;}
if(S[i][0]=='C'){c++;}
if(S[i][0]=='H'){h++;}
}
long long ans=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
string s="MARCH";
int c[5]={0};
int n;
cin >> n;
for (int i=0;i<n;++i){
string t;
cin >> t;
for (int j=0;j<5;++j){
if (t[0]==s[j]){
c[j]++;
}
}
}
int ans=0;
for (int i=0;i<5;++i){
for (int j=i+1;j<5;++j){
for (int k=j+1;k<5;++k){
ans+=c[i]*c[j]*c[k];
}
}
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
using namespace std;
typedef long long ll;
int main(){
int n; scanf("%d", &n);
int c[5] = {};
for(int i = 0; i < n; i++){
char s[20]; scanf("%s", s);
if(s[0] == 'M') c[0]++;
if(s[0] == 'A') c[1]++;
if(s[0] == 'R') c[2]++;
if(s[0] == 'C') c[3]++;
if(s[0] == 'H') c[4]++;
}
ll res = 0;
for(int i = 0; i < 3; i++) for(int j = i + 1; j < 4; j++)
for(int k = j + 1; k < 5; k++) res += (ll)c[i] * c[j] * c[k];
printf("%lld\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[5]={0};
for(int i=0;i<n;i++){
string s;
cin >> s;
if(s[0]=='M')a[0]++;
if(s[0]=='A')a[1]++;
if(s[0]=='R')a[2]++;
if(s[0]=='C')a[3]++;
if(s[0]=='H')a[4]++;
}
long long ans=0;
for(int i=0;i<5;i++)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++)ans+=a[i]*a[j]*a[k];
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
int N;
cin>>N;
long m,a,r,c,h;
m=a=r=c=h=0;
string tmp;
rep(i,N) {
cin>>tmp;
if(tmp.at(0)=='M') m++;
else if(tmp.at(0)=='A') a++;
else if(tmp.at(0)=='R') r++;
else if(tmp.at(0)=='C') c++;
else if(tmp.at(0)=='H') h++;
}
long ans=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
ll cnt[256];
char all[5] = {'M','A','R','C','H'};
int main()
{
int n;string s; cin >> n;
while(n--) cin >>s, ++cnt[s[0]];
ll ans = 0;
for(int i=0;i<5;++i)
for(int j=i+1;j<5;++j)
for(int k=j+1;k<5;++k) ans += cnt[all[i]]*cnt[all[j]]*cnt[all[k]];
cout << ans;
}
|
#include<iostream>
#include<string>
#include<map>
using namespace std;
string march = "MARCH";
int main(){
int n;
long long ans=0;
string s[100009];
map<char, long long> m;
cin >> n;
for(int i=0;i<n;i++){
cin >> s[i];
m[s[i][0]]++;
}
for(int i=0;i<3;i++){
for(int j=i+2;j<5;j++){
for(int k=i+1;k<j;k++){
ans += m[march[i]]*m[march[j]]*m[march[k]];
}
}
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
ll m,a,r,c,h;
int main() {
int n;
cin >> n;
for(int i=0; i<n; i++) {
string s;
cin >> s;
if(s[0]=='M') m++;
if(s[0]=='A') a++;
if(s[0]=='R') r++;
if(s[0]=='C') c++;
if(s[0]=='H') h++;
}
ll res = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;
cout << res << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
long long cnt[27];
string MARCH = "MARCH";
int main(){
int N;cin>>N;
for(int i=0;i<N;i++){
string s;cin>>s;
cnt[s[0] - 'A']++;
}
long long ans = 0;
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
for(int k=j+1;k<5;k++){
ans += cnt[MARCH[i]-'A'] * cnt[MARCH[j]-'A'] * cnt[MARCH[k]-'A'];
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n,ans=0;
cin>>n;
string s;
long long int a[26]={};
for(int i=0;i<n;i++){
cin>>s;
a[s[0]-'A']++;
}
int x[5]={0,2,7,12,17};
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
for(int k=j+1;k<5;k++){
ans+=a[x[i]]*a[x[j]]*a[x[k]];
}
}
}
cout<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
char s[15];
long long an[10];
long long ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%s",s);
if(s[0]=='M') an[1]++;
if(s[0]=='A') an[2]++;
if(s[0]=='R') an[3]++;
if(s[0]=='C') an[4]++;
if(s[0]=='H') an[5]++;
}
for(int i=1;i<=3;i++)
for(int j=i+1;j<=4;j++)
for(int k=j+1;k<=5;k++)
ans+=an[i]*an[j]*an[k];
printf("%lld",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string t = "MARCH";
int cnt[5];
int main()
{
string s;
int n;
cin >> n;
while (n--)
{
cin >> s;
int pos = t.find(s[0]);
if (~pos) cnt[pos]++;
}
long long ans = 0;
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++)
for (int k = j + 1; k < 5; k++)
ans += 1LL * cnt[i] * cnt[j] * cnt[k];
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main(){
map<char,ll> m;
ll n;cin>>n;
for(int i=0;i<n;i++){
string s;cin>>s;
m[s[0]]++;
}
vector<ll> v(5);
v[0]=m['M'];
v[1]=m['A'];
v[2]=m['R'];
v[3]=m['C'];
v[4]=m['H'];
ll ans=0;
for(int i=0;i<5;i++)for(int j=i+1;j<5;j++)for(int z=j+1;z<5;z++){
ans+=ll(v[i]*v[j]*v[z]);
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[5]={0};
for(int i=0;i<n;i++){
string s;
cin >> s;
if(s[0]=='M')a[0]++;
if(s[0]=='A')a[1]++;
if(s[0]=='R')a[2]++;
if(s[0]=='C')a[3]++;
if(s[0]=='H')a[4]++;
}
sort(a,a+4);
long long ans=0;
for(int i=0;i<5;i++)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++)ans+=a[i]*a[j]*a[k];
cout << ans << endl;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin>>n;
string s[100000];
long long m=0,a=0,r=0,c=0,h=0;
for(int i=0;i<n;i++){
cin>>s[i];
if(s[i][0]=='M') m++;
if(s[i][0]=='A') a++;
if(s[i][0]=='R') r++;
if(s[i][0]=='C') c++;
if(s[i][0]=='H') h++;
}
cout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
long i,j,n,ans=0;
long m=0,a=0,r=0,c=0,h=0;
string s[100001];
cin >> n;
for(i=0;i<n;i++){
cin >> s[i];
}
for(i=0;i<n;i++){
if(s[i][0]=='M'){
m++;
}
if(s[i][0]=='A'){
a++;
}
if(s[i][0]=='R'){
r++;
}
if(s[i][0]=='C'){
c++;
}
if(s[i][0]=='H'){
h++;
}
}
ans=(m*a*r)+(m*a*c)+(m*a*h)+(m*r*c)+(m*r*h)+(m*c*h)+(a*r*c)+(a*r*h)+(a*c*h)+(r*c*h);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
string t="MARCH";
vector<ll> vec(5);
rep(i,n){
string s;cin>>s;
rep(j,5){
if(s[0]==t[j])vec[j]++;
}
}
ll ans=0;
rep(i,3)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++){
ans+=vec[i]*vec[j]*vec[k];
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL num[5]={0},n,ans=0;
int main(){
LL i,j,k;
cin>>n;
char s[50];
while(n--){
scanf("%s",s);
if(s[0]=='M')num[0]++;
if(s[0]=='A')num[1]++;
if(s[0]=='R')num[2]++;
if(s[0]=='C')num[3]++;
if(s[0]=='H')num[4]++;
}
n=0;
for(i=0;i<5;i++){
for(j=i+1;j<5;j++){
for(k=j+1;k<5;k++){
ans+=(num[i]*num[j]*num[k]);
n++;
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, ans=0;
cin >> N;
string S[N];
long long M=0, A=0, R=0, C=0, H=0;
for(int i=0; i<N; i++) {
cin >> S[i];
if(S[i][0]=='M') {
M++;
}
if(S[i][0]=='A') {
A++;
}
if(S[i][0]=='R') {
R++;
}
if(S[i][0]=='C') {
C++;
}
if(S[i][0]=='H') {
H++;
}
}
ans=M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H;
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
#include <algorithm>
#define REP(i,a,b) for(int64_t i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
char c[5] = {'M', 'A', 'R', 'C', 'H'};
int64_t a[5];
int main(){
rep(i,5) a[i] = 0;
int64_t n;
cin >> n;
rep(i,n){
char tmp[15];
cin >> tmp;
rep(j,5){
if(tmp[0] == c[j]){ a[j]++;}
}
}
int64_t out = 0;
rep(i,5){ REP(j,i+1,5){ REP(k,j+1,5){
out += a[i] * a[j] * a[k];
}}}
cout << out <<endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.