Your isPrime function will return 0 for even-number and return 1 for odd-number because your loop always end at the first loop (because you always return a value at the first loop.)

Try this one...

If I am not wrong, it is logically correct.

You don't understand the code or the code does not work properly? It seem to work properly for me.

For those who are lazy to search through internet here is the link: gets() vs fgets() (http://faq.cprogramming.com/cgi-bin/smartfaq.cgi?answer=1049157810&id=1043284351)

We don't do homework for you.

I am greatly disappointed.

I have finally found the solution to my problem, so I am going to share it to anyone who interest the same thing as what I am



int main()
{
// allocate 8 bytes for storing machine code...

Don't mess with Narue. Look at her avatar, you will get some idea :sweat:

All your code do is assigning each element of your matrix to -1 and then display them. It is no surprise at all that you did not achieve the assignment because you haven't figured or aren't willing...

Recently, I have wonder how to execute machine code instruction from memory in C/C++. I am aware of data execution protection. Anyway, I have this piece of code:


int main()
{
// allocate 2...

Ouch! Didn't know this trick before

Took me 5 minutes to indent your code


/*This program removes duplicates from a sorted array of integers*/

#include <stdio.h>
#include "genlib.h"
#include "simpio.h"
#include "strlib.h"...

To be honest, it is hard to read your code without know the clear purpose of what your function intent to do. It would be easy if you tell us what will your function return, what each parameters do,...

1. Why create this function when you can simply compare two characters with operator ==.

int Check_Characters(char s1,char s2) {
if(s1==s2)
return 1;
return 0;
}

Or another faster way is using modulus operator.


Pseudo code:
For i = 0 To 3
Print i % 2
Next i

Result:
0 1 0 1

You can also use temp as char array, but you don't know how much element you need for your new string...

Here is your code and its logical error.

int RemoveChars(char *S,char c) {
int i=0;
int spaces=0;
char temp;
for(i=0;S[i]!=0;i++) {
temp=S[i];
if(S[i]!=c) {
...

I am at my workplace right now, so I don't have any compiler to test. However, I see several things that could cause some errors.

Firstly, End=S+1;, it should be End = &S[i] + 1

Secondly, int...

Now that I don't really understand what you want for your *num. Here is what I understand before:

If I have string "Hello World", and my c is 'W'. so the *num would be 7 because letter 'W' is the...

As I have mentioned before, your code keep reset the *num to 0. To solve this problem, you need to remove the code where you reset *num:


char *Strchr(char *String, char c, int *num)
{
*num...

Sorry, I was mistaken about the increment (I was at workplace where there was no compiler to test). I'm surprised that:

*b++ and *++b get the value of the next address and also increase the...

It is difference. Let start that you string "Name". The first character of the string is 'N'. so *string++ is 'O' and next time *string++ will become 'P', 'Q', 'R', 'S'..... 'Z'....

What you want...

while(*String++), you increase your first character value by one that mean that if your first character 'A' then it will loop from 'A' to 'Z', to character 255 and then to character 0 and to 'A'...

How could *num go beyond 1 when your code does not allow it to go beyond that.


char *Strchr(char *String,char c,int *num) {
char *ptr;//whish will be ptr to first stuff we found after that...

kbhit() function is in conio.h library and conio.h is not a standard library which is not what Hiroshe want

The problem that your code doesn't run properly is because you keep increase the dig without reseting it. To solve this, you can simply reset the dig to 0 in the beginning of the loop.

...

If an Armstrong number is a number such that the sum of its digits raised to the third power is equal to the number itself, then I am sure that there are only 5 Armstrong numbers that does exist in...

An n-digit number that is the sum of the nth powers of its digits is called an n-narcissistic number. It is also sometimes known as an Armstrong number, perfect digital invariant (Wolfram...

Do you, youself, know how to convert from hex to dec and from oct to bin? If you know, then program your program to do as what you would do in real life.

How about this array [2, 4, 1, 5, 6]
so the maximun of subset sum is 2 + 4 + 1 + 5 + 6 = 17?

Sorry, but I still don't understand what is "subset with maximum sum". Can anyone explain or give me more examples?

gerard4143, you're still using operator (-)

It's really true.

Not a good way :( but it works fine.


int sum(int num1, int num2)
{
int total, temp, temptotal;
total = num1 ^ num2;
for(temp = num1 & num2; temp != 0; temp = temptotal & temp) {...

Firstly, base8 = y*8^n does not have semi-colon at the end of the statement. Secondly, ^ is not a power operator. I think you are confusing with Visual Basic. Moreover, x/10 = x; and x %10 =y; are...

Yes, but the topic say divisible by 2 and 3.

If one number divisible by 2 and 3, it is also divisible by 6.

for(i = 1; i <= 100; i++) {
if (i % 6)
// this condition is true whenever i is not divisible by number 2 and 3.
}

Sorry. Without much thinking, I jumped to answer this question.

Alternative way from Narue:


// input your num here.
for (temp = num; temp > 9; temp /= 10)
printf("%c", '0' + (temp % 10));

I am not sure what you're looking for, maybe you mean continue;?