Algorithm/BOJ 기초 (19) 썸네일형 리스트형 [백준] 화성수학 5355 C++ 1234567891011121314151617181920212223242526272829303132333435363738394041#include #include #include using namespace std; int main() { string N; int n; getline(cin, N); n = stoi(N); string s; float first; float *result = new float[n]; for (int i = 0; i [백준] 스택수열 1874 Python 1234567891011121314151617181920212223N = int(input())obj = []stack = []result = []idx = 0 for i in range(N): obj.append(int(input())) for i in range(1, N+1): stack.append(i) result.append("+") while idx [백준] 2839 설탕문제 Java 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 import java.util.Scanner; public class Main { public static void main(String[] args) throws Exception { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int five = 0; int three = 0; while(N%5!=0&&N>=0){ N-=3; three++; } if(N 이전 1 2 3 다음