解题思路:吐槽优质题解还是错的,让我检查自己的老半天。
参考代码:
#include int main() { double a[6] = { 0,100000,200000,400000,600000,1000000 }, t[6] = { 0.1,0.075,0.05,0.03,0.015,0.01 },o=0; int n,p; scanf("%d", &p); for (n = 0; p > a[n+1]; n++) { o = o + (a[n + 1] - a[n]) * t[n]; if (n == 4) { n++; break; } } if (p < a[1])printf("%d", (int)(p * t[0])); else printf("%d", (int)(o + (p - a[n]) * t[n])); return 0; }
0.0分
4 人评分
C语言程序设计教程(第三版)课后习题11.3 (C语言代码)浏览:739 |
淘淘的名单 (C语言代码)答案错误???浏览:595 |
C语言程序设计教程(第三版)课后习题5.4 (C语言代码)浏览:524 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:465 |
C语言程序设计教程(第三版)课后习题7.5 (C语言代码)浏览:523 |
wu-淘淘的名单 (C++代码)浏览:1339 |
WU-拆分位数 (C++代码)浏览:786 |
2005年春浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:591 |
Minesweeper (C语言描述,蓝桥杯)浏览:1127 |
数对 (C语言代码)浏览:702 |