Ultra-Fast Mathematician

简介: Ultra-Fast Mathematician

文章目录

一、Ultra-Fast Mathematician

总结


一、Ultra-Fast Mathematician

本题链接:Ultra-Fast Mathematician


题目:

A. Ultra-Fast Mathematician

time limit per test2 seconds

memory limit per test256 megabytes

nputstandard input

outputstandard output

Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.


One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.


In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.


Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won’t give anyone very big numbers and he always gives one person numbers of same length.


Now you are going to take part in Shapur’s contest. See if you are faster and more accurate.


Input

There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn’t exceed 100.


Output

Write one line — the corresponding answer. Do not omit the leading 0s.


Examples

input

1010100

0100101

output

1110001

input

000

111

output

111

input

1110

1010

output

0100

input

01110

01100

output

00010

本博客给出本题截图

题意:输入两个数,如果对应位置上分别是01的话,输出1,否则为0

AC代码

#include <iostream>
#include <string>
using namespace std;
int main()
{
    string a, b;
    cin >> a >> b;
    for (int i = 0; i < a.size(); i ++ )
        if (a[i] + b[i] == '1' + '0')
            cout << 1;
        else cout << 0;
    return 0;
}

总结

其实就是二进制异或运算


目录
相关文章
|
机器学习/深度学习 自然语言处理 计算机视觉
【计算机视觉】MDETR - Modulated Detection for End-to-End Multi-Modal Understanding
对于图像模型,MDETR采用的是一个CNN backbone来提取视觉特征,然后加上二维的位置编码;对于语言模态,作者采用了一个预训练好的Transformer语言模型来生成与输入值相同大小的hidden state。然后作者采用了一个模态相关的Linear Projection将图像和文本特征映射到一个共享的embedding空间。 接着,将图像embedding和语言embedding进行concat,生成一个样本的图像和文本特征序列。这个序列特征首先被送入到一个Cross Encoder进行处理,后面的步骤就和DETR一样,设置Object Query用于预测目标框。
《Towards A Fault-Tolerant Speaker Verification System A Regularization Approach To Reduce The Condition Number》电子版地址
Towards A Fault-Tolerant Speaker Verification System: A Regularization Approach To Reduce The Condition Number
86 0
《Towards A Fault-Tolerant Speaker Verification System A Regularization Approach To Reduce The Condition Number》电子版地址
|
Java
HDU - 2018 Multi-University Training Contest 1 - 1001: Maximum Multiple
HDU - 2018 Multi-University Training Contest 1 - 1001: Maximum Multiple
97 0
|
tengine 应用服务中间件 Linux
ModSecurity - Efficient and Free WAF Component for Mid- and Small-Scale Webmasters
ModSecurity is a free open source host WAF software (@http://www.modsecurity.org/).
2533 0
论文笔记之:Learning to Track: Online Multi-Object Tracking by Decision Making
Learning to Track: Online Multi-Object Tracking by Decision Making ICCV   2015     本文主要是研究多目标跟踪,而 online 的多目标检测的主要挑战是 如何有效的将当前帧检测出来的目标和之前跟踪出来的目标进行联系。
|
存储 SQL
[LeetCode] Populating Next Right Pointers in Each Node
The idea is similar to a level-order traversal and remember to take full advantages of the prefect binary tree assumption in the problem statement.
789 0