CareerCup

package com.home.careercup;

import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.Stream;

/*
50050055555555555510 base 10 =
11011110010001000101001101001111111110001100100100011100011 base 2
 */
public class NumberStreamModulo {
    public static void main(String[] args) {
        String stream = "11011110010001000101001101001111111110001100100100011100011";
        List<Character> list = stream.chars().mapToObj(x -> Character.valueOf((char) x)).collect(Collectors.toList());
        isDiv5(list.stream());
    }

    static void isDiv5(Stream<Character> s) {
        final int[] res = new int[]{0};
        final StringBuilder sb = new StringBuilder();
        s.forEach(d -> {
            sb.append(d);
            int bv = Character.valueOf(d) - Character.valueOf('0');
            res[0] = res[0] * 2 + bv;
            res[0] = res[0] % 5;
            System.out.printf("%s is %s divisible by 5%n", sb.toString(), res[0] == 0 ? "" : "NOT");

        });
    }
}

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main() {
    string n;
    while(cin>>n)
    {
        int a;
        long  s=bitset<128>(n).to_ulong();
        if(s%5==0)
        {
            cout<<"true"<<endl;
        }
        else
        {
            cout<<"false"<<endl;
        }
        //cin>>a;
        
    }
	//code
	return 0;
}

public static void main(String args[]) throws Exception {
		int K = 5;
		System.out.println(isBinaryDivisible(Long.toBinaryString(655515), K));
	}

	private static boolean isBinaryDivisible(String binaryString, int K) {
		char c[] = new StringBuilder(binaryString).reverse().toString().toCharArray();
		int rem = 0;
		for (int i = 0; i < c.length; i++) {
			rem = ((((int) Math.pow(2, i) * Integer.parseInt("" + c[i])) % K) + rem) % K;
		}
		return rem == 0;
	}