<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Primality-Test on</title><link>https://h30306.github.io/blog/zh-tw/tags/primality-test/</link><description>Recent content in Primality-Test on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Tue, 06 Sep 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/primality-test/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 762: Prime Number of Set Bits in Binary Representation</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-762/</link><pubDate>Tue, 06 Sep 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-762/</guid><description>LeetCode 762 解題筆記：數字最多 10^6 &amp;lt; 2^20，1 的個數最多 19，直接比對小質數集合</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-762/featured.png"/></item></channel></rss>