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
| using System; | |
| using System.IO; | |
| using System.Collections; | |
| using System.Collections.Generic; | |
| using System.Data; | |
| using System.Text; | |
| using System.Net; | |
| public partial class CustomScript |
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
| @FormUrlEncoded | |
| @POST("์์ URL์ฃผ์") | |
| @Headers("Content-Type:application/x-www-form-urlencoded; charset=utf-8") | |
| Call<ConsultingRes> regiConsultation(@Field("data") String request); |
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> | |
| using namespace std; | |
| int gcd(long long a, long long b){ | |
| int tmp,min,max; | |
| if(a < b) {min = a, max=b;} | |
| else {min = b; max = a;} | |
| while(min != 0){ | |
| tmp = (max % min); | |
| max = min; |
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
| import java.util.ArrayList; | |
| import java.util.List; | |
| class Solution { | |
| public static int solution(String skill, String[] skill_trees) { | |
| int answer = 0; | |
| for(int i = 0 ; i < skill_trees.length ; i++){ | |
| List<Character> list = new ArrayList<Character>(); | |
| for(int j = 0 ; j < skill_trees[i].length() ; j++){ | |
| for(int k = 0 ; k < skill.length() ; k++){ |
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 <string> | |
| #include <vector> | |
| #include<iostream> | |
| using namespace std; | |
| int solution(string skill, vector<string> skill_trees) { | |
| int answer = 0; | |
| for (int i = 0; i < skill_trees.size(); i++) { | |
| vector<char> compare; |
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 <string> | |
| #include <map> | |
| using namespace std; | |
| map<char, int> m; | |
| vector<int> origin; | |
| int solution(string skill, vector<string> skill_trees) { |
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
| /* #2 ๋ณ์์ ์๋ฃํ | |
| * var : ์ผ๋ฐ์ ์ผ๋ก ํต์ฉ, ์ธ์ ๋ ์ง ์ฝ๊ธฐ ์ฐ๊ธฐ๊ฐ ๊ฐ๋ฅ | |
| * val : ์ ์ธ์์๋ง ์ด๊ธฐํ ๊ฐ๋ฅ. ์ค๊ฐ์ ๊ฐ ๋ณ๊ฒฝX(const?) | |
| * | |
| * Property(์์ฑ) : ํด๋์ค์ ์ ์ธ๋ ๋ณ์ | |
| * Local Variable(๋ก์ปฌ๋ณ์) : Scope๋ด์ ์ ์ธ๋ ๋ณ์ | |
| * | |
| * ์ฝํ๋ฆฐ์ null์ ํ์ฉํ์ง ์์ผ๋ nullable๋ณ์ ์ฌ์ฉ๊ฐ๋ฅ | |
| * nullable๋ณ์ ์ ์ธ ์ : var a:Int? = null | |
| * |
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
| HttpLoggingInterceptor interceptor = new HttpLoggingInterceptor(); | |
| interceptor.setLevel(HttpLoggingInterceptor.Level.BODY); | |
| OkHttpClient ok_client = new OkHttpClient.Builder().addInterceptor(interceptor).build(); | |
| Retrofit builder = new Retrofit.Builder() | |
| .baseUrl(IP) // ์ ์ํ๋ ค๋ IP | |
| .addConverterFactory(GsonConverterFactory.create()) | |
| .client(ok_client) | |
| .build(); | |
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 <cstring> | |
| #define MAX 502 | |
| #define INF 999999999 | |
| using namespace std; | |
| vector<pair<int, int>> path[MAX]; | |
| int dist[MAX]; | |
| int main() { | |
| int N, M; |
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 <queue> | |
| #include <vector> | |
| #include <algorithm> | |
| #include <cstring> | |
| #define MAX 10001 | |
| using namespace std; | |
| bool visited[MAX][MAX]; | |
| int dp[MAX], degree[MAX]; | |
| vector<pair<int,int>> startToEnd[MAX], endToStart[MAX]; |