I participated in Goodbye 1400 on March 14th.

Author: smh997

Contests/خداحافظ 1400/README.md

@@ -0,0 +1,3 @@
+# خداحافظ 1400  (Goodbye 1400)
+- I participated in Goodbye 1400 competition which was held by Quera on [Quera.ir](https://quera.org/contest/assignments/40731/problems/137872)
+- My rank in this contest: 50th

Contests/خداحافظ 1400/انتقال با فلش.cpp

@@ -0,0 +1,53 @@
+/*
+ * https://quera.org/contest/assignments/40731/problems/137871
+ * Author: https://github.com/smh997/
+ */
+#include <bits/stdc++.h>
+using namespace std;
+
+int n, C;
+int f[21];
+int dp[(1<<18)+3];
+int cap[(1<<18)+3];
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int csum = 0;
+    cin >> n >> C;
+    for (int i = 0; i < n; ++i) {
+        cin >> f[i];
+        if(f[i] == C)
+            csum++;
+    }
+    dp[0] = 0;
+    if(csum == n || csum == n-1){
+        cout << n << endl;
+        return 0;
+    }
+    for (int i = 1; i < (1<<n); ++i) {
+        dp[i] = 1e9;
+        int sum = 0;
+        for (int b = 0; b < n; ++b) {
+            if(i & (1<<b)){
+                sum += f[b];
+            }
+        }
+        cap[i] = sum;
+        if(cap[i] <= C)
+            dp[i] = 1;
+    }
+    for (int mask = 1; mask < (1<<n); ++mask) {
+        if(dp[mask] != 1e9)
+            continue;
+        int prevy = mask & (mask-1);
+        while(prevy != 0){
+            dp[mask] = min(dp[mask], dp[mask-prevy] + dp[prevy]);
+            prevy = mask & (prevy-1);
+        }
+    }
+    cout << dp[(1<<n)-1] << endl;
+    return 0;
+}
+

Contests/خداحافظ 1400/بازه حذف کردن.py

@@ -0,0 +1,33 @@
+"""
+https://quera.org/contest/assignments/40731/problems/137869
+Author: https://github.com/smh997/
+"""
+n = int(input())
+li = []
+for i in range(n):
+    l, r = map(int, input().split())
+    li.append((l, r))
+li.sort()
+l, r = -1, -1
+arr = set()
+for rang in li:
+    if (l, r) == (-1, -1):
+        l, r = rang[0], rang[1]
+        continue
+    if rang[0] <= r < rang[1]:
+        r = rang[1]
+    elif rang[0] > r:
+        arr.add((l, r))
+        l, r = rang[0], rang[1]
+arr.add((l, r))
+arr = sorted(list(arr))
+one_flag, hundred_flag = True, True
+for rang in arr:
+    if rang[0] == 1 or rang[1] == 1:
+        one_flag = False
+    if rang[0] == 100 or rang[1] == 100:
+        hundred_flag = False
+if hundred_flag or one_flag:
+    print(-1)
+else:
+    print(len(arr)-1)

Contests/خداحافظ 1400/دو تکه چوب.py

@@ -0,0 +1,15 @@
+"""
+https://quera.org/contest/assignments/40731/problems/137872
+Author: https://github.com/smh997/
+"""
+a, b = map(int, input().split())
+c, d = max(a, b), min(a, b)
+bb = c / 2
+aa = bb
+cc = d
+li = [aa, bb, cc]
+li.sort()
+if li[2] < li[1] + li[0]:
+    print('YES')
+else:
+    print('NO')

Contests/خداحافظ 1400/ضرب گراف‌ها.cpp

@@ -0,0 +1,64 @@
+/*
+ * https://quera.org/contest/assignments/40731/problems/137866
+ * Author: https://github.com/smh997/
+ */
+#include <bits/stdc++.h>
+using namespace std;
+
+#define inf INT_MAX
+#define num long long int
+
+const int maxn = 503;
+
+int n, m, q;
+num sp[maxn][maxn];
+num a[500003], b[500003];
+
+int main(){
+    cin >> n >> m;
+    for(int i = 0; i < n; i++)
+        for(int j = 0; j < n; j++){
+            if(i == j)
+                sp[i][j] = 0;
+            else
+                sp[i][j] = inf;
+        }
+    for(int i = 0; i < m; i++){
+        int u, v;
+        cin >> u >> v;
+        u--;v--;
+        sp[u][v] = (num)1;
+        sp[v][u] = sp[u][v];
+    }
+    for(int k = 0; k < n; k++)
+        for(int i = 0; i < n; i++)
+            for(int j = 0; j < n; j++)
+                if(sp[i][k] != inf && sp[k][j] != inf && sp[i][k] + sp[k][j] < sp[i][j])
+                    sp[i][j] = sp[i][k] + sp[k][j];
+    cin >> q;
+    num res = 0;
+    bool fff = false;
+    for (int i = 0; i < q; ++i) {
+        cin >> a[i];
+        a[i]--;
+    }
+    for (int i = 0; i < q; ++i) {
+        cin >> b[i];
+        b[i]--;
+        if(!fff){
+            if(b[i] != a[i]){
+                if(sp[b[i]][a[i]] == inf){
+                    res = inf;
+                    fff = true;
+                }
+                else{
+                    res += sp[b[i]][a[i]];
+                }
+            }
+        }
+    }
+    if(fff)
+        cout << -1 << endl;
+    else
+        cout << res << endl;
+}