园主の马蜂变迁

背景：我不知道哪天闲的没事瞟了一眼我三年前的缺省源，发现还不到现在长度的 \(1\over 3\)。

所以花了 \(\log_{2}(4.14952\times 10^{180})s\) （十分钟）抽了不同时期的缺省源配上 A+B Ploblem 的代码来进行了比较。如下：

---

\[2022.10 \]

#include<bits/stdc++.h>
using namespace std;
int main()
{
// freopen("interval.in","r",stdin);
// freopen("interval.out","w",stdout);
	long long a,b;
	cin>>a>>b;
	cout<<a+b;
	return 0;
}

---

\[2022.11 \]

#include<bits/stdc++.h>
using namespace std;
long long a,b;
int main()
{
// freopen("interval.in","r",stdin);
// freopen("interval.out","w",stdout);
	cin>>a>>b;
	cout<<a+b;
	return 0;
}

---

\[2023.3 \]

#include<bits/stdc++.h>
using namespace std;
long long a,b;
int main()
{
// freopen("interval.in","r",stdin);
// freopen("interval.out","w",stdout);
	scanf("%lld%lld",&a,&b);
	printf("%lld\n",a+b);
	return 0;
}

---

\[2023.5 \]

#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
long long a,b;
int main()
{
// freopen("interval.in","r",stdin);
// freopen("interval.out","w",stdout);
	a=read();b=read();
	cout<<a+b;
	return 0;
}

---

\[2023.7 \]

#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
int a,b;
signed main()
{
// freopen("interval.in","r",stdin);
// freopen("interval.out","w",stdout);
	a=read();b=read();
	cout<<a+b;
	return 0;
}

---

\[2024.1 \]

#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
const int maxn=1e6+10;
int a,b;
signed main()
{
// freopen("interval.in","r",stdin);
//	freopen("interval.out","w",stdout);
    a=read();b=read();
	cout<<a+b;
    return 0;
}

---

\[2024.5 \]

#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
const int mod=1e9+7;
const int maxn=1e6+10;
signed main()
{
// freopen("interval.in","r",stdin);
//	freopen("interval.out","w",stdout);
    return 0*printf("%lld\n",read()+read());
    return 0;
}

---

\[2024.6 \]

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#define int long long
using namespace std;
using namespace  __gnu_pbds;
//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int,less<int>,pairing_heap_tag> q;
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
const int mod=1e9+7;
const int maxn=1e6+10;
signed main()
{
// freopen("interval.in","r",stdin);
// freopen("interval.out","w",stdout);
	return 0*printf("%lld\n",read()+read());
}

\[2024.7 \]

#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
const int mod=998244353;
const int maxn=1e6+10;
signed main() 
{
#ifdef Lydic
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#endif
	cout<<read()+read();
    return 0;
}

\[2024.8 \]

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace std;
using namespace  __gnu_pbds;
tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> tr;//从小到大
int findnum(int k){auto it=tr.find_by_order(k-1);return ((it!=tr.end())?(*it):1e9+7);}//查元素
int findrank(int x){return tr.order_of_key(x)+1;}//查排名
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
const int mod=998244353;
const int maxn=1e6+10;
const int inf=1e17;

void Main()
{
	
}
signed main() 
{
#ifdef Lydic
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#endif
    int T=1;
	while(T--)Main();
	return 0;
}

\[2024.11 \]

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace  __gnu_pbds;
//tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> tr;//从小到大且可重
//int findnum(int k){auto it=tr.find_by_order(k-1);return ((it!=tr.end())?(*it):1e9+7);}//查元素
//int findrank(int x){return tr.order_of_key(x)+1;}//查排名
inline int read()
{
	int w=1,s=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
const int maxn=5e5+100;
const int mod=998244353;
const int inf=1e13+7;

signed main()
{
#ifdef Lydic
    freopen(".in","r",stdin);
    freopen(".out","w",stdout); 
#else
	freopen("xxxx.in","r",stdin);
	freopen("xxxx.out","w",stdout); 
#endif
	
	return 0;
}