Powers Of Two
思路:二進位制,當時沒寫出來,現在一看,也不難,很生氣。
#include<cstdio> #include<iostream> #include<algorithm> using namespace std; typedef long long ll; int main(){ int n, k; cin >> n >> k; int A[k], sum = k; fill(A, A + k, 1); for (int i = k - 1; i >= 0; --i) { while (sum + A[i] <= n) { sum += A[i]; A[i] *= 2; } } if (sum != n) cout << "NO\n"; else { cout << "YES\n"; for (int i = 0; i < k; ++i) cout << A[i] << ' '; } return 0; }
相關推薦
Codeforces 988D Points and Powers of Two 【性質】【卡常】
cout force 大於 codeforce ces com CI ORC size 這道題關鍵在於想到兩個性質,想到就好做了。這還是我做過的第一道卡常題 1.滿足題目中條件的子集,其中元素個數不能大於3 2.如果最大子集為3的話,那一定是x-2^i, k, x+2^
Codeforces Round #486 (Div. 3) D. Points and Powers of Two
equals tegra names size AR tin ++ include ESS Codeforces Round #486 (Div. 3) D. Points and Powers of Two 題目連接: http://codeforces.com/gro
【Ivan and Powers of Two】【CodeForces - 305C】(思維)(Set 應用)
題目: Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing ord
【CodeForces - 305C】Ivan and Powers of Two(思維)
C. Ivan and Powers of Two time limit per test 0.5 seconds memory limit per test 256 megabytes input standard input output standard o
CodeForces - 305C Ivan and Powers of Two 優先佇列
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order. Ivan wrote out in
CodeForces - 305C Ivan and Powers of Two(數學+思維)
CodeForces - 305C Ivan and Powers of Two(數學+思維) Ivan has got an array of n non-negative integers a1, a2, …, an. Ivan knows that the array is sor
CodeForces C - Powers Of Two
cto urn using 如果 即使 直接 後來 pow c++ 題意:給出一個數字n和k,使得k個數字加起來的和等於n。k個數字必須是2的冪次,比如1,2,4,8. 解法:首先排除k大於n的情況,這樣即使全選1也不能滿足。 比賽時候想得做法是,先把2的冪次打表,然後
Codeforces Round #529 (Div. 3) C. Powers Of Two(數學????)
傳送門 題意: 給出一個整數 n ,問能否將 n 分解成 k 個數之和,且這 k 個數必須是2的冪。 如果可以,輸出"YES",並打印出任意一組解,反之輸出"NO"; 題解: 預備知識補充: 如何求出 num 最少需要多少個2的冪之和? 例如 : n
Codeforces Round #529 (Div. 3) C. Powers Of Two
http://codeforces.com/contest/1095/problem/C 題意:給n找出k個2的冪,加起來正好等於n。例如 9,4:9 = 1 + 2 + 2 + 4 思路:首先任何數都能表示成2的次冪的和,其次很容易發現,n和k都是二的次冪的情況是最基礎的,因為可以分成k個n/k,而n/
codeforces 1095C Powers Of Two
題目: 題目連結 題意: 給出一個n和一個k,能否用k個2的x方的數的和等於n。 思路: 將2的前29次方求出,然後從大往小遍歷,儘可能的選大的數放入一個map中,記下放入數的次數Size。 如果Size<n||k>n則輸出NO。 否則,就將大於1的數進行分解
Powers Of Two
題目連結 思路:二進位制,當時沒寫出來,現在一看,也不難,很生氣。 #include<cstdio> #include<iostream> #include<algorithm> using namespace std; typedef long long
C. Powers Of Two 二進位制
題目連結:http://codeforces.com/contest/1095/problem/C 題目大意:給你兩個整數n和k,要求把n拆成k個2的冪的和。1 2 4 8 16…。如果無法做到就輸出NO,能夠做到就輸出YES,並且輸出k個2的冪加數。 思路:開始沒有往二進位制的方向想。只
CodeforcesC. Powers Of Two
題意:找到k個數,並且都是2的多少次冪,這k個數相加等於n,不需要按順序。 思路:看k>n,輸出NO,如果k<n,先找出最少的情況所需要數的個數(就是這個數轉化成二進位制後1的個數),與k比較,大於k輸出NO,小於k肯定是YES,然後每次找最大的那個數,除以2,得到兩個數,把這兩個數
Codeforces 1095C. Powers Of Two——————multiset
C. Powers Of Two A positive integer x is called a power of two if it can be represented as x
Codeforces Round #529 -C- Powers Of Two(二進位制拆分)
A positive integer xx is called a power of two if it can be represented as x=2yx=2y, where yy is a non-negative int
【Codeforces 988D】Points and Powers of Two
static catch runtime token return == .so args exc 【鏈接】 我是鏈接,點我呀:) 【題意】 讓你從一個集合中找出來一個子集 使得這個子集中任意兩個數相減的絕對值是2^的整數次冪 且集合的大小最大 【題解】 考
CF 1095C Powers Of Two(二進制拆分)
con hat 會有 inpu += string may pre ace A positive integer xx is called a power of two if it can be represented as x=2y, where y is a non-n
[LeetCode]160.Intersection of Two Linked Lists
col style return tro nod sts diff original you Intersection of Two Linked Lists Write a program to find the node at which the intersectio
Intersection of Two Arrays
func [] 空間 write example arraylist span ins 數組 Given two arrays, write a function to compute their intersection. Example Given nums1 =
4. Median of Two Sorted Arrays
中間 比較 median log pub math span pan osi 一、Description: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find