codeforces 604A Uncowed Forces

题目链接:http://codeforces.com/problemset/problem/604/A

题意:求cf比赛每次能够增加的排名,运算规则会告诉你

题目分类:数学

题目分析:用题目给的公式直接进行运算就好

代码:

#include<bits/stdc++.h>

using namespace std;

int a[15]={0,500,1000,1500,2000,2500};
int m[10];
int w[10];

int main()
{
    int s,us;
    for(int i=1;i<=5;i++)
    {
        cin>>m[i];
    }
    for(int i=1;i<=5;i++)
    {
        cin>>w[i];
    }
    cin>>s>>us;
    __int64 sum=0;
    for(int i=1;i<=5;i++)
    {
        sum+=max(3*a[i]/10,(250-m[i])*a[i]/250-50*w[i]);
    }
    sum=sum+s*100-us*50;
    cout<<sum<<endl;
}
时间: 2024-10-10 13:23:00

codeforces 604A Uncowed Forces的相关文章

Codeforces Round #334 (Div. 2)

水 A - Uncowed Forces #include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 5; const int INF = 0x3f3f3f3f; int main(void) { int s[5] = {50, 100, 150, 200, 250}; int m[5], w[5], hs, hu; for (int i=0; i<5; ++i) { sc

Codeforces Round #262 (Div. 2) E. Roland and Rose 暴力

E. Roland and Rose Time Limit: 1 Sec  Memory Limit: 256 MB 题目连接 http://codeforces.com/problemset/problem/460/E Description Roland loves growing flowers. He has recently grown a beautiful rose at point (0, 0) of the Cartesian coordinate system. The ro

CodeForces - 631C

该题code forces链接:http://codeforces.com/problemset/problem/631/C VJ暑期训练链接:https://vjudge.net/contest/238680#problem/H 参考博客链接:https://blog.csdn.net/yhyyxt/article/details/50808441 Each month Blake gets the report containing main economic indicators of t

【codeforces 718E】E. Matvey&#39;s Birthday

题目大意&链接: http://codeforces.com/problemset/problem/718/E 给一个长为n(n<=100 000)的只包含‘a’~‘h’8个字符的字符串s.两个位置i,j(i!=j)存在一条边,当且仅当|i-j|==1或s[i]==s[j].求这个无向图的直径,以及直径数量. 题解:  命题1:任意位置之间距离不会大于15. 证明:对于任意两个位置i,j之间,其所经过每种字符不会超过2个(因为相同字符会连边),所以i,j经过节点至多为16,也就意味着边数至多

Codeforces 124A - The number of positions

题目链接:http://codeforces.com/problemset/problem/124/A Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing b

Codeforces 841D Leha and another game about graph - 差分

Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges. Graph can contain multiple edges, but can not contain self loops. Each vertex has an integer di, which can be equal to 0, 1 or  - 1. To pass th

Codeforces Round #286 (Div. 1) A. Mr. Kitayuta, the Treasure Hunter DP

链接: http://codeforces.com/problemset/problem/506/A 题意: 给出30000个岛,有n个宝石分布在上面,第一步到d位置,每次走的距离与上一步的差距不大于1,问走完一路最多捡到多少块宝石. 题解: 容易想到DP,dp[i][j]表示到达 i 处,现在步长为 j 时最多收集到的财富,转移也不难,cnt[i]表示 i 处的财富. dp[i+step-1] = max(dp[i+step-1],dp[i][j]+cnt[i+step+1]) dp[i+st

Codeforces 772A Voltage Keepsake - 二分答案

You have n devices that you want to use simultaneously. The i-th device uses ai units of power per second. This usage is continuous. That is, in λ seconds, the device will use λ·ai units of power. The i-th device currently has bi units of power store

Educational Codeforces Round 21 G. Anthem of Berland(dp+kmp)

题目链接:Educational Codeforces Round 21 G. Anthem of Berland 题意: 给你两个字符串,第一个字符串包含问号,问号可以变成任意字符串. 问你第一个字符串最多包含多少个第二个字符串. 题解: 考虑dp[i][j],表示当前考虑到第一个串的第i位,已经匹配到第二个字符串的第j位. 这样的话复杂度为26*n*m*O(fail). fail可以用kmp进行预处理,将26个字母全部处理出来,这样复杂度就变成了26*n*m. 状态转移看代码(就是一个kmp