도서명 | eBook |
---|---|
개발자 영어 | O |
훌륭한 프로그래머 되는 법 | O |
3분 딥러닝, 케라스맛 | O |
블록과 함께 하는 파이썬 딥러닝 케라스 | X |
알고리즘으로 배우는 인공지능, 머신러닝, 딥러닝 입문 | X |
인공지능과 딥러닝 | O |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//2042-구간합구하기 | |
#include <iostream> | |
#include <algorithm> | |
using namespace std; | |
int n, m, k; | |
long long seg[5000000]; | |
long long update(int pos, int val, int node, int x, int y) { | |
/*재귀함수의 기저조건*/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//failfunction의 값들을 알고 있는 경우 | |
#include <cstdio> | |
#include <cstring> | |
#include <vector> | |
using namespace std; | |
const int MAX = 1000000; | |
int main(){ | |
char W[MAX+1], S[MAX+1]; | |
int M, N; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <cstdio> | |
#include <algorithm> | |
#include <string> | |
#include <cstring> | |
using namespace std; | |
#define MAX_N 500001 | |
char hear[MAX_N][21]; | |
char see[21]; | |
char hearsee[MAX_N][21]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <cstring> | |
using namespace std; | |
int main() | |
{ | |
/* | |
char char_arr[5] = { 'A','P','P','L','E' }; | |
char char_arr[5]="APPLE"; | |
어째서 에러가 날까? |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
#include <string> | |
#include <vector> | |
using namespace std; | |
#define MAX_N 1000001 | |
char t[MAX_N], p[MAX_N]; | |
int n, m; | |
vector<int> res; | |
int fail[MAX_N]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <algorithm> | |
using namespace std; | |
int chess_size; | |
int map[11][11]; | |
int max_black = 0, max_white = 0; | |
bool slash[22]; | |
bool back_slash[22]; | |
void black(int y, int x, int cnt) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <algorithm> | |
#include <vector> | |
#include <stack> | |
#include <queue> | |
#include <cstring> | |
using namespace std; | |
int arr[1020][1020]; | |
bool visited[1020]; | |
int vertex_num, edge_num; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<iostream> | |
#include<algorithm> //sort 함수를 출력하기 위한 헤더 | |
#include<vector> | |
#include<queue> | |
using namespace std; | |
int n, m, v; //n : vertex(정점)의 개수, m : edge(간선)의 개수, v : 정점의 번호 | |
vector<vector<int>> adj; //vector-vector를 선언 | |
vector<bool> visited; //node의 방문 여부에 대한 함수 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <vector> | |
#include <stack> | |
using namespace std; | |
vector<vector<int>> singer_vector; | |
stack <int> result; | |
bool visited[1001] = { false }; | |
bool finish[1001] = { false }; | |
bool cycle = false; |
OlderNewer