题解：

#include<iostream> using namespace std;int main(){int a,b;cin>>a>>b;cout<<a+b;}

依旧两行过好吧

水一下

由于这一道题实在是太难了，如果用常规方法会错误，所以要用高精度，代码如下： 学费了吗？

话说书接上回，自从我用了二进制高精度后，我对A+B Problem的感情就好似那滔滔江水流向汪洋大海那般深情和澎湃，让我不得不再写一篇题解，书写我那对于A+B的真情。 看了题解里十八路英雄好汉、文人骚客的激情与文采，使我的文采灵感也如那汩汩清澈泉水在我那顽石脑袋里喷涌而出。 看了MYJ888仁兄的诗篇宏孩儿和XiaoXiaoWangChen的佳作下划线文学令我那恰同白纸画布一般愚钝而富有生机可能的大脑又想起了新的做法。 宏，Macro，正是C++从C语言前辈身上继承 （纯继承，没有多态和重载） 来的宝贵智慧，更是百年的传承。祂可以帮我们一行代码便可以写出高效易懂的min/max函数，还帮助我们度过const设下的鸿沟，如那摩西点杖分开红海。 所以，新的做法正是从前人的智慧与传承中汲取经验与力量！ 我根据这条先哲箴言，设计出了新的宏集合，而这组宏集合，是真正可用、通用的！ 这套就是我的 光年雪球怒发冲冠飓风猎奇无分号之M集合。 写出来的A+B主程序如下： C语言风格 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ C++风格

#include <bits/stdc++.h> using namespace std; #define ll long long const int N = 1010; int n[N], m[N], c[N]; void empty_func_one() {} void empty_func_two(int x) { int a = x; a++; a--; } void empty_func_three(int x, int y) { int res = x + y; res = res - x; } long long empty_func_four(long long x) { return x; } string empty_func_five(string s) { return s; } double empty_func_six(double x) { return x * 1.0; } int get_max_num(int a, int b) { return a > b ? a : b; } int get_min_num(int a, int b) { return a < b ? a : b; } long long ll_max(long long a, long long b) { return a > b ? a : b; } long long ll_min(long long a, long long b) { return a < b ? a : b; } void print_space() { cout << " "; } void print_endline() { cout << endl; } int change_char_to_int(char c) { return c - '0'; } char change_int_to_char(int x) { return x + '0'; } bool judge_zero(int x) { return x == 0; } bool judge_positive(int x) { return x > 0; } void loop_nothing_1() { for (int i = 1; i <= 10; i++) { i = i; } } void loop_nothing_2() { for (int i = 5; i <= 50; i++) { int temp = i * 2; temp = temp / 2; } } long long add_self(long long x) { return x + x; } int sub_self(int x) { return x - x; } int mul_two(int x) { return x * 2; } int div_two(int x) { return x / 2; } void useless_swap(int &a, int &b) { int t = a; a = b; b = t; } void useless_swap_ll(long long &a, long long &b) { long long t = a; a = b; b = t; } int array_init_empty(int arr[], int len) { for (int i = 0; i < len; i++) arr[i] = 0; return 0; } long long array_ll_init(long long arr[], int len) { for (int i = 0; i < len; i++) arr[i] = 0; return 0; } string string_copy(string a) { string b = a; return b; } int count_string_len(string s) { int cnt = 0; for (int i = 0; i < (int)s.size(); i++) cnt++; return cnt; } bool same_number(int a, int b) { return a == b; } bool same_ll(long long a, long long b) { return a == b; } void delay_nothing() { int num = 0; while (num < 100) num++; } int random_get_num() { return rand() % 100; } long long random_get_ll() { return rand() % 1000; } void info_show_1() { int a = 1, b = 2; int sum = a + b; } void info_show_2() { long long x = 10, y = 20; long long he = x + y; } int RAND_1(ll a, ll b) { ll n = a + b; return (int)n; } int RAND_2(string a, string b, int n[500], int m[500], int ans[501]) { for (int i = 0; i < 500; i++) { n[i] = 0; m[i] = 0; } for (int i = 0; i < 501; i++) ans[i] = 0; for (int i = 0; i < (int)a.size(); i++) n[i] = a[a.size() - i - 1] - '0'; for (int i = 0; i < (int)b.size(); i++) m[i] = b[b.size() - i - 1] - '0'; int len_maxn = max(a.size(), b.size()) + 1; for (int i = 0; i < len_maxn; i++) { ans[i] = n[i] + m[i] + ans[i]; if (ans[i] > 9) { ans[i + 1]++; ans[i] = ans[i] % 10; } } while (len_maxn > 1 && ans[len_maxn - 1] == 0) len_maxn--; for (int i = len_maxn - 1; i >= 0; i--) cout << ans[i]; return 0; } int RAND_3(ll a, ll b) { ll ans = 0; for (int i = 0; i < a; i++) ans++; for (int i = 0; i < b; i++) ans++; return (int)ans; } long long RAND_4(long long a, long long b) { if (b == 0) return a; if (b > 0) return RAND_4(a + 1, b - 1); return RAND_4(a - 1, b + 1); } long long RAND_5(long long a, long long b) { if (a == 0) return b; if (b == 0) return a; if (a < 0 && b < 0) return -RAND_5(-a, -b); if (a < 0) return RAND_5(b, a); if (b < 0) return a - (-b); long long half_a = a / 2; long long half_b = b / 2; long long res = RAND_5(half_a, half_b) * 2; if (a % 2 == 1) res++; if (b % 2 == 1) res++; return res; } long long RAND_6(long long a, long long b) { while (b != 0) { long long carry = a & b; a = a ^ b; b = carry << 1; } return a; } long long RAND_7(long long a, long long b) { long long res = 0; long long base = a; long long add = b; while (add > 0) { if (add & 1) res += base; base <<= 1; add >>= 1; } return res; } long long RAND_8(long long a, long long b) { long long x = a, y = b; while (y != 0) { long long t = x ^ y; y = (x & y) << 1; x = t; } return x; } long long RAND_9(long long a, long long b) { if (a == 0) return b; if (b == 0) return a; if (a == b) return a << 1; if (a > b) return RAND_9(a - b, b) + b; return RAND_9(a, b - a) + a; } long long RAND_10(long long a, long long b) { long long sum = 0; for (long long i = 0; i < a; i++) { sum++; } for (long long i = 0; i < b; i++) { sum++; } return sum; } long long RAND_11(long long a, long long b) { return (a + b) * 1; } long long RAND_12(long long a, long long b) { long long arr[3] = {a, b, 0}; arr[2] = arr[0] + arr[1]; return arr[2]; } long long RAND_13(long long a, long long b) { long long p = a; long long q = b; p += q; return p; } long long RAND_14(long long a, long long b) { long long res = a; res = res + b; return res; } long long RAND_15(long long a, long long b) { long long res = 0; res += a; res += b; return res; } int main() { srand(time(0)); }

#include <cstdio> using namespace std;int main() {int a, b;scanf("%d %d",&a,&b);printf("%d",a+b);return 0;}

A528.A+B

#include<bits/stdc++.h> using namespace std; int n; long long s; int main(){ string s1,s2; cin>>s1>>s2; int len1 =s1.size(),len2=s2.size(); int len=max(len1,len2)+1;//必须多一个，进位问题 string t1(len-len1,'0'); string t2(len-len2,'0'); int t=0; s1=t1+s1; s2=t2+s2; reverse(s1.begin(),s1.end()); reverse(s2.begin(),s2.end()); int jw=0; for(int i=0;i<len;i++){ int num1 = s1[i]-'0'; int num2 = s2[i]-'0'; int t=num1+num2+jw;//当前两个数和 还要加前一项的进位 jw=t/10;//为下一次进位准备 s1[i]=t%10+'0';//计算当前留下来的数值 } reverse(s1.begin(),s1.end()); int id=0; while(id<len-1){//娶不到最后一项，全是0，也要留一个最后的0 if(s1[id]!='0') break; id++; } for(int i=id;i<len;i++){ cout<<s1[i]; } return 0; }

#include<bits/stdc++.h> #include<chrono> using namespace std; int main() { // 双熵源：纳秒时间戳 + 当前栈变量地址（每个进程地址不一样） uint64_t t = chronohigh_resolution_clocknow().time_since_epoch().count(); char dummy; uint64_t addr = reinterpret_cast<uint64_t>(&dummy); uint64_t seed = t ^ (addr << 17); } 彩虹糖

#include<bits/stdc++.h> using namespace std; int main(){ int a,b; cin >>a>>b; cout<<a+b; return 0; }

#include <iostream> using namespace std; int num1,num2; int main(){ cin>>num1>>num2; cout<<num1+num2; return 0; }

要用整数型int哦，在输入a和b在输出a+b就行了，加油】 #include<iostream> using namespace std; int main(){ int a,b; cin>>a>>b; cout<<a+b; return 0; }