摘要: 链接: https://vjudge.net/problem/HDU 1573 题意: 求在小于等于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 in 阅读全文
posted @ 2019-11-03 23:05 YDDDD 阅读(96) 评论(0) 推荐(0) 编辑
摘要: 链接: https://vjudge.net/problem/POJ 2115 题意: A Compiler Mystery: We are given a C language style for loop of type for (variable = A; variable != B; var 阅读全文
posted @ 2019-11-03 22:57 YDDDD 阅读(119) 评论(0) 推荐(0) 编辑
摘要: 链接: https://vjudge.net/problem/POJ 2689 题意: The branch of mathematics called number theory is about properties of numbers. One of the areas that has c 阅读全文
posted @ 2019-11-03 22:40 YDDDD 阅读(105) 评论(0) 推荐(0) 编辑
摘要: 链接: https://vjudge.net/problem/POJ 2891 题意: Elina is reading a book written by Rujia Liu, which introduces a strange way to express non negative integ 阅读全文
posted @ 2019-11-03 22:35 YDDDD 阅读(128) 评论(0) 推荐(0) 编辑
摘要: 链接: https://vjudge.net/problem/POJ 2142 题意: Ms. Iyo Kiffa Australis has a balance and only two kinds of weights to measure a dose of medicine. For exa 阅读全文
posted @ 2019-11-03 22:11 YDDDD 阅读(89) 评论(0) 推荐(0) 编辑
摘要: 链接: https://vjudge.net/problem/POJ 1061 题意: 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没有约 阅读全文
posted @ 2019-11-03 22:02 YDDDD 阅读(95) 评论(0) 推荐(0) 编辑