I am using ubuntu. I have written a program to calculate prime factors. it works perfectly fine till entered number is less than 9989 (or so ) but when one enters a number higher than that, for example 15000, it does not work. Can anyone guide me whats the problem ? although new codes are welcome, but i want to know problem with my code. thanks in Advance
Code:
#include<stdio.h>
void prime_factors( int );
int next_prime_no( int );
int main()
{
int num;
printf("Enter a number : ");
scanf("%d",&num);
prime_factors(num);
return 0;
}
void prime_factors( int a)
{
int r,p,c=a;
for(p=2;p<=c;p=next_prime_no(p)) //checking for prime factors starting from 2 and then finding next higher prime number
{
while(a>0)
{
if(p==c) //printing the number itself if no prime factors other than itself.
{
printf(" Factors of %d are 1 and %d \n\n",c,c);
a=0;
break;
}
else
{
r=a%p;
if(r==0)
{
printf(" %d ",p);
a=a/p;
}
else
{
break;
}
}
}
}
printf("\n\n\n");
}
int next_prime_no(int p) // finding the next higher prime number
{
int i,r,j;
for(i=p+1;i<10000;i++)
{
r=0;
for(j=2;j<i;j++)
{
r=i%j;
if(r==0)
break;
}
if(r!=0)
{
return i;
break;
}
}
}
Hi all,
I have a HP-UX Server with 4 gigabytes of physical RAM. When I use the 'Glance' utility to see what my memory utilization is, my memory usage shows up maxed out at 99%. I shut off all the known processes that I'm running on that box and the memory utilization is still at 78% (with Swap... (3 Replies)
Hi,
I am trying to process line by line of a file. But I should not be allocating static allocation for reading the contents of the file. The memory should be dynamically allocated. The confusion here is how do I determine the size of each line, put it into a buffer with the memory allocated... (11 Replies)
I have a program that will fetch some particular lines and store it in a buffer for further operations.The code which is given below works but with some errors.I couldn't trace out the error.Can anybody help on this plz??
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#define... (1 Reply)
I have a scenario like the client has to search for the active server.There will be many servers.But not all server are active.And at a time not more than one server will be active.
The client will be in active state always i.e, it should always search for an active server until it gets one.I... (1 Reply)
Hi everyone,
I'm not new to C programming, but I'm having question regarding the memory allocation of a pointer variable which, for instance, will be declared in main(), but its memory will be allocated in subroutine.
To clearify my question, I provide a small working example:
#include... (1 Reply)
Hi Experts
I need some help in static memory allocation in C. I have a program in which I declared 2 variables, one char array and one integer. I was little surprised to see the addresses of the variables.
First:
int x;
char a;
printf("%u %u\n', &x, a);
I got the addresses displayed... (2 Replies)
When we dynamically allocate the memory say 100 integers say
int *x = new int(1000);
then does entire chunk of memory gets allocated at once after the completion of the statement?
I mean will the the concept of page fault come into picture over here? (3 Replies)
hi
in the following code, how the memory is allocated for a1 which holds the values of a2 after cpy function call.
#include <stdio.h>
#include <string.h>
void cpy(char* d, const char* s){
while(*d++=*s++);
}
main(){
char* a1;
char* a2="done";
cpy(a1,a2);
... (3 Replies)
Hello,
I am new to C++ programming, so I'm still getting a feel for things. I recently wrote a simple C++ program (to be used as a ROOT Macro) to conduct a statistical analysis of a varied version of the Monty Hall problem (code below). Basically, the programs runs a few simple calculations to... (7 Replies)
Discussion started by: Tyler_92
7 Replies
LEARN ABOUT XFREE86
prime
PRIME(1SSL) OpenSSL PRIME(1SSL)NAME
openssl-prime, prime - compute prime numbers
SYNOPSIS
openssl prime [-help] [-hex] [-generate] [-bits] [-safe] [-checks] [number...]
DESCRIPTION
The prime command checks if the specified numbers are prime.
If no numbers are given on the command line, the -generate flag should be used to generate primes according to the requirements specified
by the rest of the flags.
OPTIONS
[-help]
Display an option summary.
[-hex]
Generate hex output.
[-generate]
Generate a prime number.
[-bits num]
Generate a prime with num bits.
[-safe]
When used with -generate, generates a "safe" prime. If the number generated is n, then check that (n-1)/2 is also prime.
[-checks num]
Perform the checks num times to see that the generated number is prime. The default is 20.
COPYRIGHT
Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.
Licensed under the OpenSSL license (the "License"). You may not use this file except in compliance with the License. You can obtain a
copy in the file LICENSE in the source distribution or at <https://www.openssl.org/source/license.html>.
1.1.1a 2018-12-18 PRIME(1SSL)
08-16-2014
Memory allocation problem
