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

#include<bits/stdc++.h>

using namespace std;



int main()

{

      int n;

      cin>>n;

      int ac=0;

      int wa=0;

      int tle=0;

      int re=0;

      vector<string> s(n);

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

        cin>>s[i];

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

          ++ac;

        }

        else if(s[i]=="WA"){

          ++wa;

        }

        else if(s[i]=="TLE"){

          ++tle;

        }

        else if(s[i]=="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.261707871815369x):
#include <stdio.h>

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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

using namespace std;



int main() {

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

  int n;

  cin >> n;

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

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

    string in;

    cin >> in;

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

    if (in == "TLE") TLE++;

    if (in == "WA") WA++; 

    if (in == "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.27580400545557x):
#include <stdio.h>

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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



using namespace std;



int main()

{

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

    cin >> n ;

    string arr[n] ;

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

        cin>> arr[i] ;

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

           c0=c0+1 ;

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

            c1=c1+1 ;

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

            c2=c2+1 ;

        else if (arr[i]== "RE")

            c3=c3+1 ;



    }

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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



using namespace std;



void fast();



/*

*

* Watch out! Another Buggy Code From Muhammad_Mamdouh, Happy Coding;

*

*/



int main()

{

    fast();

    int n; cin >> n;

    int a = 0, b = 0, c = 0, d = 0;



    while (n--)

    {

        string s; cin >> s;



        if (s == "AC")

            ++a;

        if (s == "WA")

            ++b;

        if (s == "TLE")

            ++c;

        if (s == "RE")

            ++d;

    }



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

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

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

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



    return 0;

}



void fast()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);

}

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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

using namespace std;

int main() {

    int countA = 0,countW = 0, countT = 0, countR = 0;

    int n;

    cin>>n;

    string s [n];

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

        cin >> s[i];

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

            countA++;

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

            countW++;

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

            countT++;

        else if (s[i] == "RE")

            countR++;

    }

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

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

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

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

    return 0;

}

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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

using namespace std;

int main (){

    int n;cin>>n;string a[n];int cnt1=0,cnt2=0,cnt3=0,cnt4=0;

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

            cin>>a[i];

            if (a[i]=="AC")cnt1++;

            else if (a[i]=="WA")cnt2++;

            else if (a[i]=="TLE")cnt3++;

            else {cnt4++;}



    }

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

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

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

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

    return 0;

}


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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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



using namespace std;



int main()

{

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

    char c;



    cin >> n;

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

    {

        cin >> c;

        switch (c)

        {

        case 'A':

            ++ac;

            cin.ignore(1);

            break;

        case 'W':

            ++wa;

            cin.ignore(1);

            break;

        case 'T':

            ++tle;

            cin.ignore(2);

            break;

        case 'R':

            ++re;

            cin.ignore(1);

            break;

        }

    }



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

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

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

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

    return 0;

}

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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



using namespace std;



int main()

{

int n,A=0,B=0,C=0,D=0;

cin>>n;

string s;

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

    cin>>s;

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

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

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

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

}

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

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

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

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

    return 0;

}


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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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

#include <string>

using namespace std;

int main() {



	long long n;

	string x;

	cin >> n;



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



	for (int i = 0; i < n; 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;

	cout << endl;

	cout << "WA x " << WA;

	cout << endl;

	cout << "TLE x " << TLE;

	cout << endl;

	cout << "RE x " << RE;

}

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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



using namespace std;



int main()

{

    int n;

    cin>>n;

    string s[n];

    int a,w,t,r;

    a=w=t=r=0;

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

        cin>>s[i];

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

           a++;

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

            w++;

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

            t++;

        else if(s[i]=="RE")

            r++;

    }



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

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

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

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

    return 0;

}


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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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

#include <map>



using namespace std;



int main()

{

    int n;

    cin>>n;

    map<string,int> counter;



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

    {

        string temp;

        cin>>temp;

        counter[temp]++;

    }



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

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

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

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



    return 0;

}


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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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

#include<string>

#include<algorithm>

#include<vector>

using namespace std;

int main()

{

	int n;

	cin >> n;

	int a, s, d, f;

	a = s = d = f = 0;

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

	{

		string x;

		cin >> x;

		if (x=="AC")

			a++;

		if (x == "WA")

			s++;

		if (x == "TLE")

			d++;

		if (x == "RE")

			f++;

	}

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

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



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

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



	return 0;

}

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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



using namespace std;



int main()

{

	int n, C1 = 0, C2 = 0, C3 = 0, C4 = 0;

	cin>>n;

	string o;

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

     {

          cin>>o;

          if ( o == "AC" )

               C1 += 1;

          else if ( o == "WA" )

               C2 += 1;

          else if ( o == "TLE" )

               C3 += 1;

          else if ( o == "RE" )

               C4 += 1;

     }

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

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

using namespace std;



int a;



int main() {

	map<string, int> m;

	cin>>a;

	for(int k = 1; k<= a; k++){

		string s;

		cin >> s;

		m[s] ++;

	}

	cout << "AC x " << m["AC"]<< '\n';

	cout << "WA x " << m["WA"] << '\n';

	cout << "TLE x " << m["TLE"] << '\n';

	cout << "RE x " << m["RE"]<< '\n';

}

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

#include <string.h>



int main() {

	int n;

	scanf("%d", &n);

	int arr[4] = {};

	char x[4];

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

		scanf("%s",x);

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

			arr[0]++;

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

			arr[1]++;

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

			arr[2]++;

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

			arr[3]++;

		}

	}

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

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

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

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

	

	

	return 0;

}
// Slower C++ solution:
///ataur

#include<bits/stdc++.h>



using namespace std;



int main()

{

    int n;

    int a=0, b=0, c=0, d=0;

    cin>>n;

    while(n--)

    {



        char s[10];

        cin>>s;

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

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

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

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



    }

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

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

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

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

    return 0;

}






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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

		if(strcmp(str, "AC") == 0){

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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

using namespace std;



map<string , long long>m;



int main(){

 long long n,a,b,x;

 set<string>lst;

 string s;

 cin >>n;

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

 cin>>s;

 m[s]++;

 }

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

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

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

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

}


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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

		if(strcmp(str, "AC") == 0){

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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



using namespace std;



int main()

{

    int n;

    cin>>n;

    int cnt1=0,cnt2=0,cnt3=0,cnt4=0;

    while(n--)

    {

        string s;

        cin>>s;

        if(s=="AC")

            cnt1++;

        else if(s=="WA")

            cnt2++;

        else if(s=="TLE")

            cnt3++;

        else

            cnt4++;

    }

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

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

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

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



    return 0;

}


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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

		if(strcmp(str, "AC") == 0){

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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



using namespace std;



int main()

{

 int n;

 cin>>n;

 string s;

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

 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;

}


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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

		if(strcmp(str, "AC") == 0){

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

}
// 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 s[n];

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

        cin >> s[i];

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

            AC++;

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

            WA++;

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

            TLE++;

        else

            RE++;

    }

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

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

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

    cout<<"RE x "<<RE;

}






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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

		if(strcmp(str, "AC") == 0){

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

}
// Slower C++ solution:
#pragma GCC optimize ("O3")

#include<bits/stdc++.h>

using namespace std;



/// Info.

///****************************************************************************************************************************************///

/// author                : BAHAA El-DEEN OSAMA .

/// Problem name          : A - Choose Two Numbers

/// Method                : brute force

/// Online judge          : vjudge(Contest)

/// Date                  : 8/6/2020

///****************************************************************************************************************************************///



string str;

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



int main()

{



cin>>n;

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

{

    cin>>str;

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

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

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

    else if (str == "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.211453848724174x):
#include<stdio.h>

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

		if(strcmp(str, "AC") == 0){

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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

using namespace std;

#define oo (long long)1e18

#define ll long long

#define setdp memset(dp,-1,sizeof(dp))

const ll mod = 1e9+7;

void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}

#define PI 3.14159265359

int n,l,r,x;

    vector<int>b(200009),a(200009);

int main()

{

    map<string,int>mp;

    cin>>n;

    while(n--)

    {

        string s;

        cin>>s;

        mp[s]++;

    }

    for(auto s:{"AC","WA","TLE","RE"})

    {

            cout<<s<<" x "<<mp[s]<<endl;

    }

}


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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

		if(strcmp(str, "AC") == 0){

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

}