### RPMCPP's blog

By RPMCPP, history, 2 months ago, Has anyone realized that Codeforces is reaching 200M submissions in the problem set? It will be a big day when this happens! Good luck getting the 200Mth submission! That person will go down in history! Comments (5)
 » 2 months ago, # | ← Rev. 2 →   Let's hope the 200 millionth submission is Accepted :)
 » 2 months ago, # | ← Rev. 2 →   I think that it will reach 200M submissions a few hours later.
•  » » Near a day later, it has not reached yet...
 » So I just woke up and look at that! 200M submissions!
 » 2 months ago, # | ← Rev. 5 →   Congratulations to nightcrawler0112 for having the 200M submission! Here is his/her code: Submission 200M#include using namespace std; // shortcuts #define M 1000000007 #define endl "\n" #define ll long long // functions ll power(ll a , ll b) { ll res = 1; while(b) { if(b%2 == 0) { a = (a*a)%M; b/=2; } else { res = (res*a)%M; b-=1; } } return res; } ll inv(ll a , ll mod) { ll ans = power(a , mod-2); return ans; } int bit_count(ll n) { int cnt = 0; while (n) {cnt++; n /= 2;} return cnt; } bool is_prime(ll n) { if(n <= 1) return false; for(ll i = 2;i*i<=n;i++) if((n%i) == 0) return false; return true; } void seive_func(vector vt , ll n) { vt = false , vt = false; for(ll i = 2;i*i<=n;i++) { if(vt[i]) { for(ll j = i*i;j<=n;j+=i) {vt[j] = false;} } } } void bfs(vector> &adj , ll src , ll n) { queue q; bool visited[n+1] = {false}; visited[src] = true; cout << src << " "; q.push(src); while(q.empty() == false) { ll p = q.front(); q.pop(); for(auto &i : adj[p]) { if(visited[i] == false) { q.push(i); cout << i << " "; visited[i] = true; } } } } // void dfs(vector> &adj , ll source) // { // if(visited[source] == true) return; // cout << source << " "; // visited[source] = true; // for(auto &i : adj[source]) // { // if(visited[i] == false) dfs(adj, i); // } // } // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ void solve() { ll n,c,d; cin>>n>>c>>d; vector v(n); for(int i=0;i>v[i]; sort(v.begin(),v.end()); ll k=1,x=0; ll ans=INT_MAX; if(v!=1) ans= n*c+d; for(int i=0;ik){ ll j=(v[i]-k)*d; x+=j; k=v[i--]; } else x+=c; } cout<> t; while (t--) { solve(); } return 0; } Unfortunately, it did not get accepted :( Ah well.You can check out the problem here: 1810C - Make It PermutationHere is the link to the submission: 200000000