[sicily online]1052. Candy Sharing Game

來源:互聯網
上載者:User
/*直接類比ConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionA number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of candy. When the teacher blows a whistle, each student simultaneously gives half of his or her candy to the neighbor on the right. Any student, who ends up with an odd number of pieces of candy, is given another piece by the teacher. The game ends when all students have the same number of pieces of candy.Write a program which determines the number of times the teacher blows the whistle and the final number of pieces of candy for each student from the amount of candy each child starts with.InputThe input may describe more than one game. For each game, the input begins with the number N of students, followed by N (even) candy counts for the children counter-clockwise around the circle. The input ends with a student count of 0. Each input number is on a line by itself.OutputFor each game, output the number of rounds of the game followed by the amount of candy each child ends up with, both on one line.Sample Input6362222211222018161412108642424680Sample Output15 1417 224 8*/#include<iostream>#include <iomanip>#include<stdio.h>#include<cmath>#include<iomanip>#include<list>#include <map>#include <vector>#include <string>#include <algorithm>#include <sstream>#include <stack>#include<queue>#include<string.h>using namespace std;bool isEqual(vector<int> &data){for(vector<int>::size_type i=1;i<data.size();i++){if(data[i]!=data[i-1])return false;}return true;} int main(){int n;while(cin>>n&&n!=0){vector<int> data;for(int i=0;i<n;i++){//輸入資料int tmp;cin>>tmp;data.push_back(tmp);}int count=0;while(1){if(isEqual(data))break;count++;for(vector<int>::size_type i=0;i<data.size();i++)data[i]=data[i]/2;int tmpZero=data[0];for(vector<int>::size_type i=0;i<data.size()-1;i++){data[i]+=data[i+1];if(data[i]%2==1)data[i]++;}data[data.size()-1]+=tmpZero;if(data[data.size()-1]%2==1)data[data.size()-1]++;}//end whilecout<<count<<" "<<data[0]<<endl;}//end while cin}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.