disjukr

문자열 인코딩에 대해서...

문자 코드는 우리가 표현하고자 하는 문자들의 집합을 코드화시킨 것이고, 문자열 인코딩은 그러한 문자 코드의 배열을 메모리상에 표현하는 방법입니다.

문자 코드	인코딩
아스키 코드	iso 8859

znxkznxk1030

#include <stdio.h>
#include <iostream>
#include <stack>
#include <cstring>
#include <queue>

#define ll long long int
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)>(b)?(b):(a)
#define pii pair<int , int>

znxkznxk1030

#include <stdio.h>
#include <iostream>
#include <stack>
#include <cstring>

#define ll long long int
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)>(b)?(b):(a)
#define pii pair<int , int>
#define time first

znxkznxk1030

#include <stdio.h>
#include <iostream>
#include <stack>
#include <cstring>

#define ll long long int
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)>(b)?(b):(a)

using namespace std;

znxkznxk1030

#include <stdio.h>
#include <iostream>
#include <stack>
#include <cstring>
#include <queue>

#define ll long long int
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)>(b)?(b):(a)
#define pii pair<int , int>

ksseono

NAVER DEVIEW 2017 Slides

• 키노트 영상

DAY 1

• Open, Share, Enjoy : 네이버의 오픈소스 활동 (영상)
• 책 읽어주는 딥러닝: 배우 유인나가 해리포터를 읽어준다면 (데모, 소스코드, 영상)
• Chromium Binding 기술을 활용하여 Node.js와 네이티브 모듈 우아하게 연동하기 (영상)

intinig

---
Language:        Cpp
AccessModifierOffset: -4
AlignAfterOpenBracket: DontAlign
AlignConsecutiveAssignments: false
AlignConsecutiveDeclarations: false
AlignEscapedNewlines: Left
AlignOperands:   true
AlignTrailingComments: true
AllowAllParametersOfDeclarationOnNextLine: true

lisawolderiksen

Using Git Commit Message Templates to Write Better Commit Messages

The always enthusiastic and knowledgeable mr. @jasaltvik shared with our team an article on writing (good) Git commit messages: How to Write a Git Commit Message. This excellent article explains why good Git commit messages are important, and explains what constitutes a good commit message. I wholeheartedly agree with what @cbeams writes in his article. (Have you read it yet? If not, go read it now. I'll wait.) It's sensible stuff. So I decided to start following the

bessarabov

git log --author="Linus Torvalds" --date=iso | perl -nalE 'if (/^Date:\s+[\d-]{10}\s(\d{2})/) { say $1+0 }' | sort | uniq -c|perl -MList::Util=max -nalE '$h{$F[1]} = $F[0]; }{ $m = max values %h; foreach (0..23) { $h{$_} = 0 if not exists $h{$_} } foreach (sort {$a <=> $b } keys %h) { say sprintf "%02d - %4d %s", $_, $h{$_}, "*"x ($h{$_} / $m * 50); }'