好吃的题解

烤题解！烤题解！新鲜出炉的烤题解！

防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视防透视

正文

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<utility>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
using namespace std;void p(string s1,string s2){char s[1001]="";int l1=s1.size(),l2=s2.size(),a[10001]={},b[10001]={},c[10001]={};int len=max(l1,l2);for(int i=0;i<l1;i++)a[i]=s1[l1-i-1]-'0';for(int i=0;i<l2;i++)b[i]=s2[l2-i-1]-'0';for(int i=0;i<len;i++){c[i]+=a[i]+b[i];if(c[i]>=10){c[i+1]+=c[i]/10;c[i]%=10;}}if(c[len])len++;for(int i=len-1;i>=0;i--){cout<<c[i];}cout<<'\n';}int main(){string n,m;cin>>n>>m;p(n,m);return 0;}