http://acm.hdu.edu.cn/showproblem.php?pid=1339
数学+暴力搜索
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<bitset>
using namespace std;
int main()
{
int i , j , n;
int Case ;
scanf( "%d" , &Case ) ;
while( Case-- )
{
scanf( "%d" , &n ) ;
int ans = 0 ;
while( n % 2 == 0 )
{
n /= 2 ;
ans++ ;
}
printf( "%d %d\n" , n , ans ) ;
}
return 0 ;
}
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<bitset>
using namespace std;
int main()
{
int i , j , n;
int Case ;
scanf( "%d" , &Case ) ;
while( Case-- )
{
scanf( "%d" , &n ) ;
int flag = 0 ;
for( i = 1 ; ; i += 2 )
{
for( j = 0 ; ; ++j )
{
if( i * pow( 2 , j ) > n )
break ;
if( i * pow( 2 , j ) == n )
{
printf( "%d %d\n" , i , j ) ;
flag = 1 ;
break ;
}
}
if( flag )
break ;
}
}
return 0 ;
}