摘要: Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives R... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(86) 评论(0) 推荐(0) 编辑
摘要: DescriptionGiven two integers: n and m and n is divisible by 2m, you have to write down the first n natura... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(90) 评论(0) 推荐(0) 编辑
摘要: DescriptionEkka and his friend Dokka decided to buy a cake. They both love cakes and that's why they want ... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(100) 评论(0) 推荐(0) 编辑
摘要: DescriptionYou task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(68) 评论(0) 推荐(0) 编辑
摘要: long long mid; long long ans; while(r>=l)//二分经典模板 { mid=(l+r)/2;... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(41) 评论(0) 推荐(0) 编辑
摘要: DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the o... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(63) 评论(0) 推荐(0) 编辑
摘要: Problem Description求A^B的最后三位数表示的整数。说明:A^B的含义是“A的B次方” Input输入数据包含多个测试实例,每个实例占一行,由两个正整数A和B组成(1int quickpow(i... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(79) 评论(0) 推荐(0) 编辑
摘要: DescriptionPeople are different. Some secretly read magazines full of interesting girls' pictures, others ... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(146) 评论(0) 推荐(0) 编辑
摘要: DescriptionFermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). ... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(63) 评论(0) 推荐(0) 编辑
摘要: Problem Descriptionsoda has a set S with n integers {1,2,…,n}. A set is called key set if the sum of integ... 阅读全文
posted @ 2019-12-12 09:00 千金一发 阅读(123) 评论(0) 推荐(0) 编辑