code forces 505A

【code forces 505A】的更多相关文章

Mr. Kitayuta's Gift Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 505A Description Mr. Kitayuta has kindly given you a string s consisting of lowercase English letters. You are asked t…

思维题--code forces round# 551 div.2

思维题--code forces round# 551 div.2 题目 D. Serval and Rooted Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Now Serval is a junior high school student in Japari Middle School, and he is…

Code Forces 796C Bank Hacking（贪心）

Code Forces 796C Bank Hacking 题目大意给一棵树,有\(n\)个点,\(n-1\)条边,现在让你决策出一个点作为起点,去掉这个点,然后这个点连接的所有点权值+=1,然后再将这些刚刚加过一的点的相邻的点的权值+=1 也就是说,除了与根节点相邻的点+=1,其余点+=2 然后求最大集合的最小点权 solution 一看是要求最大的的最小值,首先想到的就是二分,显然想到这个目前没有什么卵用,二分是用来卡最佳答案的,所以使用二分的前提是要给它一个范围去选择,那么现在的任务就是…

Code Forces 833 A The Meaningless Game（思维，数学）

Code Forces 833 A The Meaningless Game 题目大意有两个人玩游戏,每轮给出一个自然数k,赢得人乘k^2,输得人乘k,给出最后两个人的分数,问两个人能否达到这个分数不得不吐槽一下那么长的英文题面翻译完只有一句话-- solution 也很好想叭乘积开立方判断是否为两个数的因数如果是的话,显然不成立否则输出Yes即可 #include <iostream> #include <cstring> #include <cstdio>…

Code Forces 543A Writing Code

题目描述 Programmers working on a large project have just received a task to write exactly mm lines of code. There are nn programmers working on a project, the ii -th of them makes exactly a_{i}ai bugs in every line of code that he writes. Let's call a…

code forces 383 Arpa's loud Owf and Mehrdad's evil plan(有向图最小环)

Arpa's loud Owf and Mehrdad's evil plan time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output As you have noticed, there are lovely girls in Arpa's land. People in Arpa's land are numbered from 1…

code forces 382 D Taxes（数论--哥德巴赫猜想）

Taxes time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to n (n ≥ 2) bur…