随笔分类 - gcd
摘要:k-roundingFor a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zero...
阅读全文
摘要:C. Marco and GCD Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn a dre...
阅读全文
摘要:Divisiblity of DifferencesYou are given a multiset of n integers. You should select exactly k of them in a such way that the differenc...
阅读全文
摘要:给出正整数 n 和 m,统计满足以下条件的正整数对 (a,b) 的数量:1. 1≤a≤n,1≤b≤m;2. a×b 是 2016 的倍数。Input输入包含不超过 30 组数据。每组数据包含两个整数 n,m (1≤n,m≤10 9).Output对于每组数据,输出一个...
阅读全文

浙公网安备 33010602011771号