文件名称:sgu261

  • 所属分类:
  • 数学计算/工程计算
  • 资源属性:
  • [C/C++] [源码]
  • 上传时间:
  • 2015-06-15
  • 文件大小:
  • 1kb
  • 下载次数:
  • 0次
  • 提 供 者:
  • owa***
  • 相关连接:
  • 下载说明:
  • 别用迅雷下载,失败请重下,重下不扣分!

介绍说明--下载内容均来自于网络,请自行研究使用

sgu261:Discrete Roots(原根+离散对数+扩展欧几里得)

题目大意:

给你两个质数p,k,和整数a(0≤a<p),求解所有满足x^k≡a(mod p)的x。-261. Discrete Roots



time limit per test: 1 sec.

memory limit per test: 65536 KB

input: standard

output: standard







There are a lot of mysteries and legends around computer science. One of the stories tells us about three Russian hackers who know the secret of breaking down widely used cryptographic algorithm. The fact itself threatens security of economics of many countries. Until recent time nobody knew anything about these hackers but now federal security bureau knows their names (Roman, Sergey and Andrew) and they also know that their hack method somehow uses discrete roots finding algorithm. And of course nobody knows this algorithm. We suggest you to try to solve much simpler task.

Given two prime numbers P and K (2 <= P <= 10^9, 2 <= K <= 100000) and integer number A (0 <= A < P) you are to find all the roots of the equation x^K = A mod P.



Input

Integer numbers P, K, A.



Output

The first line of output should contain number of roots of the eq
(系统自动生成,下载前可以参看下载内容)

下载文件列表





sgu261.cpp

相关说明

  • 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
  • 本站是交换下载平台,提供交流渠道,下载内容来自于网络,除下载问题外,其它问题请自行百度更多...
  • 请直接用浏览器下载本站内容,不要使用迅雷之类的下载软件,用WinRAR最新版进行解压.
  • 如果您发现内容无法下载,请稍后再次尝试;或者到消费记录里找到下载记录反馈给我们.
  • 下载后发现下载的内容跟说明不相乎,请到消费记录里找到下载记录反馈给我们,经确认后退回积分.
  • 如下载前有疑问,可以通过点击"提供者"的名字,查看对方的联系方式,联系对方咨询.

相关评论

暂无评论内容.

发表评论

*主  题:
*内  容:
*验 证 码:

源码中国 www.ymcn.org