stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {

    int n,ac(0),wa(0),tle(0),re(0);

    cin>>n;

    string c[n];

    for(int i=0;i<n;i++) {

        cin >> c[i];

        if(c[i]=="AC")

            ac++;

        else if(c[i]=="WA")

            wa++;

        else if(c[i]=="TLE")

            tle++;

        else

            re++;

    }

    cout<<"AC x "<<ac<<"\n"<<"WA x "<<wa<<"\n"<<"TLE x "<<tle<<"\n"<<"RE x "<<re<<"\n";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.247549907502669x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include<string>

#include<vector>

#include<algorithm>

using namespace std;

int main()

{

    vector <string> dash={"AC", "WA", "TLE" , "RE" };

    ios_base::sync_with_stdio(0);

    int n,m;

    cin>>n;

    vector <string> v1(n);

    for(int i=0;i<n;i++)cin>>v1[i];

    for(int i=0;i<4;i++)cout<<dash[i]<<" x "<<count(v1.begin(),v1.end(),dash[i])<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3149753903967x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std ;

#include<string>

int main()

{

	int n,a=0,w=0,t=0,r=0;

	cin>>n;

	string c;

for(int i=0;i<n;i++)

{

	cin>>c;

	if(c[0]=='A')

		a++;

	else if (c[0]=='W')

		w++;

	else if (c[0]=='T')

		t++;

	else

		r++;

}

cout<<"AC x "<<a<<endl;

cout<<"WA x "<<w<<endl;

cout<<"TLE x "<<t<<endl;

cout<<"RE x "<<r<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.202177913665937x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

#include <bits/stdc++.h>

#include <vector>

using namespace std;



int main()

{

    int t, ac = 0, wa = 0, tl = 0, re = 0;

    string s;

    cin >> t;

    for (int i = 0; i < t; i++)

    {



        cin >> s;

        if (s == "AC")

            ac++;

        else if (s == "WA")

            wa++;

        else if (s == "TLE")

            tl++;

        else

            re++;

    }

    cout << "AC x " << ac << "\n" << "WA x " << wa << "\n" << "TLE x " << tl << "\n" << "RE x " << re;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.242031463583101x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#include <iostream>

#include <cstring>

#include <set>

#include <algorithm>

#include <math.h>

#include <vector>

#include <iterator>

#include<deque>

#include<cstdio>



#define lp(i,a,n) for(int i=a;i<n;++i)

#define rep(i,a,n) for(ll i=a;i<=n;++i)

#define all(v) v.begin(),v.end()

#define clr(n,a) memset(n,a,sizeof(n))

#define vi vector <int>

#define sc set <char>

#define si set<int>

#define pb push_back

#define vb vector <bool>

#define pi(n) printf("%d\n",n)

#define ln "\n"

#define mahmoud_abdelsamie ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

typedef long long ll;

typedef unsigned long long ull;

using namespace std;





int main()

{

    mahmoud_abdelsamie

    int a[4]={};

    string s[4] = {"AC","WA","TLE","RE"};

    int n;cin>>n;

    lp(i,0,n){

        string st; cin>>st;

        if(st==s[0])

            ++a[0];

        else if(st==s[1])

            ++a[1];

        else if(st==s[2])

            ++a[2];

        else

            ++a[3];

    }

    lp(i,0,4){

        cout<<s[i] << " x "<<a[i]<<ln;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.306036235769177x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
//:::: Alien :::://

// Muhammad Eid //

#include <bits/stdc++.h>

using namespace std;



#define ll long long

#define ull unsigned long long

#define prINT pair<int, int>



const int N = 4 +5;

int ar[N];



void Mo35(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}



int main(){

Mo35();



    string s;

    int t; cin>> t;

    while(t--){

        cin>> s;

        if(s == "AC") ar[0]++;

        else if(s == "WA") ar[1]++;

        else if(s == "TLE") ar[2]++;

        else ar[3]++;

    }

    cout<< "AC x "<< ar[0]<< "\n";

    cout<< "WA x "<< ar[1]<< "\n";

    cout<< "TLE x "<< ar[2]<< "\n";

    cout<< "RE x "<< ar[3]<< "\n";



return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.316948988808547x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <vector>

using namespace std;

void creatVec(vector<string> &vec, size_t size, size_t &AC, size_t &WA, size_t &TLE, size_t &RE);

void check(const string &s, size_t &AC, size_t &WA, size_t &TLE, size_t &RE);

void printer(const string &s, size_t n);

int main() {

    size_t n{}, countAC{}, countWA{}, countTLE{}, countRE{};

    cin >> n;

    vector<string> words {};

    creatVec(words, n, countAC, countWA, countTLE, countRE);

    printer("AC", countAC);

    printer("WA", countWA);

    printer("TLE", countTLE);

    printer("RE", countRE);

    return 0;

}

void creatVec(vector<string> &vec, size_t size, size_t &AC, size_t &WA, size_t &TLE, size_t &RE) {

    for (size_t i{}; i < size; i++) {

        string in{};

        cin >> in;

        check(in, AC, WA, TLE, RE);

        vec.push_back(in);

    }

}

void check(const string &s, size_t &AC, size_t &WA, size_t &TLE, size_t &RE) {

    if (s == "AC") AC++;

    else if (s == "WA") WA++;

    else if (s == "TLE") TLE++;

    else if (s == "RE") RE++;

}

void printer(const string &s, size_t n) {cout << s << " x " << n << endl;}

// Faster C++ solution for the same problem (measured speedup: 5.301056836349761x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

string arr[100000];

int main()

{

    int n=0,ACs=0,TLEs=0,WAs=0,REs=0;

    cin>>n;

    for(int i=0;i<n;i++){

        cin>>arr[i];

    }

    for(int i=0;i<n;i++){

        if(arr[i]=="AC") {ACs++;}

        else if(arr[i]=="TLE") {TLEs++;}

        else if(arr[i]=="WA") {WAs++;}

        else if(arr[i]=="RE") {REs++;}

    }

    cout<<"AC x "<<ACs<<"\n";

    cout<<"WA x "<<WAs<<"\n";

    cout<<"TLE x "<<TLEs<<"\n";

    cout<<"RE x "<<REs<<"\n";





    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 22.657692734974617x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;







int main() {



    int n;

    cin>>n;

    string word;

    int ac=0,tle=0,re=0,wa=0;

    while(n--){

        cin>>word;

        if(word[0]=='A'){

            ac++;

        }

        else if(word[0]=='R'){

            re++;

        }

        else if(word[0]=='T'){

            tle++;

        }

        else {

            wa++;

        }



    }



    cout<<"AC x "<<ac<<endl;

    cout<<"WA x "<<wa<<endl;

    cout<<"TLE x "<<tle<<endl;

    cout<<"RE x "<<re<<endl;





    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.243287302024315x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int n;

string s;

int c1=0,c2=0,c3=0,c4=0;

int main()

{

	cin>>n;

	for(int i=1;i<=n;i++)

	{

		cin>>s;

		if(s=="AC") c1++;

		else if(s=="WA")  c2++;

		else if(s=="TLE") c3++;

		else              c4++;

	}

	cout<<"AC"<<" x "<<c1<<endl;

	cout<<"WA"<<" x "<<c2<<endl;

	cout<<"TLE"<<" x "<<c3<<endl;

	cout<<"RE"<<" x "<<c4<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.212652089280453x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

using namespace std;



const char* s[5]={"","AC","WA","TLE","RE"};

int a[10],n;

char st[10];



int main() {

	scanf("%d",&n);

	a[1]=a[2]=a[3]=a[4]=0;

	for (int i=1;i<=n;++i) {

		scanf("%s",st);

		if (st[0]=='A') a[1]++;

		if (st[0]=='W') a[2]++;

		if (st[0]=='T') a[3]++;

		if (st[0]=='R') a[4]++;

	}

	for (int i=1;i<=4;++i) {

		printf("%s x %d\n",s[i],a[i]);

	}

}

// Faster C++ solution for the same problem (measured speedup: 5.136887839136756x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <algorithm>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <string>

using namespace std;

typedef long long ll;



const int maxn = 1e5 + 5;

int c[5];



int main() {

    int n;

    cin>>n;

    string s;

    while(n-->0){

        cin>>s;

        if(s[0]=='A') c[1]++;

        else if(s[0]=='W') c[2]++;

        else if(s[0]=='T') c[3]++;

        else if(s[0]=='R') c[4]++;

    }

    printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n",c[1],c[2],c[3],c[4]);

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.177754271058237x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
//

//  main.cpp

//  B - Judge Status Summary

//

//  Created by 李远铄 on 2020/8/7.

//  Copyright © 2020 李远铄. All rights reserved.

//



#include <iostream>

#include <string>



#define _DEBUG_

#ifdef _DEBUG_

#define debug(x) cout << #x << ": " << x << "  "

#define print_n printf("\n")

#define cout_n cout<<'\n'

#else

#define debug(x)

#define print_n

#define cout_n

#endif





using namespace std;

char s[10];

int a,w,t,r;

int main(int argc, const char * argv[]) {

    int n;

    scanf("%d",&n);

    while(n--){

        scanf("%s",s);

        if(s[0]=='A'){

            a++;

        }else if(s[0]=='W'){

            w++;

        }else if(s[0]=='T'){

            t++;

        }else if(s[0]=='R'){

            r++;

        }

    }

    printf("AC x %d\n",a);

    printf("WA x %d\n",w);

    printf("TLE x %d\n",t);

    printf("RE x %d\n",r);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.1334854829906345x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
						/* In the name of Allah */

#include<bits/stdc++.h>

using namespace std;

int main()

{

	int t;

	cin >> t;

	map<string, int>m;

	while (t--)

	{

		string x;

		cin >> x;

		m[x]++;

	}

	cout << "AC x " << m["AC"] << endl << "WA x " << m["WA"] << endl << "TLE x " << m["TLE"] << endl << "RE x " << m["RE"] << endl;

	return 0;

}










// Faster C++ solution for the same problem (measured speedup: 5.271349495008042x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {

    cin.tie(0);

    cout.tie(0);

    ios_base::sync_with_stdio(0);



    int n;

    cin >> n;

    map<string, int> mp;

    string s;



    while (n--) {

        cin >> s;

        ++mp[s];

    }

    vector<string> v = {"AC", "WA", "TLE", "RE"};

    for (auto i : v) {

        cout << i << " x " << mp[i] << '\n';

    }





}

// Faster C++ solution for the same problem (measured speedup: 5.382263697091768x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int n,a=0,b=0,c=0,t=0;

    cin>>n;

    string s;

    for(int i=0;i<n;i++)

    {

        cin>>s;

        if(s=="AC")

        {

            a++;

        }

        if(s=="TLE")

        {

            t++;

        }

        if(s=="WA")

        {

            b++;

        }

        if(s=="RE")

        {

            c++;

        }

    }

    cout<<"AC x "<<a<<endl;

    cout<<"WA x "<<b<<endl;

    cout<<"TLE x "<<t<<endl;

    cout<<"RE x "<<c<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.252026971545599x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

string x;



int n,AC=0,TLE=0,WA=0,RE=0;



cin>>n;

for(int i=0;i<n;i++){

cin>>x;

    if(x=="AC"){AC++;}

    else if(x=="TLE"){TLE++;}

    else if(x=="WA"){WA++;}

else if(x=="RE"){RE++;}

}





cout<<"AC x "<<AC<<endl;

cout<<"WA x "<<WA<<endl;

cout<<"TLE x "<<TLE<<endl;

cout<<"RE x "<<RE<<endl;









    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.250696748827481x):
#include <stdio.h>

#include <string.h>



int main(){

    int cases;

    scanf("%d", &cases);



    int ac = 0, wa = 0, tle = 0, re = 0;



    for(int i = 0; i < cases ; i++){

        char chances[100];

        scanf("%s", chances);



        int length = strlen(chances);



        if(chances[0] == 'A'){

            ac++;

        }

        else if(chances[0] == 'W'){

            wa++;

        }

        else if(chances[0] == 'T'){

            tle++;

        }

        else if (chances[0] == 'R'){

            re++;

        }

    }



    printf("AC x %d\n", ac);

    printf("WA x %d\n", wa);

    printf("TLE x %d\n", tle);

    printf("RE x %d\n", re);

    

    return 0;

}