zoukankan      html  css  js  c++  java
  • cf #257(Div.2) A. Jzzhu and Children

    A. Jzzhu and Children
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    There are n children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from 1 to n. The i-th child wants to get at least ai candies.

    Jzzhu asks children to line up. Initially, the i-th child stands at the i-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:

    1. Give m candies to the first child of the line.
    2. If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home.
    3. Repeat the first two steps while the line is not empty.

    Consider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?

    Input

    The first line contains two integers n, m (1 ≤ n ≤ 100; 1 ≤ m ≤ 100). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 100).

    Output

    Output a single integer, representing the number of the last child.

    Sample test(s)
    input
    5 2
    1 3 1 4 2
    
    output
    4
    
    input
    6 4
    1 1 2 2 3 3
    
    output
    6
    
    Note

    Let's consider the first sample.

    Firstly child 1 gets 2 candies and go home. Then child 2 gets 2 candies and go to the end of the line. Currently the line looks like [3, 4, 5, 2] (indices of the children in order of the line). Then child 3 gets 2 candies and go home, and then child 4 gets 2 candies and goes to the end of the line. Currently the line looks like [5, 2, 4]. Then child 5 gets 2 candies and goes home. Then child 2 gets two candies and goes home, and finally child 4 gets 2 candies and goes home.    Child 4 is the last one who goes home.

    题意:要给n个人发糖果。每人发m颗。糖果有无限颗,可是每一个人须要的糖果数不同。所以要求这n个人自觉排队,自热是从1到n的顺序;假设第i个人拿到的糖果数目大于m则回家,否则继续排队直到拿满。问最后一个走的人是谁?

    解题思路:求出每一个人要拿满至少须要排几次队,取最大的次数的人,假设有同样的则输出最后那个的编号!

    #include<stdio.h>
    int main()
    {
        int n,m,i,max=0,k;
        int a[120];
        scanf("%d%d",&n,&m);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            if(a[i]%m!=0)a[i]=(a[i]/m)+1;
            else a[i]=a[i]/m;
            if(a[i]>=max)
            {
                max=a[i];
                k=i;
            }
        }
        printf("%d
    ",k);
        return 0;
    }


  • 相关阅读:
    airodump-ng的使用及显示
    bash shell 遍历一个数组
    cisco 交换机 IOS命令
    apt-key Debian packages密钥管理命令
    find命令的用法
    bash的快捷键
    groff编写man页
    tcpdump软件使用
    vue 项目常见功能(搜索 时间戳转换 过滤器)
    vue2.0 常见功能 (v-for 配置路由 组件渲染)
  • 原文地址:https://www.cnblogs.com/yfceshi/p/7069326.html
Copyright © 2011-2022 走看看