扩展欧几里得
pupil_blue
这个作者很懒,什么都没留下…
展开
-
POJ-----2891---Strange Way to Express Integers扩展欧几里得
Strange Way to Express Integers Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 14804 Accepted: 4856 Description Elina is reading a book written by Rujia原创 2016-11-27 00:36:06 · 230 阅读 · 0 评论 -
POJ-----1006---Biorhythms扩展欧几里得
Biorhythms Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 131903 Accepted: 42066 Description Some people believe that there are three cycles in a person's原创 2016-11-27 02:08:18 · 312 阅读 · 0 评论 -
HDOJ-----1573---X问题(扩展欧几里得)
X问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5621 Accepted Submission(s): 1919 Problem Description 求在小于等于N的正整数中有多少个X满足:X mod原创 2016-11-27 03:03:42 · 348 阅读 · 0 评论 -
HDOU-----3579---Hello Kiki扩展欧几里得
Hello Kiki Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3524 Accepted Submission(s): 1304 Problem Description One day I was shopp原创 2016-11-27 03:27:56 · 501 阅读 · 0 评论 -
POJ-----2115---C Looooops扩展欧几里得
C Looooops Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24687 Accepted: 6939 Description A Compiler Mystery: We are given a C-language style for loop of原创 2016-11-27 04:01:20 · 247 阅读 · 0 评论 -
HDOJ-----1576拓展欧几里德
递归思想欧几里得算法-----求最小公倍数#include int gcd(int a, int b) // 最大公约数 { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) // 最小公倍数 { return a / gcd(a, b) * b; } int main() { int a, b; scanf("%d%d"原创 2015-12-27 13:17:30 · 251 阅读 · 0 评论 -
HDOJ-----2669---Romantic扩展欧几里得
Romantic Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5444 Accepted Submission(s): 2295 Problem Description The Sky is Sprite. T原创 2016-11-27 04:40:15 · 219 阅读 · 0 评论 -
POJ-----1061拓展欧几里得
青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 106359 Accepted: 21065 Description 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰原创 2016-08-04 10:44:06 · 246 阅读 · 0 评论