Scanner input = new Scanner(System.in);
int benjin=5000;
System.out.println("请输入您出行月份:1~12");
int yuefen = input.nextInt();
System.out.println("请输入您选择头等舱还是经济舱?头等舱输入1经济舱输入2");
double cang =input.nextDouble();
switch (yuefen*10) {
case 40:
case 50:
case 60:
case 70:
case 80:
case 90:
case 100:
if (cang==1) {
double jiage =benjin*0.9;
System.out.println("您的机票价格为:"+jiage);
}else if (cang==2) {
double jiage=benjin*0.8;
System.out.println("您的机票价格为:"+jiage);
}
break;
case 10:
case 20:
case 30:
case 110:
case 120:
if (cang==1) {
double jiage=benjin*0.5;
System.out.println("您的机票价格为:"+jiage);
}else {
if (cang==2) {
double jiage=benjin*0.4;
System.out.println("您的机票价格为:"+jiage);
}
}
break;
default:
System.out.println("请输入正确数字");
break;
相关文章
- 第4章:Electron主窗口与子窗口管理
- 第31次CCF计算机软件能力认证第二题《坐标转换其二》80分->100分攻略【2023-9-17】 C++/C
- 《Java语言程序设计》(基础篇原书第10版)第四章复习题答案
- #include <> typedef struct Node { int index; struct Node *next; }JosephuNode; int Josephu(int n, int m) { int i, j; JosephuNode *head, *tail; head = tail = (JosephuNode *)malloc(sizeof(JosephuNode)); for (i = 1; i < n; ++i) { tail->index = i; tail->next = (JosephuNode *)malloc(sizeof(JosephuNode)); tail = tail->next; } tail->index = i; tail->next = head; for (i = 1; tail != head; ++i) { for (j = 1; j < m; ++j) { tail = head; head = head->next; } tail->next = head->next; printf("第%4d个出局的人是:%4d号\n", i, head->index); free(head); head = tail->next; } i = head->index; free(head); return i; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号!\n", Josephu(n, m)); system("pause"); return 0; }">设编号为1,2,… n的n个人围坐一圈,约定编号为k(1数组实现: #include <> #include <> int Josephu(int n, int m) { int flag, i, j = 0; int *arr = (int *)malloc(n * sizeof(int)); for (i = 0; i < n; ++i) arr[i] = 1; for (i = 1; i < n; ++i) { flag = 0; while (flag < m) { if (j == n) j = 0; if (arr[j]) ++flag; ++j; } arr[j - 1] = 0; printf("第%4d个出局的人是:%4d号\n", i, j); } free(arr); return j; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号!\n", Josephu(n, m)); system("pause"); return 0; } 链表实现: #include <> #include <> typedef struct Node { int index; struct Node *next; }JosephuNode; int Josephu(int n, int m) { int i, j; JosephuNode *head, *tail; head = tail = (JosephuNode *)malloc(sizeof(JosephuNode)); for (i = 1; i < n; ++i) { tail->index = i; tail->next = (JosephuNode *)malloc(sizeof(JosephuNode)); tail = tail->next; } tail->index = i; tail->next = head; for (i = 1; tail != head; ++i) { for (j = 1; j < m; ++j) { tail = head; head = head->next; } tail->next = head->next; printf("第%4d个出局的人是:%4d号\n", i, head->index); free(head); head = tail->next; } i = head->index; free(head); return i; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号!\n", Josephu(n, m)); system("pause"); return 0; }
- 【计算机二级Python】模拟试卷第6套选择题
- 第4章-Vue.js 交互及实例的生命周期
- 洛谷题单3-P5724 【深基4.习5】求极差 最大跨度值 最大值和最小值的差-python-流程图重构-题目描述
- 201621123001《Java程序设计》第4周学习总结
- 【C++初阶】第12课—list-4. 代码
- DAY4| 24. 两两交换链表中的节点、19.删除链表的倒数第N个节点、面试题 02.07. 链表相交、142.环形链表II