static void Main(string[] args)
        {
            string[]       input = Console.ReadLine().Split();
            int            num   = int.Parse(Console.ReadLine());
            Queue <string> kids  = new Queue <string>(input);
            int            cycle = 1;

            while (kids.Count != 1)
            {
                for (int i = 0; i < num - 1; i++)
                {
                    kids.Enqueue(kids.Dequeue());
                }

                if (PrimeTool.isPrime(cycle))
                {
                    Console.WriteLine($"Prime {kids.Peek()}");
                }
                else
                {
                    Console.WriteLine($"Removed {kids.Dequeue()}");
                }
                cycle++;
            }
            Console.WriteLine($"Last is {kids.Dequeue()}");
        }
Пример #2
0
        public static void Main(string[] args)
        {
            var input  = Console.ReadLine();
            var number = int.Parse(Console.ReadLine());
            var queue  = new Queue <string>(input.Split(' '));
            int cycle  = 1;

            while (queue.Count > 1)
            {
                for (int i = 0; i < number - 1; i++)
                {
                    string reminder = queue.Dequeue();
                    queue.Enqueue(reminder);
                }

                if (PrimeTool.IsPrime(cycle))
                {
                    Console.WriteLine("Prime " + queue.Peek());
                }
                else
                {
                    Console.WriteLine("Removed " + queue.Dequeue());
                }

                cycle++;
            }

            Console.WriteLine("Last is " + queue.Dequeue());
        }
Пример #3
0
        private static void MathPatato()
        {
            var input  = Console.ReadLine();
            var queue  = new Queue <string>(input.Split(' '));
            var number = int.Parse(Console.ReadLine());
            int cycle  = 1;

            while (queue.Count > 1)
            {
                for (int i = 0; i < number - 1; i++)
                {
                    queue.Enqueue(queue.Dequeue());
                }
                if (PrimeTool.IsPrime(cycle))
                {
                    Console.WriteLine($"Prime {queue.Peek()}");
                }
                else
                {
                    Console.WriteLine($"Removed {queue.Dequeue()}");
                }
                cycle++;
            }
            Console.WriteLine($"Last is {queue.Dequeue()}");
        }
Пример #4
0
        static void Main(string[] args)
        {
            var childrens = Console.ReadLine().Split(' ');
            var number    = int.Parse(Console.ReadLine());
            var queue     = new Queue <string>(childrens);

            var circle = 1;

            while (queue.Count > 1)
            {
                for (int i = 0; i < number - 1; i++)
                {
                    queue.Enqueue(queue.Dequeue());
                }

                if (PrimeTool.IsPrime(circle))
                {
                    Console.WriteLine($"Prime {queue.Peek()}");
                }
                else
                {
                    Console.WriteLine($"Removed {queue.Dequeue()}");
                }

                circle++;
            }
            Console.WriteLine($"Last is {queue.Dequeue()}");
        }
Пример #5
0
        static void Main()
        {
            var input = Console.ReadLine();
            var toss  = int.Parse(Console.ReadLine());
            var queue = new Queue <string>(input.Split(' '));

            var cycles = 1;

            while (queue.Count > 1)
            {
                for (int i = 0; i < toss - 1; i++)
                {
                    queue.Enqueue(queue.Dequeue());
                }

                if (!PrimeTool.IsPrime(cycles))
                {
                    Console.WriteLine($"Removed {queue.Dequeue()}");
                }

                else
                {
                    Console.WriteLine($"Prime {queue.Peek()}");
                }
                cycles++;
            }
            Console.WriteLine($"Last is {queue.Peek()}");
        }
Пример #6
0
        private static void E06_MathPotato()
        {
            string[]       input  = Console.ReadLine().Split(' ');
            int            cycles = int.Parse(Console.ReadLine());
            Queue <string> queue  = new Queue <string>(input);


            int cycle = 1;

            while (queue.Count > 1)
            {
                for (int i = 0; i < cycles - 1; i++)
                {
                    queue.Enqueue(queue.Dequeue());
                }

                if (PrimeTool.IsPrime(cycle))
                {
                    Console.WriteLine($"Prime {queue.Peek()}");
                }
                else
                {
                    Console.WriteLine($"Removed {queue.Dequeue()}");
                }
                cycle++;
            }
            Console.WriteLine($"Last is {queue.Dequeue()}");
        }
 static void Main()
 {
     //
     // Write prime numbers between 0 and 100.
     //
     Console.WriteLine("--- Primes between 0 and 100 ---");
     for (int i = 0; i < 100; i++)
     {
         bool prime = PrimeTool.IsPrime(i);
         if (prime)
         {
             Console.Write("Prime: ");
             Console.WriteLine(i);
         }
     }
     //
     // Write prime numbers between 10000 and 10100
     //
     Console.WriteLine("--- Primes between 10000 and 10100 ---");
     for (int i = 10000; i < 10100; i++)
     {
         if (PrimeTool.IsPrime(i))
         {
             Console.Write("Prime: ");
             Console.WriteLine(i);
         }
     }
 }
Пример #8
0
        public static void Main()
        {
            var            children = Console.ReadLine().Split(' ');
            var            number   = int.Parse(Console.ReadLine());
            Queue <string> queue    = new Queue <string>(children);

            int cycle = 1;

            while (queue.Count != 1)
            {
                for (int i = 1; i < number; i++)
                {
                    queue.Enqueue(queue.Dequeue());
                }
                if (PrimeTool.IsPrime(cycle))
                {
                    Console.WriteLine($"Prime {queue.Peek()}");
                }
                else
                {
                    Console.WriteLine($"Removed {queue.Dequeue()}");
                }
                cycle++;
            }


            Console.WriteLine($"Last is {queue.Dequeue()}");
        }
Пример #9
0
        static void Main(string[] args)
        {
            string input  = Console.ReadLine();
            int    number = int.Parse(Console.ReadLine());
            var    circle = new Queue <string>(input.Split());
            int    cycle  = 1;

            while (circle.Count > 1)
            {
                for (int i = 0; i < number - 1; i++)
                {
                    string reminder = circle.Dequeue();
                    circle.Enqueue(reminder);
                }

                if (PrimeTool.IsPrime(cycle))
                {
                    Console.WriteLine($"Prime {circle.Peek()}");
                }
                else
                {
                    Console.WriteLine($"Removed {circle.Dequeue()}");
                }

                cycle++;
            }

            Console.WriteLine($"Last is {circle.Dequeue()}");
        }
Пример #10
0
 static void Main()
 {
     for (int i = 1; i < 10001; i++)
     {
         bool prime = PrimeTool.IsPrime(i);
         if (prime)
         {
             Console.Write(i + " ");
         }
     }
 }
Пример #11
0
 private void PrimeList()
 {
     for (int i = 0; i < 100; i++)
     {
         bool prime = PrimeTool.IsPrime(i);
         if (prime)
         {
             primeNumbers.Add(i);
         }
     }
 }
Пример #12
0
        static void Main(string[] args)
        {
            for (var i = 0; i < 10000; i++)
            {
                if (PrimeTool.IsPrime(i))
                {
                    Console.Write($"Prime: {i}");
                }
            }

            Console.ReadLine();
        }
Пример #13
0
        public void DoWork()
        {
            _i++;

            PrimeTool.IsPrime(_i);
            if (_i == int.MaxValue)
            {
                _i  = 0;
                _x  = Math.Sqrt(_i);
                _x += _x;
            }
        }
Пример #14
0
 static void Main()
 {
     Console.WriteLine("--- Primes between 0 and 100 ---");
     for (int i = 0; i < 100; i++)
     {
         bool prime = PrimeTool.IsPrime(i);
         if (prime)
         {
             Console.Write("Prime: ");
             Console.WriteLine(i);
         }
     }
 }
Пример #15
0
        private void foo()
        {
            //Console.WriteLine("--- Primes between 3 and 10100 ---");
            int threadID = System.Threading.Thread.CurrentThread.ManagedThreadId;

            for (int i = 3; i < 10100; i++)
            {
                if (PrimeTool.IsPrime(i))
                {
                    string msg = String.Format("Thread: {0}\tPrime: {1}", threadID, i);
                    Trace.WriteLine(msg);
                }
            }
        }
Пример #16
0
        static void Main(string[] args)
        {
            int P = int.Parse(Console.ReadLine());

            for (int i = 0; i < P; i++)
            {
                bool prime = PrimeTool.IsPrime(i);
                if (prime)
                {
                    Console.Write("Prime: ");
                    Console.WriteLine(i);
                }
            }

            Console.WriteLine();
            Console.WriteLine("Press any key to exit");
            Console.ReadKey();
        }
Пример #17
0
    static void Main()
    {
        string buff;

        Console.WriteLine("Input a positive Integer: ");
        buff = Console.ReadLine();
        int number;

        int.TryParse(buff, out number);
        bool prime = PrimeTool.IsPrime(number);

        if (prime)
        {
            Console.Write("Number is prime!");
            Console.ReadLine();
        }
        else
        {
            Console.WriteLine("Number is Not prime!");
            Console.ReadLine();
        }
    }
Пример #18
0
        protected void Button1_Click(object sender, EventArgs e)
        {
            bool prime = PrimeTool.IsPrime(7);       //when a class is static  , you don't `new()` it.

            Response.Write("7 is prime=" + prime)
        }