forked from Harshita1603/cs204
-
Notifications
You must be signed in to change notification settings - Fork 0
/
IsPrime.cpp
179 lines (161 loc) · 3.23 KB
/
IsPrime.cpp
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
#include<bits/stdc++.h>
using namespace std;
string add(string a, string b){
int carry=0;
string ans = "";
if(a.size() < b.size()){
swap(a,b);
}
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for(int i = 0; i< b.size(); i++){
int sum = a[i]-'0'+b[i]-'0'+carry;
ans+=sum%10+'0';
carry=sum/10;
}
for(int i = b.size(); i<a.size(); i++){
int sum = a[i]-'0'+carry;
ans+=sum%10+'0';
carry = sum/10;
}
if(carry){ans+= (carry+'0');}
reverse(ans.begin(), ans.end());
return ans;
}
string subract(string a ,string b){
string ans;
bool neg=0;
//if b is greater than a, swap them
if(a.length()<b.length()){
swap(a,b);
neg=1;
}
if(a.length()==b.length()){
for(int i=0;i<a.length();i++){
if(a[i]!=b[i]){
if(a[i]<b[i]){
swap(a,b);
}
break;
}
}
neg=1;
}
//subract individual digits of a &b
int carry=0;
int nb= b.length(),na=a.length();
int j=nb-1,i=na-1;
while(j>=0){
int s= a[i]-b[j]-carry;
if(s<0){
ans+=a[i]-b[j]+'0'+10-carry;
carry=1;
}
else{
ans+=a[i]-b[j]+'0'-carry;
carry=0;
}
i--;j--;
}
//now push remaining integers of string a into the ans string
while(i>=0){
int s=a[i]-carry;
if(s<0){
ans+=(a[i]+10-carry);
carry=1;
}
else{
ans+=(a[i]-carry);
carry=0;
}
i--;
}
int start=ans.size()-1;
while(start>=0&&ans[start]=='0'){
start--;
}
//now reverse them
string res;
for(int i=start;i>=0;i--)res+=ans[i];
return res;
}
int Comparing2strings(string a,string b){
int na=a.length(),nb=b.length();
//cout<<a<<' '<<b<<endl;
if(na<nb) return 1;
if(na>nb) return -1;
for(int i=0;i<na;i++){
if(a[i]<b[i]) {
return 1;}
else if(a[i]>b[i]) { return -1;}
}
return 0;
}
int Comparing2strings_Part2(string a,string b){
int na=a.length(),nb=b.length();
if(na>nb) return 1;
for(int i=0;i<na;i++){
if(a[i]<b[i]) {
return 0;}
else if(a[i]>b[i]) { return 1;}
}
return 0;
}
string divide(string a ,string b){
int nb= b.length(),na=a.length();
if(Comparing2strings(a,b)==1){
//cout<<"a";
return a;
}
else if(Comparing2strings(a,b)==0){
//cout<<"b";
return "0";
}
else{
//cout<<"c";
int k=b.size();
vector<int> quotient;
string remainder=a.substr(0,nb);
int i=0;
k--;
while(k<a.size()){
int count=0;
//cout<<remainder<<'r'<<endl;
while(Comparing2strings(b,remainder)==0||Comparing2strings(b,remainder)==1){
//cout<<"f"<<subract(remainder,b)<<endl;
remainder=subract(remainder,b);
count++;
}
quotient.push_back(count);
if(k==a.size()-1)
break;
remainder+=a[++k];
i++;
// cout<<quotient[i]<<' '<<remainder<<'p'<<endl;
}
//cout<<a<<endl;
return remainder;
}
}
void prime(string a){
string init = "2";
if(a == "2"){cout<<"Prime"<<endl; return;}
if(a == "3"){cout<<"Prime"<<endl; return;}
while(Comparing2strings_Part2(a, init)&&init.length()<=(a.length()/2)+1){
if(divide(a, init).length()==0){
cout<<"Not a Prime"<<endl;
return;
}
init = add(init, "1");
}
cout<<"Prime"<<endl;
}
int main(){
long long t;
cin>>t;
while(t--){
string s;
cin>>s;
prime(s);
}
}