Markdown์ ํ ์คํธ ๊ธฐ๋ฐ์ ๋งํฌ์ ์ธ์ด๋ก 2004๋ ์กด๊ทธ๋ฃจ๋ฒ์ ์ํด ๋ง๋ค์ด์ก์ผ๋ฉฐ ์ฝ๊ฒ ์ฐ๊ณ ์ฝ์ ์ ์์ผ๋ฉฐ HTML๋ก ๋ณํ์ด ๊ฐ๋ฅํ๋ค. ํน์๊ธฐํธ์ ๋ฌธ์๋ฅผ ์ด์ฉํ ๋งค์ฐ ๊ฐ๋จํ ๊ตฌ์กฐ์ ๋ฌธ๋ฒ์ ์ฌ์ฉํ์ฌ ์น์์๋ ๋ณด๋ค ๋น ๋ฅด๊ฒ ์ปจํ ์ธ ๋ฅผ ์์ฑํ๊ณ ๋ณด๋ค ์ง๊ด์ ์ผ๋ก ์ธ์ํ ์ ์๋ค. ๋งํฌ๋ค์ด์ด ์ต๊ทผ ๊ฐ๊ด๋ฐ๊ธฐ ์์ํ ์ด์ ๋ ๊นํ(https://github.com) ๋๋ถ์ด๋ค. ๊นํ์ ์ ์ฅ์Repository์ ๊ดํ ์ ๋ณด๋ฅผ ๊ธฐ๋กํ๋ README.md๋ ๊นํ์ ์ฌ์ฉํ๋ ์ฌ๋์ด๋ผ๋ฉด ๋๊ตฌ๋ ๊ฐ์ฅ ๋จผ์ ์ ํ๊ฒ ๋๋ ๋งํฌ๋ค์ด ๋ฌธ์์๋ค. ๋งํฌ๋ค์ด์ ํตํด์ ์ค์น๋ฐฉ๋ฒ, ์์ค์ฝ๋ ์ค๋ช , ์ด์ ๋ฑ์ ๊ฐ๋จํ๊ฒ ๊ธฐ๋กํ๊ณ ๊ฐ๋ ์ฑ์ ๋์ผ ์ ์๋ค๋ ๊ฐ์ ์ด ๋ถ๊ฐ๋๋ฉด์ ์ ์ ์ฌ๋ฌ ๊ณณ์ผ๋ก ํผ์ ธ๊ฐ๊ฒ ๋๋ค.
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
| REMIX EXAMPLE PROJECT | |
| Remix example project is present when Remix loads very first time or there are no files existing in the File Explorer. | |
| It contains 3 directories: | |
| 1. 'contracts': Holds three contracts with different complexity level, denoted with number prefix in file name. | |
| 2. 'scripts': Holds two scripts to deploy a contract. It is explained below. | |
| 3. 'tests': Contains one test file for 'Ballot' contract with unit tests in Solidity. | |
| SCRIPTS |
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<vector> | |
| #include<stack> | |
| #include<algorithm> | |
| using namespace std; | |
| int N, M, nowTime, sccCnt; | |
| stack<int> St; | |
| vector<int> dfsn, sccNum; | |
| vector<bool> finished; | |
| vector< vector<int>> adj, SCC; |
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<algorithm> | |
| using namespace std; | |
| const int INF = 100005; | |
| int dist[105][105]; | |
| int main() { | |
| int N, M; | |
| scanf("%d%d", &N, &M); | |
| for (int i = 1; i <= N; i++) | |
| for (int j = 1; j <= N; j++) |
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<vector> | |
| using namespace std; | |
| int segSize = 1, N, M; | |
| vector<int> seg; | |
| void update(int idx, int val) { | |
| idx += segSize; | |
| seg[idx] = val; | |
| while (idx > 1) { | |
| idx /= 2; |
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<vector> | |
| using namespace std; | |
| int N, M; | |
| vector<int> par; | |
| int find(int idx) { | |
| if (par[idx] < 0) return idx; | |
| return par[idx] = find(par[idx]); | |
| } | |
| void merge(int a, int b) { |