【TMD模拟赛】黄金拼图 Cao

正解：Cao

据说这样的题是用来骗丛林生物上树的......

这样的题除了考观察力之外还.........我们发现他异或了opt，恩，就这样，用离线推答案.....

#include <cstdio>
#include <cstring>
#include <algorithm>
const int N=;
int n,k,m,s[N],last_l,last_r;
inline bool is(int x){
  for(int i=;i*i<=x;++i)
    if(x%i==)return false;
  return true;
}
int main(){
  scanf("%d%d%d",&n,&k,&m);
  for(int i=;i<=n;++i)
    scanf("%d",&s[i]);
  int need=;
  for(int i=;i<=m;++i){
    int opt,x,y;
    scanf("%d%d%d",&opt,&x,&y);
    if(opt==){last_l=x,last_r=y,need=;continue;}
    if(opt==){s[x]=y;continue;}
    if(opt&){
      if(need)printf("%d\n",opt^),need=;
      s[x^(opt^)]=y^(opt^);
    }else{
      if(need)printf("%d\n",opt^),need=;
      last_l=x^(opt^),last_r=y^(opt^),need=;
    }
  }
  if(need){
    std::sort(s+last_l,s+(last_r+));
    for(int i=last_l;i<=last_r;++i)
      if(is(s[i])){
        --k;
        if(k==){
          printf("%d\n",s[i]);
          break;
        }
      }
  }
  return ;
}