stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

#include <set>

#include <string>



using namespace std;



int main() {

    int n; cin >> n;

    string temp;

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

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

        cin >> temp;

        if(temp == "AC") ac++;

        else if(temp == "WA") wa++;

        else if(temp == "TLE") tle++;

        else if(temp == "RE") re++;

    }

    cout << "AC x " << ac << "\n"

        << "WA x " << wa << "\n"

        << "TLE x " << tle << "\n"

        << "RE x " << re << "\n";

}

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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

using namespace std;

int main(){

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

    string s;

    cin>>x;

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

        cin>>s;

        if(s=="AC"){

            c1++;

        }

        else if(s=="WA")

            c2++;

        else if (s=="TLE")

            c3++;

        else if(s=="RE")

            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.255849347042886x):
#include <stdio.h>





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

using namespace std;

int main()

{

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

	string test;

	cin>>n;

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

	{

		cin>>test;

		if (test=="AC")

			AC++;

		else if (test=="TLE")

			TLE++;

		else if (test=="WA")

			WA++;

		else if (test=="RE")

			RE++;

	}

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

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

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

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

}

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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

typedef long long ll;

#define dbg(x) cout<<#x<<" = "<<x<<endl

#define dbg2(x,y) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<endl

#define dbg3(x,y,z) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<endl

#define dbg4(x,y,z,q) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<", "<<#q<<" = "<<q<<endl

#define dbg_array(x,sz) for (int i = 0; i < sz; ++i) cout << x[i] << " \n"[i==sz-1]

using namespace std;



const ll N = 100 + 9, M = 400 - 9, Max_ans = 1LL * (1e16);

int vis[N];



int main() {

	ios_base::sync_with_stdio(0), cin.tie(0);

#ifdef ECLIPSE

	freopen("input.in", "rt", stdin);

	//freopen("output.out", "wt", stdout);

#endif

	int n;

	cin >> n;

	string s;

	while (n--) {

		cin >> s;

		++vis[s[0] - 'A'];

	}

	printf("AC x %d\n", vis['A' - 'A']);

	printf("WA x %d\n", vis['W' - 'A']);

	printf("TLE x %d\n", vis['T' - 'A']);

	printf("RE x %d\n", vis['R' - 'A']);

	return 0;

}




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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

#include <map>

#include <string>

using namespace std;



int main()

{

	map<string, int> test;

	int count = 0;

	string verdict;

	cin >> count;

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

	{

		test["AC"] = 0;

		

		test["WA"] = 0;

		

		test["TLE"] = 0;



		test["RE"] = 0;

	}



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

	{

		cin >> verdict;

		

		if (verdict == "AC")

			test["AC"]++;

		else if (verdict == "WA")

			test["WA"]++;

		else if (verdict == "TLE")

			test["TLE"]++;

		else if (verdict == "RE")

			test["RE"]++;

	}

	cout << "AC"<< " x " << test["AC"] << endl;

	cout << "WA" << " x "<< test["WA"] << endl;

	cout << "TLE" << " x " << test["TLE"] << endl;

	cout << "RE" << " x " << test["RE"] << endl;

	return 0;

}


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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

using namespace std;

#define ll long long



bool cmp(const pair<string, int>&i, const pair<string, int>&j)

{

    return i.second > j.second;

}







int main() {

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

            int n ; cin >> n ;  string s ;

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

                  cin >> s;

                   if ( s == "AC")

                       AC++;

                   else if ( s == "TLE")

                       TLE++;

                   else if ( s == "WA")

                       WA++;

                   else

                       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.255039073000083x):
#include <stdio.h>





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

#include<string>

using namespace std;

int main(){

	int t, c0 = 0, c1 = 0, c2 = 0, c3  = 0;

	cin>>t;

	string test;

	while(t--){

		cin>>test;

		if(test == "AC")

		   c0++;

		else if(test == "WA")

		   c1++;

		else if(test == "TLE")

		   c2++;

		else if(test == "RE")

		   c3++;

	}

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

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

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

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

	

	

	return 0;

}

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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

#include <string>



using namespace std;



int main()

{

    int N;

    cin>>N;



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

    string s;



    while(N--)

    {

        cin>>s;



        if(s.compare("AC")==0)

            AC++;



        if(s.compare("WA")==0)

            WA++;



        if(s.compare("TLE")==0)

            TLE++;



        if(s.compare( "RE")==0)

            RE++;





    }



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

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

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

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

}


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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

#include<cstdio>

#include<map>

using namespace std;

int main(void)

{

    ios::sync_with_stdio(false);

    map<string,int> mp;

    int n;

    char ch[10];

    while(cin>>n)

    {

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

        cin>>ch,mp[ch]++;

        printf("AC x %d\n",mp["AC"]);

        printf("WA x %d\n",mp["WA"]);

        printf("TLE x %d\n",mp["TLE"]);    

        printf("RE x %d\n",mp["RE"]);

    }

    return 0;

} 

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





int main(){

	int N, dec[4]= {0};

	scanf("%d", &N);

	

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

		char S[5];

		scanf("%s", S);

		switch(S[0]){

			case 'A':

				dec[0]++;

				break;

			case 'W':

				dec[1]++;

				break;

			case 'T':

				dec[2]++;

				break;

			case 'R':

				dec[3]++;

				break;

		}

	}

	printf("AC x %d\n", dec[0]);

	printf("WA x %d\n", dec[1]);

	printf("TLE x %d\n", dec[2]);

	printf("RE x %d\n", dec[3]);

	

	

	return 0;

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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

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

using namespace std;

int main()

{

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

    string s;

    cin>>n;

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

    {

        cin>>s;

        if(s=="AC")

            ac++;

        if(s=="WA")

            wa++;

        if(s=="TLE")

            tle++;

        if(s=="RE")

            re++;

    }

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

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

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

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

    return 0;



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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.358881895025679x):
#include <iostream>

#include <string.h>

#include <vector>

#include <iterator>

using namespace std;

int main()

{

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

    cin >> n;

    vector<string>v(n);

    vector<string> :: iterator it;



    for(it = v.begin();it != v.end();it++)

        cin >> *it;



    for(it = v.begin();it != v.end();it++)

    {

        if(*it == "AC")

        c++;

        else if(*it == "WA")

            w++;

        else if(*it == "TLE")

            t++;

        else if( *it  == "RE")

            r++;

    }

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

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

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

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







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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.3661987548520145x):
#include<iostream>

using namespace std;



int main()

{

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

  string s;

  cin>>n;

  while(n--)

  {

    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;

  return 0;

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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

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

using namespace std;

int main()

{



    string str;

    int N,ACcount=0,WAcount=0,TLEcount=0,REcount=0;

    cin>>N;

    while(N--)

    {

        cin>>str;



        if(str=="AC")

            ACcount++;

        else if(str=="WA")

            WAcount++;

        else if(str=="TLE")

            TLEcount++;

        else if(str=="RE")

            REcount++;

    }

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

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

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

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



    return 0;

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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

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

using namespace std;

int main()

{

    string a;

    int x=0, y=0, z=0, c=0, t;

    cin>>t;

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

    {

        cin>>a;

        if(a=="AC")

        {

            x++;

        }

        else if(a=="WA")

        {

            y++;

        }

        else if(a=="TLE")

        {

            z++;

        }

        else if(a=="RE")

        {

            c++;

        }

    }

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

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

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

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

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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

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

using namespace std;

int main(){

int t;cin>>t;

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

while(t--){

    string s;cin>>s;

    if(s=="AC")

        ac++;

    else if(s=="WA")

        wa++;

    else if(s=="TLE")

        tle++;

    else

        re++;

}

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

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

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

cout<<"RE x "<<re;



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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.365413602164231x):
#include<iostream>

using namespace std;

int main()



{

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

    string s;

    cin>>n;

    while(n--)

    {

        cin>>s;

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

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

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

        else RE++;

    }



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

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

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

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

    return 0;

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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

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

using namespace std;

string s;

int a,b,c,d;

int main()

{

	int n;cin>>n;

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

	{

		cin>>s;

		if(s=="AC")

		{

			a++;

		}

		else if(s=="TLE")

		{

			c++;

		}

		else if(s=="WA")

		{

			b++;

		}

		else d++;

	}

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

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

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

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

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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

        if (S[i] == "AC") {

            A ++;

        }

    }

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

        if (S[i] == "WA") {

            W ++;

        }

    }

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

        if (S[i] == "TLE") {

            T ++;

        }

    }

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

        if (S[i] == "RE") {

            R ++;

        }

    }

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

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

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

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

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.3730836272491045x):
#include <iostream>

#include <string>

using namespace std;

int main() {

	string x; int y,AC=0,WA=0,TLE=0,RE=0;

	cin >> y;

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

		cin >> x;

		if (x == "AC") {

			AC++;

		}

		else if (x == "WA") {

			WA++;

		}

		else if (x == "TLE") {

			TLE++;

		}

		else if (x == "RE") {

			RE++;

		}

	}

	cout << "AC x " << AC << "\nWA x " << WA << "\nTLE x " << TLE << "\nRE x " << RE;

	return 0;

}