Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- int solution(int N) {
- int maxGap=0, tmpMaxGap;
- int n=N;
- while(n%2==0){//najdu pravou 1
- n>>1;
- if(n==0)
- return maxGap;
- }
- while(true){
- tmpMaxGap=0;
- while(n%2==1){//preskacu vsechny 1
- n>>1;
- if(n==0)
- return maxGap;
- }
- while( n%2==0){//naakumuluju 0
- ++tmpMaxGap;
- n>>1;
- if(n==0)
- return maxGap;
- }
- maxGap=tmpMaxGap>maxGap ? tmpMaxGap : maxGap;
- }
- std::cout<<maxGap;
- return maxGap;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement