1023. Have Fun with Numbers (20)

1.20位的数字，超过了unsigned long long的取值

2.采用string进行存储和检测

3.用哈希进行相同位检测

//#include<string>//#include <iomanip>#include<vector>#include <algorithm>//#include<stack>#include<set>#include<queue>#include<map>//#include<unordered_set>//#include<unordered_map>//#include <sstream>//#include "func.h"//#include <list>#include<stdio.h>#include<iostream>#include<string>#include<memory.h>#include<limits.h>using namespace std;/*30011111The Testing BookYue Chentest code debug sort keywords20113333333Another Testing BookYue Chentest code sort keywordsZUCS Print220122222222The Testing BookCYLLkeywords debug bookZUCS Print2201161: The Testing Book2: Yue Chen3: keywords4:5: 20113: blablabla*/int str2int(string s){int a = 0;for (int i = 0; i < s.size(); i++){a = s[i] - '0' + a * 10;}return a;}int main(void){string s;cin >> s;string t = "";int carry = 0;bool ans = true;for (int i = s.size() - 1; i >= 0; i--){int digit = (s[i] - '0') * 2 + carry;carry = digit / 10;char c = digit % 10 + '0';t = c + t;}if (carry != 0){ans = false;char c = carry + '0';t = c + t;}if (ans){int digit[10] = { 0 };for (int i = 0; i < s.size(); i++){digit[s[i] - '0']++;digit[t[i] - '0']--;}for (int i = 0; i < 10; i++){if (digit[i] != 0) ans = false;}}if (ans) cout << "Yes" << endl;else cout << "No" << endl;cout << t << endl;return 0;}