【Codeforces Round #476 (Div. 2) [Thanks, Telegram!] A】Paper Airplanes
Codeforces div round Paper
2023-09-14 09:03:44 时间
【链接】 我是链接,点我呀:)
【题意】
【题解】
统计每个人需要的sheet个数。 乘上k 然后除p就是需要的pack个数了【代码】
#include <bits/stdc++.h>
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
const double pi = acos(-1);
const int dx[4] = {0,0,1,-1};
const int dy[4] = {1,-1,0,0};
int k,n,s,p;
int main(){
#ifdef LOCAL_DEFINE
freopen("rush_in.txt", "r", stdin);
#endif
ios::sync_with_stdio(0),cin.tie(0);
cin >> k >> n >> s >> p;
int need = (n-1)/s+1;
need*=k;
need=(need-1)/p+1;
cout<<need<<endl;
return 0;
}
相关文章
- Educational Codeforces Round 132 (Rated for Div. 2) A·B·C
- Codeforces Round #813 (Div. 2)(A~C)
- Codeforces Round #674 (Div. 3)(A~D)
- Codeforces Round#806(Div.4) 题解
- 【算法竞赛】Codeforces Round #841 (Div. 2) C, E
- A. Vasya and Book ( Codeforces Educational Codeforces Round 55 )
- C. Prefixes and Suffixes ( Codeforces Round #527 (Div. 3) )
- Codeforces 842B Gleb And Pizza几何,水详解编程语言
- MySQL中DIV函数的使用方法(mysql中div的用法)
- 深入理解MySQL中的DIV函数(mysql中div)