hiho week 39 register

Ended

Participants:2159

Verdict:Time Limit Exceeded
Score:40 / 100
Submitted:2015-04-04 17:53:54

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <stdio.h>
#include <stdlib.h>
typedef struct Node
{
    long long data;
    struct Node *next;
}List;
void InsertList(List *head, long long &data, long long &count)
{
    List *p = head;
    while(1)
    {
        if(p->next == NULL || p->next->data < data)
        {
            List *tmp = (List *)malloc(sizeof(Node));
            tmp->data = data;
            tmp->next = p->next;
            p->next = tmp;
            break;
        }
        else if(p->next->data > data)
        {
            count++;
            p = p->next;
        }
    }
}
void DeleteList(List *head)
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX