CCF火车购票JAVA答案
2017-03-17 17:41
423 查看
最近在写CCF题把会的答案贴出来,希望能方便大家
代码:
package ccf;
import java.util.Scanner;
public class 火车购票 {
public static void main(String[] args) {
new 火车购票().run();
}
public void run() {
boolean flag=false;
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] a=new int
;
for (int i = 0; i < a.length; i++) {
a[i]=sc.nextInt();
}
int[][] b=new int[20][5];
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 5; j++) {
b[i][j]=0;
}
}
for (int i = 0; i < a.length; i++) {
if(a[i]==1){
flag=false;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.println((5*j+j2+1));
flag=true;
break;
}
}
if(flag){
break;
}
}
}
if(a[i]==2){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 4; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0){
b[j][j2]=1;
b[j][j2+1]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==2){break;}
}
}
if(count==2){
System.out.println("");
break;
}
}
}}
if(a[i]==3){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 3; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0&&b[j][j2+2]==0){
b[j][j2]=1;
b[j][j2+1]=1;
b[j][j2+2]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2)+" "+(5*j+j2+3));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==3){break;}
}
}
if(count==3){
System.out.println("");
break;
}
}
}
}
if(a[i]==4){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 2; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0&&b[j][j2+2]==0&&b[j][j2+3]==0){
b[j][j2]=1;
b[j][j2+1]=1;
b[j][j2+2]=1;
b[j][j2+3]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2)+" "+(5*j+j2+3)+" "+(5*j+j2+4));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==4){break;}
}
}
if(count==4){
System.out.println("");
break;
}
}
}
}
if(a[i]==5){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 1; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0&&b[j][j2+2]==0&&b[j][j2+3]==0&&b[j][j2+4]==0){
b[j][j2]=1;
b[j][j2+1]=1;
b[j][j2+2]=1;
b[j][j2+3]=1;
b[j][j2+4]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2)+" "+(5*j+j2+3)+" "+(5*j+j2+4)+" "+(5*j+j2+5));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==5){break;}
}
}
if(count==5){
System.out.println("");
break;
}
}
}
}
}
sc.close();
}}
试题编号: | 201609-2 |
试题名称: | 火车购票 |
时间限制: | 1.0s |
内存限制: | 256.0MB |
问题描述: | 问题描述 请实现一个铁路购票系统的简单座位分配算法,来处理一节车厢的座位分配。 假设一节车厢有20排、每一排5个座位。为方便起见,我们用1到100来给所有的座位编号,第一排是1到5号,第二排是6到10号,依次类推,第20排是96到100号。 购票时,一个人可能购一张或多张票,最多不超过5张。如果这几张票可以安排在同一排编号相邻的座位,则应该安排在编号最小的相邻座位。否则应该安排在编号最小的几个空座位中(不考虑是否相邻)。 假设初始时车票全部未被购买,现在给了一些购票指令,请你处理这些指令。 输入格式 输入的第一行包含一个整数n,表示购票指令的数量。 第二行包含n个整数,每个整数p在1到5之间,表示要购入的票数,相邻的两个数之间使用一个空格分隔。 输出格式 输出n行,每行对应一条指令的处理结果。 对于购票指令p,输出p张车票的编号,按从小到大排序。 样例输入 4 2 5 4 2 样例输出 1 2 6 7 8 9 10 11 12 13 14 3 4 样例说明 1) 购2张票,得到座位1、2。 2) 购5张票,得到座位6至10。 3) 购4张票,得到座位11至14。 4) 购2张票,得到座位3、4。 评测用例规模与约定 对于所有评测用例,1 ≤ n ≤ 100,所有购票数量之和不超过100。 |
package ccf;
import java.util.Scanner;
public class 火车购票 {
public static void main(String[] args) {
new 火车购票().run();
}
public void run() {
boolean flag=false;
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] a=new int
;
for (int i = 0; i < a.length; i++) {
a[i]=sc.nextInt();
}
int[][] b=new int[20][5];
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 5; j++) {
b[i][j]=0;
}
}
for (int i = 0; i < a.length; i++) {
if(a[i]==1){
flag=false;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.println((5*j+j2+1));
flag=true;
break;
}
}
if(flag){
break;
}
}
}
if(a[i]==2){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 4; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0){
b[j][j2]=1;
b[j][j2+1]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==2){break;}
}
}
if(count==2){
System.out.println("");
break;
}
}
}}
if(a[i]==3){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 3; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0&&b[j][j2+2]==0){
b[j][j2]=1;
b[j][j2+1]=1;
b[j][j2+2]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2)+" "+(5*j+j2+3));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==3){break;}
}
}
if(count==3){
System.out.println("");
break;
}
}
}
}
if(a[i]==4){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 2; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0&&b[j][j2+2]==0&&b[j][j2+3]==0){
b[j][j2]=1;
b[j][j2+1]=1;
b[j][j2+2]=1;
b[j][j2+3]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2)+" "+(5*j+j2+3)+" "+(5*j+j2+4));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==4){break;}
}
}
if(count==4){
System.out.println("");
break;
}
}
}
}
if(a[i]==5){
flag=false;
for (int j = 0; j < 20; j++){
for (int j2 = 0; j2 < 1; j2++){
if(b[j][j2]==0&&b[j][j2+1]==0&&b[j][j2+2]==0&&b[j][j2+3]==0&&b[j][j2+4]==0){
b[j][j2]=1;
b[j][j2+1]=1;
b[j][j2+2]=1;
b[j][j2+3]=1;
b[j][j2+4]=1;
System.out.print((5*j+j2+1)+" "+(5*j+j2+2)+" "+(5*j+j2+3)+" "+(5*j+j2+4)+" "+(5*j+j2+5));
flag=true;
break;
}
}
if(flag){
System.out.println("");
break;
}
}
if(!flag){
int count=0;
for (int j = 0; j < 20; j++) {
for (int j2 = 0; j2 < 5; j2++) {
if(b[j][j2]==0){
b[j][j2]=1;
System.out.print((5*j+j2+1)+" ");
count++;
if(count==5){break;}
}
}
if(count==5){
System.out.println("");
break;
}
}
}
}
}
sc.close();
}}
相关文章推荐
- CCF CSP 201609-2 火车购票(Java-100分)
- CCF 201612-2 火车购票 JAVA
- CCF编程练习:火车购票(Java)
- CCF 火车购票(Java)
- CCF CSP 201609-2 火车购票 java
- CCF 火车购票 C++ 解题,java写
- CCF 201612-2 火车购票 JAVA实现
- ccf竞赛之火车购票 java版
- CCF CSP 编程题目和解答-----试题名称:火车购票-------201609-2
- 火车购票问题(2016CCF)
- CCF 201609-2 火车购票 解题报告 简单模拟
- CCF-CSP 火车购票
- CCF 201612-2 火车购票 (暴力)
- 【CCF 火车购票 水】
- CCF计算机软件能力认证试题练习-图像旋转(Java参考答案学习记录)
- CCF 2016 9-2 火车购票
- ccf试题 火车购票
- CCF 201612-2 火车购票(简单模拟)
- CCF计算机软件能力认证试题练习-日期计算(Java参考答案学习记录)
- 201612-2 试题名称:火车购票(100分)ccf 认证