#156720 (C#(csc)) No.491 10^9+1と回文

提出ソース

結果

問題	No.491 10^9+1と回文
ユーザー	りあん
提出日時	2017-03-10 22:55:57
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	9,974 bytes
コンパイル時間	2,271 ms
コンパイル使用メモリ	112,240 KB
実行使用メモリ	24,940 KB
最終ジャッジ日時	2023-09-06 13:58:28
合計ジャッジ時間	10,575 ms
ジャッジサーバーID （参考情報）	judge12 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	57 ms 18,572 KB
testcase_01	AC	58 ms 22,688 KB
testcase_02	AC	56 ms 20,688 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	52 ms 20,844 KB
testcase_09	AC	51 ms 20,732 KB
testcase_10	AC	53 ms 22,664 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	AC	49 ms 20,684 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	AC	50 ms 20,756 KB
testcase_18	AC	50 ms 20,796 KB
testcase_19	WA	-
testcase_20	AC	49 ms 20,560 KB
testcase_21	WA	-
testcase_22	AC	51 ms 20,684 KB
testcase_23	WA	-
testcase_24	AC	48 ms 22,704 KB
testcase_25	AC	49 ms 20,784 KB
testcase_26	AC	50 ms 20,736 KB
testcase_27	AC	48 ms 20,680 KB
testcase_28	AC	51 ms 20,676 KB
testcase_29	AC	49 ms 22,664 KB
testcase_30	WA	-
testcase_31	AC	49 ms 20,672 KB
testcase_32	WA	-
testcase_33	AC	49 ms 20,644 KB
testcase_34	WA	-
testcase_35	WA	-
testcase_36	AC	47 ms 20,628 KB
testcase_37	AC	47 ms 20,768 KB
testcase_38	WA	-
testcase_39	WA	-
testcase_40	AC	49 ms 22,616 KB
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	AC	51 ms 22,724 KB
testcase_48	AC	49 ms 20,688 KB
testcase_49	AC	47 ms 22,720 KB
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	AC	47 ms 18,604 KB
testcase_54	AC	49 ms 22,660 KB
testcase_55	AC	48 ms 20,688 KB
testcase_56	AC	48 ms 20,628 KB
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	AC	51 ms 22,720 KB
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	AC	48 ms 18,704 KB
testcase_66	AC	49 ms 20,736 KB
testcase_67	WA	-
testcase_68	WA	-
testcase_69	AC	52 ms 22,624 KB
testcase_70	AC	50 ms 22,780 KB
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	WA	-
testcase_75	AC	51 ms 22,724 KB
testcase_76	AC	49 ms 20,744 KB
testcase_77	AC	48 ms 20,752 KB
testcase_78	WA	-
testcase_79	WA	-
testcase_80	AC	53 ms 20,708 KB
testcase_81	AC	54 ms 20,752 KB
testcase_82	AC	57 ms 20,816 KB
testcase_83	WA	-
testcase_84	AC	57 ms 22,776 KB
testcase_85	WA	-
testcase_86	AC	57 ms 20,840 KB
testcase_87	WA	-
testcase_88	AC	54 ms 18,700 KB
testcase_89	WA	-
testcase_90	WA	-
testcase_91	WA	-
testcase_92	AC	55 ms 22,672 KB
testcase_93	WA	-
testcase_94	WA	-
testcase_95	AC	54 ms 20,616 KB
testcase_96	WA	-
testcase_97	WA	-
testcase_98	WA	-
testcase_99	WA	-
testcase_100	WA	-
testcase_101	WA	-
testcase_102	WA	-
testcase_103	WA	-
testcase_104	WA	-
testcase_105	WA	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;
using System.IO;
using System.Text;
using System.Diagnostics;

using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.BinaryExpression>;
using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>;

class Program
{
    static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
    static Scan sc = new Scan();
//    static Scan sc = new ScanCHK();
    const int M = 1000000007;
    const double eps = 1e-9;
    static readonly int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        long n = sc.Long;
        int k = n.ToString().Length - 9;
        int sum = 0;
        for (int i = 1; i < k; i++)
        {
            sum += cntsub(i);
        }
        int m = M - 7;
        long upr = n / m, dwn = n % m;
        Prt(sum + cnt(upr <= dwn ? upr : upr - 1));

        sw.Flush();
    }
    static int cnt(long n)
    {
        string s = n.ToString();
        int up = s[0] - '0', dw = s[s.Length - 1] - '0';
        if (s.Length <= 2)
        {
            return up <= dw ? up : up - 1;
        }
        long m = long.Parse(s.Substring(1, s.Length - 2));
        if (up > dw)
        {
            return cntsub(s.Length - 2) * (up - 1);
        }
        return cntsub(s.Length - 2) * (up - 1) + cnt0(m);
    }
    static int cnt0(long n)
    {
        string s = n.ToString();
        int up = s[0] - '0', dw = s[s.Length - 1] - '0';
        if (s.Length <= 2)
        {
            return up <= dw ? up + 1 : up;
        }
        long m = long.Parse(s.Substring(1, s.Length - 2));
        if (up > dw)
        {
            return cntsub(s.Length - 2) * up;
        }
        return cntsub(s.Length - 2) * up + cnt0(m);
    }
    static int cntsub(int keta)
    {
        if (keta <= 2) return 9;
        return cntsub(keta - 2) * 9;
    }

    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }
    static T Max<T>(params T[] a) { return a.Max(); }
    static T Min<T>(params T[] a) { return a.Min(); }
    static void DBG(string a) { Console.WriteLine(a); }
    static void DBG<T>(IEnumerable<T> a) { Console.WriteLine(string.Join(" ", a)); }
    static void DBG(params object[] a) { Console.WriteLine(string.Join(" ", a)); }
    static void Prt(string a) { sw.WriteLine(a); }
    static void Prt<T>(IEnumerable<T> a) { sw.WriteLine(string.Join(" ", a)); }
    static void Prt(params object[] a) { sw.WriteLine(string.Join(" ", a)); }
}
static class ex
{
    public static void swap<T>(this IList<T> a, int i, int j) { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a)
    {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}
static class Operator<T>
{
    static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");
    static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");
    public static readonly Func<T, T, T> Add = Lambda(Expression.Add);
    public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);
    public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);
    public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);
    public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);
    public static readonly Func<T, T> Negate = Lambda(Expression.Negate);
    public static Func<T, T, T> Lambda(Binary op) { return Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile(); }
    public static Func<T, T> Lambda(Unary op) { return Expression.Lambda<Func<T, T>>(op(x), x).Compile(); }
}

class ScanCHK : Scan
{
    public new string Str { get { var s = Console.ReadLine(); if (s != s.Trim()) throw new Exception(); return s; } }
}
class Scan
{
    public int Int { get { return int.Parse(Str); } }
    public long Long { get { return long.Parse(Str); } }
    public double Double { get { return double.Parse(Str); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } }
    public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Str.Split(); } }
    bool eq<T, U>() { return typeof(T).Equals(typeof(U)); }
    T ct<T, U>(U a) { return (T)Convert.ChangeType(a, typeof(T)); }
    T cv<T>(string s) { return eq<T, int>()    ? ct<T, int>(int.Parse(s))
                             : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                             : eq<T, double>() ? ct<T, double>(double.Parse(s))
                             : eq<T, char>()   ? ct<T, char>(s[0])
                                               : ct<T, string>(s); }
    public void Multi<T>(out T a) { a = cv<T>(Str); }
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}
class mymath
{
    public static long Mod = 1000000007;
    public static bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public static bool[] sieve(int n)
    {
        var p = new bool[n + 1];
        for (int i = 2; i <= n; i++) p[i] = true;
        for (int i = 2; i * i <= n; i++) if (p[i]) for (int j = i * i; j <= n; j += i) p[j] = false;
        return p;
    }
    public static List<int> getprimes(int n)
    {
        var prs = new List<int>();
        var p = sieve(n);
        for (int i = 2; i <= n; i++) if (p[i]) prs.Add(i);
        return prs;
    }
    public static long[][] E(int n)
    {
        var ret = new long[n][];
        for (int i = 0; i < n; i++) { ret[i] = new long[n]; ret[i][i] = 1; }
        return ret;
    }
    public static long[][] pow(long[][] A, long n)
    {
        if (n == 0) return E(A.Length);
        var t = pow(A, n / 2);
        if ((n & 1) == 0) return mul(t, t);
        return mul(mul(t, t), A);
    }
    public static double dot(double[] x, double[] y)
    {
        int n = x.Length;
        double ret = 0;
        for (int i = 0; i < n; i++) ret += x[i] * y[i];
        return ret;
    }
    public static long dot(long[] x, long[] y)
    {
        int n = x.Length;
        long ret = 0;
        for (int i = 0; i < n; i++) ret = (ret + x[i] * y[i]) % Mod;
        return ret;
    }
    public static T[][] trans<T>(T[][] A)
    {
        int n = A[0].Length, m = A.Length;
        var ret = new T[n][];
        for (int i = 0; i < n; i++) { ret[i] = new T[m]; for (int j = 0; j < m; j++) ret[i][j] = A[j][i]; }
        return ret;
    }
    public static double[] mul(double[][] A, double[] x)
    {
        int n = A.Length;
        var ret = new double[n];
        for (int i = 0; i < n; i++) ret[i] = dot(x, A[i]);
        return ret;
    }
    public static long[] mul(long[][] A, long[] x)
    {
        int n = A.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = dot(x, A[i]);
        return ret;
    }
    public static long[][] mul(long[][] A, long[][] B)
    {
        int n = A.Length;
        var Bt = trans(B);
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = mul(Bt, A[i]);
        return ret;
    }
    public static long[] add(long[] x, long[] y)
    {
        int n = x.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = (x[i] + y[i]) % Mod;
        return ret;
    }
    public static long[][] add(long[][] A, long[][] B)
    {
        int n = A.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = add(A[i], B[i]);
        return ret;
    }
    public static long pow(long a, long b)
    {
        if (a >= Mod) return pow(a % Mod, b);
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = pow(a, b / 2);
        if ((b & 1) == 0) return t * t % Mod;
        return t * t % Mod * a % Mod;
    }
    public static long inv(long a) { return pow(a, Mod - 2); }
    public static long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    // a x + b y = gcd(a, b)
    public static long extgcd(long a, long b, out long x, out long y)
    {
        long g = a; x = 1; y = 0;
        if (b > 0) { g = extgcd(b, a % b, out y, out x); y -= a / b * x; }
        return g;
    }
    public static long lcm(long a, long b) { return a / gcd(a, b) * b; }
    public static long comb(int n, int r)
    {
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        int[] numer = new int[r], denom = new int[r];
        for (int k = 0; k < r; k++) { numer[k] = n - r + k + 1; denom[k] = k + 1; }
        for (int p = 2; p <= r; p++)
        {
            int piv = denom[p - 1];
            if (piv > 1)
            {
                int ofst = (n - r) % p;
                for (int k = p - 1; k < r; k += p) { numer[k - ofst] /= piv; denom[k] /= piv; }
            }
        }
        long ret = 1;
        for (int k = 0; k < r; k++) if (numer[k] > 1) ret = ret * numer[k] % Mod;
        return ret;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード