pat甲1049. Counting Ones (30)
2018-04-10 19:35
435 查看
思路见算法笔记《上机训练实践》p198
#include <cstdio> #include <cstdlib> #include <string.h> #include <cmath> #include <algorithm> using namespace std; int n; int main() { scanf("%d",&n); int sum=0; int b[11]; int right=0,left=0,now=0; int mod=0; int a=1; while(n!=0) { right=right+now*a/10; now=n%10; left=n/10; n=n/10; if(now==1) { sum+=(left)*a+right+1; } else if(now==0) { sum+=(left)*a; } else { sum+=(left+1)*a; } a*=10; } printf("%d\n",sum); system("pause"); return 0; }
相关文章推荐
- PAT甲级 1049. Counting Ones (30)
- PAT_A 1049. Counting Ones (30)
- Python实现Pat 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- 1049. Counting Ones (30)【计算1 的个数】——PAT (Advanced Level) Practise
- pat 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)(计算1到N,这些数字中1出现的个数,before i after,归纳)
- pat 甲级 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- PAT (Advanced Level) Practise 1049 Counting Ones (30)
- PAT 甲级 1049. Counting Ones (30)
- 【PAT (Advanced Level)】1049. Counting Ones (30)
- 【PAT】1049. Counting Ones (30)
- PAT (Advanced Level) 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- 【PAT甲级】1049. Counting Ones (30)
- PAT 解题报告 1049. Counting Ones (30)
- PAT (Advanced Level) 1049. Counting Ones (30) 1到N中1出现的次数
- PAT 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)