codeforces 710D Two Arithmetic Progressions (扩展中国剩余定理)
You are given two arithmetic progressions: a1k + b1 and a2l + b2. Find the number of integers x such that L ≤ x ≤ R andx = a1k' + b1 = a2l' + b2, for some integers k', l' ≥ 0.InputThe
原创
2016-08-23 09:13:14 ·
1233 阅读 ·
0 评论