A. Rewards 水题 #include#include#includeusing namespace std;int main(){ int a1,a2,a3,b1,b2,b3,s,t1,t2,sum1,sum2; while(scanf("%d%d%d",&a1,&a2,&a3)!=EOF) { scanf("%d%d%d",&b1,&b2,&b3); scanf("%d",&s); sum1 = a1+a2+a3; sum2 = b1+b2+b3; if(sum1>=5) { t1 = sum1/5; if(sum1%5) t1++; } else if(sum1>0) t1 = 1; ...
题目： C. Present time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Little beaver is a beginner programmer, so informatics is his favorite subject. Soon his informatics teacher is going to have a birthday and the beaver h...
A. Vasya and Socks 水题就不用多说了，直接暴力枚举就完事了。 #include #include#include#include#include#include#includeusing namespace std;#define LL __int64int main(){ int n,k; while(~scanf("%d%d",&n,&k)) { int m=n; int ans=n; int yu=0; while(m) { m=m+yu; yu=m%k; m=m/k; ans+=m; } cout< B. Lit...
A： 这道题目还是很简单的，做过很多遍了，类似于切割木板的问题。 把所有的数放在一个优先队列里，弹出两个最大的，然后合并，把结果放进去。依次进行。 #include #include#include#include#include#include#include#includeusing namespace std;#define LL __int64#define INF 1000000000LL a[330000];priority_queueque;int main(){ int n; while(~scanf("%d",&n)) { LL sum=0; while(!que.empty()...
A http://codeforces.com/contest/471/problem/A 解题思路：给你6个数，问是否有至少4个数都相等，没有的话输出“Alien”，有的话再看剩下的两个数，如果相等就输出" Elephant"，否则输出" Bear"； #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define Maxn 100005#define Maxm 1000005#define lowbit(x) x&(-x)#define l...
C. Dreamoon and Strings time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Dreamoon has a string s and a pattern string p. He first removes exactly x characters from s obtaining string s as a result. Then he calculates that is defined ...
Student Valera is an undergraduate student at the University. His end of term exams are approaching and he is to pass exactly n exams. Valera is a smart guy, so he will be able to pass any exam he takes on his first try. Besides, he can take several exams on one day, and in any order. According to the schedule, a student can take the exam for the i-th subject on the day number ai. However, Vale...
C. Pashmak and Buses time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Recently Pashmak has been employed in a transportation company. The company has k buses and has a contract with a school which hasn students. The school planned to take the students to d d...
C. Diverse Permutation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Permutation p is an ordered set of integers p1,???p2,???...,???pn, consisting of n distinct positive integers not larger than n. Well denote as nthe length of permutation p1,???p2,???......
C. Little Pony and Expected Maximum time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became ...
http://codeforces.com/contest/465/problem/C 给定n和m，以及一个字符串s，s不存在长度大于2的回文子串，现在要求输出一个字典比s大的字符串，且串中字母在一定范围内，并且说同样不存在长度大于2的回文子串。 直接去递归构造即可，从最后一位开始，每次只要判断是否子串中含有回文串，其实仔细想想只要考虑是否存在一个字符和前两个字符中的一个相同即可。不卡时限，裸的判断都能过 #include #include #include #inclu...
C. Predict Outcome of the Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are n games in a football tournament. Three teams are participating in it. Currently k games had already been played. You are an avid football fan, but recently you mis...
题目地址：http://codeforces.com/problemset/problem/374/C 用dp[i][j]代表第i行第j列的数可以走的最大距离。为-1时表示未走过，将走过但未走完的暂时标记为INF。这样假如有环的时候就返回INF了。然后用dfs搜。 代码如下： #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL __int64const int INF=0x3f3f3f3f;char mp[1001][1001], str[...
C. Little Elephant and LCM time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output The Little Elephant loves the LCM (least common multiple) ope...
嘎嘎，今天被一些事耽误了，但是还是A了几个题目，这道题还不错 题目链接： 题意：两个人玩游戏，有N堆纸牌，纸牌上有数字，A每次只能取N堆中的 其中一个的顶部的 纸牌，B只能取N堆中的其中一个底部 的纸牌，A，B都想让自己取的和最大，问最后比分为多少 画了一下，如果某一堆里的 纸牌数量为偶数，发现其实是两个人各分一半，因为如果对方想从这里拿走本来属于自己那半部分的 较大的牌，自己完全来得及阻止的， 接下来就...