更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits \(4\) and \(7\). For example, numbers \(47\)…

原文地址 Problem Portal Portal1:Luogu Portal2:LibreOJ Portal3:Vijos Description 在\(Mars\)星球上,每个\(Mars\)人都随身佩带着一串能量项链.在项链上有NN颗能量珠.能量珠是一颗有头标记与尾标记的珠子,这些标记对应着某个正整数.并且,对于相邻的两颗珠子,前一颗珠子的尾标记一定等于后一颗珠子的头标记.因为只有这样,通过吸盘(吸盘是\(Mars\)人吸收能量的一种器官)的作用,这两颗珠子才能聚合成一颗珠子,同时释放出…

更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong - the oldest among the inhabitants of Mainframe. But still he m…

更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description In mathematical terms, the sequence \(F_n\) of Fibonacci numbers is defined by the recurrence relation \[F_1 = 1; F_2 = 1; F_n = F_n - 1 + F_n - 2 (n > 2)\] DZY loves Fibonacci numbers ver…

title: categories: tags: - mathjax: true --- Problem Portal Portal1:Luogu Portal2: LibreOJ Description \(G\)公司有\(n\)个沿铁路运输线环形排列的仓库,每个仓库存储的货物数量不等.如何用最少搬运量可以使\(n\)个仓库的库存数量相同.搬运货物时,只能在相邻的仓库之间搬运. Input 文件的第\(1\)行中有\(1\)个正整数\(n\),表示有\(n\)个仓库. 第\(2\)行中有\(n…

原文地址 Problem Portal Portal1:UVa Portal2:Luogu Portal3:Vjudge Description Given a directed graph \(\text{G}\), consider the following transformation. First, create a new graph \(\text{T(G)}\) to have the same vertex set as \(\text{G}\). Create a direc…

更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description Recently a Golden Circle of Beetlovers was found in Byteland. It is a circle route going through \(n \cdot k\) cities. The cities are numerated from \(1\) to \(n \cdot k\), the distance be…

更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description Recently Lynyrd and Skynyrd went to a shop where Lynyrd bought a permutation \(p\) of length \(n\), and Skynyrd bought an array \(a\) of length \(m\), consisting of integers from \(1\) to…

更好的阅读体验 Portal Portal1: Luogu Description 小\(K\)在\(\mathrm MC\)里面建立很多很多的农场,总共\(n\)个,以至于他自己都忘记了每个农场中种植作物的具体数量了,他只记得一些含糊的信息(共\(m\)个),以下列三种形式描述: 农场\(a\)比农场\(b\)至少多种植了\(c\)个单位的作物, 农场\(a\)比农场\(b\)至多多种植了\(c\)个单位的作物, 农场\(a\)与农场\(b\)种植的作物数一样多. 但是,由于小\(K\)的记忆…

更好的阅读体验 Portal Portal1: Luogu Portal2: LibreOJ Description 在有向图\(\mathrm G\)中,每条边的长度均为\(1\),现给定起点和终点,请你在图中找一条从起点到终点的路径,该路径满足以下条件: 路径上的所有点的出边所指向的点都直接或间接与终点连通. 在满足条件\(1\)的情况下使路径最短. 注意:图\(\mathrm G\)中可能存在重边和自环,题目保证终点没有出边. 请你输出符合条件的路径的长度. Input 第一行有两个用一个…