CareerCup

#include<iostream>

using namespace std;

int main()
{
int a;
cout<<"enter a positive number..."<<endl;
cin>>a;
cout<< (a+64 &(~63));
return 0;
}

Its easy

#include<iostream>

int main(){
int k;
cin>>k;
cout<<(1+((k)/64))*64;
return 0;

}

#include<iostream>
using namespace std;

int nextmultiple(int);

int main()
{
int n;
cin>>n;
cout<<endl<<nextmultiple(n)<<endl;

return 0;
}
int nextmultiple(int n)
{
if(n<64)return 64;
return ((n>>6)+1)<<6;
}

its pretty easy man... i am simply writing the algo...

int multiple64(int num){
int a=num/64;
return ((a+1)<<6);

// with out bitwise
#include<iostream>
int main(){
int n;
cin>>n;
cout<<(1+(n/64))*64;
return 0;
}

k=input/64
return 64<<(k+1)

public static int multiple64(int n){
	int mask=1<<31,pos=0;
	int i=0;
	for(i=0;i<32;i++){
		if(mask&n>0)break;
	}
	pos=32-i;
	return (pos>6)?1<<(pos+1):64;
}

k=input/64
return 64<<(k)

#include<iostream>
#include<stdint.h>
using namespace std;
#include<conio.h>
#include <bitset>
main()
{int n;
cin>>n;
n= n>>6;
n=n+1;
n= n<<6;

cout<<n;



getch();
return 0;
}

a + (64 - (a & 0x3f))

Use the following code to get the answer.

#include <stdio.h>
#include <math.h>

int main ()
{
  float param, result;
  scanf("%f", &param);
  int leftmostsetbit = (int)log2(param);
  int answer = 1;
  answer =  answer << (leftmostsetbit+1);
  if(answer < 64)
            printf("64\n");
  else
            printf("%d\n", answer);
  getch();
  return 0;
}