I am also a newcomer, Just want to know whether the following will be quite faster to find prime numbers.
#include "math.h"
main() /* This Generates Prime from 5 to 5000 */
{
int i, j, k,...
Type: Posts; User: chandanpatra
I am also a newcomer, Just want to know whether the following will be quite faster to find prime numbers.
#include "math.h"
main() /* This Generates Prime from 5 to 5000 */
{
int i, j, k,...
struct s { int i; };
typedef struct s service;
#ifdef __SERVICE__
#define FOO 2
#endif
main()
{
printf("%d",FOO);