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

#include <string>

#include <cstring> // memset()

#include <algorithm>

#include <vector>

#include <map>

#include <set>

#include<cmath>



using namespace std;



#define ll long long

#define For(i, a, b) for (int i = (int)(a), sz = (int)(b); i < sz; i++)

#define rFor(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)

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

#define rall(v) (v).rbegin(), (v).rend()

#define fill(a, b) memset(a, b, sizeof(a))

#define IO ios_base::sync_with_stdio(0), cin.tie(0)



const int MAX = 2e2 + 5;



int main() {

    IO;

    int n, cnt[4]{};

    string str, type[4]{"AC", "WA", "TLE", "RE"};

    cin >> n;

    For(i, 0, n) {

        cin >> str;

        For(j, 0, 4) if (str == type[j]) cnt[j]++;

    }

    For(i, 0, 4) printf("%s x %d\n", type[i].c_str(), cnt[i]);

    return 0;

}

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



int main() {

  int c, verdict[4] = {0}; 

  scanf("%d", &c);



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

    char str[5];

    scanf("%s", str);

    switch(str[0]) {

      case 'A':

        verdict[0]++;

        break;

      case 'W':

        verdict[1]++;

        break;

      case 'T':

        verdict[2]++;

        break;

      case 'R':

        verdict[3]++;

        break;

    }

  }



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

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

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

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

  return 0;

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



using namespace std;



int main()

{

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

    cin>>x;

    string ans;

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

    {

        cin>>ans;

        if(ans == "AC")

            AC++;

        else if(ans == "WA")

            WA++;

        else if(ans == "TLE")

            TLE++;

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



int main() {

  int c, verdict[4] = {0}; 

  scanf("%d", &c);



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

    char str[5];

    scanf("%s", str);

    switch(str[0]) {

      case 'A':

        verdict[0]++;

        break;

      case 'W':

        verdict[1]++;

        break;

      case 'T':

        verdict[2]++;

        break;

      case 'R':

        verdict[3]++;

        break;

    }

  }



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

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

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

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

  return 0;

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



using namespace std;



int main()

{

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

    string s;

    cin>>n;

    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<<"WA x "<<b<<"\nTLE x "<<c<<"\nRE x "<<d<<endl;

}


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



int main() {

  int c, verdict[4] = {0}; 

  scanf("%d", &c);



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

    char str[5];

    scanf("%s", str);

    switch(str[0]) {

      case 'A':

        verdict[0]++;

        break;

      case 'W':

        verdict[1]++;

        break;

      case 'T':

        verdict[2]++;

        break;

      case 'R':

        verdict[3]++;

        break;

    }

  }



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

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

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

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

  return 0;

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



using namespace std;



int main(){

	int n;

	string w0 = "AC", w1 = "WA", w2 = "TLE", w3 = "RE";

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

	cin >> n;

	string w[n];

	

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

		cin >> w[i];

		if(w[i] == w0){

			c0++;

		}else if(w[i] == w1){

			c1++;

		}else if(w[i] == w2){

			c2++;

		}else if(w[i] == w3){

			c3++;

		}

	}

	cout << w0 << " x " << c0 << endl;

	cout << w1 << " x " << c1 << endl;

	cout << w2 << " x " << c2 << endl;

	cout << w3 << " x " << c3 << endl;

}

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



int main() {

  int c, verdict[4] = {0}; 

  scanf("%d", &c);



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

    char str[5];

    scanf("%s", str);

    switch(str[0]) {

      case 'A':

        verdict[0]++;

        break;

      case 'W':

        verdict[1]++;

        break;

      case 'T':

        verdict[2]++;

        break;

      case 'R':

        verdict[3]++;

        break;

    }

  }



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

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

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

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

  return 0;

}
// 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: 2.6146913802523892x):
#include <bits/stdc++.h>

using namespace std;



int main()

{

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

    cin >> n;



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

    {

        string str;

        cin >> str;

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

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

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

        if(str=="RE") RE++;

    }

    cout << "AC x " << AC << endl << "WA x " << WA << endl << "TLE x " << TLE << endl << "RE x " << RE << endl;

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



using namespace std;



int main()

{

    string s[100000];

    int i , n ;

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

    cin>>n;

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

        cin>>s[i];}

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

        if(s[i]=="AC"){ AC+=1;}

        else if (s[i]=="WA"){WA+=1;}

        else if (s[i]=="TLE"){TLE+=1;}

        else if (s[i]=="RE"){RE+=1;}

        }

    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: 4.351868461323291x):
#include <bits/stdc++.h>

using namespace std;



int main()

{

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

    cin >> n;



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

    {

        string str;

        cin >> str;

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

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

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

        if(str=="RE") RE++;

    }

    cout << "AC x " << AC << endl << "WA x " << WA << endl << "TLE x " << TLE << endl << "RE x " << RE << endl;

}
// 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: 2.617231094353238x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long int test,i,j,ac=0,wa=0,tle=0,re=0;

    string ch;

    cin>>j;

    for(i=0;i<j;i++)

    {

        cin>>ch;

        if(ch=="AC")

        {

            ac+=1;

        }

        else if(ch=="WA")

        {

            wa+=1;

        }

         else if(ch=="TLE")

        {

            tle+=1;

        }

        else if(ch=="RE")

        {

            re+=1;

        }





    }

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



    return 0;





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



using namespace std;



int main()

{

    string s[100000];

    int i , n ;

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

    cin>>n;

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

        cin>>s[i];}

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

        if(s[i]=="AC"){ AC+=1;}

        else if (s[i]=="WA"){WA+=1;}

        else if (s[i]=="TLE"){TLE+=1;}

        else if (s[i]=="RE"){RE+=1;}

        }

    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: 4.356095538285312x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long int test,i,j,ac=0,wa=0,tle=0,re=0;

    string ch;

    cin>>j;

    for(i=0;i<j;i++)

    {

        cin>>ch;

        if(ch=="AC")

        {

            ac+=1;

        }

        else if(ch=="WA")

        {

            wa+=1;

        }

         else if(ch=="TLE")

        {

            tle+=1;

        }

        else if(ch=="RE")

        {

            re+=1;

        }





    }

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



    return 0;





}
// 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: 2.6147954902518835x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,count=0,countt=0,countt1=0,countt2=0;

    cin>>n;

    string s[n];

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

    {

        cin>>s[i];

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

            count++;

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

            countt++;

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

            countt1++;

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

            countt2++;

    }

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

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

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

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

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



using namespace std;



int main()

{

    string s[100000];

    int i , n ;

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

    cin>>n;

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

        cin>>s[i];}

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

        if(s[i]=="AC"){ AC+=1;}

        else if (s[i]=="WA"){WA+=1;}

        else if (s[i]=="TLE"){TLE+=1;}

        else if (s[i]=="RE"){RE+=1;}

        }

    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: 4.352041741055931x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,count=0,countt=0,countt1=0,countt2=0;

    cin>>n;

    string s[n];

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

    {

        cin>>s[i];

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

            count++;

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

            countt++;

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

            countt1++;

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

            countt2++;

    }

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

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

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

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

}
// 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: 2.602638222530086x):
#include<bits/stdc++.h>

#define ll long long

#define pb push_back

#define mp make_pair

#define vi vector <int>

#define vii vector <int>::iterator 

#define vd vector <double>

#define vdd vector <double>::iterator

#define vs vector <string>

#define vss vector <string>::iterator

#define vc vector <char>

#define vcc vector <char>::iterator

#define maxx(a,b,c) max(a,max(b,c))

#define minn(a,b,c) min(a,min(b,c))

#define SORT(x)     sort(x.begin(),x.end())

#define fill(x,y)   memset(x, y, sizeof(x))

#define PI 2*acos(0.0)

#define fio ios::sync_with_stdio(false);cin.tie(0)

using namespace std;

int main(){

   ll t;

   cin >> t;

   map <string , int> m;

   m["AC"] = 0;

   m["WA"] = 0;

   m["TLE"] = 0;

   m["RE"] = 0;

   while(t--){

       string s;

       cin >> s;

       if(m.count(s) == 0)

            m[s] = 1;

        else

            m[s]++;

   }

   /*map <string , int>:: iterator it;

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

        cout << it->first << " x " << it->second << endl;*/

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

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

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

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

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



using namespace std;



int main()

{

    string s[100000];

    int i , n ;

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

    cin>>n;

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

        cin>>s[i];}

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

        if(s[i]=="AC"){ AC+=1;}

        else if (s[i]=="WA"){WA+=1;}

        else if (s[i]=="TLE"){TLE+=1;}

        else if (s[i]=="RE"){RE+=1;}

        }

    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: 4.331807295654865x):
#include<bits/stdc++.h>

#define ll long long

#define pb push_back

#define mp make_pair

#define vi vector <int>

#define vii vector <int>::iterator 

#define vd vector <double>

#define vdd vector <double>::iterator

#define vs vector <string>

#define vss vector <string>::iterator

#define vc vector <char>

#define vcc vector <char>::iterator

#define maxx(a,b,c) max(a,max(b,c))

#define minn(a,b,c) min(a,min(b,c))

#define SORT(x)     sort(x.begin(),x.end())

#define fill(x,y)   memset(x, y, sizeof(x))

#define PI 2*acos(0.0)

#define fio ios::sync_with_stdio(false);cin.tie(0)

using namespace std;

int main(){

   ll t;

   cin >> t;

   map <string , int> m;

   m["AC"] = 0;

   m["WA"] = 0;

   m["TLE"] = 0;

   m["RE"] = 0;

   while(t--){

       string s;

       cin >> s;

       if(m.count(s) == 0)

            m[s] = 1;

        else

            m[s]++;

   }

   /*map <string , int>:: iterator it;

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

        cout << it->first << " x " << it->second << endl;*/

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

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

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

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

}
// 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: 2.572816711106189x):
#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define pb push_back

#define mp make_pair

#define PI 2*acos(0.0)

#define boost ios::sync_with_stdio(false);cin.tie(0)

/*ll arr[1000000];void seive(){memset(arr,1,sizeof(arr));arr[0]=arr[1]=0;for(ll i=2;i<=(sqrt(1000000));i++){if(arr[i]){for(ll j=(i+i);j<=1000000;j+=i){arr[j]=0;}}}}*/

int main()

{

 boost;

 ll t;

 cin>>t;

 map <string,int> mp;

 while(t--)

 {

     string str;

     cin>>str;

     mp[str]++;

 }

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

 

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



using namespace std;



int main()

{

    string s[100000];

    int i , n ;

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

    cin>>n;

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

        cin>>s[i];}

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

        if(s[i]=="AC"){ AC+=1;}

        else if (s[i]=="WA"){WA+=1;}

        else if (s[i]=="TLE"){TLE+=1;}

        else if (s[i]=="RE"){RE+=1;}

        }

    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: 4.282172644309465x):
#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define pb push_back

#define mp make_pair

#define PI 2*acos(0.0)

#define boost ios::sync_with_stdio(false);cin.tie(0)

/*ll arr[1000000];void seive(){memset(arr,1,sizeof(arr));arr[0]=arr[1]=0;for(ll i=2;i<=(sqrt(1000000));i++){if(arr[i]){for(ll j=(i+i);j<=1000000;j+=i){arr[j]=0;}}}}*/

int main()

{

 boost;

 ll t;

 cin>>t;

 map <string,int> mp;

 while(t--)

 {

     string str;

     cin>>str;

     mp[str]++;

 }

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

 

}
// 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: 2.6156488795033668x):
#include<iostream>

#include<cstring>

using namespace std;

int main()

{

    int i,j,Co=0,C1=0,C2=0,C3=0;

    string n;

    cin>>j;

    for(i=1; i<=j; i++)

    {

        cin>>n;

        if(n=="AC")

            Co++;

        else if(n=="WA")

            C1++;

        else if(n=="TLE")

            C2++;

        else if(n=="RE")

            C3++;

    }

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

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

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

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

    return 0;

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



using namespace std;



int main()

{

    string s[100000];

    int i , n ;

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

    cin>>n;

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

        cin>>s[i];}

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

        if(s[i]=="AC"){ AC+=1;}

        else if (s[i]=="WA"){WA+=1;}

        else if (s[i]=="TLE"){TLE+=1;}

        else if (s[i]=="RE"){RE+=1;}

        }

    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: 4.353462114334709x):
#include<iostream>

#include<cstring>

using namespace std;

int main()

{

    int i,j,Co=0,C1=0,C2=0,C3=0;

    string n;

    cin>>j;

    for(i=1; i<=j; i++)

    {

        cin>>n;

        if(n=="AC")

            Co++;

        else if(n=="WA")

            C1++;

        else if(n=="TLE")

            C2++;

        else if(n=="RE")

            C3++;

    }

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

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

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

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

    return 0;

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

#include <string>

#include <map>



int main()

{

    int n;

    std::map<std::string,int> mp;



    std::cin>>n;

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

    {

        std::string tmp;

        std::cin>>tmp;

        mp[tmp]++;

    }

    std::cout<<"AC x "<<mp["AC"]<<std::endl;

    std::cout<<"WA x "<<mp["WA"]<<std::endl;

    std::cout<<"TLE x "<<mp["TLE"]<<std::endl;

    std::cout<<"RE x "<<mp["RE"]<<std::endl;

    return 0;

}

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

#include <string.h>



int n;

char s[100000][4];

int ans[4]={0};//AC WA TLE RE



int main()

{

    scanf("%d",&n);

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

        scanf("%s",s[i]);

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

    if(strcmp(s[i],"AC")==0) ans[0]++;

    else if(strcmp(s[i],"WA")==0) ans[1]++;

    else if(strcmp(s[i],"TLE")==0) ans[2]++;

    else ans[3]++;

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

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

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

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

    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: 4.321276220402226x):
#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;

}