2+1/2

今天完成了2题半，算是一个进步吧，现展示成果：

1

R - Misha and Changing Handles

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

Misha hacked the Codeforces site. Then he decided to let all the users change their handles. A user can now change his handle any number of times. But each new handle must not be equal to any handle that is already used or that was used at some point.

Misha has a list of handle change requests. After completing the requests he wants to understand the relation between the original and the new handles of the users. Help him to do that.

Input

The first line contains integer q (1 ≤ q ≤ 1000), the number of handle change requests.

Next q lines contain the descriptions of the requests, one per line.

Each query consists of two non-empty strings old and new, separated by a space. The strings consist of lowercase and uppercase Latin letters and digits. Strings old and new are distinct. The lengths of the strings do not exceed 20.

The requests are given chronologically. In other words, by the moment of a query there is a single person with handle old, and handle new is not used and has not been used by anyone.

Output

In the first line output the integer n — the number of users that changed their handles at least once.

In the next n lines print the mapping between the old and the new handles of the users. Each of them must contain two strings, old and new, separated by a space, meaning that before the user had handle old, and after all the requests are completed, his handle is new. You may output lines in any order.

Each user who changes the handle must occur exactly once in this description.

Sample Input

Input

5
Misha ILoveCodeforces
Vasya Petrov
Petrov VasyaPetrov123
ILoveCodeforces MikeMirzayanov
Petya Ivanov

Output

3
Petya Ivanov
Misha MikeMirzayanov
Vasya VasyaPetrov123

这是自己的代码，纯当作纪念

#include<cstdio> #include<cstring> #include<algorithm> #include<iostream> #include<stdio h=""> using namespace std; struct node { char a[25]; char b[25]; }p1[2005],p2[2005]; int main() { int fg1[2005],k1=0,fg2[2005],k2=0; int n,m,c1,c2,fg=1; while(~scanf("%d",&n)) { memset(fg1,0,sizeof(fg1)); for(int i=0;i<n;i++) { scanf("%s%s",p1[i].a,p1[i].b); } for(int i=1;i<n;i++) { for(int j=0;j<n;j++) { if(strcmp(p1[i].a,p1[j].b)==0) { strncpy(p1[j].b,p1[i].b,sizeof(p1[j].b)); fg1[k1++]=i; break; } if((strcmp(p1[i].a,p1[j].b))==0) fg=0; } if(fg) { strncpy(p2[k2].b,p1[i].b,sizeof(p2[k2].b)); strncpy(p2[k2].a,p1[i].a,sizeof(p2[k2].a)); k2++; } fg=1; } cout<<k1+1<<endl; for(int j=0, i=0;i<n;i++) { if(!(i-fg1[j])) //试了喝多中判断语句，发现只有这样才行，，以后要少用"!=" j++; else { cout<<p1[i].a<<" "<<p1[i].b<<endl;//这里不能直接在fg1[j++],只能在下面单独加j++，原理未知 } } } return 0; } //突然被告知不用管顺序，心都醉了 </stdio></iostream></algorithm></cstring></cstdio>

灿爷的指导

#include<stdio h=""> #include<string h=""> char a[1010][25],b[1010][25]; bool f[1010]; int main() { int n; while(scanf("%d",&n)==1) { for(int i=1;i<=n;i++) scanf("%s%s",a[i],b[i]); memset(f,false,sizeof(f)); int ans=0; for(int i=1;i<=n;i++) { if(!f[i]) { ans++; for(int j=1;j<=n;j++) if(strcmp(b[i],a[j])==0) { f[j]=true; //记录的被传递的中间过程 strcpy(b[i],b[j]); } } } printf("%d\n",ans); for(int i=1;i<=n;i++) if(!f[i]) printf("%s %s\n",a[i],b[i]); } return 0; } //这就是大神和新手的区别，没想到我码了那么多的字母还是wa，但别人这么短。 </string></stdio>

2

A - Help Me with the Game

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

Your task is to read a picture of a chessboard position and print it in the chess notation.

Input

The input consists of an ASCII-art picture of a chessboard with chess pieces on positions described by the input. The pieces of the white player are shown in upper-case letters, while the black player's pieces are lower-case letters. The letters are one of "K" (King), "Q" (Queen), "R" (Rook), "B" (Bishop), "N" (Knight), or "P" (Pawn). The chessboard outline is made of plus ("+"), minus ("-"), and pipe ("|") characters. The black fields are filled with colons (":"), white fields with dots (".").

Output

The output consists of two lines. The first line consists of the string "White: ", followed by the description of positions of the pieces of the white player. The second line consists of the string "Black: ", followed by the description of positions of the pieces of the black player.

The description of the position of the pieces is a comma-separated list of terms describing the pieces of the appropriate player. The description of a piece consists of a single upper-case letter that denotes the type of the piece (except for pawns, for that this identifier is omitted). This letter is immediatelly followed by the position of the piece in the standard chess notation -- a lower-case letter between "a" and "h" that determines the column ("a" is the leftmost column in the input) and a single digit between 1 and 8 that determines the row (8 is the first row in the input).

The pieces in the description must appear in the following order: King("K"), Queens ("Q"), Rooks ("R"), Bishops ("B"), Knights ("N"), and pawns. Note that the numbers of pieces may differ from the initial position because of capturing the pieces and the promotions of pawns. In case two pieces of the same type appear in the input, the piece with the smaller row number must be described before the other one if the pieces are white, and the one with the larger row number must be described first if the pieces are black. If two pieces of the same type appear in the same row, the one with the smaller column letter must appear first.

Sample Input

+---+---+---+---+---+---+---+---+
|.r.|:::|.b.|:q:|.k.|:::|.n.|:r:|
+---+---+---+---+---+---+---+---+
|:p:|.p.|:p:|.p.|:p:|.p.|:::|.p.|
+---+---+---+---+---+---+---+---+
|...|:::|.n.|:::|...|:::|...|:p:|
+---+---+---+---+---+---+---+---+
|:::|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|...|:::|...|:::|.P.|:::|...|:::|
+---+---+---+---+---+---+---+---+
|:P:|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|.P.|:::|.P.|:P:|...|:P:|.P.|:P:|
+---+---+---+---+---+---+---+---+
|:R:|.N.|:B:|.Q.|:K:|.B.|:::|.R.|
+---+---+---+---+---+---+---+---+

Sample Output

White: Ke1,Qd1,Ra1,Rh1,Bc1,Bf1,Nb1,a2,c2,d2,f2,g2,h2,a3,e4
Black: Ke8,Qd8,Ra8,Rh8,Bc8,Ng8,Nc6,a7,b7,c7,d7,e7,f7,h7,h6

这题很简单，做完后还帮自己巩固了一些知识

#include<cstdio> #include<iostream> using namespace std; char ch[20][35]; char ve[8]={'a','b','c','d','e','f','g','h'}; //已知内容的数组是这样定义的 int main() { int i,j,w=0,b=0,ct=1; for(i=1;i<=17;i++) for(j=1;j<=34;j++) //这里是34而非33，是因为还有一个\0,这非常重要，因为这让我纠结了很久才找到原因 { scanf("%c",&ch[i][j]); if(ch[i][j]>='A'&&ch[i][j]<='Z')w++; if(ch[i][j]>='a'&&ch[i][j]<='z')b++; } // printf("%d %d\n",w,b); printf("White: "); for(i=17;i>=1;i--) for(j=1;j<=34;j++) { if(ch[i][j]=='K') //这里不能用strcmp来比较，因为strcmp是字符串之间的比较，而对于单一字符的比较，直接比较就行 { // printf("%d %c\n",9-i/2,ve[j/4]); printf("K%c%d",ve[j/4],9-i/2); if(ct<w printf="" ct="" else="" printf="" n="" for="" i="17;i">=1;i--) for(j=1;j<=34;j++) if(ch[i][j]=='Q') { printf("Q%c%d",ve[j/4],9-i/2); if(ct<w printf="" ct="" else="" printf="" n="" for="" i="17;i">=1;i--) for(j=1;j<=34;j++) if(ch[i][j]=='R') { printf("R%c%d",ve[j/4],9-i/2); if(ct<w printf="" ct="" else="" printf="" n="" for="" i="17;i">=1;i--) for(j=1;j<=34;j++) if(ch[i][j]=='B') { printf("B%c%d",ve[j/4],9-i/2); if(ct<w printf="" ct="" else="" printf="" n="" for="" i="17;i">=1;i--) for(j=1;j<=34;j++) if(ch[i][j]=='N') { printf("N%c%d",ve[j/4],9-i/2); if(ct<w printf="" ct="" else="" printf="" n="" for="" i="17;i">=1;i--) for(j=1;j<=34;j++) if(ch[i][j]=='P') { printf("%c%d",ve[j/4],9-i/2); if(ct<w) { printf(","); ct++; } else printf("\n"); } ct=1; printf("Black: "); for(i=1;i<=17;i++) for(j=1;j<=34;j++) { if(ch[i][j]=='k') //这里不能用strcmp来比较，因为strcmp是字符串之间的比较，而对于单一字符的比较，直接比较就行 { // printf("%d %c\n",9-i/2,ve[j/4]); printf("K%c%d",ve[j/4],9-i/2); if(ct<b) { printf(","); ct++; }else printf("\n"); } } for(i=1;i<=17;i++) for(j=1;j<=34;j++) if(ch[i][j]=='q') { printf("Q%c%d",ve[j/4],9-i/2); if(ct<b) { printf(","); ct++; }else printf("\n"); } for(i=1;i<=17;i++) for(j=1;j<=34;j++) if(ch[i][j]=='r') { printf("R%c%d",ve[j/4],9-i/2); if(ct<b) { printf(","); ct++; }else printf("\n"); } for(i=1;i<=17;i++) for(j=1;j<=34;j++) if(ch[i][j]=='b') { printf("B%c%d",ve[j/4],9-i/2); if(ct<b) { printf(","); ct++; }else printf("\n"); } for(i=1;i<=17;i++) for(j=1;j<=34;j++) if(ch[i][j]=='n') { printf("N%c%d",ve[j/4],9-i/2); if(ct<b) { printf(","); ct++; }else printf("\n"); } for(i=1;i<=17;i++) for(j=1;j<=34;j++) if(ch[i][j]=='p') { printf("%c%d",ve[j/4],9-i/2); if(ct<b) { printf(","); ct++; }else printf("\n"); } return 0; } //一开始一直都是Presentation Error，，后来问了别人后才知道，都是少了一个空格。。 </w></w></w></w></w></iostream></cstdio>

最后一题就是我现在还在纠结的1/2，说真的这题我本来以为会很没有悬念的，毕竟A我都会做了，相反不是一样的道理吗？而理想总是和现实有那么点点的差距啦

3

B - Emag eht htiw Em Pleh

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

This problem is a reverse case of the problem 2996. You are given the output of the problem H and your task is to find the corresponding input.

Input

according to output of problem 2996.

Output

according to input of problem 2996.

Sample Input

White: Ke1,Qd1,Ra1,Rh1,Bc1,Bf1,Nb1,a2,c2,d2,f2,g2,h2,a3,e4
Black: Ke8,Qd8,Ra8,Rh8,Bc8,Ng8,Nc6,a7,b7,c7,d7,e7,f7,h7,h6

Sample Output

+---+---+---+---+---+---+---+---+
|.r.|:::|.b.|:q:|.k.|:::|.n.|:r:|
+---+---+---+---+---+---+---+---+
|:p:|.p.|:p:|.p.|:p:|.p.|:::|.p.|
+---+---+---+---+---+---+---+---+
|...|:::|.n.|:::|...|:::|...|:p:|
+---+---+---+---+---+---+---+---+
|:::|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|...|:::|...|:::|.P.|:::|...|:::|
+---+---+---+---+---+---+---+---+
|:P:|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|.P.|:::|.P.|:P:|...|:P:|.P.|:P:|
+---+---+---+---+---+---+---+---+
|:R:|.N.|:B:|.Q.|:K:|.B.|:::|.R.|
+---+---+---+---+---+---+---+---+

接下来是我的1/2，唉，无法通过，一直都是wa，但怎么找也找不出问题，样例也很perfect地通过了。（只有下次再来解决了，现在贴出来纯当前奏）

#include<cstdio> #include<iostream> #include<string> using namespace std; char ve[8]={'a','b','c','d','e','f','g','h'}; char ch[18][35]={ {""}, {" +---+---+---+---+---+---+---+---+"}, {" |...|:::|...|:::|...|:::|...|:::|"}, {" +---+---+---+---+---+---+---+---+"}, {" |:::|...|:::|...|:::|...|:::|...|"}, {" +---+---+---+---+---+---+---+---+"}, {" |...|:::|...|:::|...|:::|...|:::|"}, {" +---+---+---+---+---+---+---+---+"}, {" |:::|...|:::|...|:::|...|:::|...|"}, {" +---+---+---+---+---+---+---+---+"}, {" |...|:::|...|:::|...|:::|...|:::|"}, {" +---+---+---+---+---+---+---+---+"}, {" |:::|...|:::|...|:::|...|:::|...|"}, {" +---+---+---+---+---+---+---+---+"}, {" |...|:::|...|:::|...|:::|...|:::|"}, {" +---+---+---+---+---+---+---+---+"}, {" |:::|...|:::|...|:::|...|:::|...|"}, {" +---+---+---+---+---+---+---+---+"}, }; //string li="+---+---+---+---+---+---+---+---+"; int main() { string aa,bb; int x,y; int i,j; char ss; getline(cin,aa); getline(cin,bb); for(i=0;i<aa size="" i="" if="" aa="" i="" aa="" i="" 1="">='a'&&aa[i+1]<='z') aa.insert(i+1,"P"); //帅气的insert,这使我的后续步骤规划范了。开心 } for(i=0;i<bb size="" i="" if="" bb="" i="" bb="" i="" 1="">='a'&&bb[i+1]<='z') bb.insert(i+1,"P"); //帅气的insert,这使我的后续步骤规划范了。开心 } // cout<<ct<<endl; for(i=0;i<aa.size();i++) { if(aa[i]=='K') { for(j=0;j<8;j++) if(aa[i+1]==ve[j]) { x=(9-(aa[i+2]-48))*2; //特别注意，shtring里面的全是字符，里面的数字要减48后才能回归原来面貌 y=(j+1)*4-1; ch[x][y]='K'; // printf("%c\n",ch[x][y]); } } if(aa[i]=='Q') { for(j=0;j<8;j++) if(aa[i+1]==ve[j]) { x=(9-(aa[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='Q'; } } if(aa[i]=='R') { for(j=0;j<8;j++) if(aa[i+1]==ve[j]) { x=(9-(aa[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='R'; } } if(aa[i]=='B') { for(j=0;j<8;j++) if(aa[i+1]==ve[j]) { x=(9-(aa[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='B'; } } if(aa[i]=='N') { for(j=0;j<8;j++) if(aa[i+1]==ve[j]) { x=(9-(aa[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='N'; } } if(aa[i]=='P') { for(j=0;j<8;j++) if(aa[i+1]==ve[j]) { x=(9-(aa[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='P'; } } }for(i=0;i<bb.size();i++) { if(bb[i]=='K') { for(j=0;j<8;j++) if(bb[i+1]==ve[j]) { x=(9-(bb[i+2]-48))*2; //特别注意，shtring里面的全是字符，里面的数字要减48后才能回归原来面貌 y=(j+1)*4-1; ch[x][y]='k'; // printf("%c\n",ch[x][y]); } } if(bb[i]=='Q') { for(j=0;j<8;j++) if(bb[i+1]==ve[j]) { x=(9-(bb[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='q'; } } if(bb[i]=='R') { for(j=0;j<8;j++) if(bb[i+1]==ve[j]) { x=(9-(bb[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='r'; } } if(bb[i]=='B') { for(j=0;j<8;j++) if(bb[i+1]==ve[j]) { x=(9-(bb[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='b'; } } if(bb[i]=='N') { for(j=0;j<8;j++) if(bb[i+1]==ve[j]) { x=(9-(bb[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='n'; // cout<<ve[j]<<endl; } } if(bb[i]=='P') { for(j=0;j<8;j++) if(bb[i+1]==ve[j]) { x=(9-(bb[i+2]-48))*2; y=(j+1)*4-1; ch[x][y]='p'; } } } for(i=1;i<=17;i++) for(j=1;j<=34;j++) { printf("%c",ch[i][j]); if(j==34)printf("\n"); } //for(j=1;j<=34;j++) // cout<<ch[2][j]; return 0; } //明明把样例输出了，怎么还会错，！！！！ </bb></aa></string></iostream></cstdio>

虽然是wa，但是在做这道题的时候，却学会了一个新知识 string中运用insert，啊哈，付出没有白费哈， 晚安，世界^ ^