258A - Little Elephant and Bits - CodeForces Solution


greedy math *1100

Please click on ads to support us..

Python Code:

n=input()

min=int(n[0])
index=0
liste=[]

for i in range(len(n)):
    liste.append(n[i])

    if(int(n[i])<min):
        min=int(n[i])
        index=i

liste.remove(liste[index])


print("".join(liste))

C++ Code:

//Little Elephant and Bits

#include<bits/stdc++.h>

using namespace std;

void solve()

{

  string a;

  cin>>a;

  int flag=0,n=a.size();

  for(int i=0; i<n; i++)

  {

    if(a[i]=='0')

    {

      a.erase(i,1);

      flag=1;

      break;

    }

  }

  if(!flag) a.erase(0,1);

  cout<<a;

}



int main()

{

  ios_base::sync_with_stdio(0);

  cin.tie(0);

  solve();

}


Comments

Submit
0 Comments
More Questions

1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment
75A - Life Without Zeros
1519A - Red and Blue Beans
466A - Cheap Travel
659E - New Reform
1385B - Restore the Permutation by Merger
706A - Beru-taxi
686A - Free Ice Cream
1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs