216

198

import Foundation

let N = Int(readLine()!)!
var res = 1

for i in 0 ..< N{
    var temp = i
    var sum = 0
    while( temp != 0){
        sum += temp % 10
        temp /= 10
    }
    if (sum + i == N){
        res = i
        break
    }
}
print(res)

https://www.acmicpc.net/

14
push 1
push 2
top
size
empty
pop
pop
pop
size
empty
pop
push 3
empty
top

2
2
0
2
1
-1
0
1
-1
0
3

코드

import Foundation

public struct Stack<T>{
    private var elements = [T]()
    public init() {}
    
    public mutating func push(_ element: T){
        self.elements.append(element)
    }
    
    public mutating func pop() -> T? {
        return self.elements.popLast()
    }
    
    public func top() -> T? {
        return self.elements.last
    }
    
    public func empty() -> Bool {
        return self.elements.isEmpty
    }
    
    public var size: Int {
        return self.elements.count
    }
}

var myStack = Stack<Int>()
var arr : [String] = []

let input = Int(readLine()!)!

for _ in 0 ..< input {
    arr.append(readLine()!)
}

for i in 0 ..< input {
    var narr = arr[i].split(separator: " ")
    if narr[0] == "top"{
        let top = myStack.top()
        if top == nil{
            print(-1)
        }else{
            print(top!)
        }
    }
    if narr[0] == "size"{
        print(myStack.size)
    }
    if narr[0] == "pop"{
        let pop = myStack.pop()
        if pop == nil {
            print(-1)
        }else{
            print(pop!)
        }
    }
    if narr[0] == "empty"{
        if myStack.empty() == true{
            print(1)
        }else{
            print(0)
        }
    }
    if narr[0] == "push"{
        let n : Int = Int(narr[1])!
        myStack.push(n)
    }
    narr.removeAll()
}

• 문제를 만든 사람: baekjoon
• 데이터를 추가한 사람: deunlee, djm03178

6 2 10 3

1

코드

import Foundation

let input = readLine()!.split(separator: " ").map{Int(String ($0))!}

let inputX = input[0]
let inputY = input[1]
let compX = input[2]
let compY = input[3]

var resX = inputX-compX
var resY = inputY-compY


if (resX < 0){
    resX = resX * -1
}
if (resY < 0){
    resY = resY * -1
}

print(min(resX,resY,inputX,inputY))

• 문제를 번역한 사람: baekjoon

8 8
WBWBWBWB
BWBWBWBW
WBWBWBWB
BWBBBWBW
WBWBWBWB
BWBWBWBW
WBWBWBWB
BWBWBWBW

1

코드

import Foundation

let input = readLine()!.split(separator: " ").map{Int(String($0))!}
let row = input.first!
let col = input.last!
var arr : [[String]] = []
var res = 999

for _ in 0 ..< row {
    arr.append(readLine()!.map{String($0)})
}

let White =
[["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"]]

let Black =
[["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"]]

func compare(trow: Int,tcol:Int)-> Int{
    var Wcount = 0
    var Bcount = 0
    for i in 0..<8{
        for j in 0..<8{
            if White[i][j] != arr[trow + i][ tcol + j]{
                Wcount += 1
            }
            if Black[i][j] != arr[trow + i][ tcol + j]{
                Bcount += 1
            }
        }
    }
    if Wcount >= Bcount{
        return Bcount
    }else{
        return Wcount
    }
}

for i in 0...row-8{
    for j in 0...col-8{
        res = min(compare(trow: i, tcol: j),res)
    }
}

print(res)

• 문제를 번역한 사람: baekjoon
• 데이터를 추가한 사람: jh05013
• 문제를 다시 작성한 사람: jh05013

3
21 Junkyu
21 Dohyun
20 Sunyoung

20 Sunyoung
21 Junkyu
21 Dohyun

코드

import Foundation

struct Member{
    var name : String
    var age : Int
    var index : Int
    
}

let num = Int(readLine()!)!
var member : [Member] = []

for i in 0 ..< num {
    let input = readLine()!.split(separator: " ").map { a in String(a) }
    let A = Member(name: input[1], age: Int(input[0])!, index: i)
    member.append(A)
}

member.sort { a, b in a.age == b.age ? a.index < b.index : a.age < b.age }

for i in 0..<num{
    print("\(member[i].age) \(member[i].name)")
}

24 18

6
72

코드

import Foundation

let input = readLine()!.split(separator: " ").map{Int($0)!}
var max = input.max()!
var min = input.min()!
var mod = 0

mod = max % min
while true{
    if mod == 0 {
        break
    }
    max = min
    min = mod
    mod = max % min
}
print(min)
print(min * (input[0]/min) * (input[1]/min))

후기

유클리드를 몰라 깡으로풀다 안돼서

https://sectumsempra.tistory.com/77

이거보고 배웠슴다...

Olympiad > 한국정보올림피아드 > 한국정보올림피아드시․도지역본선 > 지역본선 2004 > 중등부 1번

Olympiad > 한국정보올림피아드 > 한국정보올림피아드시․도지역본선 > 지역본선 2004 > 고등부 1번

• 데이터를 추가한 사람: circlecho, jsh587