WZJRJ28

Description　　单身! 　　依然单身！ 　　吉哥依然单身！ 　　DS级码农吉哥依然单身！ 　　所以，他生平最恨情人节，不管是214还是77，他都讨厌！ 　　 　　吉哥观察了214和77这两个数，发现： 　　2+1+4=7 　　7+7=7*2 　　77=7*11 　　最终，他发现原来这一切归根到底都是因为和7有关！所以，他现在甚至讨厌一切和7

One Martian boy called Zorg wants to present a string of beads to his friend from the Earth — Masha. He knows that Masha likes two colours: blue and red, — and right in the shop where he has come, the

题意： 有n（nB表示A必须在B之前完成，A-B表示A和B不能在同一天晚上。输入保证约束图是将一颗树的一些边定向之后得到的。分析：     这题好神，我一开始根据题目的提示想了个错误的贪心，然后疯狂WA了一天。    我一开始错误的贪心是认为对于原图最长链k大于2的情况，答案为k+1当且仅当只有一个无向边定向后参与入了新的最长链的构造，于是我一开始的做法就是特判k = 2的情况

Problem DescriptionMs. Zhang is a journalist from Hong Kong, and she runs very very fast, so every one calls her “The fastest runner”. There are n cities (numbered from 1 to n) and n roads in the co

题意：有n(3分析：这题的状态表示很精妙，f[j][k]表示除了最高书所在层外的另外两层的宽度为j 和 k（最后最高层的宽度就是tot - j - k）时的最小总高度,这样做是枚举比较小的宽度来约束高度，如果能想到这个状态表示那么转移也就很自然了。#include#include#include#include#include#include#inclu

DescriptionA TV-network plans to broadcast an important football match. Their network of transmitters and users can be represented as a tree. The root of the tree is a transmitter that emits the f

Ostap already settled down in Rio de Janiero suburb and started to grow a tree in his garden. Recall that a tree is a connected undirected acyclic graph.Ostap's tree now has n vertices. He wants t

题意：你有c美元，但是没有股票。给m天时间和n支股票供逆买卖（c 分析：

ACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗？ Input每个测试实例首先包括2个整数，N,M.(1 = 0。当N = 0, M = 0输入结束。

Recently Bob invented a new game with a tree (we should remind you, that a tree is a connected graph without cycles): he deletes any (possibly, zero) amount of edges of the tree, and counts the produc

One day, Hongcow goes to the store and sees a brand new deck of n special cards. Each individual card is either red or blue. He decides he wants to buy them immediately. To do this, he needs to play

题意：给n（小于２００）个砖块，每个砖块有自己的颜色，你每次可以选择一段颜色相等的砖块然后把它消去，得分为长度的平方，问你这段砖块最多能得多少分。分析：黑书上的经典ＤＰ，以前写过，今天趁着忘了又试着写了写，然后发现自己怎么个搞不出来状态的表示方法。。。f[i,j,k]表示 [i,j]这一段砖块后边再接上长度为k的颜色和第j块一样的砖块的最高得分，然后我们发现只要讨论

DescriptionOnce upon a time there lived a good fairy A. One day a fine young man B came to her and asked to predict his future. The fairy looked into her magic ball and said that soon the fine you

Memory and his friend Lexa are competing to get higher score in one popular computer game. Memory starts with scorea and Lexa starts with score b. In a single turn, both Memory and Lexa get some i

C. Centroidstime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputTree is a connected acyclic graph. Suppose you are given

Problem DescriptionHearthstone is an online collectible card game from Blizzard Entertainment. Strategies and luck are the most important factors in this game. When you suffer a desperate situation

题意：给定n,选择一些小于等于n的数构成一个集合，使得集合内各个元素的十进制表示形式没有重叠的数字，问这样的集合有多少个。分析：一共十个数字，我们可以枚举单个数字的所有组合情况（一千种），然后用数位DP求出符合每种组合的所有单个数字的个数，设f[x]表示数字集合为x的个数，我们可以利用用状压DP的方式求出f[x]的值。#include#include#include#

Sonya was unable to think of a story for this problem, so here comes the formal description.You are given the array containing n positive integers. At one turn you can pick any element and increase

Problem DescriptionFor a number,if the length of continuous odd digits is even and the length of continuous even digits is odd,we call it odd-even number.Now we want to know the amount of odd-even n

Problem DescriptionEvery school has some legends, Northeastern University is the same.Enter from the north gate of Northeastern University，You are facing the main building of Northeastern Univer

Problem DescriptionThere was a civil war between two factions in Skyrim, a province of the Empire on the continent of Tamriel. The Stormcloaks, led by Ulfric Stormcloak, are made up of Skyrim's nati

DescriptionThis problem differs from one which was on the online contest.The sequence a1, a2, ..., an is called increasing, ifai ai + 1 fori n.The sequence s1, s2, ..., sk is called the

DescriptionNick likes strings very much, he likes to rotate them, sort them, rearrange characters within a string... Once he wrote a random string of characters a, b, c on a piece of paper and b

Given a simple graph, output the number of simple cycles in it. A simple cycle is a cycle with no repeated vertices or edges.InputThe first line of input contains two integers n and m (1 ≤ n ≤ 19,

A boy named Gena really wants to get to the "Russian Code Cup" finals, or at least get a t-shirt. But the offered problems are too complex, so he made an arrangement with his n friends that they wil

Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaining amount of soda ai and bottle volumebi (ai ≤ bi).Nick has decided to pour all remaining soda

Another MeaningTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 558    Accepted Submission(s): 262Problem DescriptionAs is known to a

题意:佳佳的一套筷子有三只，两根短筷子和一只比较长的.如果一套筷子的长度分别为a,b,c,(a 分析:设f[i][j]表示当前已经凑齐了j双筷子,并且最后一套筷子中最小的那根为i的最小质量和,如果3*j > n-i+1那么当前状态一定不合法,有个这个状态我们发现只要处理下上个阶段的后缀最小值就能实现O(1)转移了.#include #define N 10005#define

题意:给出一个由大写字母组成的长度为n(n 分析:f[i][j]表示把i到j这一段压缩后的最小长度,那么f[i][j] = min(f[i][k]+f[k+1][j]),如果[i,j]这一子串存在循环节的话还要处理一下折叠的情况.#include #define N 100005#define INF 1047483647using namespace std;ty

For given sequence A = (a1, a2, . . . , an), a sequence S = (s1, s2, . . . , sn) has shape A if and only if:• si = min{si, si+1, . . . , sn} for all ai = 0;• si = max{si, si+1, . . . , sn} for all a

分析：大概就是f[i][j] = min (f[k][j-1] + w[k+1][i])这种形式的DP,我们把w函数拆开可以得到一个斜率为-dis[i][n]的等式,随着i的增大斜率也在不断增大,所以我们维护一个下凸的决策队列,这样能把转移复杂度优化到O (1).题目链接：https://acm.whu.edu.cn:8443/problem/663#include #define IN

On the last day before the famous mathematician Swan's death, he left a problem to the world: Given integers nn and aiai for 0≤i≤40≤i≤4, calculate the number of nn-digit integers which have at mos

There are n people numbered from 1 to n. Each people have a unique message. Some pairs of people can send messages directly to each other, and this relationship forms a structure of a tree. In one tur

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:Yuta has n01 strings si, and he wants to

Think about the Zuma Game. You have a row of at most 200black(0) or white(1) balls on the table at the start. Each three consecutive balls never share the same colour. You also have infinite amo

We all have much to be proud of.As a player of the game Ingress, IloveMATH is proud of these portals on the road in front of his campus.Here is a brief introduction of this mobile game. Ingress, a

题意:你是一个披萨店的老板,有一天突然收到了n个客户的订单(n 分析:这题有个特点就是如果ei-ti#include using namespace std;int t,T,n,p[105],e[105],f[105][105][2][105],vis[105][105][2][105];int dfs(int l,int r,int op,int k

分析：所有的文法都能拆分成A=S1S2这种形式,设状态f[i]j]表示字符i能生成的长度为j的字典序最小字符串,那么f[i][j] = min(f[k][j'] + f[l][j-j']),但是这样会有同层转移的情况,这种情况下状态之间会产生环,我们需要把这种情况拿出来特盘一下(单独跑一遍dij).#include using namespace std;typedef pair

Problem DescriptionRecently, Mr. Frog has learned binary indexed tree. Here is the code of adding t to the interval [1,x]: void add (int x, int t ){ for (int i = x; i != 0; i -= i & (-i

Princess Twilight went to Celestia and Luna's old castle to research the chest from the Elements of Harmony.A sequence of positive integers bi is harmony if and only if for every two elements