quant developer dave

#includeusing namespace std; long long length[51];void precalc(){length[0] = 1;for(int i = 1; i=length[generations])skip -= length[generations];else if(dragonCurve[i] == 'X'){return expand(X, generations-1, skip);}else if(dragonCurve[i] =='Y'){return expand(Y, generations-1,skip);}}else if(skip>0)--skip;elsereturn dragonCurve[i];} return '#';} int main(){string t;int C, a,b,c;cin>>C;precalc();wh..

미완성 #includeusing namespace std; int C,n,d,p;int g[51][51];int dp[101][101];double degree[101];int gogo(int here, int days){if(days == d){if(here==p)return 1;else return 0;} int &ret = dp[here][days];if(ret > -0.5) return ret; double ans = 0;for(int i = 0 ; i>C;while(C--){cin>>n>>d>>p;for(int i=0; ig[i][j];if(g[i][j]==1){degree[i]++;degree[j]++;}}}double v = -1.0;memset(dp,v,sizeof(dp)); } }

#includeusing namespace std; long long d[101][101]; int dp(int n, int first){if(n==first)return 1;if(nC;memset(d,-1,sizeof(d));while(C--){cin>>n;long long ans = 0;for(int first = 1; first

#include #include #include using namespace std; int n,m;int C;bool areFriends[10][10],taken[10]; int countPairings(bool taken[10]){int firstFree = -1; for(int i=0; i>C;while(C--){memset(areFriends, false, sizeof(areFriends));cin>>n>>m;int f1,f2;for(int i=0; i>f1>>f2;areFriends[f1][f2] = true;areFriends[f2][f1] = true;}cout

#include #include using namespace std; void printPicked(const vector &picked){for(auto i = picked.begin(); i!=picked.end(); i++){cout

#include #include #include using namespace std; int color[220][220][220];int arr[30];const int C = 30;int sum;class node{public:int arr[3];int index;node(int a, int b, int c, int d){arr[0] = a; arr[1]=b;arr[2]=c;index=d;} bool operator rv) return true;else return false;}}; //bfsvoid seek(){queue q;q.push(node(0,0,0,0)); while(!q.empty()){node now = q.front();q.pop();if(now.index == C){cout