A - Move Right /247

最新推荐文章于 2024-09-28 22:05:59 发布

Lie ㅤ

最新推荐文章于 2024-09-28 22:05:59 发布

阅读量218

点赞数

文章标签：算法 c++

本文链接：https://blog.csdn.net/m0_61837058/article/details/124182481

版权

01序列移动人员分布循环右移字符串操作

关键词由CSDN通过智能技术生成

AtCoder 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

题目链接

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100 points

Problem Statement

There are 4 squares lined up horizontally.

You are given a string S of length 4 consisting of 0 and 1.
If the i-th character of S is 1, there is a person in the ii-th square from the left;
if the i-th character of S is 0, there is no person in the ii-th square from the left.

Now, everyone will move to the next square to the right simultaneously. By this move, the person who was originally in the rightmost square will disappear.

Determine if there will be a person in each square after the move. Print the result as a string in the same format as SS. (See also Sample Input / Output for clarity.)

Constraints

S is a string of length 4 consisting of 0 and 1.

Input

Input is given from Standard Input in the following format:

Output

Print a string of length 4 such that the ii-th character is 1 if there will be a person in the i-th square from the left after the move, and 0 otherwise.

Sample Input 1 Copy

Copy

Sample Output 1 Copy

Copy

After the move, the person who was originally in the 1-st square will move to the 2-nd square,
the person in the 3-rd square to the 4-th square,
and the person in the 4-th square will disappear.

Sample Input 2 Copy

Copy

Sample Output 2 Copy

Copy

Sample Input 3 Copy

Copy

Sample Output 3 Copy

Copy

翻译：给你一个01序列，0表示没有人，1表示有人，问你将这个01序列向后移动一个位置后的序列是什么

思路：第1个位置肯定是0，因为是新出现的位置，第二个位置是原来的第一个位置，本质应该是一个数组循环右移的问题，那么直接开一个新的字符串去复制一下就好了

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int main()
{
    string s;
    cin >> s;
    string res = "0";
    for (int i = 0; i < 3; i ++ )   res += s[i];
    cout << res << endl;
    return 0;
}