4 条题解
-
0
#include<bits/stdc++.h> //#include<bits/extc++.h> //#define int long long//__int128 #define mmst0(x) memset(x,0,sizeof(x)) #define mmst3f(x) memset(x,0x3f3f3f3f,sizeof(x)) #define si(x) scanf("%d",&x) //scanf("%lld",&x) //When define int ll #define pb(x) emplace_back(x) #define mkp(x, y) make_pair(x, y) #define fi first #define se second #define YESS printf("YES\n") #define NOO printf("NO\n") //#define len (r-1+1) using namespace std; //using namespace __gnu_pbds; //If using pbds don't using std! typedef long long ll; //typedef long double rld; //use double pls! typedef unsigned long long ull; typedef pair<int, int> PII; const double eps = 1e-6; const int INF=0x3f3f3f3f;//0x3f3f3f3f3f3f3f3f;//LLINF const int MAXN=(int)75+3; const int N=505; const int M=55; const int maxn=510; const int mod=1e9; const int inf=0x7f7f7f7f; inline char nc() { static char buf[100000],*p1=buf,*p2=buf; return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++; } inline int read() { int s=0,w=1; char ch=nc(); while(!isdigit(ch)) { if(ch=='-')w=-1; ch=nc(); } while(isdigit(ch)) { s=(s<<3)+(s<<1)+(ch^48); ch=nc(); } return s*w; } //inline int read() { // int x; // FAKE QUICK READ,JUST FOR DEBUG // si(x); // return x; //} //inline void read(int &x){char ch=nc();x=0;while (!(ch>='0'&&ch<='9')) ch=nc();while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-48,ch=nc();}//根据参数个数自动选择 //void prt(int x){if(x<0){putchar('-');x=-x;}if(x>9)prt(x/10);putchar((char)(x%10+'0'));} int a1[maxn],b1[maxn],c[maxn]; inline void work(int CASE=1,bool FINAL_CASE=false) { string a,b; cin>>a>>b; int len=max(a.length(),b.length()); for(int i=a.length()-1,j=1;i>=0;i--,j++)a1[j]=a[i]-'0'; for(int i=b.length()-1,j=1;i>=0;i--,j++)b1[j]=b[i]-'0'; for(int i=1;i<=len;i++) { c[i]+=a1[i]+b1[i]; c[i+1]=c[i]/10; c[i]%=10; } if(c[len+1]) len++; for(int i=len;i>=1;i--) cout<<c[i]; return ; } signed main() { //ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); //freopen(".in", "r", stdin);//freopen(".out", "w", stdout); //signed T=(signed)read();//scanf("%d",&T);//cin>>T; int T=1; for(int CASE=1; CASE<=T; CASE++) { //printf("Case #%d: ",Case); //while(cin>>n) work(n); work(CASE,CASE==T); } return 0; }
信息
- ID
- 729
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 2
- 标签
- 递交数
- 398
- 已通过
- 239
- 上传者