zoukankan      html  css  js  c++  java
  • hbmy周赛1--C

    C - Exam
    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    An exam for n students will take place in a long and narrow room, so the students will sit in a line in some order. The teacher suspects that students with adjacent numbers (i and i + 1) always studied side by side and became friends and if they take an exam sitting next to each other, they will help each other for sure.

    Your task is to choose the maximum number of students and make such an arrangement of students in the room that no two students with adjacent numbers sit side by side.

    Input

    A single line contains integer n (1 ≤ n ≤ 5000) — the number of students at an exam.

    Output

    In the first line print integer k — the maximum number of students who can be seated so that no two students with adjacent numbers sit next to each other.

    In the second line print k distinct integers a1, a2, ..., ak (1 ≤ ai ≤ n), where ai is the number of the student on the i-th position. The students on adjacent positions mustn't have adjacent numbers. Formally, the following should be true: |ai - ai + 1| ≠ 1 for all i from 1 tok - 1.

    If there are several possible answers, output any of them.

    Sample Input

    Input
    6
    Output
    6
    1 5 3 6 2 4
    Input
    3
    
    Output
    2
    1 3
    
    
    #include <iostream>
    #include <stdio.h>
    using namespace std;
    
    int main()
    {
    	int n;
    	cin >> n;
    	if (n==1)
    	{
    		cout << 1<< endl << 1<< endl;
    	}
    	if (n==2)
    		cout << 1<< endl << 1<< endl; 
    	if (n==3)
    	{
    		cout << 2<< endl<< 1<< " "<< 3<< endl;
    	}
    	if (n == 4)
    	{
    		cout <<4<< endl; 
    		cout << 2 << " "<< 4<< " "<< 1<<" "<< 3<<endl;
    	}
    	if (n==5)
    		cout << 5<<endl<<1<<" "<< 4<< " "<< 2<< " "<< 5<< " "<<3<< endl;
    	if (n>5)
    	{
    		cout << n<< endl;
    		cout << n<< " ";
    		for (int i=1; i<n; i++)
    		{
    			if (i%2!=0)
    				printf("%d ",i);
    		}
    		for (int j=2; j<n; j++)
    		{
    			if (j%2==0)
    				printf("%d ",j);
    		}
    		cout << endl;
    	}
    	return 0;
    }


  • 相关阅读:
    Windows各个文件夹介绍
    Zabbix使用外部命令fping处理ICMP ping的请求
    QT 样式表实例
    QT 样式表基础知识
    cocos2d-js入门一
    try throw catch typeid
    cocos2d-x入门三 分层设计框架
    cocos2d-x入门二 helloworld实例运行与创建
    cocos2d-x入门一
    批量操作QT UI中的控件
  • 原文地址:https://www.cnblogs.com/Tovi/p/6194895.html
Copyright © 2011-2022 走看看