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++... |
#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;
r... |
#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... |
#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++){
... |
#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) {... |
#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];... |
#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";
... |
#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<=... |
#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+1... |
#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[... |
#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]++;
}
fo... |
#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[... |
#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'){
... |
#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 +... |
#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]++;
}... |
// 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.si... |
#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... |
#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 ... |
#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 ... |
#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 ... |
#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,... |
#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;
... |
#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['... |
#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... |
#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... |
#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... |
#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)
... |
#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*... |
#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... |
#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(... |
#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++;
... |
#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... |
#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=... |
#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++){
... |
#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++;
... |
#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){
... |
#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+... |
#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];
}
}
}
... |
#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<... |
#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++;
... |
#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++;
}
co... |
#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... |
#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*... |
#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;... |
#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 ... |
#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... |
#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') ... |
#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++)
... |
#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... |
#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++)
... |
#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+... |
#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 (in... |
#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]++;
... |
#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 (... |
#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++;
}
... |
#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... |
#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){
f... |
#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<... |
#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;... |
#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++){
... |
#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... |
#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... |
#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++;
}
c... |
#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){
... |
#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[... |
#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);
c... |
#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(i... |
#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... |
#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++;
... |
#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(... |
#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... |
#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] + ... |
#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++;
}
su... |
#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... |
#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... |
#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]++;
... |
#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... |
#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++;
}... |
#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... |
#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++;
... |
#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')
... |
#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++)
... |
#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++;... |
#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++;
... |
#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... |
#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;... |
#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 !=... |
#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;... |
#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... |
#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)
{
... |
#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... |
#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(... |
// 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 lon... |
#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,... |
#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)
{
... |
#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(... |
#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 ... |
//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... |
// 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 WARRA... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.