Codeforces Round #469 (Div. 2) D. A Leapfrog in the Array (思维)
#include
using namespace std;
int main(){
long long n;
int m;
cin>>n>>m;
long long x;
for(int i=1;i<=m;i++){
cin>>x;
while(x%2==0)
x+=n-x/2;
cout<<(x/2)+1<<endl;
}
return 0;
}
原创
2018-03-10 10:41:36 ·
259 阅读 ·
0 评论