1049. Counting Ones (30)
来源:互联网 发布:通关宝典软件下载 编辑:程序博客网 时间:2024/06/05 15:33
题目:https://www.patest.cn/contests/pat-a-practise/1049
#include<cstdio>int main(){ int n,a=1,left,now,right,ans=0; scanf("%d",&n); while(n/a) { left = n/(a*10); now = n/a % 10; right = n%a; if(now == 0) ans += left * a; else if(now == 1) ans += left *a + right +1; else ans += (left + 1) *a; a *=10; } printf("%d",ans); return 0;}
0 0
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1049. Counting Ones (30)
- 1048. Find Coins (25)
- 通过Ajax方式绑定select选项数据
- activity生命周期
- 主页面
- 理解Linux系统/etc/init.d目录和/etc/rc.local脚本(开机运行)
- 1049. Counting Ones (30)
- 队列的应用——火车重排(java实现)
- 23种设计模式彩图
- 四种读入方式的效率对比
- SQL:1999语法
- Git 分支管理最佳实践
- hdu 2795 Billboard
- Leetcode 263. Ugly Number
- 新手初学sublime text