eolymp
bolt
Try our new interface for solving problems
Problems

Fenwick Function

published at 2/16/24, 6:46:52 am

include<bits/stdc++.h>

using namespace std; int main() { long long n; cin>>n; long long k=1; while(n%2==0) { k=k*2; n/=2; } cout<<k; }

published at 4/3/24, 1:11:51 am

import java.util.Scanner;

public class Main { public static int getLargestPowerOfTwo(int n) { int m = n - (n & (n - 1)); return m; }

public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    int n = scan.nextInt();
    int m = getLargestPowerOfTwo(n);
    System.out.println(m);
    scan.close();
}

}