zoukankan      html  css  js  c++  java
  • [CodeForces-259C] Little Elephant and Bits

    C. Little Elephant and Bits
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    The Little Elephant has an integer a, written in the binary notation. He wants to write this number on a piece of paper.

    To make sure that the number a fits on the piece of paper, the Little Elephant ought to delete exactly one any digit from number a in the binary record. At that a new number appears. It consists of the remaining binary digits, written in the corresponding order (possible, with leading zeroes).

    The Little Elephant wants the number he is going to write on the paper to be as large as possible. Help him find the maximum number that he can obtain after deleting exactly one binary digit and print it in the binary notation.

    Input

    The single line contains integer a, written in the binary notation without leading zeroes. This number contains more than 1 and at most 105digits.

    Output

    In the single line print the number that is written without leading zeroes in the binary notation — the answer to the problem.

    Examples
    input
    Copy
    101
    output
    Copy
    11
    input
    Copy
    110010
    output
    Copy
    11010
    Note

    In the first sample the best strategy is to delete the second digit. That results in number 112 = 310.

    In the second sample the best strategy is to delete the third or fourth digits — that results in number 110102 = 2610.

    #include<bits/stdc++.h>
    #define N 100005
    using namespace std;
    typedef long long ll;
    int main(){
        char a[N];
        int flag=-1;
        cin>>a;
        int len=strlen(a);
        for(int i=0;i<len;i++){
            if(a[i]=='0'){
    
                flag=i;
                break;
            }
        }
        if(flag==-1)flag=len-1;
        for(int i=0;i<len;i++)
        {
            if(flag==i)continue;
            cout<<a[i];
    
        }
    
        return 0;
    }
  • 相关阅读:
    HTML5项目笔记7:使用HTML5 WebStorage API构建与.NET对应的会话机制 Hello
    论设计模式和分析模式
    昨天我做了点什么事情啊?
    时间,时间,还是时间
    人生需要规划
    突然想起今天的博客汇报没写
    昨天看了熊猫大侠
    双休日往往会忘了写日志
    老婆说我是缺心眼!
    要下班了才想起没写报告
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/11386785.html
Copyright © 2011-2022 走看看