zoukankan      html  css  js  c++  java
  • POJ 2167 Irrelevant Elements 质因数分解



    Irrelevant Elements
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 2231   Accepted: 550
    Case Time Limit: 2000MS

    Description

    Young cryptoanalyst Georgie is investigating different schemes of generating random integer numbers ranging from 0 to m - 1. He thinks that standard random number generators are not good enough, so he has invented his own scheme that is intended to bring more randomness into the generated numbers. 
    First, Georgie chooses n and generates n random integer numbers ranging from 0 to m - 1. Let the numbers generated be a1, a2, . . . , an. After that Georgie calculates the sums of all pairs of adjacent numbers, and replaces the initial array with the array of sums, thus getting n - 1 numbers: a1 + a2, a2 + a3, . . . , an-1 + an. Then he applies the same procedure to the new array, getting n - 2 numbers. The procedure is repeated until only one number is left. This number is then taken modulo m. That gives the result of the generating procedure. 
    Georgie has proudly presented this scheme to his computer science teacher, but was pointed out that the scheme has many drawbacks. One important drawback is the fact that the result of the procedure sometimes does not even depend on some of the initially generated numbers. For example, if n = 3 and m = 2, then the result does not depend on a2. 
    Now Georgie wants to investigate this phenomenon. He calls the i-th element of the initial array irrelevant if the result of the generating procedure does not depend on ai. He considers various n and m and wonders which elements are irrelevant for these parameters. Help him to find it out.

    Input

    Input contains n and m (1 <= n <= 100 000, 2 <= m <= 109).

    Output

    On the first line of the output print the number of irrelevant elements of the initial array for given n and m. On the second line print all such i that i-th element is irrelevant. Numbers on the second line must be printed in the ascending order and must be separated by spaces.

    Sample Input

    3 2

    Sample Output

    1
    2

    Source

    [Submit]   [Go Back]   [Status]   [Discuss]



    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <vector>
    
    using namespace std;
    
    const int maxn=100100;
    
    int n,m;
    int pm[maxn],pr[maxn],pc[maxn],pn;
    vector<int> ans;
    
    void f(int x,int d)
    {
        for(int i=0;i<pn;i++)
            while(x%pm[i]==0)
            {
                pc[i]+=d;
                x/=pm[i];
            }
    }
    
    bool check()
    {
        for(int i=0;i<pn;i++)
        {
            if(pc[i]<pr[i]) return false;
        }
        return true;
    }
    
    int main()
    {
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            ans.clear(); pn=0;
    
            /**********/
            for(int i=2;i*i<=m;i++)
            {
                if(m%i==0)
                {
                    pm[pn]=i;
                    while(m%i==0)
                    {
                        pr[pn]++;
                        m/=i;
                    }
                    pn++;
                }
            }
            if(m!=1)
            {
                pm[pn]=m;
                pr[pn++]=1;
            }
            /**********/
            n--;
            for(int i=1;i<=n;i++)
            {
                f(n-i+1,1);
                f(i,-1);
                if(check())
                {
                    ans.push_back(i+1);
                }
            }
    
            printf("%d
    ",ans.size());
            sort(ans.begin(),ans.end());
            for(int i=0,sz=ans.size();i<sz;i++)
            {
                printf("%d ",ans[i]);
            }
            putchar(10);
        }
        return 0;
    }
    



  • 相关阅读:
    刷题总结——跳蚤(poj1091容斥+分解质因数)
    刷题总结——分糖(ssoj 容斥原理+逆元+快速幂+组合数求插板)
    刷题总结——旅馆(bzoj1593线段树)
    刷题总结——树的同构(bzoj4337 树上hash)
    刷题总结——骑士的旅行(bzoj4336 树链剖分套权值线段树)
    刷题总结——松鼠的新家(bzoj3631)
    mysql备份与恢复
    nginx添加用户验证(访问服务器是的用户名密码)
    df命令
    org.mongodb.morphia.query.QueryException: sorting is not allowed for updates.
  • 原文地址:https://www.cnblogs.com/gccbuaa/p/6895829.html
Copyright © 2011-2022 走看看