0~9中有一个1;
例:
n=2; 1 cut=1
n=12:1 10 11 12 cut=5
......
*/
#include<stdio.h>
#include<stdlib.h>
int ret_one_number(int N)
{
int i, cut = 0, num;
for (i = 1; i <= N; i++)
{
num = i;
while (num)
{
if (num % 10 == 1)
cut++;
num /= 10;
}
}
}
int main(void)
{
int x,cut;
printf("输入数:");
scanf_s("%d",&x);
cut = ret_one_number(x);
printf("%d\n", cut);
system("pause");
return 0;
}
10~19:有10个1
。。。。
对于所有数采取对10取余操作后,判断该数是否为1,是1就计数器加一
例:
n=2; 1 cut=1
n=12:1 10 11 12 cut=5
......
*/
1 2 3 4 5 6 7 8 9 10 11 12:cut=5
1......10 11 12 13 14 15 16 17 18 19 ..21..... cut=13
#include<stdio.h>
#include<stdlib.h>
int ret_one_number(int N)
{
int i, cut = 0, num;
for (i = 1; i <= N; i++)
{
num = i;
while (num)
{
if (num % 10 == 1)
cut++;
num /= 10;
}
}
}
int main(void)
{
int x,cut;
printf("输入数:");
scanf_s("%d",&x);
cut = ret_one_number(x);
printf("%d\n", cut);
system("pause");
return 0;
}