当前位置:网站首页>CSP salary calculation
CSP salary calculation
2022-07-06 09:08:00 【< WRM>】
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d",&t);
int s;
if(t<=3500) {
s=t;
} else if(t<=3500+1500-45) {
s=(t-105)*100/97;
} else if(t<=8000-45-300) {
s=(t-455)*10/9;
}else if(t<=3500+9000-45-300-900) {
s=(t+345-1600)*10/8;
}else if(t<=3500+35000-45-300-900-(35000-9000)*0.25) {
s=(t-1880)*100/75;
} else if(t<=3500+55000-45-300-900-6500-6000) {
s=(t-3805)*10/7;
} else if(t<=3500+80000-8750-6000-6500-900-300-45) {
s=(t-6730)*100/65;
} else {
s=(t-15080)*100/55;
}
printf("%d",s);
return 0;
}
边栏推荐
猜你喜欢
Once you change the test steps, write all the code. Why not try yaml to realize data-driven?
Export IEEE document format using latex
MYSQL卸载方法与安装方法
I-BERT
Guangzhou will promote the construction of a child friendly city, and will explore the establishment of a safe area 200 meters around the school
多元聚类分析
SimCLR:NLP中的对比学习
LeetCode41——First Missing Positive——hashing in place & swap
【图的三大存储方式】只会用邻接矩阵就out了
LeetCode:498. 对角线遍历
随机推荐
What is an R-value reference and what is the difference between it and an l-value?
七层网络体系结构
[OC foundation framework] - [set array]
使用标签模板解决用户恶意输入的问题
自定义卷积注意力算子的CUDA实现
Advanced Computer Network Review(3)——BBR
[OC]-<UI入门>--常用控件-UIButton
LeetCode:498. Diagonal traversal
如何正确截取字符串(例:应用报错信息截取入库操作)
一篇文章带你了解-selenium工作原理详解
多元聚类分析
LeetCode:34. 在排序数组中查找元素的第一个和最后一个位置
The carousel component of ant design calls prev and next methods in TS (typescript) environment
Problems encountered in connecting the database of the project and their solutions
The ECU of 21 Audi q5l 45tfsi brushes is upgraded to master special adjustment, and the horsepower is safely and stably increased to 305 horsepower
在QWidget上实现窗口阻塞
Navicat premium create MySQL create stored procedure
什么是MySQL?MySql的学习之路是怎样的
【文本生成】论文合集推荐丨 斯坦福研究者引入时间控制方法 长文本生成更流畅
Intel distiller Toolkit - Quantitative implementation 2