随笔分类 -  牛客网编程题

摘要:A题: "https://ac.nowcoder.com/acm/contest/3674/A" 题解: 给出m和n,分别对应斐波那契数列的第m项和第n项,求这两项的最大公约数。 注意:(1 ≤m,n ≤ 231 , GCD(m,n) ≤ 45) 对于gcd(m,n)比较小的来说,直接套结论即可。 阅读全文
posted @ 2020-01-17 23:19 化身孤岛的鲸o 阅读(260) 评论(0) 推荐(0)
摘要:"https://www.nowcoder.com/practice/93f2c11daeaf45959bb47e7894047085?tpId=98&tqId=32833&tPage=1&rp=1&ru=%2Fta%2F2019test&qru=%2Fta%2F2019test%2Fquestio 阅读全文
posted @ 2020-01-08 00:30 化身孤岛的鲸o 阅读(112) 评论(0) 推荐(0)
摘要:"https://www.nowcoder.com/practice/9407e24a70b04fedba4ab3bd3ae29704?tpId=98&tqId=32832&tPage=1&rp=1&ru=/ta/2019test&qru=/ta/2019test/question ranking" 阅读全文
posted @ 2020-01-07 23:20 化身孤岛的鲸o 阅读(257) 评论(0) 推荐(0)
摘要:"https://www.nowcoder.com/practice/bf877f837467488692be703735db84e6?tpId=98&tqId=32831&tPage=1&rp=1&ru=%2Fta%2F2019test&qru=%2Fta%2F2019test%2Fquestio 阅读全文
posted @ 2020-01-06 23:16 化身孤岛的鲸o 阅读(278) 评论(0) 推荐(0)
摘要:"https://www.nowcoder.com/practice/9173e83d1774462f81255a26feafd7c6?tpId=98&tqId=32830&tPage=1&rp=1&ru=%2Fta%2F2019test&qru=%2Fta%2F2019test%2Fquestio 阅读全文
posted @ 2020-01-06 15:44 化身孤岛的鲸o 阅读(139) 评论(0) 推荐(0)