小q的数列

最新推荐文章于 2023-02-15 12:06:55 发布

whitewall_9

最新推荐文章于 2023-02-15 12:06:55 发布

阅读量200

点赞数

分类专栏：练习题目文章标签：思维

本文链接：https://blog.csdn.net/qq_28409093/article/details/124030810

版权

数列递推 NowCoder 算法竞赛 C++代码

关键词由CSDN通过智能技术生成

练习题目专栏收录该内容

340 篇文章 1 订阅

订阅专栏

// Problem: 小q的数列
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/21763/1002
// Memory Limit: 65536 MB
// Time Limit: 2000 ms
// 2022-04-08 02:30:26
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
ll f[1000000];

ll get (ll n) {
    if (n <= 0) return 0;
    if ( n == 1) return 1;
    return get (n / 2) + get(n % 2);
}
int main () {
	 ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    cin >> t;
    
    while (t --) {
        ll n;
        cin >> n;
        
        ll s = get(n);
        cout << s << ' ';
        cout << (1ll<<s) - 1 << endl;
    }
    return 0;
}

多列几项可以发现规律