7 solutions
-
1
#include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; while(n--) { int x; cin>>x; vector<int> a; for(int i=1;i<=x/i;i++) { if(x%i==0) { a.push_back(i); if(x/i!=i) { a.push_back(a/i); } } } sort(a.begin(),a.end); for(auto x:a) cout<<x<<" "; cout<<endl; } return 0; }
-
1
#include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; while(n--) { int x; cin>>x; vector<int> v; for(int i=1;i<=x/i;i++) //枚举小因子 { if(x%i==0) { v.push_back(i); if(x/i!=i) //大小因子不同 { v.push_back(x/i); } } } sort(v.begin(),v.end()); //排序 for(auto x:v) { cout<<x<<" "; } cout<<endl; } return 0; }
-
0
#include<bits/stdc++.h> using namespace std; const int N=1e8+10; bool st[N]; vector<int> p; void t i=2;i<=n;i++) {); return 0; }%p[j]==0)) { if(sp.p int n; } }_back(i); }prime(int n for(int[i]==ush { if(i ci; prime(n);n>>n cout<<p.size( break; } } int main() {0) { for(int j=0;p[j]*i<=n;j++) { st[i*p[j]]=1;
-
0
#include <bits/stdc++.h> using namespace std; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { int a; vector <int>h; cin>>a; for(int j=1;j<=a/j;j++) { if(a%j==0) { h.push_back(j); if(a/j!=j)h.push_back(a/j); } } sort(h.begin(),h.end()); reverse(h.begin(),h.end()); while(h.size()) { cout<<h.back()<<" "; h.pop_back(); } cout<<endl; } return 0; }
-
-3
#include<bits/stdc++.h> using namespace std; int main() { int n,a; cin>>n; while(n--) { cin>>a; vector v; for(int i=1;i<=sqrt(a);i++) { if(a%i==0) { v.push_back(i); if(a/i!=i) { v.push_back(a/i); } } } sort(v.begin(),v.end()); for(auto x:v) cout<<x<<" "; cout<<endl; } return 0; }
- 1
Information
- ID
- 179
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 1
- Tags
- # Submissions
- 85
- Accepted
- 20
- Uploaded By