📄 problem 1489.htm
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0047)http://acm.zju.edu.cn/show_problem.php?pid=1489 -->
<HTML><HEAD><TITLE>Problem 1489</TITLE>
<META http-equiv=Content-Type content="text/html; charset=gb2312">
<META content="MSHTML 6.00.2900.3157" name=GENERATOR></HEAD>
<BODY>
<CENTER><IMG src="Problem 1489.files/logo.gif" align=center></IMG></CENTER>
<HR>
<CENTER><FONT color=blue size=+2>2^x mod n = 1</FONT></CENTER>
<HR>
<CENTER><FONT color=green>Time limit:</FONT> 1 Seconds <FONT
color=green>Memory limit: </FONT>32768K </FONT><BR><FONT
color=green>Total Submit:</FONT> 7213 <FONT color=green>Accepted
Submit:</FONT> 1890 </CENTER>
<HR>
<P>Give a number n, find the minimum x that satisfies 2^x mod n = 1.</P>
<P><BR><B>Input</B></P>
<P>One positive integer on each line, the value of n.</P>
<P><BR><B>Output</B></P>
<P>If the minimum x exists, print a line with 2^x mod n = 1.</P>
<P>Print 2^? mod n = 1 otherwise.</P>
<P>You should replace x and n with specific numbers.</P>
<P><BR><B>Sample Input</B></P>
<P>2<BR>5</P>
<P><BR><B>Sample Output</B></P>
<P>2^? mod 2 = 1<BR>2^4 mod 5 = 1</P>
<P><B><BR>Author:</B> <I>MA, Xiao</I> </P>
<HR>
<FONT color=green size=+1>Problem Source: </FONT><I>ZOJ Monthly, February
2003</I>
<HR>
<CENTER><A href="http://acm.zju.edu.cn/submit.php?pid=1489">Submit</A>
<A href="http://acm.zju.edu.cn/list_problem.php?vol=5">Back</A>
<A
href="http://acm.zju.edu.cn/problem_status.php?pid=1489">Status</A> </CENTER>
<HR>
<CENTER>
<TABLE width="100%" border=0>
<TBODY>
<TR>
<TD align=right width="65%"><A href="http://acm.zju.edu.cn/"><FONT
color=red>Zhejiang University Online Judge</FONT></A> <A
href="http://acm.zju.edu.cn/"><FONT color=red>V1.0</FONT></A></TD>
<TD align=right width="35%"><A href="http://www.zzhang.cn/"><FONT
color=#ffffff
size=-3>Book</FONT></A></TD></TR></TBODY></TABLE></CENTER></BODY></HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -