🐢

Where there is a will, there is a way

NiklasJang niklasjang

🐢

Where there is a will, there is a way

Student

5 followers · 2 following

View GitHub Profile

Recently created

Least recently created

Recently updated

Least recently updated

niklasjang / var-let-const.md

Last active October 7, 2019 02:22 — forked from LeoHeo/var-let-const.md

javascript var, let, const 차이점

var, let, const 차이점은?

var는 function-scoped이고, let, const는 block-scoped입니다.
function-scoped와 block-scoped가 무슨말이냐?

var(function-scoped)

jsfiddle 참고주소

niklasjang / boj15651.cpp

Last active March 22, 2020 10:46

[PS][완전탐색][N자리 K진수]/[BOJ][15651][N과 M (3)]

	#include <iostream>
	using namespace std;

	int n=0, k=0;
	int arr[100];
	void recur(int depth){
	if(depth == n){
	for(int j=0; j<n; j++){
	cout << arr[j] <<" ";
	}

niklasjang / boj15649.cpp

Created March 22, 2020 10:57

[PS][완전탐색][N자리 K진수]/[BOJ][15651][N과 M (1)]

	#include <iostream>
	using namespace std;

	int n=0, k=0;
	bool visited[100];
	int arr[100];
	void recur(int depth){
	if(depth == n){
	for(int j=0; j<n; j++){
	cout << arr[j] <<' ';

niklasjang / boj15650_0.cpp

Created March 22, 2020 11:04

[PS][완전탐색][N자리 K진수]/[BOJ][15651][N과 M (2)]/방법0

	#include <iostream>
	using namespace std;

	int n=0, k=0;
	int arr[100];

	void recur(int depth){
	if(depth == n){
	for(int j=0; j<n; j++){
	cout << arr[j] <<' ';

niklasjang / boj15650_1.cpp

Created March 22, 2020 11:09

[PS][완전탐색][N자리 K진수]/[BOJ][15651][N과 M (2)]/방법1

	#include <iostream>
	using namespace std;

	int n=0, k=0;
	int arr[100];

	void recur(int depth, int start){
	if(depth == n){
	for(int j=0; j<n; j++){
	cout << arr[j] <<' ';

niklasjang / boj15652.cpp

Created March 22, 2020 11:15

[PS][완전탐색][N자리 K진수]/[BOJ][15651][N과 M (4)]

	#include <iostream>
	using namespace std;

	int n=0, k=0;
	int arr[100];

	void recur(int depth, int start){
	if(depth == n){
	for(int j=0; j<n; j++){
	cout << arr[j] <<' ';

niklasjang / boj15656.cpp

Last active March 22, 2020 15:12

[PS][완전탐색][N자리 K진수]/[BOJ][15651][N과 M (7)]


	#include <iostream>
	#include <algorithm>
	using namespace std;

	int n=0, k=0;
	int input[100];
	int arr[100];
	void recur(int depth){
	if(depth == n){

niklasjang / boj2023.cpp

Created March 22, 2020 15:53

[PS][완전탐색][N자리 K진수]/[BOJ][2023][신기한 소수]


	#include <iostream>
	using namespace std;

	int n=0;

	bool isPrime(int num){
	if(num == 0) return true;
	if(num == 1) return false;
	int cnt = 0;

niklasjang / boj1759_0.cpp

Last active March 22, 2020 16:37

[PS][완전탐색][N자리 K진수]/[BOJ][1759][암호 만들기]방법0

	#include <iostream>
	#include <algorithm>
	using namespace std;

	int n=0, k=0;
	int mo=0, za=0;
	char input[20];
	char arr[100];
	bool visited[20];
	void recur(int depth, int mcnt, int zcnt){

niklasjang / boj1759_1.cpp

Created March 22, 2020 16:38

[PS][완전탐색][N자리 K진수]/[BOJ][1759][암호 만들기]방법1

	#include <iostream>
	#include <algorithm>
	using namespace std;

	int n=0, k=0;
	int mo=0, za=0;
	char input[20];
	char arr[100];
	bool visited[20];
	void recur(int depth, int start, int mcnt, int zcnt){

OlderNewer