CodeForces - 1646C Factorials and Powers of Two

看了大佬的博客才会写的传送门

#include<bits/stdc++.h>
using namespace std;#define int long longint lowbit(int x)
{return x&(-x);
}int ans=0;int getl(int x)
{int n=0;for(;x;x-=lowbit(x))n++;return n;
}void dfs(int x,int sum,int k,int s)
{if(sum>s){ans=min(ans,k+getl(s));return;}dfs(x+1,sum*x,k+1,s-sum);dfs(x+1,sum*x,k,s);
}signed main()
{ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);int t,m;cin>>t;while(t--){cin>>m;ans=getl(m);dfs(4,6,0,m);cout<<ans<<endl;}
}

CodeForces - 1646C Factorials and Powers of Two相关推荐

Codeforces 1646C Factorials and Powers of Two
0x10 题目链接 cf 1646c 0x20 题目 0x21 Tag 状态压缩,枚举 0x22 题目描述 0x23 翻译给出一个数n,是否能将其拆解成多个**(共k个)**2的幂次与阶乘的和,求k ...
CF 1646C Factorials and Powers of Two
题目思路只有2的指数阶和n的阶层所构成数据范围是101210^{12}1012,恰好在2402^{40}240和15!15!15!以内总所周知,每一个整数都可以转换为相应的二进制数, 对应这道 ...
CodeForces 305C Ivan and Powers of Two【set】
这个题啊,纠结了本公举一中午,知道如果出现了重复的,就要往后移,差点就把自己想的恶心的bool 数组付诸实现了,== 既然是思维的题,借助了STL的特性是再正常不过的了,既然想写数组,先应该想想Set ...
Codeforces Round #774 (Div. 2) A-D
A. Square Counting 思路签到 #include <bits/stdc++.h> using namespace std; int main() {ios::sync_w ...
CodeForce 774 div2 A-C,E题解
E. Power Board 思路重复的数是从哪里来的?比如4 = 2 2 2^2 22, 那么 4 2 4^2 42 就会跟 ( 2 2 ) 2 (2^2)^2 (22)2 = 2 4 2^4 2 ...
Codeforces 955C Sad powers（数论）
Codeforces 955C Sad powers 题意 q组询问,每次询问给定L,R,求[L,R]区间内有多少个数可以写成ap的形式,其中a>0,p>1,1 ≤ L ≤ R ≤ 1e1 ...
Relatively Prime Powers CodeForces - 1036F （莫比乌斯函数容斥）
Relatively Prime Powers CodeForces - 1036F Consider some positive integer xx. Its prime factorizatio ...
Educational Codeforces Round 50: F. Relatively Prime Powers（莫比乌斯函数）
F. Relatively Prime Powers 题意: 给你一个n,问满足在[2,n]范围内有多少个数是非次方数(也就是不是这样的) 思路: 答案就是原理是利用容斥,注意n开i次根是向下取整( ...
Codeforces 955C Sad powers
C. Sad powers time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...

CodeForces - 1646C Factorials and Powers of Two

CodeForces - 1646C Factorials and Powers of Two相关推荐

最新文章

热门文章