Information
- ID
- 6762
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 1
- Tags
- # Submissions
- 368
- Accepted
- 81
- Uploaded By
#include <iostream>
using namespace std;
int main() {
long long lkb, hzy;
cin >> lkb >> hzy;
cout << lkb + hzy;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e5+5;
const int mod=1e9+7;
int a,b;
signed main() {
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>a>>b;
cout<<a+b;
return 0;
}
#include <iostream>
using namespace std;
int main() {
long long lkb, hzy;
cin >> lkb >> hzy;
cout << lkb + hzy;
return 0;
}
#include using namespace std;
int main() { long long ts, th; cin >> ts >> th; cout << ts + th; return 0; }
很明显,新手可能并不知道如何使用加法符号,所以我们可以通过高精度来实现
#include<bits/stdc++.h>
using namespace std;
int a[250],b[250],c[250];
int main(){
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++)a[j]=A[i]-'0';
for(int i=B.length()-1,j=1;i>=0;i--,j++)b[j]=B[i]-'0';
for(int i=1;i<=len;i++){
c[i]+=a[i]+b[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 0;
}
//纯恶意,无娱乐
By signing up a HFOJ universal account, you can submit code and join discussions in all online judging services provided by us.