# Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) A-C题解

A. Search for Pretty Integers time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given two lists of non-zero digits. Let's call an integer pretty if its (base 10) representation has at least on...

# Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) A-D题解

A. Trip For Meal time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and...

# HDU 5115 Dire Wolf (区间DP)

Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 2761 Accepted Submission(s): 1632 Problem Description Dire wolves, also known as Dark wolves, are extraordinarily large and powerful...

# BZOJ 1072 [SCOI2007]排列perm (状态压缩+dp+同余定理)

1072: [SCOI2007]排列perm Time Limit: 10 Sec Memory Limit: 128 MB Submit: 2537 Solved: 1583 [Submit][Status][Discuss] Description 　　给一个数字串s和正整数d, 统计s有多少种不同的排列能被d整除（可以有前导0）。例如123434有90种排列能 被2整除，其中末位为2的有30种，末位为4的有60种。 Input 　　输入第一行是一个整数T，表示测试数据的个数，以下每行一组s...

# Codeforces Round #439 (Div. 2) A-C题解

A. The Artful Expedient time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Rock... Paper! After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyom...

# Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) A-C题解

A. Bark to Unlock time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly as possible. To unlock its new p...

# USACO Milking Cows (模拟)

Milking Cows Three farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000. The second farmer begins at time 700 and ends at time...

# HDU 6063 RXD and math (数论+快速幂)

RXD and math Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1363 Accepted Submission(s): 747 Problem Description RXD is a good mathematician. One day he wants to calculate: ∑i=1nkμ2(i)×⌊nki−...

# HDU 5514 Frogs （容斥+数论)

Frogs Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2810 Accepted Submission(s): 904 Problem Description There are m stones lying on a circle, and n frogs are jumping over them. The stones ar...

# Codeforces Round #436 (Div. 2) A-D题解

Codeforces Round #436 (Div. 2) A. Fair Game B.Polycarp and Letters C. Bus D. Make a Permutation!...

# 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 A Cache Simulator

Cache memories have been used widely in current microprocessor systems. In this problem, you are asked to write a program for a cache simulator. The cache has the following metrics: 1. The cache size is 1 KB (K-byte). 2. The cache uses the direct mapped ...

# 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 M. Frequent Subsets Problem （状态压缩）

The frequent subset problem is defined as follows. Suppose UU={1, 2,\ldots…,N} is the universe, and S_{1}S ​1 ​​ , S_{2}S ​2 ​​ ,\ldots…,S_{M}S ​M ​​ are MM sets over UU. Given a positive constant \alphaα, 0<\alpha \leq 10<α≤1, a subset BB (B \neq 0B≠0) is...

# 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 F. Overlapping Rectangles （面积并+线段树）

There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these rectangles shall not be counted more than once. For example,...

128条 共9页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：34286次
• 积分：1582
• 等级：
• 排名：千里之外
• 原创：127篇
• 转载：1篇
• 译文：0篇
• 评论：13条
联系方式
欢迎谈论交流：1245985209
博客专栏
 CodeForce题解 文章：26篇 阅读：7977
 ACM的进阶之路 文章：68篇 阅读：20718
文章分类
最新评论