目录
2.计算1/1-1/2+1/3-......+1/99-1/100
1.数9的个数
int nine_num(int n)
{
int count = 0;
for (n = 1; n <= 100; n++)
{
if (n % 10 == 9)
{
count++;
}
if (n /10 == 9)
{
count++;
}
}
return count;
}
int main()
{
int num = 0;
int ret = nine_num(num);
printf("%d", ret);
return 0;
}
2.计算1/1-1/2+1/3-......+1/99-1/100
int main()
{
int b = 0;
double sum = 0; //注意sum不是整数
int flag = 1;
for (b=1;b<=100;b++)
{
if(b%2==0)
sum += flag*1.0 / b;
flag = -flag;
}
printf("%lf", sum);
return 0;
}
3.求10个整数中的最大值
int main()
{
int arr[] = { -1,2,3,-4,5,6,-7,8,-9,10 };
int max = arr[0];
int i = 0;
for (i = 1; i < 10; i++)
{
if (arr[i] > max)
{
max = arr[i];
}
}
printf("%d", max);
return 0;
}
4.九九乘法表
int main()
{
int i = 1;
int j = 1;
for (i = 1; i < 10; i++)
{
for (j = 1; j <= i; j++)
{
printf("%d*%d= %d", i, j, i * j);
}
printf("\n");
}
return 0;
}
修改:
乘法口诀表
int main()
{
int n = 0;
int i = 0;
int j = 0;
scanf_s("%d", &n);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
{
printf("%d*%d=%d ", i, j, i * j);
}
printf("\n");
}
return 0;
}
5.字符串逆序
循环方式:
int my_strlen(char* str)
{
int count = 0;
while (*str != '\0')
{
count ++;
str++;
}
return count;
}
void reverse_string(char* str)
{
int left = 0;
int right = my_strlen(str) - 1;
while (left < right)
{
char tmp = str[left];
str[left]=str[right];
str[right] = tmp;
left++;
right--;
}
}
int main()
{
char arr[] = "abcdef";
reverse_string(arr);//数组名arr是数组arr首元素的地址
printf("%s\n", arr);
return 0;
}
递归方式:
大事化小
int my_strlen(char* str)
{
int count = 0;
while (*str != '\0')
{
count ++;
str++;
}
return count;
}
void reverse_string(char* str)
{
char tmp = *str;
int len = my_strlen(str);
*str = *(str + len - 1);
*(str + len - 1) = '\0';
//判断条件
if (my_strlen(str+1)>=2)
{
reverse_string(str + 1);
}
*(str + len - 1) = tmp;
}
int main()
{
char arr[] = "abcdef";
reverse_string(arr);//数组名arr是数组arr首元素的地址
printf("%s\n", arr);
return 0;
}
6.输入一非负整数,输出是组成该非负整数的每一位数的和
int Digitsum(int num)
{
if (num > 9)
{
return Digitsum(num / 10) + num % 10;
}
else
{
return num;
}
}
int main()
{
int num = 1729;
int sum = Digitsum(num);
printf("%d", sum);
return 0;
}
7.用递归实现n的k次方
double Pow(int n, int k)
{
if (k == 0)
{
return 1.0;
}
else if(k > 0)
{
return n * Pow(n, k - 1);
}
else
{
return 1.0 / (Pow(n, -k));
}
}
int main()
{
int n = 0;
int k = 0;
scanf_s("%d %d", &n,&k);
double ret = Pow(n, k);
printf("%f", ret);
return 0;
}