程序代码：

#include<stdio.h>
int main()
{
    int a[50],b[50];
    int i,tmp,pod=0,ned=0;
    while((scanf("%d",&tmp),tmp)!=0)
    {
        if(tmp>0) a[pod++]=tmp;
        else if(tmp<0) b[ned++]=tmp;
    }
    printf("正数 %d 个,负数 %d 个\n",pod,ned);
    for(i=0;i<pod;i++) printf("%d ",a[i]);
    for(i=0;i<ned;i++) printf("%d ",b[i]);
    printf("\n");
    return 0;
}

程序代码：

#include <stdio.h>

int main (void) {

        int a=0,b=0,array[100],i=0,j,n,m;

        while(1) {
                scanf("%i",&n);
                if(n==0) break;
                else if(n<0) a++;
                else b++;
                array[i]=n;
                i++;
        }

        for(j=0;j<i-1;j++) {
                for(n=j+1;n<i;n++) {
                        if(array[j]<array[n]) {
                                m=array[j];
                                array[j]=array[n];
                                array[n]=m;
                        }
                }
        }

        printf("Numbers of integer:%i\nNumbers of negative:%i \n",b,a);

        printf("After sorted:\n");

        for(j=0;j<i;j++)
                printf("%i ",array[j]);

        printf("\n");

        return 0;

}

程序代码：

#include <iostream>
using namespace std;

class Node
{
public:
    Node(Node *next=NULL, int data=0);
public:
    int data;
    Node *next;
};

Node::Node(Node *next, int data)
{
    this->next = next;
    this->data = data;
}

class List
{
public:
    List();
    bool add_node(int data);
    void print_list();

private:
    Node *head;
};

List::List()
{
    head = new Node();
    head->next = NULL;
}

bool List::add_node(int data)
{
    Node *p = head->next;
    Node *prev = head;

    while (NULL != p)
    {
        if (p->data <= data)
        {
            prev->next = new Node(prev->next, data);
            return true;
        }
        prev = prev->next;
        p = p->next;
    }
   
    prev->next = new Node(prev->next, data);

    return true;
}

void List::print_list()
{
    Node *p = head->next;

    while (NULL != p)
    {
        cout << p->data << ' ';
        p = p->next;
    }
    cout << endl;
}

int main()
{
    List L;
    size_t mm;
   
    do
    {
        cin >> mm;
    }while (0 != mm && L.add_node(mm));

    cout << "\t打印数据" << endl;
    L.print_list();

    return EXIT_SUCCESS;
}