Hey, I'm looking for fellow girl coders to practise and learn together. We will be having a telegram group wherein we'll be discussing our approaches after the contest. I believe we rise by lifting others

Unfortunately, due to network issues, we are forced to reschedule the round. Let's do it in the coming days. Apologize.
×

# | User | Rating |
---|---|---|

1 | Benq | 3783 |

2 | jiangly | 3772 |

3 | tourist | 3706 |

4 | maroonrk | 3609 |

5 | Um_nik | 3591 |

6 | fantasy | 3526 |

7 | ko_osaga | 3500 |

8 | inaFSTream | 3477 |

9 | cnnfls_csy | 3427 |

10 | zh0ukangyang | 3423 |

# | User | Contrib. |
---|---|---|

1 | Um_nik | 183 |

2 | awoo | 180 |

3 | nor | 172 |

3 | -is-this-fft- | 172 |

5 | adamant | 170 |

6 | maroonrk | 165 |

7 | antontrygubO_o | 161 |

8 | SecondThread | 159 |

9 | dario2994 | 152 |

9 | kostka | 152 |

**Indian** Youtube channels that post videos on Competitive Programming & Interview Problems?

Can anyone tell me how ratings of problems are calculated after the contest?

Can anyone suggest good problems on GCD to practice as this is my most weak topic I think

Hello Codeforces Community, I'm writing this blog post to share different custom codeforces sites(in a random order) which I came across while using codeforces and are really good in different perspectives and can be used for practice. Thanks to all the creators for these websites.

http://codedigger.tech/practice/general/

http://algoshots.herokuapp.com/

http://rudradesai.in/cfviewer/

https://competitive.herokuapp.com/

Feel free to mention any other websites in the comments. I will update the blog. Cheers !!

Hello everyone, while solving problems the code template I use on codeforces doesn't work on CSES. Can anyone point out what can be done in the template so that it can be used in both places. Here is my template

```
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <unordered_map>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ln cout << endl;
#define vi vector<int>
#define vll vector<long long>
#define sortl(vec) sort(vec.begin(), vec.end());
#define sortr(vec) sort(vec.rbegin(), vec.rend());
#define forn(i, x, n) for(long long i = x; i < n; i++)
#define revn(i, n, x) for(long long i = n; i >= x; i--)
#define in(vec) for(auto &it : vec) cin >> it;
#define out(vec) for(auto &it : vec) cout << it << " "; ln
#define ll long long
#define pb emplace_back
#define mp make_pair
#define um unordered_map
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pi 3.14159265359
#define o(x) cout << x << endl;
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define endl "\n"
#define CLOCK cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
using namespace std;
const ll Nfact = 200005;
const ll mod = 1000000007;
const ll Nsieve = 1000005;
//https://codeforces.com/blog/entry/74640?#comment-587521
vector<bool> is_prime(Nsieve, true);
void sieve() {
is_prime[0] = is_prime[1] = false;
for (ll i = 2; i * i <= Nsieve; i++) {
if (is_prime[i]) {
for (ll j = i * i; j <= Nsieve; j += i)
is_prime[j] = false;
}
}
}
ll bSearch(ll l, ll r, ll x, vll arr) {
while (l <= r) {
ll m = l + (r - l) / 2;
if (arr[m] == x)
return m;
if (arr[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}
//For printing prime factors of a number
void primeFactors(ll n) {
while (n % 2 == 0) {
//cout << 2 << " ";
n = n / 2;
}
for (ll i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
//cout << i << " ";
n = n / i;
}
}
if (n > 2)
cout << n << " ";
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modulo(ll a, ll b) {
ll c = a % b;
return (c < 0) ? c + b : c;
}
//Use these functions below only when modulus is involved
ll mul(ll x, ll y) {
return (x * y) % mod;
}
ll inv(ll x) {
return power(x, mod - 2, mod);
}
ll divide(ll x, ll y)
{
return mul(x, inv(y));
}
ll fact[Nfact];
void precalc() { // Call this once in main()
fact[0] = 1;
for (ll i = 1; i < Nfact; i++)
fact[i] = mul(fact[i - 1], i);
}
ll nCr(ll n, ll k) {
if (n < k)
return 0;
return divide(fact[n], mul(fact[k], fact[n - k]));
}
void solve() {
//[IMPORTANT] Make the indexing 0-based if required.
ll n;
cin >> n;
}
int main() {
// in(vec) works for size-defined type vectors
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input1.txt", "r", stdin);
// for writing output to output.txt
freopen("output1.txt", "w", stdout);
#endif
fastio
ll t;
cin >> t;
while (t--) {
solve();
}
CLOCK
return 0;
}
```

Hello, guys, I need your opinion on which platform is better for practising problems

PLease share your opinions and why do you think so?

`constructive algorithms`

help me in improving my observational skills?

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2023 21:24:49 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|