zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 11 B. Seating On Bus 水题

    B. Seating On Bus

    题目连接:

    http://www.codeforces.com/contest/660/problem/B

    Description

    Consider 2n rows of the seats in a bus. n rows of the seats on the left and n rows of the seats on the right. Each row can be filled by two people. So the total capacity of the bus is 4n.

    Consider that m (m ≤ 4n) people occupy the seats in the bus. The passengers entering the bus are numbered from 1 to m (in the order of their entering the bus). The pattern of the seat occupation is as below:

    1-st row left window seat, 1-st row right window seat, 2-nd row left window seat, 2-nd row right window seat, ... , n-th row left window seat, n-th row right window seat.

    After occupying all the window seats (for m > 2n) the non-window seats are occupied:

    1-st row left non-window seat, 1-st row right non-window seat, ... , n-th row left non-window seat, n-th row right non-window seat.

    All the passengers go to a single final destination. In the final destination, the passengers get off in the given order.

    1-st row left non-window seat, 1-st row left window seat, 1-st row right non-window seat, 1-st row right window seat, ... , n-th row left non-window seat, n-th row left window seat, n-th row right non-window seat, n-th row right window seat.

    The seating for n = 9 and m = 36.
    You are given the values n and m. Output m numbers from 1 to m, the order in which the passengers will get off the bus.

    Input

    The only line contains two integers, n and m (1 ≤ n ≤ 100, 1 ≤ m ≤ 4n) — the number of pairs of rows and the number of passengers.

    Output

    Print m distinct integers from 1 to m — the order in which the passengers will get off the bus.

    Sample Input

    2 7

    Sample Output

    5 1 6 2 7 3 4

    Hint

    题意

    有一个公交车

    如果人数小于2n的话,那么这些人就只会坐在边上,是先坐左边,然后坐右边这样的

    如果大于等于2n的话,就会去坐中间,也是先坐左边,再坐右边

    走的时候,就先走第二列,然后走第一列,然后走第三列,然后走第四列这样的,依次走一个这样。

    问你这些人走的样子是什么样子

    题解:

    先走的奇数,然后再走偶数位置,先走大于2n的,再走小于的。

    代码

    #include<bits/stdc++.h>
    using namespace std;
    
    int main()
    {
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=2*n;i++)
        {
            if(2*n+i<=m)cout<<2*n+i<<" ";
            if(i<=m)cout<<i<<" ";
        }
        cout<<endl;
    }
  • 相关阅读:
    Oracle 11g导出空表
    如何破解ROS路由器禁用路由PPPOE拨号?
    Oracle入门心得(2)
    ORACLE了局,每天10问(五)
    若何消除Oracle数据库的安静隐患(3)
    Oracle入门心得(1)
    ORACLE用户自定义备份与恢复条记
    ORACLE成绩,每天10问(三)
    ORACLE问题,每天10问(一)
    怎样消除Oracle数据库的安全隐患(1)
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5373377.html
Copyright © 2011-2022 走看看