CF寒假补题——Everyone is a Winner

  On the well-known testing system MathForces, a draw of nn rating units is arranged. The rating will be distributed according to the following algorithm: if kk participants take part in this event, then the nn rating is evenly distributed between them and rounded to the nearest lower integer, At the end of the drawing, an unused rating may remain — it is not given to any of the participants.

For example, if n=5n=5 and k=3k=3, then each participant will recieve an 11 rating unit, and also 22 rating units will remain unused. If n=5n=5, and k=6k=6, then none of the participants will increase their rating.

Vasya participates in this rating draw but does not have information on the total number of participants in this event. Therefore, he wants to know what different values of the rating increment are possible to get as a result of this draw and asks you for help.

For example, if n=5n=5, then the answer is equal to the sequence 0,1,2,50,1,2,5. Each of the sequence values (and only them) can be obtained as ⌊n/k⌋⌊n/k⌋ for some positive integer kk (where ⌊x⌋⌊x⌋ is the value of xx rounded down): 0=⌊5/7⌋0=⌊5/7⌋, 1=⌊5/5⌋1=⌊5/5⌋, 2=⌊5/2⌋2=⌊5/2⌋, 5=⌊5/1⌋5=⌊5/1⌋.

Write a program that, for a given nn, finds a sequence of all possible rating increments.

Input

The first line contains integer number tt (1≤t≤101≤t≤10) — the number of test cases in the input. Then tt test cases follow.

Each line contains an integer nn (1≤n≤1091≤n≤109) — the total number of the rating units being drawn.

Output

Output the answers for each of tt test cases. Each answer should be contained in two lines.

In the first line print a single integer mm — the number of different rating increment values that Vasya can get.

In the following line print mm integers in ascending order — the values of possible rating increments.

Example

input

Copy

4
5
11
1
3

output

Copy

4
0 1 2 5 
6
0 1 2 3 5 11 
2
0 1 
3
0 1 3 

题目类型：整除分块

解题思路：题目中n的范围是1~1e9，关键是要尽量压缩时间；

 可以通过观察任意的n及其运算后的值寻找规律，越小的数字值的存续范围越大，通过直接获得左右边界来加快运算。

整除分块思想：遇到了一个数n，并且已得知得到它的左边界为l，则 可知k =[ n/l]的值为可能的结果之一，然后求取相除后答案依然为k的l的最大的取值即为[n/k]；

注意点：加速

错误代码：超时

#include<bits/stdc++.h>

using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t -- )
    {
        vector<int> v;
        int n;
        cin>>n;
        int c = 1;
        int f = n;
        v.push_back(0);
        v.push_back(1);
        while(--f)
        {
            if(n/f != c)
            {
                v.push_back(n/f);
                c = n/f;
            }
        }
        cout<<v.size()<<endl;
        for(int i = 0; i<=(int)v.size()-1; i++)
            cout<<v[i]<<' ';
        cout<<endl;
    }

    return 0;
}

AC代码1：

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int t;
    cin>>t;
    while(t -- )
    {
        set<int> v;
        int n;
        cin>>n;
        int r = 0;
        v.insert(0);
        for(int l=1; l <= n; l = r+1)
        {
            int k = n / l;
            r = n /k;//左右边界的运算结果相等放一个就行。
            v.insert(r);
        }
        cout<<v.size()<<endl;
        for(auto x : v)
         cout<<x<<' ';
        cout<<endl;
    }

    return 0;
}

AC代码2：

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int t;
    cin>>t;
    while(t -- )
    {
        set<int> v;
        int n;
        cin>>n;
        int f = sqrt(n)+1;//先开方（因为左边得到的商等于除这个商得到的另一个商）
        v.insert(0);
        while(--f )
        {
          v.insert(n/f);//暴力算右边界，set，自带去重。
          v.insert(f);//开根号后左边的f一定是满足条件的左值，直接加入
        }
        cout<<v.size()<<endl;
      //set里面会自动排序（从小到大），以后可以利用好这个特性
        for(auto x : v)
         cout<<x<<' ';
        cout<<endl;
    }

    return 0;
}

这个大佬写的整除分块敲详细可以瞅瞅：
(55条消息) 整除分块的平民分析法_gdhy9064的博客-CSDN博客