資源簡介
給定一整數(shù)n,計(jì)算所有小于等于n的非負(fù)整數(shù)中數(shù)字1出現(xiàn)的個數(shù)
代碼片段和文件信息
#include?
#include?
int?getNums(int?num);
int?getEveryRes(int?start?int?end?int?len);
int?main()?{
????int?num?=?-1;
????static?int?count1?=?0;
????int?length?=?-1;
????//?判斷當(dāng)前輸入數(shù)是幾位數(shù)
????printf(“input?a?num?:?“);
????scanf(“%d“?&num);
????length?=?getNums(num);
????printf(“你輸入的是:%d?位數(shù)\n“?length);
????for?(int?i?=?1;?i?<=?length;?++i)??//?位數(shù)?1?1-9??2??10?-99?3?100-999
????{
????????if?(i?==?length)
????????{
????????????count1?+=?getEveryRes(pow(10?i?-?1)?num?i);
????????}
????????else
????????{
????????????count1?+=?getEveryRes(pow(10?i?-?1)?pow(10?i)?-?1?i);
????????}
????}
????printf(“%d?-?%d?中1出現(xiàn)的個數(shù)?=?%d\n“?1?n
- 上一篇:輸出1000以內(nèi)的水仙花數(shù)?
- 下一篇:ba
se64 算法
評論
共有 條評論