Algorithm/BOJ 기초
[백준] 10773 제로 Python C++
hackyu
2019. 10. 8. 15:57
|
1
2
3
4
5
6
7
8
9
|
n = int(input())
result = []
for i in range(n):
inputs = int(input())
if inputs == 0:
else:
print(sum(result))
|
|
|
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
|
#include <iostream>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <list>
#include <array>
#include <vector>
#include <map>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
stack <int> si;
int temp;
for (int i = 0; i < n; i++){
cin >> temp;
if (temp == 0)
si.pop();
else
}
int si_size = si.size();
temp = 0;
for (int i = 0; i < si_size; i++){
si.pop();
}
cout << temp << '\n';
return 0;
}
|
|