-
Notifications
You must be signed in to change notification settings - Fork 35
/
Copy pathTimeComplexityPrimality.cs
49 lines (37 loc) · 1.23 KB
/
TimeComplexityPrimality.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
// https://www.hackerrank.com/challenges/ctci-big-o/problem
using System.CodeDom.Compiler;
using System.Collections.Generic;
using System.Collections;
using System.ComponentModel;
using System.Diagnostics.CodeAnalysis;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Reflection;
using System.Runtime.Serialization;
using System.Text.RegularExpressions;
using System.Text;
using System;
class Solution {
// Complete the primality function below.
static string primality(int n) {
if(n == 1) return "Not prime";
if(n < 4) return "Prime";
for(var index = 2; index <= Math.Sqrt(n); index++)
if(n % index == 0)
return "Not prime";
return "Prime";
}
static void Main(string[] args) {
TextWriter textWriter = new StreamWriter(@System.Environment.GetEnvironmentVariable("OUTPUT_PATH"), true);
var temp = Console.ReadLine();
int p = Convert.ToInt32(temp);
for (int pItr = 0; pItr < p; pItr++) {
int n = Convert.ToInt32(Console.ReadLine());
string result = primality(n);
textWriter.WriteLine(result);
}
textWriter.Flush();
textWriter.Close();
}
}