![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
文章平均质量分 77
Evelyn_y
这个作者很懒,什么都没留下…
展开
-
Aaronson
题目链接: http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=718&pid=1001求x的和,想要和最小,那么Xn就得尽可能大 基本就是从后往前开始除除减减 n是整型的数字,最大值2^32-1 当m大于32的时候就没意义,直接从31开始处理数据。#include<iostream>#include<cm原创 2016-09-24 13:24:38 · 392 阅读 · 0 评论 -
Codeforces Round 833A-The Meaningless Game
Codeforces原创 2017-07-31 10:50:28 · 408 阅读 · 0 评论 -
Codeforces Round 834B-The Festive Evening
Codeforces原创 2017-07-31 10:44:33 · 288 阅读 · 0 评论 -
ZOJ-3939 The lucky week
ACM原创 2017-04-24 21:07:22 · 382 阅读 · 0 评论 -
POJ-3176 Cow Bowling
简单dp原创 2017-02-20 21:05:06 · 212 阅读 · 0 评论 -
Rings
水题,补题原创 2016-09-08 21:47:19 · 744 阅读 · 2 评论 -
CodeForces-767A Snacktower
Snacktower原创 2017-02-21 19:54:12 · 775 阅读 · 0 评论 -
ZOJ-3944 People Counting
ACM原创 2017-04-19 22:00:05 · 343 阅读 · 0 评论 -
STL
STL原创 2017-04-27 21:37:57 · 1999 阅读 · 1 评论 -
VUA-10375 Choose and divide
The binomial coefficient C(m, n) is defined as C(m, n) = m!/[(m − n)! n!] Given four natural numbers p, q, r, and s, compute the the result of dividing C(p, q) by C(r, s).Input Input consists原创 2017-04-18 23:04:06 · 250 阅读 · 0 评论 -
ZOJ-3785 What day is that day?
It’s Saturday today, what day is it after 1^1 + 2^2 + 3^3 + … + N^N days?Input There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For e原创 2017-04-18 22:26:08 · 288 阅读 · 0 评论 -
ZOJ-3972 Beauty of Array
Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to know the summation of the beauty of all contiguous s原创 2017-04-12 22:03:34 · 241 阅读 · 0 评论 -
POJ-1930 Dead Fraction(简单数论)
Mike is frantically scrambling to finish his thesis at the last minute. He needs to assemble all his research notes into vaguely coherent form in the next 3 days. Unfortunately, he notices that h原创 2017-04-08 13:21:50 · 485 阅读 · 0 评论 -
POJ 3421 X-factor-Chains
Given a positive integer X, an X-factor chain of length m is a sequence of integers,1 = X0, X1, X2, …, Xm = XsatisfyingXi < Xi+1 and Xi | Xi+1 where a | b means a perfectly divides into b.Now we are in原创 2017-03-26 20:36:58 · 402 阅读 · 0 评论 -
HDU-5744 Keep On Moving
ACM原创 2017-03-05 22:35:52 · 428 阅读 · 0 评论 -
POJ-3087 Shuffle'm Up
模拟原创 2017-02-23 19:58:12 · 282 阅读 · 0 评论 -
UVA-12657 Boxes in a Line(数据结构)
数据结构原创 2017-07-27 21:10:57 · 322 阅读 · 0 评论