获取前 50 个奇数的总和不是 5 的倍数?
Getting the sum of the first 50 odd numbers not multiple of 5?
1- 我知道如何找到数字,我只是不知道如何 link 将其转换为循环求和
#include <stdio.h>
#include <conio.h>
int main () {
int count, sum=0, i;
for (count=1;count<125;count=count+2)
if(count%5 != 0)
{ //non multiple of 5
printf ("%d \t ",count);
}
for (i = 0; i<=count; i++)
sum = sum + count;
printf("Sum= %d \t" , sum);
return(0);
}
一个循环似乎就足够了,这是我拼凑的解决方案:
#include <stdio.h>
int main(void)
{
int sum = 0;
for (int i = 1, hits = 0; hits < 50; i += 2)
{
if (i % 5 != 0)
{
sum += i;
++hits;
}
}
printf("Got sum %d\n", sum);
return 0;
}
结果是3124。
答案更正一处:
#include <stdio.h>
int main(void)
{
int sum = 0;
for (int i = 1, hits = 0; hits < 50; i += 2)
{
if (i % 5)
{
printf("%d \t%c", i, !(hits % 10) ? '\n' : ' ');
sum += i;
++hits;
}
}
printf("\nGot sum %d\n", sum);
return 0;
}
1- 我知道如何找到数字,我只是不知道如何 link 将其转换为循环求和
#include <stdio.h>
#include <conio.h>
int main () {
int count, sum=0, i;
for (count=1;count<125;count=count+2)
if(count%5 != 0)
{ //non multiple of 5
printf ("%d \t ",count);
}
for (i = 0; i<=count; i++)
sum = sum + count;
printf("Sum= %d \t" , sum);
return(0);
}
一个循环似乎就足够了,这是我拼凑的解决方案:
#include <stdio.h>
int main(void)
{
int sum = 0;
for (int i = 1, hits = 0; hits < 50; i += 2)
{
if (i % 5 != 0)
{
sum += i;
++hits;
}
}
printf("Got sum %d\n", sum);
return 0;
}
结果是3124。
#include <stdio.h>
int main(void)
{
int sum = 0;
for (int i = 1, hits = 0; hits < 50; i += 2)
{
if (i % 5)
{
printf("%d \t%c", i, !(hits % 10) ? '\n' : ' ');
sum += i;
++hits;
}
}
printf("\nGot sum %d\n", sum);
return 0;
}