Bladeren bron

上传文件至 ''

webturing 5 jaren geleden
bovenliggende
commit
ff410cae9f
5 gewijzigde bestanden met toevoegingen van 111 en 0 verwijderingen
  1. 30 0
      e.c
  2. 16 0
      f.c
  3. 31 0
      g.c
  4. 17 0
      h.c
  5. 17 0
      i.c

+ 30 - 0
e.c

@@ -0,0 +1,30 @@
+#include <stdio.h>
+#define MOD 998244353
+
+int dp[500005];
+
+void init()
+{
+    int i;
+    memset(dp,0,sizeof(dp));
+    dp[0] = 1;
+    for (i = 0; i < 500000; i ++)
+    {
+        dp[i+1] = (dp[i] + dp[i+1]) % MOD;
+        dp[i+2] = (dp[i] + dp[i+2]) % MOD;
+        dp[i+3] = (dp[i] + dp[i+3]) % MOD;
+    }
+}
+
+int main()
+{
+    init();
+    int t, n;
+    scanf("%d", &t);
+    while (t--)
+    {
+        scanf("%d", &n);
+        printf("%d\n", dp[n]);
+    }
+    return 0;
+}

+ 16 - 0
f.c

@@ -0,0 +1,16 @@
+#include<stdio.h>
+#define max(a,b) ((a)>=(b)?(a):(b))
+
+int main()
+{
+    int a, b, c;
+    while(~scanf("%d%d%d", &a, &b, &c))
+    {
+        if(max(a, b) == a && max(a, c) == a)
+            printf("%d\n", max(b ,c));
+        else if(max(a, b) == b&&max(b, c) == b)
+            printf("%d\n", max(a, c));
+        else printf("%d\n", max(a, b));
+    }
+    return 0;
+}

+ 31 - 0
g.c

@@ -0,0 +1,31 @@
+#include <stdio.h>
+
+int main()
+{
+    int a[10], i;
+
+    while (~scanf("%d", a))
+    {
+        int over = 1;
+        for (i = 1; i < 5; i++)
+        {
+            scanf("%d", a + i);
+            if (a[i] != 0) over = 0;
+        }
+        if (over) break;
+        int d = a[1] - a[0];
+        int flag = 1;
+        for (i = 1; i < 5; i++)
+            if (a[i] != a[i - 1] + d)
+                flag = 0;
+        int n = a[4];
+        for (i = 0; i < 5; i++)
+        {
+            if (flag) n = n + d;
+            else n = n * (d = a[1] / a[0]);
+            printf("%d ",n);
+        }
+        printf("\n");
+    }
+    return 0;
+}

+ 17 - 0
h.c

@@ -0,0 +1,17 @@
+#include<stdio.h>
+#include<math.h>
+
+int main()
+{
+    int x, y, x1, y1;
+    double PI = 4.0 * atan(1.0);
+    while(~scanf("%d%d%d%d", &x, &y, &x1, &y1))
+    {
+        x1 -= x,y1 -= y;
+        double R = asin(y1 / sqrt((x1 * x1) + (y1 * y1)));
+        if (x1 < 0) R = -R - PI;
+        double c = R * 360 / 2 / PI;
+        printf("%d\n", (110 - (int) c) % 360 / 40 + 1);
+    }
+    return 0;
+}

+ 17 - 0
i.c

@@ -0,0 +1,17 @@
+#include<stdio.h>
+#define f(a) ((a)*(a)*(a))
+
+int main()
+{
+    int n;
+    while(~scanf("%d", &n))
+    {
+        int a = n % 10;
+        int b = n / 10 % 10;
+        int c = n / 10 / 10 % 10;
+        if(f(a) + f(b )+ f(c) == n)
+            puts("1");
+        else puts("0");
+    }
+    return 0;
+}