結果

問題 No.186 中華風 (Easy)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-04-19 23:48:50
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,010 bytes
コンパイル時間 942 ms
コンパイル使用メモリ 118,612 KB
実行使用メモリ 25,812 KB
最終ジャッジ日時 2024-07-04 18:47:31
合計ジャッジ時間 2,220 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
17,664 KB
testcase_01 AC 21 ms
17,920 KB
testcase_02 AC 21 ms
17,408 KB
testcase_03 AC 22 ms
17,664 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 22 ms
17,792 KB
testcase_10 AC 21 ms
17,664 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 23 ms
17,664 KB
testcase_14 AC 22 ms
17,408 KB
testcase_15 AC 21 ms
17,664 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 21 ms
17,664 KB
testcase_20 AC 23 ms
17,664 KB
testcase_21 AC 22 ms
17,664 KB
testcase_22 AC 22 ms
17,664 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var a = new long[3];
            for (long i = 0; i < 3; i++)
                a[i] = 1;
            var b = new long[3];
            var mod = new long[3];
            for (long i = 0; i < 3; i++)
            {
                b[i] = sc.Integer();
                mod[i] = sc.Integer();
            }
            var ans = MathEX.LiniearCongruence(a, b, mod);
            if (ans.Key <= 0)
                IO.Printer.Out.WriteLine(-1);
            else IO.Printer.Out.WriteLine(ans.Key);

        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
    }
}

#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
static public class MathEX
{
    static public long GCD(long x, long y)
    {
        byte i = 0;
        while (x != 0 && y != 0)
        {
            if (i == 0)
                y %= x;
            else x %= y;
            i ^= 1;
        }
        return x == 0 ? y : x;
    }


    //O(log n)
    //ax+by=gcd(a,b),return x,y
    static public long ExGCD(long a, long b, out long x, out long y)
    {
        var u = new long[] { a, 1, 0 };
        var v = new long[] { b, 0, 1 };
        while (v[0] != 0)
        {
            var t = u[0] / v[0];
            for (long i = 0; i < 3; i++)
            {
                var tmp = u[i] - t * v[i];
                u[i] = v[i];
                v[i] = tmp;
            }
        }
        x = u[1];
        y = u[2];
        if (u[0] > 0)
            return u[0];
        for (long i = 0; i < 3; i++)
            u[i] = -u[i];
        return u[0];

    }
    static public long Inverse(long num, long mod)
    {
        long p, q;
        ExGCD(num, mod, out p, out q);
        return (p % mod + mod) % mod;
    }


    static public KeyValuePair<long, long> LiniearCongruence(long[] A, long[] B, long[] M)
    {
        var x = 0L;
        var m = 1L;
        var n = A.Length;
        for (long i = 0; i < n; i++)
        {
            var a = A[i] * m;
            var b = B[i] - A[i] * x;
            var d = GCD(M[i], a);
            if (b % d != 0) return new KeyValuePair<long, long>(0, -1);
            var t = (b / d) * Inverse(a / d, M[i] / d) % (M[i] / d);
            x = x + m * t;
            m *= M[i] / d;

        }
        return new KeyValuePair<long, long>(x % m, m);
    }
}
0