Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- namespace MathPotato
- {
- using System;
- using System.Collections.Generic;
- using System.Linq;
- public class Program
- {
- static void Main(string[] args)
- {
- string[] names = Console.ReadLine()
- .Split(' ')
- .ToArray();
- int cycle = 1;
- int counter = int.Parse(Console.ReadLine());
- Queue<string> queue = new Queue<string>(names);
- while (queue.Count != 1)
- {
- for (int i = 1; i < counter; i++)
- {
- queue.Enqueue(queue.Dequeue());
- }
- if (IsPrime(cycle))
- {
- Console.WriteLine($"Removed {queue.Dequeue()}");
- }
- else
- {
- Console.WriteLine($"Prime {queue.Peek()}");
- }
- cycle++;
- }
- Console.WriteLine($"Last is {queue.Dequeue()}");
- }
- private static bool IsPrime(int number)
- {
- if (number == 2)
- {
- return true;
- }
- if (number % 2 == 0)
- {
- return false;
- }
- int maxDivider = (int) Math.Sqrt(number);
- for (int divider = 3; divider <= maxDivider; divider += 2)
- {
- if (number % divider == 0)
- {
- return false;
- }
- }
- return true;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement