1527A - And Then There Were K - CodeForces Solution

bitmasks *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):

    n = int(input())

    b, res = bin(n)[2:], float('inf')
    n = len(b)

    for i in range(n):
        if b[i] == '1':
            c = "1" * i + "0" + "1" * (n - i - 1)
            res = min(res, int(c, 2))

    print(res)

C++ Code: 

#include<iostream>
#include<map>
#include<set>    
#include<iterator>
#include<algorithm>
#include<vector>
#include <unordered_set>
#include<cmath>
#include<iomanip>
#include<utility>
using namespace std;
int main() {
	int g; cin >> g; while (g--) {
		double n; cin >> n;
		long long int a = log2(n);
		cout <<fixed<<setprecision(0)<< pow(2, a) - 1 << endl;
	}
}


Comments

Submit
0 Comments
More Questions

528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable