hhh
查看原帖
hhh
1012278
thy0510楼主2024/9/11 19:40
#include <iostream>
#include <string>
using namespace std;
string S[100]={
    "i++",       
    "j--",       
    "kz!=-1",    
    "reverse(line)" ,
    "return",       
    "(dr<tr+s)&&(dc<tc+s)",       
    "chessboard(tr,tc,tr+s-1,tc+s-1,s)",    
    "chessboard(tr,tc+s,tr+s-1,tc+s,s)",
    "chessboard(tr+s,tc,tr+s,tc+s-1,s)",       
    "chessboard(tr+s,tc+s,tr+s,tc+s,s)",       
    "change[i]>='A'&&change[i]<='Z'",    
    "str[i]>='A'&&str[i]<='Z'" ,
    "str[i]=change[str[i]-'a'];",       
    "ChangeString();",       
    "a[left]",    
    "a[j]<value" ,
    "a[i]>value",       
    "a[i]=value;",    
    "i+1,right,n" ,
    "FindKth(left,i-1,n);",       
    "0",       
    "tmp+a[i]==ans",    
    "<0" ,
    "i",       
    "tmp+=a[i]",       
    "0",    
    "hash[i][j]++" ,
    "work(x,y,tot+1)",       
    "hash[i][j]--",
    "work(0,0,0)",    
    "tmp = true" ,
    "p[j]",       
    "p[r]=i",       
    "p[j]+p[k]",    
    "1004" ,
    "num<=2",       
    "go(LEFT_TO_RIGHT)",       
    "pos[i]==LEFT",    
    "hour[i]+go(RIGHT_TO_LEFT)" ,
    "pos[i] = LEFT",       
    "cin>>b[i][j]",       
    "m1-m2+1",    
    "good = true" ,
    "m2",       
    "haveAns = true",       
    "ans.num[i+j-1]",    
    "ans.num[i]%=10" ,
    "a.num[i]+b.num[i]",       
    "ans.num[i]%2",       
    "ans.len++",    
    "a.len<b.len" ,
    "'0'",       
    "times(middle,middle),target",       
    "0",    
    "y[j]<y[i]" ,
    "f[i]++",       
    "f[i]>=max_f",       
    "ans=i",    
    "false" ,
    "used[data[i]]=false",       
    "j",       
    "n",    
    "break" ,
    "n+i-p",       
    "a[i]",       
    "n",    
    "i-p+1" ,
    "a[i-p]",
};

int main(){
    int a;
    cin >> a;
    cout << S[a-1];
    return 0;
}
2024/9/11 19:40
加载中...