T-coding

더보기 #include #include #include using namespace std; #define MAX 55 string s; int visited[MAX]; stack st; int func(int start, int end) { int result = 0; for (int i = start; i > s; for (int i = 0; i < s.length(); i++) { i..

더보기 #include #include #include using namespace std; int gcd(int x, int y) { while (y) { int t = x % y; x = y; y = t; } return x; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; vectorarr(n); for (int i = 0; i > arr[i]; sort(arr.begin(), arr.end()); vectortmp; for (int i = 1; i < n; i++) tmp.push_back(arr[i] - arr[i - 1]); int res = tmp[0..

더보기 #include #include #include #include using namespace std; #define INF 1e9 int n,m; int start; vector v[20001]; vector dijkstra(int start) { vectordist(n + 1, INF); priority_queuepq; dist[start] = 0; pq.push({ 0,start }); while (!pq.empty()) { int cost = -pq.top().first; int now = pq.top().second; pq.pop(); if (dist[now] < cost) continue; for (auto& next : v[now]) { int nv = next.first;..