也是非常简单 #include<bits/stdc++.h> using namespace std; int a[10100],b[10100],c[10100]; int main(){ string s1 , s2; cin>>s1>>s2;//用字符串存储较大的数据 }

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

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

a, b = map(int, input().split()) print(a + b)

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

#include<iostream> #include<algorithm> #include<string> #include<queue> #include<stack> #include<iomanip>//头文件 using namespace std; int main() { int a, b;//定义a和b cin >> a >> b;//输入 cout << a + b; return 0;//结束 }

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

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

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

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

#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 main(){ int a; int b; cin >> a; cin >> b; cout << a+b; }

#include<bits/stdc++.h> using namespace std; int n,a[105],b[105]; void m_sort(int l,int r){ if(l>=r) return ; int mid=(l+r)/2; // cout<<"["; // for(int i=l;i<=mid;i++){ // cout<<a[i]<<" "; // } // cout<<"],["; // for(int i=mid+1;i<=r;i++){ // cout<<a[i]<<" "; // } // cout<<"]"<<endl; m_sort(l,mid); m_sort(mid+1,r); int i=l,j=mid+1,k=l; while(i<=mid && j<=r){ if(a[i]<=a[j]){ b[k++]=a[i++]; } else{ b[k++]=a[j++]; } } while(i<=mid){ b[k++]=a[i++]; } while(j<=r){ b[k++]=a[j++]; } for(int i=l;i<=r;i++){ a[i]=b[i]; } for(int i=1;i<=n;i++){ cout<<a[i]<<" "; } cout<<endl; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } m_sort(1,n); return 0; }

#include <bits/stdc++.h> using namespace std; #define ll long long const int N = 1010; int RAND_1(ll a,ll b){ ll n = a + b; return n; } int RAND_2(string a, string b, int n[500], int m[500], int ans[501]){ for(int i = 0; i < a.size(); i++) n[i] = a[a.size() - i - 1] - '0'; for(int i = 0; i < 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(ans[len_maxn - 1] == 0 && len_maxn > 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 ans; } int n[1010], m[1010],c[1010]; int main(){ srand(time(0)); ll a , b; string z , y; int x; x = 1 + rand() % 3; if(x == 1){ cin >> a >> b; int ans = RAND_1(a,b); cout << ans; } if(x == 2){ cin >> z >> y; RAND_2(z , y , n , m, c); } if(x == 3){ cin >> a >> b; int ans = RAND_3(a, b); cout << ans; } return 0; }

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

简单过不多解释（结尾还是有的） 先拆空格 再加加号 exec运行代码（即c = 1+2） 最后print出来