Skip to content

Instantly share code, notes, and snippets.

@uhmseohun
uhmseohun / io-test2-ymd.cpp
Created March 22, 2019 15:21
입출력 연산자 Test2 - 년월일 출력하기
#include <stdio.h>
int main() {
int year, month, day;
scanf("%d.%d.%d", &year, &month, &day);
printf("%04d년 %02d월 %02d일\n", year, month, day);
return 0;
}
@uhmseohun
uhmseohun / print.css
Created July 18, 2019 22:44
io print
table, th, td, tr{
border-collapse: collapse;
border: 1px solid #c4c4c4;
}
.Ticket {
height: 100%;
width: 100%;
}
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
/** Error Messages **/
const char undefinedCmd[100] = "Undefined Command.";
void swap (int *a, int *b) {
int tmp = *a;
*a = *b;
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
/** Error Messages **/
const char undefinedCmd[100] = "Undefined Command.";
void swap (int *a, int *b) {
int tmp = *a;
*a = *b;
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
/** Error Messages **/
const char undefinedCmd[100] = "Undefined Command.";
void swap (int *a, int *b) {
int tmp = *a;
*a = *b;
@uhmseohun
uhmseohun / math.cpp
Last active December 10, 2019 11:21
수학 평면좌표 단원
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
/** Error Messages **/
const char undefinedCmd[100] = "Undefined Command.";
void swap (int *a, int *b) {
int tmp = *a;
*a = *b;
@uhmseohun
uhmseohun / set.cpp
Created December 11, 2019 03:00
수학 집합 단원
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <algorithm>
using namespace std;
const int maxSize = 150; // The maximum number of elements
const int boundSize = 50;
@uhmseohun
uhmseohun / simple_mnist.py
Created April 6, 2020 08:00
간단한 MNIST 예제
import numpy as np
import tensorflow as tf
from tensorflow.keras.models import Sequential
from tensorflow.keras.layers import Flatten, Dense, Activation
def softmax(x):
return np.exp(x) / np.sum(np.exp(x), axis=0)
(x_train, y_train), (x_test, y_test) = tf.keras.datasets.mnist.load_data()
x_train = x_train.astype('float32')
#include <iostream>
#include <set>
#include <string>
using namespace std;
set <int> s;
void push () {
int val;
cin >> val;
if (s.insert(val).second)
#include <stdio.h>
#include <stdlib.h>
#define STACK_SIZE 10
char stack[STACK_SIZE];
int top = -1;
int isFull() {
return top >= STACK_SIZE - 1;
}