<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=PowerOfCryptography%2FHint</id>
	<title>PowerOfCryptography/Hint - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=PowerOfCryptography%2FHint"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=PowerOfCryptography/Hint&amp;action=history"/>
	<updated>2026-05-14T15:18:06Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.8</generator>
	<entry>
		<id>https://mediawiki.zeropage.org/index.php?title=PowerOfCryptography/Hint&amp;diff=37537&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:24, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=PowerOfCryptography/Hint&amp;diff=37537&amp;oldid=prev"/>
		<updated>2021-02-07T05:24:01Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;# 102 자리까지 p 가 입력될 수 있다. 그렇다면 이를 어떻게 입력받아야 될까?&lt;br /&gt;
*** 문자열로 입력받을수 있다.&lt;br /&gt;
# 꼭 루프를 사용해야 하나? &lt;br /&gt;
*** 간단한 수학식을 통해 O(1)안에 해결할 수 있다. Log를 이용해보자.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
[[PowerOfCryptography]]&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>