/* Author: Gaurav Agrawal [CHALLENGE Snowball (Ponzi)-System] Given a community with 1000 members. Member 1 is level 0 and chooses two random members let's say 2 and 3. They are level 1 and each one chooses 2 further random members for level 3. 1. Each chosen member pays 1 pence to the one member two levels above( level 0 and level 1 don't pay) 2. No member plays more than 1 time 3. Each member x tries to choose 2 further member. If a chosen member already played, x tries again, but maximum 3 tries to get 2 further member. 4. All member are honest and pay. Simulate this game and show the total gain/loss of each member. Modified to show winners, and not so lucky members. Link to challenge: https://www.sololearn.com/post/796134/?ref=app */ #include using namespace std; int N=1000; vector gr[1002]; map ans; bool vis[1002]; int getRandom(){ return 1+rand()%N; } void bfs(int st){ queue q; vis[st]=true; q.push(st); while(!q.empty()){ int u=q.front(); q.pop(); int found=0; for(int i=0;i<3;i++){ if(found==2) break; int v=getRandom(); if(!vis[v]){ found++; vis[v]=true; q.push(v); gr[u].push_back(v); } } } } void dfs(int u){ ans[u]=0; for(int v:gr[u]) if(v) ans[u]+=gr[v].size(), dfs(v); } int main(){ srand(time(0)); bfs(1); dfs(1); int min=9999, max=-1; vector winners, loosers; for(auto u:ans){ if(u.second>max) max=u.second; if(u.second

Snowball (ponzi) - System