【第22期】观点:IT 行业加班,到底有没有价值?

poj2167 Irrelevant Elements

原创 2016年08月30日 13:46:30

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.

在纸上推一推可以发现,最后得到的每个元素的系数恰好是杨辉三角的第n行。另外很容易看出,一个元素是无关的,当且仅当他的系数是m的倍数。
于是问题就变成了求C(n-1,0),C(n-1,1)..C(n-1,n-1)中有多少是m的倍数。
很容易想到一种错误的做法,直接用C(n,k)=n!/(n-k)!k!在模m下计算。因为m不一定是质数,所以除数的逆并不一定存在。
可以利用递推式C(n,k)=C(n,k-1)*(n-k+1)/k进行计算,根据唯一分解定理,只要对每个m的质因数的指数进行加减即可。

#include<cstdio>
#include<cstring>
#include<cmath>
int m,n,a[1000010],p[1000010],now[1000010],ans[1000010];
int main()
{
    int i,j,k,x,y,z,tot=0,cnt=0;
    bool flag;
    scanf("%d%d",&n,&m);
    x=sqrt(m+0.5);
    for (i=2;i<=x;i++)
      if (m%i==0)
      {
        a[++tot]=i;
        while (m%i==0)
        {
            m/=i;
            p[tot]++;
        }
      }
    if (m>1)
    {
        a[++tot]=m;
        p[tot]=1;
    }
    for (i=1;i<n-1;i++)
    {
        x=n-i;
        y=i;
        for (j=1;j<=tot;j++)
          while (x%a[j]==0)
          {
            x/=a[j];
            now[j]++;
          }
        for (j=1;j<=tot;j++)
          while (y%a[j]==0)
          {
            y/=a[j];
            now[j]--;
          }
        flag=1;
        for (j=1;j<=tot;j++)
          if (p[j]>now[j])
          {
            flag=0;
            break;
          }
        if (flag) ans[++cnt]=i+1;
    }
    printf("%d\n",cnt);
    for (i=1;i<=cnt;i++)
      printf("%d%c",ans[i],i==cnt?'\n':' ');
}
版权声明:本文为博主原创文章,未经博主允许不得转载,欢迎添加友链。 举报

相关文章推荐

POJ 2167 Irrelevant Elements

题目链接: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=32215 经过紫书的分析,已经将问题转化为求组合数C(n...

POJ 2431 Expedition (贪心 + 优先队列)

Expedition Time Limit: 1000MS   Memory Limit: 65536K       Description ...

程序员升职加薪指南!还缺一个“证”!

CSDN出品,立即查看!

POJ 2167 Irrelevant Elements (math,brute force)

#include #include #include #include #include #include #include #include #include #include ...

POJ 2167 Irrelevant Elements 质因数分解

Irrelevant Elements Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 223...

POJ1625 DP+AC自动机+大数加法

题目描述:给n个可用字母,组成长为m的串s,其中有w个子串t是不能在这些串s中出现的,请问这样的串s有多少种? 思路:先建立一个ac自动机,并且标记每个w的结束节点end=1,同时把fail指向en...

POJ 2082 Terrible Sets 51nod 1102 面积最大的矩形 《题意好难懂---<贪心+单调栈>》

Terrible Sets Time Limit: 1000MS   Memory Limit: 30000KB   64bit IO Format: %lld & %llu Sub...

POJ 2455 Secret Milking Machine && 二分枚举 + 最大流

Secret Milking Machine Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10692   Ac...

poj3728之离线LCA+dp思想/RMQ+LCA(非常好的题目)

The merchant RMQ+LCA?LCA+DP Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 2740  ...

POJ 2167 Irrelevant Elements

题目链接: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=32215 经过紫书的分析,已经将问题转化为求组合数C(n...
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)