摘要: 0、欧几里德定理 一切的基础,自然就是欧几里德定理了。它的形式非常简单(sometimes naive) gcd(a,b)=gcd(b,a mod b) 证明: 假设a,b的公约数为g,且$${a}={bx+y}{(x,y\in Z)}$$则显然有$${g \mid a},\qquad {g \mi 阅读全文
posted @ 2018-08-04 23:03 NoObsidian 阅读(133) 评论(0) 推荐(0) 编辑
摘要: A. Piles With Stones time limit per test: 1 second time limit per test: memory limit per test: 256 megabytes memory limit per test: Description There 阅读全文
posted @ 2018-08-01 23:11 NoObsidian 阅读(109) 评论(0) 推荐(0) 编辑
摘要: C. Fly time limit per test: 1 second time limit per test: memory limit per test:256 megabytes Description Natasha is going to fly on a rocket to Mars 阅读全文
posted @ 2018-08-01 17:12 NoObsidian 阅读(265) 评论(0) 推荐(0) 编辑