#include<unordered_map>
#include<iostream>
using namespace std;
class A{
private:
int x;
int y;
float x_f;
float y_f;
jeon3029
/ bits-stdc++.h
Created
April 9, 2024 02:30
— forked from Einstrasse/bits-stdc++.h
bits/stdc++.h header file
This file contains hidden or 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
| // C++ includes used for precompiling -*- C++ -*- | |
| // Copyright (C) 2003-2015 Free Software Foundation, Inc. | |
| // | |
| // This file is part of the GNU ISO C++ Library. This library is free | |
| // software; you can redistribute it and/or modify it under the | |
| // terms of the GNU General Public License as published by the | |
| // Free Software Foundation; either version 3, or (at your option) | |
| // any later version. |
jeon3029
/ gist:3ed5f3c3d5aba68597617d6ec11969c5
Created
October 2, 2021 13:53
c++ / unordered map with class Example
jeon3029
/ surjective.c
Created
June 22, 2021 08:07
— forked from thinkphp/surjective.c
Generating the total number of surjective functions
This file contains hidden or 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 <stdio.h> | |
| #define SIZE 100 | |
| int stack[SIZE], | |
| level, | |
| N, | |
| M; | |
| void init() { |
jeon3029
/ kmp.cpp
Created
June 22, 2021 08:06
— forked from bowbowbow/kmp.cpp
This file contains hidden or 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 <string> | |
| #include <cstdio> | |
| #include <vector> | |
| using namespace std; | |
| vector<int> getPi(string p){ | |
| int m = (int)p.size(), j=0; | |
| vector<int> pi(m, 0); | |
| for(int i = 1; i< m ; i++){ | |
| while(j > 0 && p[i] != p[j]) |
- ๋ธ๋ก์ ๊ฐ์์ ์ฅ๋ถ๋ฅผ ์๋ฏธ(์ํธํ ๋์ด ์ ์ฅ)
- ์ฌ๋ฌ์ฌ๋์ด ๋์ผํ๊ฒ ๋ธ๋ก์ ๋๋์ด ๊ฐ์ง
- ํ๋์ ๋ธ๋ก์ด ํดํน๋์ด๋ ๋ถ์ฐ ์ ์ฅ๋์ด์๊ธฐ ๋๋ฌธ์ ์ฌ์ค์ ํดํน(์,๋ณ์กฐ)์ด ๋ถ๊ฐ --> ์ค์ํต์ ์์ด๋ ๊ฑฐ๋๊ฐ ๊ฐ๋ฅ
- ์ 2์ ์ธํฐ๋ท์ด๋ผ๊ณ ๋ ๋ถ๋ฆผ๏ฟฝ
jeon3029
/ 20190808_codinginterview(chap1).md
Last active
August 16, 2019 13:09
20190808_codinginterview(chap1to5) / ์ฝ๋ฉ์ธํฐ๋ทฐ ์์ ๋ถ์(1~5์ฅ) ์์ฝ