摘要:
code #include<algorithm> #include<iostream> using namespace std; void iswap(int a[],int x,int y){ if(a[x]==a[y]){ return; }else{ swap(a[x],a[y]); } } 阅读全文
摘要:
![](https://img2022.cnblogs.com/blog/1963362/202202/1963362-20220214213446279-1795587014.png) 阅读全文
摘要:
code #include<algorithm> #include<iostream> #include<cstring> using namespace std; int main(){ ios::sync_with_stdio(false); char s1[105],s2[105];//sto 阅读全文
摘要:
![](https://img2022.cnblogs.com/blog/1963362/202202/1963362-20220213173917555-1737231334.png) ![](https://img2022.cnblogs.com/blog/1963362/202202/1963362-20220216145556670-1693448417.png) 阅读全文
摘要:
code #include<cstring> #include<iostream> #include<vector> #include<sstream> #include<algorithm> #include<iomanip> using namespace std; struct Node{ s 阅读全文
摘要:
0x3f 阅读全文
摘要:
code #include<iostream> #include<algorithm> using namespace std; const int N=1000+10; bool cmp(int x,int y){ return x>y; } int f1[N],f2[N]; int main() 阅读全文
摘要:
code #include<cstdio> #include<algorithm> #include<iostream> using namespace std; void tran(int t){ if(t==0){ //TODO cout<<"00:00:00\n"; return; } int 阅读全文
摘要:
code #include<iostream> using namespace std; typedef long long LL; const int N=1500000,M=100010; int vis[N],prime[M]; LL f[M]; int main(){ ios::sync_w 阅读全文
摘要:
code #include<iostream> #include<algorithm> using namespace std; int len; string s; void recursion(int l,int r){ if(l==r||l>(len-1)/2){//single charac 阅读全文