Comments
0

I need a O(n*n) solution C++ code for div2 E, the Editotrial is not very clear to me QAQ......
0

it is rated, as the anouncement said.
0

the statement of D was ambiguous, I used nearly 20mins to comprehend how to calculate the fall damage
0

It usually takes 1 day or longer to apply rating modification, the longest dely I have ever seen is almost 1 week, since a large number of contestants cheated with AI in that round.
0

Other than cf I practice on Atcoder, and some Chinese local sites, just because they are Chinese so I neednt do translation, such as https://ac.nowcoder.com/ and https://www.luogu.com.cn/
0

Most of the time I spent on cf is for its contests, but the awkward thing is that in fact I seldom redo the problems that I was unable to solve during the contests. I do most of my practice on some other sites

0

reach 1600 from 1200 in 3 months? That is a long tour. Look into my profile and you will find that I stucked in green and gray name for a pretty long time. I think the only way to improve your rating is to practice. you need not stuck on thouse tough problems that may be too hard for you now, you may try some easier problems such as greedy strategy or consruct problems which usually appear as div2 A,B and C. If you can stably solve 3 problems of div2 in about 30mins, reaching 1600 is just a matter of time.
0

thank you!
+3

Auto comment: topic has been updated by Danpyu (previous revision, new revision, compare).
0

thanks!!!!!!
0

as far as I know, it`s cant be called "fast", just average level. About tips, I think you need to practice and learn hard if you want to make achievement.
0

That`s great if they are removing cheaters.
0

By an IE plug-in named Carrot, which predicts your performance rating and possible rating changes in real time, a very helpful one.

0

I come from a rural town,little people there knows OI or CP or anything like them, I didnt even heard about those things until I went to college
0

That is just what I want, even it may be somehow crazy for me now, and also best wishes to you my friend!
0

By solving easy problems pretty fast...... For example, I solved A,B,C of last edu round in 30 mins, which makes my performance rating came to 1900+ at that moment.Then I solved D 40 mins after, and my perfomance rating ended up at 1860 when the contest ended.
0

I m in university, freshman now but will soon become sophomore. I like solving arithmetic problems and I sometimes even regret for not knowing IOI or ACM when I was younger.

0

Thank you very much. This contest is my finnal chance to accomplish my goal of becoming expert from 0 in a school year, it means a lot to me.By the way, what is my level among all players if I do become expert in 1 year? I want to get at least 1 ICPC regional prize before my retirement.
0

I just really really need that 51 rating ......
-19

very very very depressed, cause the announcement said it is rated for div2, and there is no notification saying it will be unrated. QAQ
-18

why the contest is unrated? why? I expected to become blue, but it is unrated!
On Aryanwastaken → WHAT WAS THAT CONTEST, 11 months ago
0

Hard to say. I noticed Idian orgnizors at first and had a bad feeling at first, then I saw A which is easy but full of if-else conditions, so i went to solve B, but it is appearantly much harder than normal div2 B. So I immediately quited. The finnal standing shows I was right. I have suspected those Idians deliberately wrote abnormal problems and leaked them from the very begining so as to make other Indian cheaters exceed normal contestants.

0

can no more agree with that
On Aryanwastaken → WHAT WAS THAT CONTEST, 11 months ago
0

last div2. It`s almost a disaster
0

Auto comment: topic has been updated by Danpyu (previous revision, new revision, compare).
0

Auto comment: topic has been updated by Danpyu (previous revision, new revision, compare).
0 
1 2 3 4
√ √ √ √
  × ×
× √ √ ×

In this structure, at least one is correct.
-8

What the hell? You dont even want to give us solution codes?

0

I used dijkstra too
0

it`s for C， not B
0

O(1) complexity solution for C：

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long

void solve() {
    ll n;
    cin >> n;
    cout<<(ll)sqrt((long double)n/4) + (ll)sqrt((long double)n/2)<<endl;
}


int main() {
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
0

It`s ez if u get the point, in fact the problem has nearly nothing to do with GCD
0

it is too hard,harder than all div 2 I have participate in. perhaps I am not qualified to these div2s