Пример #1
0
        public static void Main(string[] args)
        {
            var N = Inputer.LongArray1Line();
            var A = N[0];
            var B = N[1];
            var K = N[2];

            var amari = A - K;

            if (A + B < K)
            {
                A = 0;
                B = 0;
            }
            else
            {
                if (amari < 0)
                {
                    B = B + amari;
                    A = 0;
                }
                else
                {
                    A = A - K;
                }
            }


            Console.WriteLine("{0} {1}", A, B);
        }
Пример #2
0
        public static void Main(string[] args)
        {
            var N = Inputer.Int1Char();

            for (int i = N; i <= 1e10; i++)
            {
                if (IsPrime(i))
                {
                    Console.WriteLine(i);
                    break;
                }
            }
        }
        public static void Main(string[] args)
        {
            var inp  = Inputer.IntArray1Line();
            var N    = inp[0];
            var K    = inp[1];
            var inp2 = Inputer.IntArray1Line();
            var R    = inp2[0];
            var S    = inp2[1];
            var P    = inp2[2];
            var T    = Console.ReadLine().ToArray();

            var takahasi_num = new List <int>();
            var takahasi_te  = new List <char>();

            var min_te_num = Math.Min(R, P);

            min_te_num = Math.Min(min_te_num, S);

            var max_te = Math.Max(S, Math.Max(R, P));
            var second = R + S + P - max_te - min_te_num;

            var min_te = 'r';

            if (min_te_num == R)
            {
                min_te = 'r';
            }
            if (min_te_num == P)
            {
                min_te = 'p';
            }
            if (min_te_num == S)
            {
                min_te = 's';
            }

            var second_te = 'r';

            if (second == R)
            {
                second_te = 'r';
            }
            if (second == P)
            {
                second_te = 'p';
            }
            if (second == S)
            {
                second_te = 's';
            }

            for (int i = 0; i < T.Length; i++)
            {
                if (T[i] == 'r')
                {
                    takahasi_num.Add(P);
                    takahasi_te.Add('p');
                }
                if (T[i] == 'p')
                {
                    takahasi_num.Add(S);
                    takahasi_te.Add('s');
                }
                if (T[i] == 's')
                {
                    takahasi_num.Add(R);
                    takahasi_te.Add('r');
                }
                if (i >= K && (takahasi_te[i] == takahasi_te[i - K]) && takahasi_te[i] == min_te)
                {
                    takahasi_num.RemoveAt(i);
                    takahasi_te.RemoveAt(i);
                    takahasi_num.Add(0);
                    if (i + K < N)
                    {
                        if (T[i + K] == 'r')
                        {
                            takahasi_te.Add('r');
                        }
                        if (T[i + K] == 'p')
                        {
                            takahasi_te.Add('p');
                        }
                        if (T[i + K] == 's')
                        {
                            takahasi_te.Add('s');
                        }
                    }
                    else
                    {
                        takahasi_te.Add(second_te);
                    }
                }
                if (i >= K && (takahasi_te[i] == takahasi_te[i - K]) && takahasi_te[i] != min_te)
                {
                    takahasi_num.RemoveAt(i);
                    takahasi_te.RemoveAt(i);
                    takahasi_num.Add(0);
                    if (i + K < N)
                    {
                        if (T[i + K] == 'r')
                        {
                            takahasi_te.Add('r');
                        }
                        if (T[i + K] == 'p')
                        {
                            takahasi_te.Add('p');
                        }
                        if (T[i + K] == 's')
                        {
                            takahasi_te.Add('s');
                        }
                    }
                    else
                    {
                        takahasi_te.Add(min_te);
                    }
                }
            }

            Console.WriteLine(takahasi_num.Sum());
        }