zrk-8008

摘要： void move(int *arr,int sz){ int left = 0; int right = sz - 1; while (left < right)//left必须小于right 防止指针越界 { //从左边找偶数 while (left < right && arr[left] % 阅读全文

摘要： int main(){ //方案1 int pay = 0; int sum = 0; scanf("%d", &pay); while (pay) { sum += pay; pay /= 2; } sum = sum + 1; printf("%d\n", sum); //方案2 int mon 阅读全文