zoukankan      html  css  js  c++  java
  • codeforces-266B

    B. Queue at the School
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    During the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second.

    Let's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 to n, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i + 1)-th position, then at time x + 1 the i-th position will have a girl and the (i + 1)-th position will have a boy. The time is given in seconds.

    You've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after t seconds.

    Input

    The first line contains two integers n and t (1 ≤ n, t ≤ 50), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find.

    The next line contains string s, which represents the schoolchildren's initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals "B", otherwise the i-th character equals "G".

    Output

    Print string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal "B", otherwise it must equal "G".

    Examples
    input
    5 1
    BGGBG
    output
    GBGGB
    input
    5 2
    BGGBG
    output
    GGBGB
    input
    4 1
    GGGB
    output
    GGGB
    感觉像是冒泡排序
    #include<stdio.h>
    void main()
    {
        char a[100], temp;
        int i, j, n, times;
        scanf("%d%d", &n,&times);
        for (i = 0;i <= n;i++)
            scanf("%c", &a[i]);
        for (j = 0;j < times;j++)
        {
            for (i = 0;i < n ;i++)
                if (a[i] == 'B'&&a[i + 1] == 'G')
                {
                    temp = a[i];
                    a[i] = a[i + 1];
                    a[i + 1] = temp;
                    i++;
                }
        }
        for (i = 0;i <= n;i++)
            printf("%c", a[i]);
        printf("
    ");
    }
  • 相关阅读:
    PHP用curl发送get post put delete patch请求
    ubuntu中设置php7.0-fpm开机自启动
    对计算机领域中间层的理解
    后端程序猿怎能不会的linux命令
    查看磁盘空间和目录大小的命令
    Http协议详解
    supervisor使用总结
    vmware中扩充磁盘
    HDU 4946 共线凸包
    Codeforces_GYM Flight Boarding Optimization
  • 原文地址:https://www.cnblogs.com/chenruijiang/p/7832918.html
Copyright © 2011-2022 走看看