Codeforces Round #476 (Div. 2) A. Paper Airplanes

点击打开题目链接

签到题

#include <iostream>
using namespace std;
int main()
{int k,n,s,p;cin>>k>>n>>s>>p;long long  sum=0;sum=(n%s!=0 ? n/s+1:n/s);sum*=k;sum=(sum%p!=0?sum/p+1:sum/p);cout<<sum<<endl;return 0;
}

Codeforces Round #476 (Div. 2) A. Paper Airplanes相关推荐

Codeforces Round #476 (Div. 2) C. Greedy Arkady
点击打开题目链接知道了当第一个人比那 k-1 个人多分一次x就是最优策略和对分糖果的次数进行枚举就差不多了当分i次的时候, 有 (i-1)*x(k-1)+x+i<=n; x=n/((i- ...
Codeforces Round #476 (Div. 2) B. Battleship
用暴力就可以过,不过晚上做的时候被题面和自己的英语水平唬着了,没做.也是签到题吧,不过自己写的比较乱点击打开题目链接 #include <iostream> #include <c ...
Codeforces Round #476 (Div. 2) C - Greedy Arkady
Examples 1: input: 20 4 5 2 output: 8Examples 2: input: 30 9 4 1 output: 4 题意: n,k,m,d分别表示n颗糖,k个人,一次 ...
Codeforces Round #476 (Div. 2)
LINK A.B 水题 C. Greedy Arkady 题意现有n个糖果,分给k个人,编号为1~k,你可以选择X,按顺序给个人x个,直至分完或者不足X个的舍弃,X<=M ,每个人得到糖果的次 ...
Codeforces Round 263(Div. 2)
layout: post title: Codeforces Round 263(Div. 2) author: "luowentaoaa" catalog: true tags: ...
Codeforces Round #597 (Div. 2) - BenFromHRBUST
Codeforces Round #597 (Div. 2) -----比赛传送门----- A - Good ol' Numbers Coloring Problem Description Con ...
Codeforces Round #797 (Div. 3)无F
Codeforces Round #797 (Div. 3)无F 这打的也太屎了,白天把G补了才知道简单的很,但f还是没头绪呜呜呜 Problem - A - Codeforces Given the ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...

Codeforces Round #476 (Div. 2) A. Paper Airplanes

Codeforces Round #476 (Div. 2) A. Paper Airplanes相关推荐

最新文章

热门文章