///'#include ///'///'//n#include ///'///'//n#include ///'///'//n#include ///'///'//nusing namespace std;///n///nstruct disciple {//n int id;//n int power;//n};///n///nvector disciples[100000];//ndouble Z, r;///n///ndouble getPower(int id) {//n if (disciples[id].size() == 0) {//n return Z;//n } else {//n double power = 0;//n for (int i = 0; i < disciples[id].size(); i++) {//n power += getPower(disciples[id][i].id) * disciples[id][i].power;//n }//n return power;//n }//n}//n///nint main() {//n int N;//n cin >> N >> Z >> r;//n r /= 100;//n for (int i = 1; i < N; i++) {//n int K;//n cin >> K;//n if (K == 0) {//n int id;//n double factor;//n cin >> id >> factor;//n disciples[id].push_back({i, factor});//n } else {//n for (int j = 0; j < K; j++) {//n int id;//n cin >> id;//n disciples[i].push_back({id, 1});//n }//n }//n }//n ///n double totalPower = getPower(0);//n cout << fixed << setprecision(0) << totalPower << endl;//n ///n return 0;//n}//n///

C++程序设计:祖师爷武功传承,得道者功力总值计算

原文地址: http://www.cveoy.top/t/topic/pEk6 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录