CodeForces 893B Beautiful Divisors (打表)
来源:互联网 发布:河北网站seo 编辑:程序博客网 时间:2024/06/06 05:03
题目大意:最近,Luba了解了一种特殊的数字,他称之为“漂亮的数字”。这个数被称为漂亮是因为它的二进制表示包括k+1个连续的,然后是k个连续的0。
Some examples of beautiful numbers:
- 12 (110);
- 1102 (610);
- 11110002 (12010);
- 1111100002 (49610).
The only line of input contains one number n (1 ≤ n ≤ 105) — the number Luba has got.
解题思路:实质上就是求“漂亮的”n的最大除数,题中给的n范围比较小,我们可以直接估算出2的次幂,然后手动算出所有漂亮的除数,开个数组存起来,也可以写个循环自行打表。
代码如下:
#include<iostream>#include<cmath>using namespace std;int n;int a[9]={1,6,28,120,496,2016,8128,32640};int main(){ cin>>n; /*for(int i=0; i<8; i++) { int sum=0; for(int j=2*i; j>=i; j--) { sum+=pow(2,j); } a[i]=sum; }*/ for(int i=7; i>=0; i--) { if(n%a[i]==0) { cout<<a[i]<<endl; break; } } return 0;}
~step by step
阅读全文
0 0
- CodeForces 893B Beautiful Divisors (打表)
- CodeForces 893B Beautiful Divisors
- CodeForces 893B Beautiful Divisors
- Codeforces Educational Codeforces Round 33 B 893B Beautiful Divisors
- 【Educational Codeforces Round 33 B】Beautiful Divisors
- 171127 #codeforces# Beautiful Divisors
- CF-B.Beautiful Divisors
- Educational Codeforces Round 33 (Rated for Div. 2) 893B. Beautiful Divisors
- 【Educational Codeforces Round 33】 B. Beautiful Divisors (枚举)
- 【CodeForces】651B - Beautiful Paintings(暴力)
- codeforces 651B Beautiful Paintings(贪心)
- CodeForces 651 B.Beautiful Paintings (贪心)
- codeforces--651B Beautiful Paintings
- codeforces 651B Beautiful Paintings
- CodeForces 651B Beautiful Paintings
- codeforces 651B Beautiful Paintings
- CodeForces 651B Beautiful Paintings
- 【CodeForces】651B - Beautiful Paintings
- MFC 思考:MFC是否没落了
- Java程序员的面试经历和题库
- 拥塞控制概论
- 理解Spring中的IOC和AOP
- lnmp环境安装
- CodeForces 893B Beautiful Divisors (打表)
- Hadoop完全分布式集群安装Hbase
- springboot依赖下载很慢,使用maven镜像
- UV旋转动画Shader
- 抽象类和接口的区别
- 合并单链表
- centos7安装shipyard没有本地容器及镜像附安装步骤
- win下mysql启动配置
- 网狐荣耀版短信验证开发流程说明