Anxdada -- 我等风来也等你

传送门AC Codeconst int maxn = 1e3+5;int a[maxn],b[maxn];void solve(){ int n; while(~scanf("%d",&n)){ Fill(a,0); Fill(b,0); for(int i=0;i<=n;i++) a[i] = 1; for(int i=2;

/** @Cain*/#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <iostream>#include <queue>#include <stack>#include <vector>#include <map>#include <set>#include <bi