zoukankan      html  css  js  c++  java
  • ACM HDU 1040 As Easy As A+B

    As Easy As A+B

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 15920    Accepted Submission(s): 6448


    Problem 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
     

    Author
    lcy
     
    太简单了,水题
    #include<stdio.h>
    #include
    <stdlib.h>
    int a[100];
    int cmp(const void *a,const void *b)
    {
    return *(int *)a-*(int *)b;
    }
    int main()
    {
    int T,n,i;
    scanf(
    "%d",&T);
    while(T--)
    {
    scanf(
    "%d",&n);
    for(i=0;i<n;i++)
    scanf(
    "%d",&a[i]);
    qsort(a,n,
    sizeof(a[0]),cmp);
    for(i=0;i<n-1;i++) printf("%d ",a[i]);
    printf(
    "%d\n",a[n-1]);
    }
    return 0;
    }

  • 相关阅读:
    红蓝对抗
    SQLMAP用法大全
    Web安全工程师(进阶)课程表
    msf连接PostgreSQL数据库
    我的web安全工程师学习之路——规划篇
    web安全深度剖析pdf
    js面试题
    js克隆一个对象
    js面试必考:this
    前端面试:js数据类型
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2119924.html
Copyright © 2011-2022 走看看