状压DP？不像学生出的，背后必有高人指点

题目ID破案里

这真的是能做出来的吗

所以为设么叫失落的猴子

{
address[adr]=i;
puts("OK");
}
}
else if(cpt=="Client")
{
if(address.count(adr))printf("%d\n",address[adr]);
else puts("FAIL");
}
}
return 0;
}

if(0<=tmp&&tmp<=65535) return true;
else return false;
}
int main(){
freopen("csp2021pj_network.in","r",stdin);
freopen("csp2021pj_network.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
string cpt,adr;
cin>>cpt>>adr;
if(!check(adr))puts("ERR");
else if(cpt=="Server")
{
if(address.count(adr))puts("FAIL");
else

else if(s[i]==':') cnt2++;
if(cnt1<3&&cnt2) return false;
if(!cnt3) return false;
if(0<=tmp&&tmp<=255)
{
tmp=0;
continue;
}
else return false;
}
else if(s[i]<'0'||s[i]>'9') return false;
if(i&&!tmp&&s[i-1]=='0') return false;
tmp = tmp*10+s[i]-'0';
}
if(cnt1!=3||cnt2!=1||cnt3!=5) return false;

#include <bits/stdc++.h>
using namespace std;
int n;
map<string,int>address;
bool check(string s)
{
int len=s.length();
long long tmp=0;
int cnt1=0,cnt2=0,cnt3=0;
for(int i=0;i<len;i++)
{
if((i==0||(s[i-1]=='.'||s[i-1]==':'))&&s[i]>='0'&&s[i]<='9') cnt3++;
if(s[i]=='.'||s[i]==':')
{
if(s[i]=='.') cnt1++;
else if(s[i]==':') cnt2++;

回复 @回归运动 :
#include<bits/stdc++.h>
using namespace std;
bool cmp(int a,int b)
{
if()
}
int main() {
freopen("csp2021pj_sort.in","r",stdin);
freopen("csp2021pj_sort.out","w",stdout);
int n,q;
cin>>n>>q;
int a[n+1],b[n+1];
for(int y=1;y<=n;y++)
{cin>>a[y];
b[y]=y;
}
return 0;

回复 @*附加题* :

回复 @yrtiop :

普及组的剑也未必不利！

回复 @00000 :
zA

#include<bits/stdc++.h>
using namespace std;
int n;
void scrt(int a[],int x)
{for(int i=1;i<=n;i++)
for(int j=i;j>=2;j--)
{if(a[j]<a[j-1])
{if(x==j) x--;
else x++;
swap(a[j],a[j-1]);
}
}cout<<x<<endl;return;
}
int main()
{int q,s,x,y,a[8001]={},b[8001];
cin>>n>>q;
for(int i=1;i<=n;i++) {cin>>a[i];b[i]=a[i];}
while(q--)
{cin>>s;
if(s==1)
{cin>>x>>y;
a[x]=y;b[x]=y;}
else
{cin>>x;
scrt(a,x);
for(int i=1;i<=n;i++) {a[i]=b[i];}
}
}
return 0;}

回复 @2_16鸡扒拌面 :
turuy foure hiofd jiher

cout<<"/"<<2*a/t;
cout<<endl;
}
}
return 0;
}

y)==0)
{ k*=y;
d/=(y*y);
}
if(d==0||d==1)
{
t=abs(god(2*a,-b+k*d));
cout<<(-b+k*d)/t;
if(2*a/t != 1)
cout<<"/"<<2*a/t;
cout<<endl;
continue;
}
g:
t=abs(god(-b,2*a));
if(-b/t==0)
goto g;
cout<<-b/t;
if(2*a/t != 1)
cout<<"/"<<2*a/t;
cout<<"+";
t=abs(god(k,2*a));
if(k/t != 1)
cout<<k/t<<"*";
cout<<"sqrt("<<d<<")";
if(2*a/t != 1)

int t,m,a,b,c,d,q1,q2,q3,r,x,y,zi,mu;
cin>>t>>m;
for(int i=1;i<=t;i++)
{cin>>a>>b>>c;
if(a<0)
{a=-a;
b=-b;
c=-c;
}
d=b*b-4*a*c;mu=2*a;
if(d<0) cout<<"NO";
else if(d>=0)
{q2=iff(d);
if(q2*q2==d)
{zi=-b+q2;
zi=zi/gcd(

#include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
if(y == 0)return x;
x = abs(x),y = abs(y);
return gcd(y,x%y);
}
int iff(int d)
{int i=1,an;
for(i=1;i<=d;i++)
{if(d%(i*i)==0) an=i;
}
return i;
}
int main(){
freopen("uqe.in","r",stdin);
freopen("uqe.out","w",stdout);

#include<bits/stdc++.h>
using namespace std;
int god(int a,int b) {
if(b==0) return a;
else return god(b,a%b);
}
int main() {
freopen("uqe.in","r",stdin);
freopen("uqe.out","w",stdout);
int T, M;
cin >> T >> M;
while (T--) {
int a, b, c;
cin >> a >> b >> c;
int d=b*b-4*a*c;
if(d<0)
cout<<"NO";
else
{int p,q;
//★★☆
if(a>0)
{
a=-a;
b=-b;
c=-c;
}
int k=1,t;
for(int y=2;y*y<=d;y++)
while(d%(y*