| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19541 | 孙文谦 | 洗牌 | C++ | Accepted | 100 | 1 MS | 200 KB | 320 | 2021-05-16 16:54:51 |
#include<stdio.h> int main() { int n,k,i,m,a[1000],b[1000],j; scanf("%d %d %d",&n,&k,&m); for(i=0;i<n;i++) a[i]=i+1; while(k--) { j=0; for(i=0;i<n/2;i++) { b[j++]=a[i]; b[j++]=a[i+n/2]; } for(i=0;i<n;i++) a[i]=b[i]; } printf("%d",b[m-1]); return 0; }