#include<bits/stdc++.h>
#define ll long long
using namespace std;
//这道题不用考虑k等于几,根据公式得x=n/(1+2+4+...),只要得到整数x即可
int main()
{
ll t,k,x,n;
cin>>t;
for(int i=0;i<t;i++)
{
cin>>n;
ll j=1,s=1;
while(j*=2)
{
s+=j;
if(n%s==0)
{
cout<<n/s<<endl;
break;
}
}
}
}
相关文章
- 03-255.23 Vj B - Balanced Array
- 03-255.29 VJ F - Eugene and an array
- 03-25VJ - dp - Monkey and Banana - 最长单调序列
- 03-256.2 VJ C - Exercising Walk
- 03-255.23 Vj A - Candies
- 03-25VJ - dp - 完全背包问题
- 03-25VJ基础练习题三 J - 最小长方形
- 03-251431. Kids With the Greatest Number of Candies
- 03-251431. Kids With the Greatest Number of Candies
- 03-25VJ - H - Almost the shortest route - 图论(反向建图)