[蓝桥杯][2020年第十一届真题第一场]整除序列

解题思路：签到题，直接暴力解，主要是开longlong

#include<bits/stdc++.h>
#define x first
#define y second
#define mem(h) memset(h,-1,sizeof h)
#define mcp(a,b) memcpy(a,b,sizeof b)
using namespace std;
typedef long long LL;
typedef unsigned long long ull; 
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
namespace IO{
	inline LL read(){
		LL o=0,f=1;char c=getchar();
		while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
		while(c>='0'&&c<='9'){o=o*10+c-'0';c=getchar();}
		return o*f;
	}
}using namespace IO;
//#############以上是自定义技巧（可忽略）########## 
const int N=1e4+7,M=2e5+7,INF=0x3f3f3f3f,mod=1e8+7,P=131;
LL n;
int main(){
	cin>>n;
	while(n>1){
		cout<<n/2<<" ";
		n/=2;
	}
	return 0;
}