Comments - Codeforces

→ Pay attention

Before contest
Educational Codeforces Round 195 (Rated for Div. 2)
17:24:24
Register now »

→ Streams

By aryanc403

Before stream 19:34:23

View all →

→ Top rated

#	User	Rating
1	Benq	3676
2	jiangly	3670
3	Kevin114514	3657
4	maroonrk	3355
5	Um_nik	3353
6	squareOf105	3346
7	tourist	3343
8	strapple	3324
9	heuristica	3322
10	jiangbowen	3291

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	Qingyu	158
2	nik_exists	150
2	maspy	150
4	AmShZ	143
5	Um_nik	141
6	Errichto	139
7	adamant	137
8	BledDest	133
8	maroonrk	133
10	qwexd	130

View all →

→ Find user

→ Recent actions

Detailed →

Comments

mega_bot

On makrav → Codeforces Round 1111 (Div. 2) Editorial, 3 months ago

I will add to the intuition of why in the first place pick p, which is highest power of 2 less than or equal to k

think in terms of msb's, suppose you have some element which needs to be moved out of its msb position to some lower msb position(to be sorted), then analyze this situation and see what must be the lower bound of k, you will find out the power of 2.

mega_bot

On AmirrzwM → Codeforces Global Round 31, 10 months ago

edge case
1
28 2
ans 15 19 
(xor 28 sum 34)

for k = even case

0,n,n,n.. (our initial intuitive solution, which is wrong)

claim:instead of removing set bits from one n its optimal to remove from multiple different n's

in general when bit is 0 in n that means we could use 1's in their position(as xor of them is still 0, as our solution looks like ,,n,n,,) but that could increase the current ai value greater than n if we add more 1's .

so in our first solution

we say 0 n n n instead of removing all bits from first position, we can distribute the 1's removal from different n's, so that the value of n decreases, hence we can use our claim, here to add those extra 1's

implementation is tricky, which i couldn't :(

mega_bot

On Little_Sheep_Yawn → Codeforces Round 1057 (Div. 2), 12 months ago

Little_Sheep_Yawn orz

mega_bot

On wuhudsm → [Plan] Rewrite of Some Editorial, 21 month(s) ago

D. Gifts Order
E. Kevin and And
Can you rewrite for these two problems?
Thanks in advance!

mega_bot

On majju → How to use a user snippet in geany, 2 years ago

Method which worked for me

1.copy paste your code here and copy the output without the quotes

2.type sudo gedit /usr/share/geany/snippets.conf (or you can go to snippets.conf from the tools menu in geany)

3.under the language section which you want to change

4.aliasname=paste the op which you have copied and save it

5.open geany ,in tools -> reload configuration

6.you are done just type aliasname and then press tab, your snippet is pasted.

print(repr("""
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
"""))

Like in the above case under c++ section in that conf file ,i would do as customhash=the op you copied

mega_bot

On mesanu → Codeforces Round 944 (Div. 4) Editorial, 2 years ago

For someone who need a small hack test case for E

Test case

answer is 29, you might get 28 due to precision errors.

mega_bot

On physical23 → Weird code, 3 years ago

I asked it to replace the defines in the code itself.

Spoiler

#include <bits/stdc++.h> 
using namespace std;

// Replace #define int long long with int long long 
// Replace #define endl '\n' with endl '\n'
// Replace #define MOD (int)(1e9+7) with const int MOD = (int)(1e9+7);
// Replace #define vint(x) vector<int> x with typedef vector<int> vint;
// Replace #define deci(x) int x;cin>>x; with int x; cin >> x;
// Replace #define decstr(x) string x;cin>>x; with string x; cin >> x;
// Replace #define cinarr(x) for (auto &it : x) cin>>it; with for (auto &it : x) cin >> it;
// Replace #define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl; with for (auto &it : x) cout << it << " "; cout << endl;
// Replace #define sortarr(x) sort(x.begin(),x.end()) with sort(x.begin(),x.end());
// Replace #define sortrarr(x) sort(x.rbegin(),x.rend()) with sort(x.rbegin(),x.rend());
// Replace #define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); with ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int MOD = (int)(1e9+7);
typedef vector<int> vint;

int main() {
    ios::sync_with_stdio(0); 
    cin.tie(0); 
    cout.tie(0); 

    int n, m;
    cin >> n >> m;
    vector<vector<int>> arr(n, vector<int>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> arr[i][j];
        }
    }

    vector<vector<int>> dp(n, vector<int>(1LL<<n, INT_MIN));
    dp[0][1] = 0;
    for (int mask = 0; mask < (1LL<<n); ++mask) {
        for (int node = 0; node < n; ++node) {
            if (dp[node][mask] != INT_MIN) {
                for (int i = 0; i < n; ++i) {
                    if (!(mask&(1LL<<i))) {
                        dp[i][mask|(1LL<<i)] = max(dp[i][mask|(1LL<<i)], min(dp[node][mask], arr[node][i]));
                    }
                }
            }
        }
    }

    cout << dp[n-1][(1LL<<(n-1))] << endl;

    return 0;
}

mega_bot

On physical23 → Weird code, 3 years ago

Click me

mega_bot

On wuhudsm → Codeforces Round 930 (Div. 1, Div. 2) Editorial, 3 years ago

+10

If you go right, you always have the chance to go down.There by you can have minimum among those both

mega_bot

On pashka → Editorial for Codeforces Round 920 (Div. 3), 3 years ago

In problem c, doesn't the phone lose charge at 0 moment and also will the phone lose charge after it sends a message or before?

could someone explain?

mega_bot

On stefdasca → Click here if you want to know your future CF rating [Part 2], 3 years ago

mega_bot

On Vladosiya → Codeforces Round 913 (Div. 3) Editorial, 3 years ago

Does anyone have a formal proof for this?

mega_bot

On awoo → Educational Codeforces Round 159 Editorial, 3 years ago

For Problem D

How Δi,j is found over there in editorial? Is there a simpler way?

I did this in the below given way

Found the pattern of how reversing changes the path(about what lines the pattern is reflected) and accordingly what distance each point is moving with respect to reflections, there by finding the Δi,j.

mega_bot

On Theo830 → Codeforces Round #912 (Div. 2) Editorial, 3 years ago

Thanks for the comment

mega_bot

On NemanjaSo2005 → Codeforces Round 911 (Div. 2) Editorial, 3 years ago

Thanks for mentioning,i was not able to understand why i got tle on pretest 5.

Spoiler

mega_bot

On cry → Codeforces Round 887 (Div 1, Div 2) Tutorial, 3 years ago

I found a interesting solution for problem B in O(number of fibonacci numbers under n)

        vector<double>fib(35);
        fib[1]=1;
        for(int i = 2;i < 32;i++){
	  fib[i]=fib[i-1]+fib[i-2];
        }
	int n,k;
	cin >> n >> k;
	if(k>30)cout << 0 << nl;
	else{
	    if(k%2==0){
		cout << floor((fib[k-1]*n)/fib[k])-ceil(((fib[k-2]*n)/fib[k-1]))+1 << nl;
	    }
            else{
		cout << floor(((fib[k-2]*n)/fib[k-1]))-ceil((fib[k-1]*n)/fib[k])+1 << nl;
	    }
	}

mega_bot

On awoo → Educational Codeforces Round 153 Editorial, 3 years ago

Can anyone explain the problem D solution?

mega_bot

On GerrySup22 → Geany Snippets Conf, 3 years ago

https://github.com/geany/geany/issues/2481 Checkout this link,for further solution

mega_bot

On MikeMirzayanov → Codeforces Round #218 (Div. 2): Tutorial, 4 years ago

-6

‎ nice contest

The only programming contests Web 2.0 platform

Server time: Oct/14/2026 00:10:37 (f1).

Desktop version, switch to mobile version.

Supported by