轉載自 https://www.youtube.com/watch?v=0714IbwC3HA When I find myself in times of trouble, Mother Mary comes to meSpeaking words of wisdom, let it beAnd in my hour of darkness she is standing right in front of meSpeaking words of wisdom, let it beLet it…

Eliza Doolittle lyrics  Big City 歌词很好,现在还没有,以后添加进来.…

Lyre 里拉琴,古希腊语,在北欧流行至中世纪.   Lyrics in sheet music. This is a homorhythmic (i.e., hymn-style) arrangement of a traditional piece entitled "Adeste Fideles", in standard two-staff format for mixed voices.  Play (help·info) Lyrics are words that make…

https://codeforces.com/contest/1143/problem/D D. The Beatles time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Recently a Golden Circle of Beetlovers was found in Byteland. It is a circle rou…

CF1143D/1142A The Beatles 将题目中所给条件用同余方程表示,可得 \(s-1\equiv \pm a,s+l-1\equiv \pm b\mod k\). 于是可得 \(l\equiv \pm a\pm b \mod k\),将四个 \(l\) 取模后记为 \(l_1,l_2,l_3,l_4\). 对于每个 \(l​\) ,它一定是 \(l_i+q\cdot k,q\in \mathbb{N_+}​\) 的形式,它对应的答案为 \(\frac {n\cdot k} {gc…

链接: https://codeforces.com/contest/1182/problem/C 题意: You are given n words, each of which consists of lowercase alphabet letters. Each word contains at least one vowel. You are going to choose some of the given words and make as many beautiful lyric…

I really want to go out I really want to go outside and stop to see your day You really want to hole up You really want to stay inside and sleep the light away I really want to go out I really want to go outside and make it light all day You really w…

链接 [https://codeforces.com/contest/1143/problem/D] 题意 就是有nkcity,n个面包店 第一个面包店在1city,第x个在(x-1)k+1city 已知刚开始起步离最近面包店的距离和跳第一次之后离面包店最近的距离 问你最多需要走调少次回到出发地和最少的跳次数 分析 我是看官方题解才知道这么回事收获不小 就是一定去用已知条件去确定某些情况 缩小需要枚举的范围,分析能力还是不够强啊 首先我们不知道每次要跳多远 但是你的出发点是可以确定,一旦出发点确…

题目 解题思路 关键是要 ,找出L 的组合,然后遍历L的组合,用最大公约数就可以算出来当前L的值要停多少次 怎么找出L的组合呢?饭店是每隔K 有一个,是重复的,我们只需要算出第一个饭店两侧,起点和停顿点的情况,之后再加上k1 ,k2,k*3 就能得出所有L的组合. 数据范围是 10万,所以必须要用long long int. 还有就是对于大数运算,能化简的就化简,大数运算也可能超纲. #include <iostream> #include <stdio.h> #include &…

传送门: 题意:题目给出n,k分别代表在这个环中饭店的个数和两个饭店相离的距离.然后再给出一组a,b分别代表在某一点s里最近饭店的距离和在这个s点走一步之后到达的点离最近饭店的距离. 然后问这个人再次走回到s点的最大步数跟最小步数....由题意可知  城市点数有 n*k个,那么我们如何去确定当前的s点的可能值呢? 枚举可得!!!为什么?  饭店的位置在1,1+k,1+2k....... s的下一个点最近的饭店有两种情况,1:跟离s点最近的饭店是一样的 那么我们就可以求出  l=1+mk+b- s…