<\/p>\n
2 seconds<\/p><\/div>\n
256 megabytes<\/p><\/div>\n
standard input<\/p><\/div>\n
standard output<\/p><\/div>\n<\/div>\n
The Bitlandians are quite weird people. They do everything differently. They have a different alphabet so they have a different definition for a string.<\/p>\n
A Bitlandish string is a string made only of characters “0” and “1”.<\/p>\n
BitHaval (the mayor of Bitland) loves to play with Bitlandish strings. He takes some Bitlandish string\u00a0a<\/i>, and applies several (possibly zero) operations to it. In one operation the mayor may take any two adjacent characters of a string, define one of them as\u00a0x<\/i>\u00a0and the other one as\u00a0y<\/i>. Then he calculates two values\u00a0p<\/i>\u00a0and\u00a0q<\/i>:\u00a0p<\/i>\u2009=\u2009x<\/i>\u00a0xor<\/i>\u00a0y<\/i>,\u00a0q<\/i>\u2009=\u2009x<\/i>\u00a0or<\/i>\u00a0y<\/i>. Then he replaces one of the two taken characters by\u00a0p<\/i>\u00a0and the other one by\u00a0q<\/i>.<\/p>\n
The\u00a0xor<\/i>\u00a0operation means the bitwise excluding OR operation. The\u00a0or<\/i>\u00a0operation is the bitwise OR operation.<\/p>\n
So for example one operation can transform string\u00a011\u00a0to string\u00a010\u00a0or to string\u00a001. String\u00a01\u00a0cannot be transformed into any other string.<\/p>\n
You’ve got two Bitlandish strings\u00a0a<\/i>\u00a0and\u00a0b<\/i>. Your task is to check if it is possible for BitHaval to transform string\u00a0a<\/i>\u00a0to string\u00a0b<\/i>\u00a0in several (possibly zero) described operations.<\/p>\n<\/div>\n The first line contains Bitlandish string\u00a0a<\/i>, the second line contains Bitlandish string\u00a0b<\/i>. The strings can have different lengths.<\/p>\n It is guaranteed that the given strings only consist of characters “0” and “1”. The strings are not empty, their length doesn’t exceed\u00a0106<\/sup>.<\/p>\n<\/div>\n Print “YES” if\u00a0a<\/i>\u00a0can be transformed into\u00a0b<\/i>, otherwise print “NO”. Please do not print the quotes.<\/p>\n<\/div>\n <\/p>\n C. XOR and OR time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The Bitlandians are quite weird people. They do everything differently. They have a different alphabet so they … Continue reading 11 10<\/pre>\n<\/div>\n
YES<\/pre>\n<\/div>\n
1 01<\/pre>\n<\/div>\n
NO<\/pre>\n<\/div>\n
000 101<\/pre>\n<\/div>\n
NO<\/pre>\n<\/div>\n<\/div>\n<\/div>\n
\r\n#include <iostream>\r\n#include <cstdio>\r\n#include <cstdlib>\r\n#include <cstring>\r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tchar c;\r\n\tint ones1=0,zero1=0,ones2=0,zero2=0;\r\n\tint fs=1;\r\n\twhile(c=getchar())\r\n\t{\r\n\t\tif(1==fs)\r\n\t\t{\r\n\t\t\tif(c=='\\n')fs=2;\r\n\t\t\telse if(c=='1')ones1++;\r\n\t\t\telse zero1++;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tif(c=='\\n')break;\r\n\t\t\telse if(c=='1')ones2++;\r\n\t\t\telse zero2++;\r\n\t\t}\r\n\t}\r\n\tif(((ones2 && ones1) || ones2==ones1) && ones1+zero1==ones2+zero2)\r\n\t cout<<"YES"<<endl;\r\n\telse cout<<"NO"<<endl;\r\n\t\/\/system("pause");\r\n\treturn 0;\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"