编程介的小学生 2017-09-15 14:05 采纳率: 20.5%
浏览 838
已采纳

Ene's problem

Problem Description
Ene was a girl lives in computer systems. When she was studying the periodic sequence bn = Bn mod P (B is an integer and P is a prime number, n >= 0), she chose a contiguous subsequence bs, bs + 1, …, bt, and marked them as special numbers. Then she began to investigate another sequence an = M × An mod P, (M and A are integers) and incidentally such a problem came to her mind: what is the minimum non-negative integer k such that ak is a special number(k starts from 0) ?

As a result of Ene's ability to control a computer, she soon answered the question of herself. But as she had never taken any computer science courses, she could only enumerate all possible solutions to get the answer. Your task is to solve her questions faster, so your algorithm should possess a lot higher performance than hers.

Input
There are no more than 100 test cases in the input. In each case, you are given six integers M, A, B, s, t, P, satisfying 2 ≤ A, B, M < P ≤ 109,0 ≤ s ≤ t < P - 1, and P is a prime number. The input ends by 0 0 0 0 0 0.

Output
For each test case, output your answer k in one line. If there's no solution, output "impossible" (no quotes).

Sample Input
2 3 5 1 6 11
2 3 8 1 6 11
0 0 0 0 0 0

Sample Output
impossible
1

  • 写回答

1条回答

  • devmiao 2017-09-30 01:25
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥15 matlab图像高斯低通滤波
  • ¥15 针对曲面部件的制孔路径规划,大家有什么思路吗
  • ¥15 钢筋实图交点识别,机器视觉代码
  • ¥15 如何在Linux系统中,但是在window系统上idea里面可以正常运行?(相关搜索:jar包)
  • ¥50 400g qsfp 光模块iphy方案
  • ¥15 两块ADC0804用proteus仿真时,出现异常
  • ¥15 关于风控系统,如何去选择
  • ¥15 这款软件是什么?需要能满足我的需求
  • ¥15 SpringSecurityOauth2登陆前后request不一致
  • ¥15 禅道二次开发编辑版本,上传不了发行包