text
stringlengths 49
983k
|
|---|
#include <cstdio>
#define MAXN 14
int main(void)
{
long long i,c0,c1,c2,N,m[5]={0};
long long s;
char name[MAXN];
const char sign[7]="MARCH";
scanf("%lld",&N);
for(i=0;i<N;i++)
{
scanf("%s",name);
for(int j=0;j<5;j++)
if(name[0]==sign[j])
m[j]++;
}
s=0;
for(c0=0;c0<5;c0++)
for(c1=c0+1;c1<5;c1++)
for(c2=c1+1;c2<5;c2++)
s+=m[c0]*m[c1]*m[c2];
printf("%lld\n",s);
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<ll> vec(5);
string t="MARCH";
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;
int main() {
int n;
cin>>n;
string m="MARCH";
map<char,int> c;
for (int i=0;i<n;i++) {
string s;cin>>s;
c[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+=(ll)c[m[i]]*c[m[j]]*c[m[k]];
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n;
string s;
cin >> n;
int i;
long long a[5]={},ans=0;
for(i=0;i<n;i++){
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]++;
}
int j,k;
for(i=0;i<3;i++){
for(j=i+1;j<4;j++){
for(k=j+1;k<5;k++){
ans+=a[i]*a[j]*a[k];
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main()
{
int N;
cin >> N;
map<char, long long> m;
for (int i = 0; i < N; ++i) {
string S;
cin >> S;
++m[S[0]];
}
long long ans = 0;
const string F = "MARCH";
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
for (int k = j + 1; k < 5; ++k) {
ans += m[F[i]] * m[F[j]] * m[F[k]];
}
}
}
cout << ans << endl;
}
|
#include<cstdio>
const char c[]={'M','A','R','C','H'};
char s[15];
int a[10];
int main()
{
int n;scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%s",s);
for(int j=0;j<5;j++)
if(c[j]==s[0]) a[j]++;
}
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];
printf("%lld\n",ans);
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n; cin >> n;
vector<long long> cnt(128);
while (n--) {
string s; cin >> s;
cnt[s[0]]++;
}
long long ans = 0;
string march = "MARCH";
rep(i, 5) rep(j, i) rep(k, j) {
ans += cnt[march[i]] * cnt[march[j]] * cnt[march[k]];
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>//atcoder.089.C
using namespace std;
int main(){
long long n,m,i,j,b=0;
cin>>n;
long long a[6]={0};
string s[n+1];
for(i=1;i<=n;i++){
cin>>s[i];
if(s[i][0]=='M')a[1]++;
if(s[i][0]=='A')a[2]++;
if(s[i][0]=='R')a[3]++;
if(s[i][0]=='C')a[4]++;
if(s[i][0]=='H')a[5]++;
}
for(i=1;i<=3;i++){
if(a[i]!=0)
for(j=i+1;j<=4;j++){
if(a[j]!=0)
for(m=j+1;m<=5;m++){
if(a[m]!=0)b=b+a[i]*a[j]*a[m];
}
}
}
cout<<b;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int a[30];
string s;
int main()
{
int i,j,k,n,m,x,y,z,w,q;
scanf("%d",&n);
for(i=0;i<n;i++)
{
cin>>s;
a[s[0]-'A']++;
}
ll ans;//march
x=a['M'-'A'];
y=a[0];
z=a['R'-'A'];
w=a[2];
q=a['H'-'A'];
ans=1ll*x*y*z+1ll*x*y*w+1ll*x*y*q+1ll*x*z*w+1ll*x*z*q+1ll*x*w*q+1ll*y*z*w+1ll*y*z*q+1ll*y*w*q+1ll*z*w*q;
printf("%lld",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
vector<long long>A(N);
for(int i=0;i<N;i++){
string S; cin>>S;
if(S.at(0)=='M')A[0]++;
if(S.at(0)=='A')A[1]++;
if(S.at(0)=='R')A[2]++;
if(S.at(0)=='C')A[3]++;
if(S.at(0)=='H')A[4]++;
}
cout<<A[0]*A[1]*A[2]+A[0]*A[1]*A[3]+A[0]*A[1]*A[4]+A[0]*A[2]*A[3]+A[0]*A[2]*A[4]+A[0]*A[3]*A[4]+A[1]*A[2]*A[3]+A[1]*A[2]*A[4]+A[1]*A[3]*A[4]+A[2]*A[3]*A[4]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long march[5]={};
long long ans=0;
string s;
for(int i=1;i<=n;i++)
{
cin>>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<3;i++)
{
for(int j=i+1;j<4;j++)
{
for(int k=j+1;k<5;k++)
{
ans+=march[i]*march[j]*march[k];
}
}
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,a[10];
string s;
signed main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
if(s[0]=='M')a[0]++;
else if(s[0]=='A')a[1]++;
else if(s[0]=='R')a[2]++;
else if(s[0]=='C')a[3]++;
else if(s[0]=='H')a[4]++;
}
cout<<a[0]*a[1]*a[2]+a[0]*a[1]*a[3]+a[0]*a[1]*a[4]+a[0]*a[2]*a[3]+a[0]*a[2]*a[4]+a[0]*a[3]*a[4]+a[1]*a[2]*a[3]+a[1]*a[2]*a[4]+a[1]*a[3]*a[4]+a[2]*a[3]*a[4]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t m=0,a=0,r=0,c=0,h=0;
cin>>N;
for(int i=0;i<N;i++){
string s;
cin>>s;
if(s.at(0)=='M'){
m++;
}
else if(s.at(0)=='A'){
a++;
}
else if(s.at(0)=='R'){
r++;
}
else if(s.at(0)=='C'){
c++;
}
else if(s.at(0)=='H'){
h++;
}
}
cout<<m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
map<char, long long int> mp;
long long int N, count = 0;
string S;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S;
mp[S[0]]++;
}
long long int M = mp['M'], A = mp['A'], R = mp['R'], C = mp['C'], H = mp['H'];
count += M * A * (R + C + H);
count += (M + A) * R * (C + H);
count += (M + A + R) * C * H;
cout << count;
}
|
#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);
string t="MARCH";
vector<ll> vec(5);
rep(i,n){
cin>>s[i];
rep(j,5){
if(s[i][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;
}
|
// C - March
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string T{"MARCH"};
int N; cin>>N;
vector<int> C(T.size());
while(N--){
string s; cin>>s;
for(int t=0; t<T.size(); ++t)
if(s[0]==T[t]) C[t]++;
}
ll ans = 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)
ans += (ll)C[i] * C[j] * C[k];
cout<< ans <<endl;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
string march="MARCH";
vector<long long> c(5,0);
for(int i=0;i<n;i++)
{
string s;
cin >> s;
for(int j=0;j<5;j++)
if(s[0]==march[j])
c[j]++;
}
long long ans=0;
for(int i=0;i<5-2;i++)
for(int j=i+1;j<5-1;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() {
char c[] = "MARCH";
vector<int> a(5);
int n;
cin >> n;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < 5; j++) {
if (s[0] == c[j])
a[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 += (long long) a[i] * a[j] * a[k];
}
}
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
long long n,a[129],ans;
char b[6]={0,'M','A','R','C','H'};
int main(){
cin >> n;
for(int i=1;i<=n;i++){
string s1;
cin >> s1;
a[s1[0]]++;
}
for(int i=1;i<=5;i++){
for(int j=i+1;j<=5;j++){
for(int k=j+1;k<=5;k++){
ans+=a[b[i]]*a[b[j]]*a[b[k]];
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5;
const string march = "MARCH";
ll n, ans, cnt[N];
string s;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
while(n--) {
cin >> s;
for (int i = 0; i < N; i++)
if(s[0] == march[i])
cnt[i]++;
}
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++)
for (int k = j + 1; k < N; k++)
ans += cnt[i] * cnt[j] * cnt[k];
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N;
cin>>N;
ll a[26]={};
rep(i,N){
string s;
cin>>s;
a[(int)s[0]-'A']++;
}
ll ans=0;
int t[5]={'M'-'A','A'-'A','R'-'A','C'-'A','H'-'A'};
rep(i,5)rep(j,5)rep(k,5)if(i>j and j>k) ans+=a[t[i]]*a[t[j]]*a[t[k]];
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<int> 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+=(ll)vec[i]*vec[j]*vec[k];
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
int main(){
int N;
cin>>N;
map<char,ll> m;
for(int i=0;i<N;i++){
string S;
cin>>S;
char c=S.at(0);
if(m.count(c)==0){
m[c]=1;
}else{
m[c]++;
}
}
ll a=m['M'],b=m['A'],c=m['R'],d=m['C'],e=m['H'];
ll ans=a*b*c+a*b*d+a*b*e+a*c*d+a*c*e+a*d*e+b*c*d+b*c*e+b*d*e+c*d*e;
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
map<char,long>m;
int main(){
int n;
cin>>n;
string a[100005];
for(int i=1;i<=n;i++){
string y;
cin>>y;
m[y[0]]++;
}
unsigned long res=0;
char c[6]={'M','A','R','C','H'};
for(int i=0;i<=2;i++){
for(int j=i+1;j<=3;j++){
for(int k=j+1;k<=4;k++){
res+=m[c[i]]*m[c[j]]*m[c[k]];
}
}
}
cout<<res;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<char, ll> m;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
m[S[0]]++;
}
ll ans = 0;
char c[5] = {'M', 'A', 'R', 'C', 'H'};
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
for (int k = j + 1; k < 5; k++) {
ans += m[c[i]] * m[c[j]] * m[c[k]];
}
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
long n,m,a,r,c,h;
m=0;a=0;r=0;c=0;h=0;
cin>>n;
string s;
rep(i,n){
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+c+h) + m*r*(c+h) + m*c*h + a*r*(c+h) + a*c*h + r*c*h<<endl;
}
|
#include <cstdio>
#include <map>
int main()
{
std::map<char, long long> m;
int n;
scanf("%d", &n);
char s[11];
for (int i = 0; i < n; ++i)
{
scanf("%s", s);
m[*s]++;
}
long long ans = 0;
const char march[] = "MARCH";
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[march[i]] * m[march[j]] * m[march[k]];
}
}
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
long long m=0,a=0,r=0,c=0,h=0;
for(int 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+a*c+a*h+r*c+r*h+c*h)+a*(r*c+r*h+c*h)+r*c*h<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m=0,a=0,r=0,c=0,h=0;
string s;
long long ans;
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
if(s[0]=='M'){m++;}
else if(s[0]=='A'){a++;}
else if(s[0]=='R'){r++;}
else if(s[0]=='C'){c++;}
else 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;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,i,j,k,ans=0;
string s;
vector<int64_t> z(5);
cin>>n;
for(i=0;i<n;i++){
cin>>s;
if(s.at(0)=='M') z.at(0)++;
else if(s.at(0)=='A') z.at(1)++;
else if(s.at(0)=='R') z.at(2)++;
else if(s.at(0)=='C') z.at(3)++;
else if(s.at(0)=='H') z.at(4)++;
}
for(i=0;i<3;i++) for(j=i+1;j<4;j++)for(k=j+1;k<5;k++) ans+=z.at(i)*z.at(j)*z.at(k);
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int main() {
int n;cin>>n;
string s;
ll m=0,a=0,r=0,c=0,h=0;
rep(i,n){
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>
#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++) {
cin >> 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]];
}
}
}
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
long long A[10];
int main(){
int n;
string s;
cin >> n;
for(int i=0;i<n;i++){
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 sum=0;
for(int i=0;i<5;i++){
for(int j=i+1;j<5;j++){
for(int k=j+1;k<5;k++){
sum+=A[i]*A[j]*A[k];
}
}
}
cout << sum << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll s[5];
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
string str;
cin>>str;
if(str[0]=='M')s[0]++;
if(str[0]=='A')s[1]++;
if(str[0]=='R')s[2]++;
if(str[0]=='C')s[3]++;
if(str[0]=='H')s[4]++;
}
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+=s[i]*s[j]*s[k];
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
ll n;
cin >> n;
string s;
ll m = 0, a = 0, r = 0, c = 0, h = 0;
while (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 ans;
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;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
string march = "MARCH";
int N;
cin >> N;
long long C[26];
fill(C,C+26,0);
for(int i = 0; i < N; ++i){
string s;
cin >> s;
++C[s[0]-'A'];
}
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 += C[march[i]-'A']*C[march[j]-'A']*C[march[k]-'A'];
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int march[5] = {0, 2, 7, 12, 17};
int main(){
int N;
cin >> N;
long long name[26] = {};
string S;
for(int i = 0; i < N; i++){
cin >> S;
name[int(S[0]) - 65] += 1;
}
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 += name[march[i]] * name[march[j]] * name[march[k]];
}
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
long ans,n,a[6];
string s;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>s;
a[s[0]=='M'?0:s[0]=='A'?1:s[0]=='R'?2:s[0]=='C'?3:s[0]=='H'?4:5]++;
}
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<n;i++)
#define ll long long int
int main(){
int n;
cin>>n;
string S[n];
map<char,ll>m;
rep(i,n){
cin>>S[i];
m[S[i][0]]++;
}
char a[5]={'M','A','R','C','H'};
ll count=0;
for(int i=0;i<3;i++){
for(int j=i+1;j<4;j++){
for(int k=j+1;k<5;k++){
count+=m[a[i]]*m[a[j]]*m[a[k]];
}
}
}
cout<<count<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin>>N;
vector<string>v(N);
int a=0;
int b=0;
int c=0;
int d=0;
int e=0;
for(int i=0;i<N;i++){
cin>>v[i];
if(v[i][0]=='M')a++;
if(v[i][0]=='A')b++;
if(v[i][0]=='R')c++;
if(v[i][0]=='C')d++;
if(v[i][0]=='H')e++;
}
cout<<a*b*(c+d+e)+a*c*(d+e)+a*d*e+b*c*(d+e)+b*d*e+c*d*e<<endl;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
long long m=0,a=0,r=0,c=0,h=0;
string s;
cin>>n;
while(cin>>s)
switch(s[0]){
case'M':
m++;
break;
case'A':
a++;
break;
case'R':
r++;
break;
case'C':
c++;
break;
case'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<cstring>
#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
char s[205];
int main(){
int n;
ll m=0,a=0,r=0,c=0,h=0;
scanf("%d",&n);
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++;
}
ll res=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;
cout<<res;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
long long a=0, c=0, h=0, m=0, r=0, ans=0;
cin >> n;
string s;
for(int i=0; i<n; i++){
cin >> s;
if(s[0]=='A') a++;
else if(s[0]=='C') c++;
else if(s[0]=='H') h++;
else if(s[0]=='M') m++;
else if(s[0]=='R') r++;
}
ans += a*(c*h+c*m+c*r+h*m+h*r+m*r) + c*(h*m+h*r+m*r) + h*m*r;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
long long ans;
long long s[10];
char str[50];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%s",&str);
if(str[0]=='M') s[1]++;
if(str[0]=='A') s[2]++;
if(str[0]=='R') s[3]++;
if(str[0]=='C') s[4]++;
if(str[0]=='H') s[5]++;
}
for(int i=1;i<=5;i++)
for(int j=i+1;j<=5;j++)
for(int k=j+1;k<=5;k++)
ans+=(long long)s[i]*s[j]*s[k];
printf("%lld",ans);
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9+7;
int main(){
int N;
ll cnt[5] = {};
cin >> N;
for(int i = 0;i < N;i++){
string s,str = "MARCH";
cin >> s;
for(int j = 0;j < 5;j++)if(s[0] == str[j])cnt[j]++;
}
ll sum = 0;
for(int i = 0;i < 5;i++)for(int j = i+1;j < 5;j++)for(int k = j+1;k < 5;k++){
sum += cnt[i] * cnt[j] * cnt[k];
}
cout << sum << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
long long m,a,r,c,h;
int main()
{
int n;
cin>>n;
for(int i=1;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++;
}
cout<<m*a*h+m*a*c+m*a*r+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;
}
|
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
long long N,m = 0,a = 0,r = 0,c = 0,h = 0;
string S;
int main(){
cin >> N;
long long ans = 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++;
}
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>
#define MOD (long long)(1e9+7)
using namespace std;
long long n,dp[6][5];
char s[20],*k="MARCH";
int main()
{
cin >> n;
long long cnt[5]={0};
for(int i=0; i<n; i++)
{
cin >> s;
char *v=strchr(k,s[0]);
if(v) cnt[v-k]++;
}
for(int i=0; i<=5; i++) dp[i][0]=1;
for(int i=1; i<=5; i++)
for(int j=1; j<=3; j++)
if(i>=j)
{
dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*cnt[i-1];
//cout << dp[i][j]<< ' ';
}
cout << dp[5][3];
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
long i,j,n,ans=0,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 <cstdio>
int n,a,b;
long long odp, tb[50];
char s[20];
int main()
{
scanf("%d", &n);
for(int i=0; i<n; i++)
{
scanf("%s", &s);
if(s[0]=='M')tb[1]++;
if(s[0]=='A')tb[2]++;
if(s[0]=='R')tb[3]++;
if(s[0]=='C')tb[4]++;
if(s[0]=='H')tb[5]++;
}
for(int i=1; i<=5; i++)
for(int j=i+1; j<=5; j++)
for(int g=j+1; g<=5; g++)
odp+=tb[i]*tb[j]*tb[g];
printf("%lld", odp);
}
|
#include<cstdio>
long long n,a[11],ans;
char s[100001];
int main()
{
scanf("%lld",&n);
for (int i=1;i<=n;i++)
{
scanf("%s",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]++;
}
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];
printf("%lld",ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
map<char,long long> dic;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
dic[s[0]]++;
}
string s = "MARCH";
long long ret = 0;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
for (int k = j + 1; k < 5; k++) {
ret += dic[s[i]] * dic[s[j]] * dic[s[k]];
}
}
}
cout << ret << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,m,a,r,c,h;
string s;
cin>>n;
map<char,ll> mp;
for(int i=0;i<n;i++){
cin>>s;
mp[s[0]]++;
}
m=mp['M'],a=mp['A'],r=mp['R'],c=mp['C'],h=mp['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>
using namespace std;
#define ll long long
int main()
{
string s;char x;
vector<char>v;
map<char,ll>m;
ll a,b,c,d,i,j,k,l=0;
cin>>a;
for(i=1;i<=a;i++)
{
cin>>s;x=s[0];
if(x=='C'||x=='R'||x=='A'||x=='M'||x=='H'){
if(m[x]==0)
{
v.push_back(x);
}
m[x]++;
}
}
for(i=0;i<v.size();i++)
{
for(j=i+1;j<v.size();j++)
{
for(k=j+1;k<v.size();k++)
{
l+=(m[v[i]]*m[v[j]]*m[v[k]]);
}
}
}
cout<<l<<endl;
}
|
#define rep(i, n) for(ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
string march = "MARCH";
vector<ll> cnt (5,0);
rep(i,n) {
string s;
cin >> s;
rep(j,5) if (s[0] == march[j]) cnt[j]++;
}
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[i]*cnt[j]*cnt[k];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long int n,ma=0,aa=0,ra=0,ca=0,ha=0;
cin >> n;
for (int i=0;i<n;i++){
string t;
cin >> t;
if (t[0]=='M' ) ma++;
if (t[0]=='A' ) aa++;
if (t[0]=='R' ) ra++;
if (t[0]=='C' ) ca++;
if (t[0]=='H' ) ha++;
}
cout << ma*aa*ra+ma*aa*ca+ma*aa*ha+ma*ra*ca+ma*ra*ha+ma*ca*ha+aa*ra*ca+aa*ra*ha+aa*ca*ha+ra*ca*ha << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
char start[5]={'M','A','R','C','H'};
ll counter[5];
int main(){
int n;
cin>>n;
while(n--){
string s;
cin>>s;
for(int i=0; i<5; i++){
if(s[0]==start[i]){
counter[i]++;
break;
}
}
}
ll ret = 0;
for(int i=0; i<5; i++){
for(int j=i+1; j<5; j++){
for(int k=j+1; k<5; k++) ret+=counter[i]*counter[j]*counter[k];
}
}
cout<<ret;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s="MARCH";
long long c[5]={0};
long long n;
cin >> n;
for (long long i=0;i<n;++i){
string t;
cin >> t;
for (int j=0;j<5;++j){
if (t[0]==s[j]){
c[j]++;
}
}
}
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+=c[i]*c[j]*c[k];
}
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
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<iostream>
#include<string>
using namespace std;
int main(){
long n,ans=0;
string temp;
char target[5]={'M','A','R','C','H'};
long count[5]={0,0,0,0,0};
cin >>n;
for(int i=0;i<n;i++){
cin >>temp;
for(int j=0;j<5;j++){
if(temp[0]==target[j])count[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+=count[i]*count[j]*count[k];
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>//atcoder.089.C
using namespace std;
int main(){
long n,m,i,j,b=0;
cin>>n;
long a[6]={0};
string s[n+1];
for(i=1;i<=n;i++){
cin>>s[i];
if(s[i][0]=='M')a[1]++;
if(s[i][0]=='A')a[2]++;
if(s[i][0]=='R')a[3]++;
if(s[i][0]=='C')a[4]++;
if(s[i][0]=='H')a[5]++;
}
for(i=1;i<=3;i++){
if(a[i]!=0)
for(j=i+1;j<=4;j++){
if(a[j]!=0)
for(m=j+1;m<=5;m++){
if(a[m]!=0)b=b+a[i]*a[j]*a[m];
}
}
}
cout<<b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
map<char, long long> m;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
m[S[0]]++;
}
string S = "MARCH";
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 += m[S[i]]*m[S[j]]*m[S[k]];
}
}
}
cout << ans << endl;
}
|
#include <stdio.h>
int ch[15];
int main(){
int n,i,k,j;
char a[100];
scanf("%d",&n);
long long int b,sum=0;
for(i=0;i<n;i++){
scanf("%s",a);
if(a[0]=='M') ch[1]++;
else if(a[0]=='A') ch[2]++;
else if(a[0]=='R') ch[3]++;
else if(a[0]=='C') ch[4]++;
else if(a[0]=='H') ch[5]++;
}
for(i=1;i<=5;i++){
for(j=i+1;j<=5;j++){
for(k=j+1;k<=5;k++){
b=ch[i];
b*=ch[k]; b*=ch[j];
sum+=b;
}
}
}
printf("%lld",sum);
}
|
#include <iostream>
#include <string>
using namespace std;
string s;
long long m, a, r, c, h;
int main()
{
long long n;
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 + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
map<char, long long> s;
for(int i = 0; i < n; ++i){
string tmp;
cin >> tmp;
s[tmp[0]]++;
}
long long ans = 0;
string ma = "MARCH";
for(int i = 0; i < 5; ++i){
for(int j = i+1; j < 5; ++j){
for(int k = j+1; k < 5; ++k){
ans += s[ma[i]]*s[ma[j]]*s[ma[k]];
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin>>N;
map<char,long long> A;
for(long long i=0;i<N;i++){
string S;
cin>>S;
A[S[0]]++;
}
vector<string> B={"MAR","MAC","MAH","MRC","MRH","MCH","ARC","ARH","ACH","RCH"};
long long j=0;
for(string s:B)
j+=A[s[0]]*A[s[1]]*A[s[2]];
cout<<j<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int N,X=0;string S,T="MARCH";
cin>>N;vector<long long int>A(5,0);
for(int i=0;i<N;i++){
cin>>S;
for(int j=0;j<5;j++)if(S[0]==T[j])A.at(j)++;
}
for(int i=2;i<5;i++)for(int j=1;j<i;j++)for(int k=0;k<j;k++)X+=A.at(i)*A.at(j)*A.at(k);
cout<<X<<endl;
}
|
#include <stdio.h>
long long ans, arr[10];
int main() {
int n; scanf("%d",&n);
for(int i = 1; i<=n;i++){
char name[20]; scanf("%s",name);
if(name[0]=='M') arr[0]++;
else if(name[0]=='A') arr[1]++;
else if(name[0]=='R') arr[2]++;
else if(name[0]=='C') arr[3]++;
else if(name[0]=='H') arr[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 += arr[i]*arr[j]*arr[k];
}
}
}
printf("%lld",ans);
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
typedef long long LL;
int main ()
{
int n;
cin >> n;
map<char,LL> mp;
while (n--)
{
string s;
cin >> s;
mp[ s[0] ]++;
}
LL _=mp['M'],__=mp['A'],___=mp['R'],____=mp['C'],_____=mp['H'];
cout << _*__*___ + _*__*____+_*__*_____ + _*___*____ + _*___*_____+_*____*_____+__*___*____+__*___*_____+__*____*_____+___*____*_____<<endl;
}
|
#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++;
}
}
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<cstdio>
using namespace std;
int n;
long long ans,a[10];
char s[101010];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%s",s);
if(s[0]=='M') a[1]++;
if(s[0]=='A') a[2]++;
if(s[0]=='R') a[3]++;
if(s[0]=='C') a[4]++;
if(s[0]=='H') a[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+=a[i]*a[j]*a[k];
printf("%lld",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long m, a, r, c, h;
int main()
{
int n;
cin >> n;
char s[12];
for (int i = 0; i < n; i++) {
scanf("%s", s);
switch (s[0])
{
case 'M': m++; break;
case 'A': a++; break;
case 'R': r++; break;
case 'C': c++; break;
case 'H': h++;
}
}
cout << m * (a*(r + c + h) + r * (c + h) + c * h) + a * (r*(c + h) + c * h) + r * c*h << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int num, i = 0, p;
long long ans = 0, a[5] = { 0 };
cin >> num;
string s, march = "MARCH";
for (; i < num; i++) {
cin >> s;
p = march.find(s[0]);
a[p]++;
}
ans += a[0] * a[1] * (a[2] + a[3] + a[4]);
ans += a[2] * a[3] * (a[0] + a[1] + a[4]);
ans += (a[0] + a[1]) * (a[2] + a[3]) * a[4];
cout << ans << "\n";
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
unsigned long m,a,r,c,h,sum;
m=a=r=c=h=0;
string s;
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
if(s[0]=='M')m++;
else if(s[0]=='A')a++;
else if(s[0]=='R')r++;
else if(s[0]=='C')c++;
else if(s[0]=='H')h++;
}
sum=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;
cout<<sum<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
long long ans = 0;
map<char, long long> m;
char c[5] = {'M', 'A', 'R', 'C', 'H'};
int main(){
cin >> n;
for (int i = 1; i <= n; i++){
string s;
cin >> s;
m[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++){
ans += m[c[i]]*m[c[j]]*m[c[k]];
}
cout << ans;
}
|
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
string s;
long long int n,M=0,A=0,R=0,C=0,H=0;
long long int ans=0;
int main()
{
ios::sync_with_stdio(false);
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;
}
ans+=(M*A*R+M*A*C+M*A*H);
ans+=(M*R*C+M*R*H+M*C*H);
ans+=(A*R*C+A*R*H+A*C*H);
ans+=(R*C*H);
printf("%lld",ans);
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long h[5],num;
int main()
{
int n;
cin>>n;
string s[n];
for(int i=0;i<n;i++)
{
cin>>s[i];
if(s[i][0]=='M') h[0]++;
if(s[i][0]=='A') h[1]++;
if(s[i][0]=='R') h[2]++;
if(s[i][0]=='C') h[3]++;
if(s[i][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++)
num+=h[i]*h[j]*h[k];
cout<<num<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int64_t m=0;
int64_t a=0;
int64_t r=0;
int64_t c=0;
int64_t h=0;
for(int 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++;
}
int64_t T=m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h;
int64_t Q=a*r*c+a*r*h+a*c*h+r*c*h;
cout<<T+Q<<endl;
}
|
#include<stdio.h>
int main(void)
{
long a=0, m=0, r=0, c=0, h=0;
int i,num;
long answer;
scanf("%d", &num);
char array[10];
for(i=1; i<=num; i++)
{
scanf("%s", array);
if(array[0]=='M')m++;
if(array[0]=='A')a++;
if(array[0]=='R')r++;
if(array[0]=='C')c++;
if(array[0]=='H')h++;
}
answer=m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*c*h+r*c*h+a*r*h;
printf("%ld", answer);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
long long n,i,j,k,res=0;
long long c[5];
string s,m="MARCH";
cin >> n;
fill(c,c+5,0);
for(i=0;i<n;i++){
cin >> s;
for(j=0;j<5;j++)
if(s[0]==m[j])
c[j]++;
}
for(i=0;i<=2;i++)
for(j=i+1;j<=3;j++)
for(k=j+1;k<=4;k++)
res+=c[i]*c[j]*c[k];
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
unsigned 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++;
}
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 <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
long long M=0,A=0,R=0,C=0,H=0;
for(int 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 ;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
long long march[5] = {0};
const char pat[] = "MARCH";
cin >> n;
for(int i=0; i<n ;i++){
string s;
cin >> s;
for(int t=0; t<5; t++){
if(pat[t] == s[0])
march[t] += 1;
}
}
long long ans = 0;
for(int a=0; a<5; a++)
for(int b=a+1; b<5; b++)
for(int c=b+1; c<5; c++){
ans += march[a] * march[b] * march[c];
}
cout << ans << endl;
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
long long n,m=0,h=0,a=0,r=0,c=0,sum=0;
char s[105];
scanf("%lld",&n);
while(n--)
{
getchar();
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 %lld %lld %lld %lld\n",m,a,r,c,h);
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);
}
|
#include <iostream>
using namespace std;
int main(void){
int n;
cin >> n;
string name;
long m,a,r,c,h;
m=0;
a=0;
r=0;
c=0;
h=0;
for (int i = 0; i < n; i++)
{
cin >> name;
if (name[0] == 'M') m++;
if (name[0] == 'A') a++;
if (name[0] == 'R') r++;
if (name[0] == 'C') c++;
if (name[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<bits/stdc++.h>
using namespace std;
#define ll long long
ll ans;
int n;
ll a[5];
int main(){
cin>>n;
for(int i=0;i<n;i++){
char s[100];
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]++;
}
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;
#define REP(i,n) for(int(i)=0;i<(n);i++)
int main(){
long long n,ans=0;cin>>n;
vector<long long> x(5,0);
REP(i,n){
string s,m="MARCH";cin>>s;
REP(j,5) if(s.at(0)==m.at(j)) x.at(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+=x.at(i)*x.at(j)*x.at(k);
}
}
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
char c[5] = {'M', 'A', 'R', 'C', 'H'};
int cnt[30];
int n, ans;
int32_t main() {
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
cnt[s[0] - 'A']++;
}
for (auto i : c)
for (auto j : c)
for (auto k : c)
if (i != j && j != k && k != i)
ans += cnt[i - 'A'] * cnt[j - 'A'] * cnt[k - 'A'];
return cout << ans / 6, 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<char, ll> m;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
m[S[0]]++;
}
string s = "MARCH";
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 += m[s[i]] * m[s[j]] * m[s[k]];
}
}
}
cout << ans << endl;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<set>
using namespace std;
#define REP(i,st,ed) for(int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(int i=st,i##end=ed;i>=i##end;--i)
multiset<string>s;
multiset<string>::iterator it1,it2;
int a,b,c;
int main(){
scanf("%d%d%d",&a,&b,&c);
REP(i,1,a)s.insert("a");
REP(i,1,b)s.insert("b");
REP(i,1,c)s.insert("c");
REP(i,1,a+b+c-1){
it1=s.begin();
it2=s.end(),--it2;
s.insert(*it1+*it2);
s.erase(it1);
s.erase(it2);
}
cout<<*s.begin()<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define reg register
#define ll long long
using namespace std;
multiset<string>s;
ll a,b,c;
int main()
{
scanf("%lld%lld%lld",&a,&b,&c);
for(reg int i=1;i<=a;i++)s.insert("a");
for(reg int i=1;i<=b;i++)s.insert("b");
for(reg int i=1;i<=c;i++)s.insert("c");
while(s.size()>1)
{
string a=*s.begin(),b=*s.rbegin();
s.erase(s.lower_bound(a));
s.erase(s.lower_bound(b));
s.insert(a+b);
}
cout<<(*s.begin()).c_str()<<endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
typedef long long LL;
string solve (int x,int y,int z)
{
// printf("%d %d %d\n",x,y,z);
if (y==0&&z==0)
{
string ans;
for (int u=1;u<=x;u++) ans+='a';
return ans;
}
if (x==0)
{
string ans=solve(y,z,0);
for (int u=0;u<ans.size();u++) ans[u]++;
return ans;
}
if (z==0)
{
string ans=solve(x,0,y);
for (int u=0;u<ans.size();u++) if (ans[u]=='c') ans[u]='b';
return ans;
}
if (z>=x)
{
string str=solve(x,y,z-x),ans;
for (int u=0;u<str.size();u++)
{
ans+=str[u];
if (str[u]=='a') ans+='c';
}
return ans;
}
else
{
string str=solve(x-z,z,y),ans;
for (int u=0;u<str.size();u++)
{
if (str[u]=='a') ans+='a';
else if (str[u]=='b') {ans+='a';ans+='c';}
else ans+='b';
}
return ans;
}
}
int main()
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
cout<<solve(x,y,z);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
multiset< string > S;
multiset< string > :: iterator it;
int A, B, C;
string ns;
int main() {
cin >> A >> B >> C;
for(int i=1; i<=A; ++i) S.insert("a");
for(int i=1; i<=B; ++i) S.insert("b");
for(int i=1; i<=C; ++i) S.insert("c");
while(1) {
if(S.size() == 1) break;
it = S.begin();
ns = (*it);
S.erase(it);
it = S.end();
--it;
ns = ns + (*it);
S.erase(it);
S.insert(ns);
}
it = S.begin();
ns = (*it);
cout << ns << endl;
return 0;
}
|
// includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// }}}
// #include<bits/stdc++.h>
using namespace std;
using ll = long long;
string operator*(string a, int t) {
string r;
while(t) {
if(t&1) r += a;
a += a;
t >>= 1;
}
return r;
}
string sol(int x, int y, int z, string a, string b, string c) {
if(y + z == 0) return a * x;
if(x == 0) return sol(y, z, 0, b, c, "");
int p = x / (y + z);
int q = x % (y + z);
string t = a * p;
if(q < z) {
// aa...ac, aa...b, aa...c
return sol(q, y, z - q, t + a + c, t + b, t + c);
} else {
// aa...ac, aa...ab, aa...b
return sol(q - z, z, y - (q - z), t + a + b, t + a + c, t + b);
}
}
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
int x, y, z;
cin >> x >> y >> z;
cout << sol(x, y, z, "a", "b", "c") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fr(a,b,c) for(int a=b,__=c;a<__;a++)
using namespace std;
typedef long long ll;
ll n,m;
string dp[51][51][51];
string go(int x,int y,int z){
if(x==1&&y==0&&z==0)return "a";
if(x==0&&y==1&&z==0)return "b";
if(x==0&&y==0&&z==1)return "c";
if(dp[x][y][z]!="")return dp[x][y][z];
fr(i,0,x+1)fr(j,0,y+1)fr(k,0,z+1){
if(i+j+k&&(i!=x||j!=y||k!=z)){
string a=go(i,j,k);
string b=go(x-i,y-j,z-k);
if(a<b)a=a+b;
else a=b+a;
if(dp[x][y][z]<a)dp[x][y][z]=a;
}
}
return dp[x][y][z];
}
int main(){
int x,y,z;
cin>>x>>y>>z;
cout<<go(x,y,z)<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
char str[201];
string s[201];
int main()
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
int r = 0;
while(x--) str[r++] = 'a';
while(y--) str[r++] = 'b';
while(z--) str[r++] = 'c';
for(int i = 0; i < r; i++) s[i] += str[i];
while(r > 1)
{
sort(s, s+r);
s[0] += s[r-1];
r--;
}
cout << s[0] << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
// head
int rem[55][55][55][55],nxt[55][10],fail[55],T;
bool val[55][55][55][55];
char s[55];
int x,y,z;
bool dfs2(int u,int v,int w,int p) {
if (rem[u][v][w][p]==T) return val[u][v][w][p];
// printf("%d %d %d %d\n",u,v,w,p);
rem[u][v][w][p]=T;
bool &r=val[u][v][w][p]; r=0;
if (u==0&&v==0&&w==0) {
rep(i,0,x+y+z) {
if (s[i]==0) break;
if (s[p]>s[i]) return r=0;
else p=nxt[p][s[i]-'a'];
}
return r=1;
}
if (u>0&&s[p]<='a') r|=dfs2(u-1,v,w,nxt[p][0]); if (r) return 1;
if (v>0&&s[p]<='b') r|=dfs2(u,v-1,w,nxt[p][1]); if (r) return 1;
if (w>0&&s[p]<='c') r|=dfs2(u,v,w-1,nxt[p][2]); if (r) return 1;
return r=0;
}
bool checkp(int u,int v,int w,int d) {
// puts("checking");
s[d]=0;
rep(i,0,d) {
bool cmp=0;
rep(j,0,d-i) if (s[j]!=s[i+j]) {
if (s[j]>s[i+j]) cmp=1;
break;
}
if (cmp) return 0;
}
// puts(s);
if (d==0) return 1;
rep(i,0,3) nxt[0][i]=0;
if (d>1) nxt[0][s[0]-'a']=1;
rep(i,1,d) {
if (i==1) fail[i]=0; else fail[i]=nxt[fail[i-1]][s[i-1]-'a'];
rep(j,0,3) nxt[i][j]=nxt[fail[i]][j];
if (i+1!=d) nxt[i][s[i]-'a']=i+1;
}
fail[d]=nxt[d-1][s[d-1]-'a'];
T++;
return dfs2(u,v,w,fail[d]);
}
bool check(int d) {
rep(i,0,d) {
bool cmp=0;
rep(j,0,d) if (s[j]!=s[(i+j)%d]) {
if (s[j]>s[(i+j)%d]) cmp=1;
break;
}
if (cmp) return 0;
}
return 1;
}
void dfs(int u,int v,int w,int d) {
if (!checkp(u,v,w,d)) return;
if (u==0&&v==0&&w==0) {
if (check(d)) {
puts(s);
exit(0);
}
} else {
if (w>0) s[d]='c',dfs(u,v,w-1,d+1);
if (v>0) s[d]='b',dfs(u,v-1,w,d+1);
if (u>0) s[d]='a',dfs(u-1,v,w,d+1);
}
}
int main() {
scanf("%d%d%d",&x,&y,&z);
dfs(x,y,z,0);
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
//INSERT ABOVE HERE
signed main(){
int x,y,z;
cin>>x>>y>>z;
vector<string> vs;
for(int i=0;i<x;i++) vs.emplace_back("a");
for(int i=0;i<y;i++) vs.emplace_back("b");
for(int i=0;i<z;i++) vs.emplace_back("c");
while(vs.size()>1u){
sort(vs.begin(),vs.end());
vs.front()+=vs.back();
vs.pop_back();
}
cout<<vs.front()<<endl;
return 0;
}
|
//2017-10-10
//miaomiao
//
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
multiset<string> s;
int main(){
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
For(i, 1, A) s.insert("a");
For(i, 1, B) s.insert("b");
For(i, 1, C) s.insert("c");
string tmp;
while(s.size() > 1){
tmp = (*s.begin()) + (*s.rbegin());
s.erase(s.begin());
s.erase(--s.end());
s.insert(tmp);
}
printf("%s\n", (*s.begin()).c_str());
return 0;
}
|
// Copyright (C) 2017 Sayutin Dmitry.
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.
#include <iostream>
#include <vector>
#include <stdint.h>
#include <algorithm>
#include <set>
#include <map>
#include <array>
#include <queue>
#include <stack>
#include <functional>
#include <utility>
#include <string>
#include <assert.h>
#include <iterator>
#include <cstdint>
#include <cinttypes>
#include <string.h>
#include <random>
#include <numeric>
#include <tuple>
using std::cin;
using std::cout;
using std::cerr;
using std::vector;
using std::map;
using std::array;
using std::set;
using std::string;
using std::pair;
using std::make_pair;
using std::min;
using std::abs;
using std::max;
using std::unique;
using std::sort;
using std::generate;
using std::reverse;
using std::min_element;
using std::max_element;
#ifdef LOCAL
#define LASSERT(X) assert(X)
#else
#define LASSERT(X) {}
#endif
template <typename T>
T input() {
T res;
cin >> res;
LASSERT(cin);
return res;
}
template <typename IT>
void input_seq(IT b, IT e) {
std::generate(b, e, input<typename std::remove_reference<decltype(*b)>::type>);
}
#define SZ(vec) int((vec).size())
#define ALL(data) data.begin(),data.end()
#define RALL(data) data.rbegin(),data.rend()
#define TYPEMAX(type) std::numeric_limits<type>::max()
#define TYPEMIN(type) std::numeric_limits<type>::min()
#define pb push_back
#define eb emplace_back
// solve problem when a != 0.
string solve(int a, int b, int c) {
string base = "a";
// while (c >= a)
// base += 'c', c -= a;
// while (b >= a)
// base += 'b', b -= a;
if (b == 0 and c == 0) {
string res = "";
for (int t = 0; t != a; ++t)
res += base;
return res;
}
int num = (a + (b + c - 1)) / (b + c);
int free = num * (b + c) - a;
string tmp = "";
for (int i = 0; i != num - 1; ++i)
tmp += base;
vector<string> parts;
for (int i = 0; i != (b + c - free); ++i)
parts.push_back(tmp + base);
for (int i = 0; i != free; ++i)
parts.push_back(tmp);
for (int i = 0; i != c; ++i)
parts[i] += 'c';
for (int i = 0; i != b; ++i)
parts[c + i] += 'b';
std::sort(ALL(parts));
vector<string> cparts = parts;
cparts.resize(std::unique(ALL(cparts)) - cparts.begin());
while (cparts.size() < 3)
cparts.push_back("");
assert(SZ(cparts) == 3);
string zzans = solve(std::count(ALL(parts), cparts[0]),
std::count(ALL(parts), cparts[1]),
std::count(ALL(parts), cparts[2]));
string ans = "";
for (char ch: zzans)
ans += cparts[ch - 'a'];
return ans;
}
int main() {
std::iostream::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
// code here.
int a = input<int>();
int b = input<int>();
int c = input<int>();
std::map<char, char> back;
if (a == 0 and b == 0) {
back['a'] = 'c';
a = c;
b = 0;
c = 0;
} else if (a == 0) {
back['a'] = 'b';
back['b'] = 'c';
a = b;
b = c;
c = 0;
} else {
back['a'] = 'a';
back['b'] = 'b';
back['c'] = 'c';
}
// solve problem when a != 0.
string ans = solve(a, b, c);
for (int i = 0; i != SZ(ans); ++i)
cout << back[ans[i]];
cout << "\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.