提出 #520212

---

ソースコード 拡げる

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
	public static void Main()
	{
		int num = int.Parse(Console.ReadLine());
		int sum = sumOfDigit(num);
		Console.WriteLine(IsLikePrime(num) ? "Prime" : "Not Prime");

		/*var N = int.Parse(Console.ReadLine());
		var a = Console.ReadLine()
			.Split(new[] { ' ' })
			.Select(int.Parse)
			.ToList();

		var aSum = a.Sum();

		if (aSum % N != 0)
		{
			Console.WriteLine(-1);
			return;
		}

		var bridgeCount = 0;
		var unitNum = aSum / N;

		for (int i = 0; i < N; i++)
		{
			if (a.Skip(i).Take(N - i).Sum() != (N - i) * unitNum)
			{
				bridgeCount++;
			}
		}

		Console.WriteLine(bridgeCount);*/
	}
	static int sumOfDigit(int num)
	{
		int sum = 0;
		while (num > 0)
		{
			sum += num % 10;
			num = num / 10;
		}
		return sum;
	}
	static bool IsLikePrime(int num)
	{
		if (num == 1) return false;
		int finalOfnum = num % 10;
		if (finalOfnum % 2 == 0) return false;
		if (finalOfnum  == 5) return false;

		return sumOfDigit(num) % 3 > 0;
	}
	static bool IsPrime(int num)
	{
		if (num == 1 || num % 2 == 0)
			return false;
		else if (num == 2)
			return true;
		else
		{
			for (int i = 3; i < Math.Sqrt(num); i += 2)
				if (num % i == 0) return false;
		}
		return true;
	}
}

提出情報

ジャッジ結果