![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 50
任鹏举
这个作者很懒,什么都没留下…
展开
-
HDoj 2014 判断互质
hide handkerchief Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4629 Accepted Submission(s): 2162 Problem Description The Chi原创 2016-12-10 14:09:11 · 324 阅读 · 0 评论 -
算法竞赛入门经典 竖式问题
#include #include int main() { int i, ok, abc, de, x, y, z, count = 0; char s[20], buf[99]; scanf("%s", s); for(abc = 111; abc for(de = 11; de { x = abc*(de%10); y =原创 2016-11-25 11:08:05 · 649 阅读 · 0 评论