| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19747 | 陈路垚 | 洗牌 | C++ | Accepted | 100 | 1 MS | 264 KB | 292 | 2021-05-22 13:36:28 |
#include<bits/stdc++.h> using namespace std; int main() { int n,k,i,m,a[1000],b[1000],j; cin>>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]; } cout<<b[m-1]; return 0; }