08 2015 档案

HDU 1695 GCD（求两区间的互质数对+容斥原理）
摘要：DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x... 阅读全文
posted @ 2015-08-05 18:15 Bug_Clearlove 阅读(529) 评论(0) 推荐(0)
UVA 10200 Prime Time（简单素数判定预处理）
摘要：Euler is a well-known matematician, and, among many other things, he discovered that the formula n 2 + n + 41 produces a prime for 0 ≤ n #include #inc... 阅读全文
posted @ 2015-08-05 17:38 Bug_Clearlove 阅读(292) 评论(0) 推荐(0)
HDU 1452 FZU 1053 Happy 2004(逆元函数+因子和函数+大指数取模化简公式)
摘要：DescriptionConsider a positive integer X,and let S be the sum of all positive integer divisors of 2004^X. Your job is to determine S modulo 29 (the re... 阅读全文
posted @ 2015-08-05 17:11 Bug_Clearlove 阅读(412) 评论(0) 推荐(0)
低三位的数是8的倍数就可以被8整除
摘要：DescriptionYou are given a non-negative integern, its decimal representation consists of at most100digits and doesn't contain leading zeroes.Your task... 阅读全文
posted @ 2015-08-05 02:48 Bug_Clearlove 阅读(503) 评论(0) 推荐(0)
UESTC 288 青蛙的约会 （扩展欧几里得求解方程）
摘要：Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着某个... 阅读全文
posted @ 2015-08-05 02:42 Bug_Clearlove 阅读(236) 评论(0) 推荐(0)
UVA 11827 Maximum GCD ( 暴力搜+GCD函数 )
摘要：Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possible pair of these integers.InputThe first line of input... 阅读全文
posted @ 2015-08-05 00:00 Bug_Clearlove 阅读(319) 评论(0) 推荐(0)