int main()
{
int test,N,i,j;
scanf("%d",&test);
prime();
while(test--)
{
scanf("%d",&N);
long long int array[N];
int temp,count,rep,repmax,answer;
for(i=0;i<N;i++)
scanf("%lld",&array[i]);
count=temp=answer=0;
for(j=0;j<h;j++)
{
repmax=0;
for(i=0;i<N;i++)
{
if(array[i]!=1 && array[i]>prime2[j] && array[i]%prime2[j]==0)
{
rep=0;
while(array[i]%prime2[j]==0 && array[i]>=prime2[j])
{
array[i]=array[i]/prime2[j];
rep++;
}
if(rep>repmax)
repmax=rep;
}
else
{
count++;
continue;
}
}
answer=answer+repmax;
if(count==N)
break;
}
printf("%d\n",answer);
}
return 0;
}
void main()
{
int n,num[7],i,c=0;
do
{
printf("How many number (3-7) : ");
scanf("%d",&n);
}
while(n<3||n>7);
i=0;
while(i<n)
{
if(num[i]<1||num[i]>20)
{
printf("number %d (1-20) : ",i+1);
scanf("%d",&num[i]);
}
else
{
i++;
}
}
printf("Before calling a function\n");
for(i=0; i<n; i++)
{
printf("%d ",num[i]);
}
printf("\nAfter calling a function\n");
prime(num,n);
for(i=0; i<n; i++)
{
if(num[i]!=0)
{
c++;
}
printf("%d ",num[i]);
}
printf("\nAll prime number = %d",c);
}
vector<int> Solution::sieve(int a) {
int i,j,k;
vector<int>ans;
if(a<2)
return ans;
vector<int> prime(a+10, 0);
prime[2]=0;
for(i=2;i<=a;i++){
if(prime[i]==0){
ans.push_back(i);
for(j=2; j*i<=a; j++)
prime[i*j]=1;
}
}
return ans;
}
int main(void)
{
int count, i, m, n, sum;
int repeat, ri;
scanf("%d", &repeat);
for(ri = 1; ri <= repeat; ri++){
scanf("%d%d", &m, &n);
sum=0;
count=0;
for(i=m;i<=n;i++)
{
if (prime(i))
{
sum=sum+i;
count++;
}
}
printf("Count = %d, sum = %d\n", count, sum);
}
}
int main (void)
{
int count = 0;
long long checknum = 3;
long long total = 2;
while (checknum < 2000000)
{
if (prime(checknum))
{
count++;
total = total + checknum;
checknum = checknum + 2;
} else {checknum = checknum + 2;}
}
printf("%lld", (total));
return 0;
}
void printAllPrimes(unsigned n)
{ /*
functia verifica numere succesive pana gaseste n numere prime
n este de tipul int , n>0
functia nu returneaza nimic
*/
int number=2;
while(n>0)
{
if (prime(number))
{ printf("%d",number);
printf("\n");
n--;
}
number++;
}
}
int main()
{
prime();
char w[2001];
//int c,b,d,e,f,i,j,k,n;
int c,d,e,f,g,t,i,j,k,l,m,n,s;
scanf("%d",&n);
getchar();
for(t=1;t<=n;t++)
{f=0;
gets(w);
l=strlen(w);
for(j=0;j<l;j++)
{
if(w[j]>=48&&w[j]<=123)
{
c=w[j];
r[c]++;
}
}
a[1]=1;
printf("Case %d: ",t);
for(k=48;k<126;k++)
{
d=r[k];
if(a[d]==0&&d!=0)
{
f=1;
printf("%c",k);
}
}
if(f==0)
printf("empty");
printf("\n");
memset(r,0,sizeof(r));
}
return 0;
}
int main() {
int ispr[kMaxVal];
for (int i = 0; i < kMaxVal; ++i)
ispr[i] = prime(i);
int qla = 0, qlb = 0, qlmax = 0;
for (int a = -kMaxA + 1; a < kMaxA; ++a) {
for (int b = -kMaxB + 1; b < kMaxB; ++b) {
int ql = quadlen(ispr, a, b);
if (ql > qlmax) {
qla = a;
qlb = b;
qlmax = ql;
}
}
}
printf("a = %d b = %d\n", qla, qlb);
printf("a * b = %d\n", qla * qlb);
return 0;
}
int
main()
{
const uint_fast64_t n = 10000;
uint_fast64_t i;
prime_init(n);
for (i = 3; i < n; i += 2)
{
if (prime(i))
continue;
if (!goldbach(i))
break;
}
printf("%lu\n", i);
return EXIT_SUCCESS;
}
int main()
{
int t,n,a[10005],k=0,z;
scanf("%d",&t);
while(t--)
{
k=0;
scanf("%d",&n);
for(z=2;z<=104729;z++)
{
if(prime(z))
k++;
if(k==n)
{
printf("%d\n",z);
break;
}
}
}
return 0;
}
main()
{
long long int i=2;
long long int n=600851475143;
long long int max=-999999999999;
long long int pnum;
for(i=1;i<n;i++)
{
if(n%i==0)
pnum=prime(i);
if(pnum>max)
{
max=pnum;
}
else max=max;
}
printf("%lli",max);
getch();
}
int main(int argc, char*argv[]){
int n;
int i;
int j;
int k;
int a[n][n];
printf("enter the size of the array:\n");
scanf( "%d", &n ) ;
printf("enter the intial value:\n");
scanf("%d",&k);
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(prime(k++)==1)/*need k++ otherwise k won't change*/
printf("%d ",k-1);/*need this minus one to counter act the k++*/
else
printf( "*** ");
}
printf("\n");
a[j][k] = a[j+1][k+1];
}
return 0;
}
int sc_main(int ac, char *av[])
{
// Signal Instantiation
sc_signal<bool> reset ("reset");
sc_signal<bool> prime_ready ("prime_ready");
signal_bool_vector prime ("prime");
// Clock Instantiation
sc_clock clk ("CLK", 6, SC_NS, 0.5, 10, SC_NS, false); // 167 Mhz
// Process Instantiation
prime_numgen D1 ("D1", clk, reset, prime_ready, prime);
resetp T1 ("T1", clk, reset);
displayp T2 ("T2", clk, prime_ready, prime);
// Simulation Run Control
sc_start();
return 0;
}
void calcE() {
int k;
k=0;
// cycles through all integers less than phi..
for(i=2;i<phi;i++) {
if(phi%i==0)
continue;
// if phi is not divisible by 'i', checks if prime.
flag=prime(i);
if(flag==1&&i!=p&&i!=q) {
// if prime, assigns to a value of 'e'.
e[k]=i;
flag=calcD(e[k]);
if(flag>0) {
d[k]=flag;
k++;
}
if(k==99)
break;
}
}
}
int main(){
int cas;
while(~scanf("%d",&cas)){
while(cas--){
int n;scanf("%d",&n);
memset(map1,-1,sizeof(map1));
int tsum=0;
init(n);
for(int i=0;i<n;i++){
int t1,t2,t3;scanf("%d%d%d",&t1,&t2,&t3);
a[t1]=t2;
for(int i=0;i<t3;i++){
int u;scanf("%d",&u);
map1[t1][u]=1;
un(t1,u);
}
tsum+=t2*t3;
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(map1[i][j]==1){
map1[i][j]=a[i]+a[j];
}
}
}
int ans=0;
for(int i=0;i<n;i++){
if(fa[i]==i){
// printf("%d %d\n",i,num[i]);
ans+=prime(i,num[i]);
}
}
// printf("%d %d\n",ans,tsum);
printf("%d\n",tsum-ans);
}
// break;
}
return 0;
}
void partPrime(int value, int* arr, int ind)
{
int n = 0;
int primenum = 0;
int prime(int n);
if (value == 0)
{
printpart(arr, ind);
return;
}
for (n = 1; n <= value; n++)
{
primenum = prime(n);
if (primenum == 1)
{
arr[ind] = n;
partPrime(value - n, arr, ind + 1);
}
}
}
int main()
{
int x , y , i;
printf("The program finds all prime numbers that divide by 3 and are between x and y!");
do
{
printf("\nEnter x and y (x < y)");
printf("\nEnter x:"); scanf("%d", &x);
printf("\nEnter y:"); scanf("%d", &y);
}while(x>=y);
for(i=x; i<y; i++)
{
if(prime(i) && i%10==3)
{
printf("%d\n", i);
}
}
getchar();
getchar();
}
static long long int solve(int n, int m) {
struct prime_info *primes = malloc(PRIME_COUNT * sizeof(struct prime_info));
int prime_count = 0;
long long int result = 1;
for (int i = 2; i <= n; ++i) {
long long int r;
int left;
prime(i, m, primes, &prime_count, &r, &left, MOD);
/* result *= r; */
/* result %= MOD; */
}
for (int i = 0; i < prime_count; ++i) {
assert(primes[i].value > 0);
/* printf("%d %d\n", primes[i].value, primes[i].count); */
assert(primes[i].count >= 0);
result *= power_mod(primes[i].value, primes[i].count, MOD);
result %= MOD;
}
free(primes);
return result;
}
int main(int argc, char *argv[])
{
int n, i, f1,f2,f3;
//scanf("%d",&n);
klee_make_symbolic(&n, sizeof n, "n");
f1 = prime(n);
f2 = even(n);
f3 = squr(n);
if(f1){
if(f2){
if(f3)
printf("%d is a prime, even and squre number.\n",n);
else
printf("%d is a prime, even and not squre number.\n",n);
}
else{
if(f3)
printf("%d is a prime, odd and squre number.\n",n);
else
printf("%d is a prime, odd and not squre number.\n",n);
}
}
else{
if(f2){
if(f3)
printf("%d is a composite, even and squre number.\n",n);
else
printf("%d is a composite, even and not squre number.\n",n);
}
else{
if(f3)
printf("%d is a composite, odd and squre number.\n",n);
else
printf("%d is a composite, odd and not squre number.\n",n);
}
}
return 0;
}
int main()
{
int m,n;
int k;
int sum;
scanf("%d",&n);
while(n--)
{
sum=0;
scanf("%d",&m);
while(m--)
{
scanf("%d",&k);
sum+=prime(k);
}
printf("%d\n",sum);
}
return (0);
}
void ce()
{
int k;
k=0;
for(i=2;i<t;i++)
{
if(t%i==0)
continue;
flag=prime(i);
if(flag==1&&i!=p&&i!=q)
{
e[k]=i;
flag=cd(e[k]);
if(flag>0)
{
d[k]=flag;
k++;
}
if(k==99)
break;
}
}
}
int prime(int a)
{
static int d=2,flag=1;
if(d==a)
{
return(0);
}
else
{
if(a%d==0)
{
flag=0;
d++;
}
else
{
d++;
flag=1;
prime(a);
}
}
return(flag);
}
void Hash::rehash(int x)
{
int newsize = prime(m_length);
int c = count();
int array[c];
int size = 0;
for (int i = 0;i<m_length;i++)
{
int value = table[i]->getvalue();
if(value!=-1)
{
array[size]=value;
table[i] = new hashnode(-1,false);
size++;
}
}
m_length = newsize;
for(int i=0;i<size;i++)
{
insert(array[i]);
}
insert(x);
}
// the number of numbers less than n which are relatively prime to num
int totient(int num) {
int n = num;
if(is_prime(num)) return num - 1;
double prod = 1;
long _prime = 2;
int curr_p = 0;
while(_prime < num) {
if(num % _prime == 0) {
prod *= (1 - 1./_prime);
}
_prime = prime(++curr_p);
}
return (int)(n*prod);
}
void ofxAudioUnitFilePlayer::play(uint64_t startTime) {
if(!_primed) {
prime();
}
_primed = false;
if(startTime == 0) {
startTime = mach_absolute_time();
}
AudioTimeStamp startTimeStamp = {0};
FillOutAudioTimeStampWithHostTime(startTimeStamp, startTime);
OFXAU_RETURN(AudioUnitSetProperty(*_unit,
kAudioUnitProperty_ScheduleStartTimeStamp,
kAudioUnitScope_Global,
0,
&startTimeStamp,
sizeof(startTimeStamp)),
"setting file player start time");
}
int get_prime(int Pm, int Pn, int *output)
{
int i = 3, j = 1, k = 0;
if (NULL == output)
{
printf("output create err");
return 0;
}
output[0] = 2;
// printf("%d", output[0]);
do{
if (prime(i))
{
output[j] = i;
//printf("%d ", output[j]);
j++;
}
i++;
}while(j <= Pn);
if (Pm == Pn)
{
goto last;
}
for (i = 1,k = Pm; k < Pn; i++, k++)
{
printf ("%d", output[k-1]);
if (i % 10 == 0)
printf("\n");
else{
printf (" ");
}
}
last:
printf ("%d", output[Pn-1]);
return 0;
}
int main()
{
int i=500;
int j=2;
int a;
int counter=1;
while(i)
{
a=prime(j);
if(a)
{
printf("%d ",j);
i--;
counter++;
}
if(counter>10)
{printf("\n");
counter=1;
}
j++;
}
return 0;
}
int main( void ){
int i;
for(i = 1; i < 1000; i++) {
printf("%d is %d\n", i, perfect(i));
}
int a;
for(a = 2; a < 75; a++) {
printf("%d is %d\n", a, prime(a));
}
int num1, num2, num3,num4;
printf("Enter number:\n");
scanf("%d",&num1,"\n");
printf("Enter 2nd number:\n");
scanf("%d",&num2,"\n");
printf("Reverse number of %d is %d\n", num1, revDigits(num1));
printf("Reverse number of %d is %d\n", num2, revDigits(num2));
}
int main()
{
int i;
int colcnt = 0;
for (i=2; i <= 50000; i++)
{
if (prime(i))
{
colcnt++;
if (colcnt%9 == 0)
{
printf("%5d\n",i);
colcnt = 0;
}
else
{
printf("%5d ", i);
}
}
}
putchar('\n');
return 0;
}
int main(){
system("clear");
int x,y;
printf("Enter x : ");
scanf("%d", &x);
do{
// system("clear");
printf("Enter y>x : ");
scanf("%d", &y);
}while(x>=y);
int i;
for(i=x; i<y; i++){
if( prime(i) ){
if( end_three(i) ){
printf("%d \n", i);
}
}
}
return 0;
}
