C# ACM poj1006

中国剩余定理

public static void acm1006(int a, int b, int c, int d)
        {
            int z =  * ;
            int y =  * ;
            int x =  * ;
            int w =  *  * ;
            int n = Acm1006Unit(z, ) * z;
            int m = Acm1006Unit(y, ) * y;
            int o = Acm1006Unit(x, ) * x;
            int r = (n * a + m * b + o * c - d) % w;
            Console.WriteLine(r);
        }
        public static int Acm1006Unit(int a, int b)
        {
            int n = ;
            while ((a * n) % b != )
                n++;
            return n;
        }