-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.c
84 lines (67 loc) · 1.2 KB
/
main.c
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
//
// main.c
// BaekJun Algorithm 47(10773, 제로)
// https://www.acmicpc.net/problem/10773
// Created by hyungwook on 2021/03/28.
//
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int max;
int ptr;
int *stk;
} IntStack;
int Initialize(IntStack *s, int max)
{
s->max = max;
s->ptr = 0;
s->stk = malloc(sizeof(int) * max);
return 0;
}
int Push(IntStack *s, int x)
{
if(s->max <= s->ptr)
return -1;
s->stk[s->ptr] = x;
s->ptr++;
return 0;
}
int Pop(IntStack *s, int *x)
{
if(s->ptr == 0)
return -1;
s->ptr--;
*x = s->stk[s->ptr];
return 0;
}
int Isempty(IntStack *s)
{
if(s->ptr == 0)
return 1;
else
return 0;
}
int main(int argc, const char * argv[]) {
// insert code here...
IntStack s;
int k;
int x;
long long sum = 0;
Initialize(&s, 100000);
scanf("%d", &k);
for(int i = 0; i < k; i++)
{
scanf("%d", &x);
if(x == 0)
Pop(&s, &x);
else
Push(&s, x);
}
while(!Isempty(&s))
{
Pop(&s, &x);
sum += x;
}
printf("%lld\n", sum);
return 0;
}