摘要: "传送门" "原题" 题目里的 $111...11$ 让人很不爽 设 $111...11$ 为 $x$ $\because x \equiv k (mod m)$ $\therefore x 9+1 \equiv k 9+1 (mod m)$ $\therefore 10^n \equiv k 9+ 阅读全文
posted @ 2020-04-21 22:25 ZSH_ZSH 阅读(93) 评论(0) 推荐(1)