Refresh

OnlineJudges/hdu/hdu.cpp

@@ -0,0 +1 @@
+

OnlineJudges/lydsy/2809.cpp

@@ -0,0 +1,66 @@
+#include <cctype>
+#include <cstdio>
+template <typename T> inline void swap(T &x, T &y)
+{
+    T t = x;
+    x = y;
+    y = t;
+}
+template <typename T> inline T max(T x, T y) { return x > y ? x : y; }
+inline void read(int &x)
+{
+    int ch = x = 0;
+    while (!isdigit(ch = getchar()));
+    for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
+}
+const int maxn = 100010;
+int n, m, fa[maxn], C[maxn], L[maxn], cnt;
+typedef struct Node
+{
+    Node *lc, *rc;
+    int val, dis, sz;
+    long long sum;
+} *lpNode;
+lpNode merge(lpNode x, lpNode y)
+{
+    if (x == 0) return y;
+    if (y == 0) return x;
+    if (x->val < y->val) swap(x, y);
+    x->rc = merge(x->rc, y);
+    if (x->lc == 0 || x->lc->dis < x->rc->dis) swap(x->lc, x->rc);
+    x->dis = x->rc ? x->rc->dis + 1 : 0;
+    x->sz = (x->lc ? x->lc->sz : 0) + (x->rc ? x->rc->sz : 0) + 1;
+    x->sum = (x->lc ? x->lc->sum : 0) + (x->rc ? x->rc->sum : 0) + x->val;
+    return x;
+}
+Node mem[maxn];
+lpNode nodes[maxn];
+int head[maxn], to[maxn], next[maxn], ecnt, arr[maxn], aend;
+inline void addEdge(int f, int t)
+{
+    ecnt++;
+    next[ecnt] = head[f];
+    head[f] = ecnt;
+    to[ecnt] = t;
+}
+int main()
+{
+    read(n), read(m);
+    for (int i = 1; i <= n; i++)
+        read(fa[i]), read(C[i]), read(L[i]), addEdge(fa[i], i),
+        (nodes[i] = mem + i)->sz = 1, nodes[i]->sum = nodes[i]->val = C[i];
+    for (int i = 0; i <= n; i++)
+        for (int cur = head[i]; cur; cur = next[cur])
+            arr[++aend] = to[cur];
+    long long ans = 0;
+    for (int i = aend; i; i--)
+    {
+        int x = arr[i], y = fa[x];
+        ans = max(ans, 1ll * nodes[x]->sz * L[x]);
+        nodes[y] = merge(nodes[y], nodes[x]);
+        while (y && nodes[y]->sum > m)
+            nodes[y] = merge(nodes[y]->lc, nodes[y]->rc);
+    }
+    printf("%lld", ans);
+    return 0;
+}

OnlineJudges/poj/2115.cpp

@@ -0,0 +1,25 @@
+#include <cstdio>
+typedef long long int64;
+void exgcd(int64 a, int64 b, int64 &d, int64 &x, int64 &y)
+{
+    !b ? (x = 1, y = 0, d = a) : (exgcd(b, a % b, d, y, x), y -= x * (a / b));
+}
+int main()
+{
+    int64 A, B, C;
+    int k;
+    while (scanf("%lld%lld%lld%d", &A, &B, &C, &k), A | B | C | k)
+    {
+        int64 a = C, b = B - A, x, y, n = 1ll << k, d;
+        exgcd(a, n, d, x, y);
+        if (b % d)
+            puts("FOREVER");
+        else
+        {
+            x = (x * (b / d)) % n;
+            x = (x % (n / d) + n / d) % (n / d);
+            printf("%lld\n", x);
+        }
+    }
+    return 0;
+}

OnlineJudges/poj/3090.cpp

@@ -0,0 +1,22 @@
+#include <cstdio>
+const int maxn = 1010;
+int phi[maxn], sum[maxn];
+int main()
+{
+    phi[1] = 1;
+    for (int i = 2; i <= 1005; i++) if (!phi[i])
+        for (int j = i; j <= 1005; j += i)
+        {
+            if (!phi[j]) phi[j] = j;
+            phi[j] = phi[j] / i * (i - 1);
+        }
+    for (int i = 1; i <= 1005; i++) sum[i] = sum[i - 1] + phi[i];
+    int T, x;
+    scanf("%d", &T);
+    for (int i = 1; i <= T; i++)
+    {
+        scanf("%d", &x);
+        printf("%d %d %d\n", i, x, sum[x] << 1 | 1);
+    }
+    return 0;
+}