zoukankan      html  css  js  c++  java
  • POJ

    这道题只要英语单词都认得,阅读没有问题,就做得出来。

    POJ - 1666 Candy Sharing Game

    Time Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64u

    Description

    A 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.

    Input

    The 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.

    Output

    For 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 Input

    6

    36

    2

    2

    2

    2

    2

    11

    22

    20

    18

    16

    14

    12

    10

    8

    6

    4

    2

    4

    2

    4

    6

    8

    0

    Sample Output

    15 14

    17 22

    4 8

    Hint

    Notes: The game ends in a finite number of steps because: 1. The maximum candy count can never increase. 2. The minimum candy count can never decrease. 3. No one with more than the minimum amount will ever decrease to the minimum. 4. If the maximum and minimum candy count are not the same, at least one student with the minimum amount must have their count increase

    Source

    Greater New York 2003

     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<math.h>
     4 #include<stdlib.h>
     5 
     6 int n, stu[1000], give[1000];
     7 
     8 
     9 int main()
    10 {
    11     while(scanf("%d", &n)) {
    12         if(!n) break;
    13         for(int i = 0; i < n; i++) {
    14             scanf("%d", &stu[i]);
    15         }
    16         int time = 0;
    17         while(true) {
    18             bool flag = 0;
    19             for(int i = 0; i < n; i++) {
    20                 if(i > 0 && stu[i] != stu[0]) {
    21                     flag = 1;
    22                     break;
    23                 }
    24             }
    25             if(!flag) break;
    26 
    27             time++;
    28 
    29             for(int i = 0; i < n; i++) {
    30                 give[i] = stu[i]/2;
    31             }
    32 
    33             for(int i = 0; i < n; i++) {
    34                 stu[i] = give[i] + give[(i+1)%n];
    35                 if(stu[i]%2) {
    36                     stu[i]++;
    37                 }
    38             }
    39 
    40         }
    41 
    42         printf("%d %d
    ", time, stu[0]);
    43 
    44     }
    45 
    46     return 0;
    47 }
  • 相关阅读:
    产品经理的未来在哪里
    如何打造一款成功的产品
    彻底解决Android 应用方法数不能超过65K的问题
    MVC,MVP 和 MVVM 的图示
    oracle最高账号sys的密码认证模式
    Android开发者必须深入学习的10个应用开源项目
    Android程序完全退出的三种方法
    Android-监听网络状态
    Android开发图片分辨率问题解决方案
    Android清除本地数据缓存代码
  • 原文地址:https://www.cnblogs.com/acmicky/p/3221071.html
Copyright © 2011-2022 走看看