AcWing 869. 试除法求约数（枚举）

Posted 2022-02-20 MangataTS

题目连接

https://www.acwing.com/problem/content/871/

思路

就是我们从1枚举到$\sqrt{(}n)$如果能整除我们就放进map容器中最后遍历容器就好了

代码

#include<bits/stdc++.h>
using namespace std;
//----------------自定义部分----------------
#define ll long long
#define mod 1000000007
#define endl "\\n"
#define PII pair<int,int>
#define INF 0x3f3f3f3f

int dx[4] = -1, 0, 1, 0, dy[4] = 0, 1, 0, -1;

ll ksm(ll a,ll b) 
	ll ans = 1;
	for(;b;b>>=1LL) 
		if(b & 1) ans = ans * a % mod;
		a = a * a % mod;
	
	return ans;


ll lowbit(ll x)return -x & x;

const int N = 2e6+10;
//----------------自定义部分----------------
int t,n,m,q,a[N];
void slove()
	map<int,bool> vis;
	cin>>n;
	for(int i = 1;i * i <= n; ++i) 
		if(n % i == 0) vis[i] = vis[n/i] = true;
	
	for(auto it: vis)
		cout<<it.first<<" ";
	
	cout<<endl;
	


int main()

	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>t;
	while(t--)
		slove();
	
	
	return 0;