TopCoder SRM 664 Div2 Level One

Problem Statement

Limak is an old brown bear. Because of his bad eyesight he sometimes has to visit his doctor, Dr. Carrot. Today is one such day.

Dr. Carrot has a blackboard in his office. There is a number A written on the blackboard. In order to examine Limak’s eyesight, Dr. Carrot asked him to read the number. Limak couldn’t see the number really well. He could determine the number of digits correctly, but he was not sure what the individual digits are. Finally, he decided to announce the number B to the doctor. The doctor then left the office for a short while.

Limak really doesn’t want to wear glasses, so he has decided to cheat. As soon as the doctor left the room, Limak went to the blackboard to read the correct number A. Before the doctor returns, Limak has the time to change one of the digits of A to any different digit. (Note that he may not add any new digits to A and he may not completely erase any digits of A. He may only change at most one of the digits.) Limak hopes that he can deceive the doctor by changing the number A into his number B.

You are given the ints A and B. Return the string “happy” (quotes for clarity) if Limak can convince the doctor that his eyesight is good. Otherwise, return the string “glasses”.

Definition

Class:

BearCheats

Method:

eyesight

Parameters:

int, int

Returns:

string

Method signature:

string eyesight(int A, int B)

(be sure your method is public)

Limits

Time limit (s):

2.000

Memory limit (MB):

256

Stack limit (MB):

256

Constraints

A and B will be between 1 and 999,999, inclusive.

A and B will have the same number of digits.

Examples

0)

8072

3072

Returns: “happy”

Limak wants to change 8072 into 3072. He can do that by changing the digit 8 to a 3.

1)

508

540

Returns: “glasses”

Limak would need to change two digits, but he only has the time to change at most one.

2)

854000

854000

Returns: “happy”

It is possible that Limak read the number correctly. If that happens, he will not change any digits.

3)

1

6

Returns: “happy”

4)

385900

123000

Returns: “glasses”

题意

熊孩子检查视力，医生给了一个数字A，熊孩子给了一个数字B，然后医生出去了，熊孩子想改变数字A让自己通过检查，最多更改一位，不能增加或减少数字，问能否令A==B

题解

一位一位判断就好。。。

#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

class BearCheats {
public:
string eyesight(int, int);
};

string BearCheats::eyesight(int A, int B) {
if(A==B)
return string("happy");
int ans=0;
while(A&&B&&ans<=1)
{
if(A%10!=B%10)
ans++;
A/=10;
B/=10;
}
if(ans==1&&A==0&&B==0)
return string("happy");
else
return string("glasses");
}