Topcoder SRM 596 DIV 1
2013-11-21 12:31
351 查看
250 IncrementAndDoubling
class IncrementAndDoubling { private: int n; int a[55]; bool ok(){ for (int i=0;i<n;i++){ if (a[i]!=0) return false; } return true; } int check(){ int res=0; for (int i=0;i<n;i++){ if (a[i]&1){ res+=1; a[i]-=1; } } return res; } int doubi(){ int res=0; for (int i=0;i<n;i++){ if (a[i]){ a[i]/=2; res=1; } } return res; } public: int getMin(vector <int> desiredArray) { int res=0; n=sz(desiredArray); for (int i=0;i<n;i++) a[i]=desiredArray[i]; while (!ok()){ res+=check(); res+=doubi(); // cerr<<res<<endl; // for (int i=0;i<n;i++) cerr<<a[i]<<" ";cerr<<endl; // cerr<<endl; } return res; } };
相关文章推荐
- Topcoder SRM 596 DIV 1
- TopCoder SRM 596 Div2 第3题
- TopCoder SRM 596 DIV 1 250
- Topcoder SRM 626 DIV2 SumOfPower
- TopCoder SRM 654 Div2 Problem 500 - OneEntrance (思维)
- topcoder srm 585 div1
- topcoder SRM 592 DIV2 LittleElephantAndBooks
- Topcoder SRM 651 div1 250 题解 (概率dp)
- topcoder srm 677 DIV 1 300
- topcoder srm 360 div1
- topcoder srm 711 div1 -3
- TopCoder SRM 602 Div1 第1题
- Topcoder SRM 517 DIV2 1000 CuttingGrass
- topcoder srm 698 div1 -3
- Topcoder SRM 660 DIV1 500 Privateparty(数学,容斥)
- TopCoder SRM 612 DIV1 250 EmoticonsDiv1
- TopCoder SRM 666 Div2 Problem 999 - WalkOverATreeDiv2 (树形DP)
- Topcoder SRM 145 DIV 1
- topcoder srm 679 div1 -3
- [TopCoder] SRM 578 DIV 2, Wolf In Zoo, Solution