#include<bits/stdc++.h> using namespace std; vector<int> Next(string c){ vector<int>next; next.push_back(0); for(int i=1,j=0;i<c.length();i++){ while(j>0&&c[j]!=c[i]){ j=next[j-1]; } if(c[i]==c[j]){ j++; } next.push_back(j); } return next; } int main(){ string a,c; cin>>a>>c; vector<int> next= Next(c); for(int i=0,j=0;i<a.length();i++){ while(j>0&&a[i]!=c[j]){ j=next[j-1]; } if(a[i]c[j]) j++; if(jc.length()){ cout<<i-j+2<<endl; j=next[j-1]; } } for(int i=0;i<next.size();i++){ cout<<next[i]<<" "; } return 0; }

力求史上最长题解：

一下版本无注释，请谅解！ 如果满意，请评论，谢各位~

#include <bits/stdc++.h> 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; int b; cin >> a >> b; cout << a+b << endl; return 0; }

#include <cassert> #include <cctype> #include <cerrno> #include <cfloat> #include <ciso646> #include <climits> #include <clocale> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <cwchar> #include <cwctype> #include <ccomplex> #include <cfenv> #include <cinttypes> #include <cstdalign> #include <cstdbool> #include <cstdint> #include <ctgmath> #include <cuchar> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <array> #include <atomic> #include <chrono> #include <codecvt> #include <condition_variable> #include <forward_list> #include <future> #include <initializer_list> #include <mutex> #include <random> #include <ratio> #include <regex> #include <scoped_allocator> #include <system_error> #include <thread> #include <tuple> #include <typeindex> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <shared_mutex> #include <any> #include <optional> #include <string_view> #include <variant> //必备头文件 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, b; cin >> a >> b; cout << a + b; return 0;} 有帮助就赞一个！！！！！！！

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

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

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

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

#include<bits/stdc++.h> using namespace std; const int N=505; string s1,s2; int c[N],a[N],b[N]; int main(){ int la,lb,lc; cin>>s1>>s2; la=s1.size(); lb=s2.size(); for(int i=0;i<la;i++){ a[la-i]=s1[i]-'0'; } for(int i=0;i<lb;i++){ b[lb-i]=s2[i]-'0'; } lc=max(la,lb)+1; for(int i=1;i<=lc;i++){ c[i]+=a[i]+b[i]; c[i+1]=c[i]/10; c[i]=c[i]%10; } if(c[lc]==0){ lc--; } for(int i=lc;i>=1;i--){ cout<<c[i]; } return 0; }

#include<bits/stdc++.h> using namespace std; string bl(string a,string b){ string c(max(a.size(),b.size())+1,0); int i=a.size()-1,j=b.size()-1,k=c.size()-1; for(;i>=0||j>=0;i--,j--,k--){ int sum=c[k]; if(i>=0) sum+=a[i]-'0'; if(j>=0) sum+=b[j]-'0'; if(sum>=10){ c[k-1]=1; c[k]=sum-10; }else c[k]=sum; } for(int i=0;i<c.size();i++){; c[i]+='0'; } while(c.size()>1 && c.front()=='0') c.erase(c.begin()); return c; } int main(){ string a,b; cin>>a>>b; cout<<bl(a,b); return 0; }

#include<iostream> 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,b; cin >> a >> b; cout << a+b; }