DTL66的博客

D - X问题 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u   Description 求在小于等于N的正整数中有多少个X满足：X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0

A. Divisibility time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Find the number of k-divisible numbers on th