当前位置:网站首页>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;
}
边栏推荐
猜你喜欢

Alibaba cloud server mining virus solution (practiced)
![[MySQL] limit implements paging](/img/94/2e84a3878e10636460aa0fe0adef67.jpg)
[MySQL] limit implements paging
![[oc]- < getting started with UI> -- common controls uibutton](/img/4d/f5a62671068b26ef43f1101981c7bb.png)
[oc]- < getting started with UI> -- common controls uibutton

requests的深入刨析及封装调用

Selenium+Pytest自动化测试框架实战

The carousel component of ant design calls prev and next methods in TS (typescript) environment

Cesium draw points, lines, and faces

CUDA realizes focal_ loss

Pytest's collection use case rules and running specified use cases
![[oc]- < getting started with UI> -- common controls - prompt dialog box and wait for the prompt (circle)](/img/af/a44c2845c254e4f48abde013344c2b.png)
[oc]- < getting started with UI> -- common controls - prompt dialog box and wait for the prompt (circle)
随机推荐
Pytest之收集用例规则与运行指定用例
[OC]-<UI入门>--常用控件-提示对话框 And 等待提示器(圈)
LeetCode:673. 最长递增子序列的个数
LeetCode:836. Rectangle overlap
LeetCode:124. 二叉树中的最大路径和
数学建模2004B题(输电问题)
[sword finger offer] serialized binary tree
CUDA realizes focal_ loss
【图的三大存储方式】只会用邻接矩阵就out了
LeetCode:162. Looking for peak
Philosophical enlightenment from single point to distributed
Intel distiller Toolkit - Quantitative implementation 1
UML图记忆技巧
【剑指offer】序列化二叉树
多元聚类分析
甘肃旅游产品预订增四倍:“绿马”走红,甘肃博物馆周边民宿一房难求
opencv+dlib实现给蒙娜丽莎“配”眼镜
Alibaba cloud server mining virus solution (practiced)
LeetCode:124. Maximum path sum in binary tree
Compétences en mémoire des graphiques UML