FOWng_lp的博客

题目链接http://acm.hdu.edu.cn/showproblem.php?pid=1027点击此处题目描述注意这里的第M个是指按照字典序大小算的AC Code因为是自己裸敲的，所以很乱。。。。#include<cstdio>#include<iostream>#include<algorithm>#include<cmath...

A. Nicoleta and the circle of kidstime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputNicoleta is a happy kid, he goes every day to school and is always com...

链接：https://ac.nowcoder.com/acm/contest/700/J来源：牛客网题目描述Recently MINIEYE’s engineer M is working on neural network model training and he has found that if the output of the network is S = (S1, S2, …,...

http://codeforces.com/problemset/problem/1059/CLet’s call the following process a transformation of a sequence of length nn.If the sequence is empty, the process ends. Otherwise, append the greatest...

http://codeforces.com/problemset/problem/578/BB. “Or” Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n numbers a1, a2, …,...

http://codeforces.com/problemset/problem/735/DD. Taxestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Funt now lives in a country with a...

A. Repoststime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Polycarp published a funny picture in a social network making a poll about t...

ideaIt’s easy to find that it’s a 01 bag problem ,but I think my dp learned so nervous that meeting the easy change problem can’t get idea in a short timeafter looking the problem solution , there...

小白鼠排队Time Limit:1000MS Memory Limit:65536KTotal Submit:2 Accepted:2Description有N只小白鼠（1＜N＜100），每只小白鼠头上戴着一顶有颜色的帽子。现在称出了每只小白鼠的重量，要求按照小白鼠重量从大到小的顺序输出它们头上帽子的颜色。帽子的颜色用“red”，“blue”等字符串来表示。不同的小白鼠可以戴相同颜色的帽...

C. Hard Processtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a with n elements. Each element of a is either 0 or 1.L...

There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbour...

While walking down the street Vanya saw a label “Hide&amp;Seek”. Because he is a programmer, he used &amp; as a bitwise AND for these two words represented as a integers in base 64 and got new word. N...

You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.InputInput starts with an integer T (≤ 1000), denoting the numbe...

Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word.Hongcow has decided to try to...

The clique problem is one of the most well-known NP-complete problems. Under some simplification it can be formulated as follows. Consider an undirected graph G. It is required to find a subset of ver...

Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write ...

Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it’s possible that ...

When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be ...

There are some beautiful girls in Arpa’s land as mentioned before.Once Arpa came up with an obvious problem:Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n...

Right now she actually isn’t. But she will be, if you don’t solve this problem.You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perform two...