zoukankan      html  css  js  c++  java
  • CDZSC_2015寒假新人(1)——基础 D

    Description

    These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.        Give you some integers, your task is to sort these number ascending (升序).        You should know how easy the problem is now!        Good luck!       
                  

    Input

    Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.         It is guarantied that all integers are in the range of 32-int.       
                  

    Output

    For each case, print the sorting result, and one line one case.       
                  

    Sample Input

    2
    3 2 1 3
    9 1 4 7 2 5 8 3 6 9
                  

    Sample Output

    1 2 3
    1 2 3 4 5 6 7 8 9
     
    思路:简单排序,没啥思路
     
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    int main()
    {
    #ifdef CDZSC_OFFLINE
        freopen("in.txt","r",stdin);
    #endif
        int t,n,a[1010],i;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d",&n);
            for(i=0; i<n; i++)
            {
                scanf("%d",&a[i]);
            }
            sort(a,a+n);
            for(i=0; i<n; i++)
            {
                if(i!=0)
                {
                    printf(" ");
                }
                printf("%d",a[i]);
            }
            printf("
    ");
        }
        return 0;
    }
    View Code
  • 相关阅读:
    跨域处理
    intellij idea远程调试
    sring boot特性
    spring mvc与struts2的区别
    jenkins集成sonar
    hibernate笔记
    python脚本
    python 字符框
    python操作
    python环境配置
  • 原文地址:https://www.cnblogs.com/Wing0624/p/4243808.html
Copyright © 2011-2022 走看看