Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <cstdlib>
- #include <cstring>
- using namespace std;
- string sizes[] = {"S", "M", "L", "X", "XL"};
- int sockMap[26][26][26][5];
- void init(){
- for(int i1 = 0; i1 < 26; i1++){
- for(int i2 = 0; i2 < 26; i2++){
- for(int i3 = 0; i3 < 26; i3++){
- for(int s = 0; s < 5; s++){
- sockMap[i1][i2][i3][s] = 0;
- }
- }
- }
- }
- }
- void output(int i){
- printf("Case #%d\n",i);
- for(int i1 = 0; i1 < 26; i1++){
- for(int i2 = 0; i2 < 26; i2++){
- for(int i3 = 0; i3 < 26; i3++){
- for(int s = 0; s < 5; s++){
- int t = sockMap[i1][i2][i3][s];
- if(t > 0){
- if(t % 2 == 0){
- printf("Socks fine\n");
- }else{
- printf("%c%c%c %s\n",i1+'a' ,i2+'a' ,i3+'a', sizes[s].c_str());
- }
- }
- sockMap[i1][i2][i3][s] = 0;
- }
- }
- }
- }
- }
- int main(){
- init();
- freopen("input.txt","r",stdin);
- int n, m;
- string name,sz;
- scanf("%d",&n);
- //cout << n << endl;
- for(int i = 0; i < n; i++){
- scanf("%d",&m);
- //cout << m << endl;
- for(int j = 0; j < m; j++){
- cin >> name >> sz;
- int si = 0;
- for(; si < 5; si++)
- if(sz.compare(sizes[si]) == 0)
- break;
- int i1 = name.at(0) - 'a';
- int i2 = name.at(1) - 'a';
- int i3 = name.at(2) - 'a';
- sockMap[i1][i2][i3][si]++;
- //cout << name << " " << sz << endl;
- }
- output(i + 1);
- }
- return 1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement