Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
3328 | OscarWLY | 报数模拟 | C++ | Accepted | 0 MS | 256 KB | 343 | 2023-01-01 15:20:20 |
#include<bits/stdc++.h> using namespace std; int main() { queue<int> q; int n; cin>>n; for(int i=1;i<=n;i++) q.push(i); int cnt=0; for(int i=1;;i++) { if(i==n) { cout<<q.front(); break; } int m=q.front(); q.pop(); q.push(m); m=q.front(); q.pop(); q.push(m); q.pop(); } return 0; }