- 通过查找表确定质数的有效bit数n
- 从被除数位数16开始循环(即i=16开始循环) 比较被除数右移i-n大于除数是否满足，满足时： 被除数减去左移i-n位的除数 商加向左移i-n位的1
- i-n等于0结束循环，比较余数是否到除数的一半，到了则商加1
共消耗16-n+3个周期得到结果，消耗周期14~17个
-
Notifications
You must be signed in to change notification settings - Fork 0
Hang-XX/tests_2022
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published