It is true. Have a nice day! Happy New Year.
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
It is true. Have a nice day! Happy New Year.
My answer: I'll take with me 25 pages of motivational quotes and songs in my codebook xD
(IDK if rotavirus is a college student or not, but I wanna know her answer)
I think the fact that people can just make a new account anytime they want and start posting or commenting makes it very "easy" to spam. I've had that opinion since quite sometime but didn't say anything but today something happened which makes me think that this is of extreme importance.
Commenting from a new unrated account is like saying stuff without consequences : When you've given a few contests and spent some time on your account then you have an identity. Making a new fake account is equivalent to wearing a mask.
Take for example today's incident-
So there's this blog on codeforces "Code For Athoy — Contest for Saving a Life". It's basically a contest announcement as well as a person asking for donations for a cancer patient.
Now on that thread I see an absolutely insensitive jerk, just look at the audacity of this person. Here's his comment
While banning unrated people won't end spamming completely it'd definitely reduce it, plus I don't think it'll be hard to implement. There's no reason for not banning them, after all, unless you haven't been a part of any rated contest, you're not really a part of the community anyway. I believe this one step would go a long way in reducing spam posts and comments to a great degree.
Earlier today I was writing a dynamic segment tree for the problem 915-E
My solution gave Memory Limit Exceeded
Verdict. Then I made a small change in my code, surprisingly it got accepted.
node* create()
{
node *tmp=new node;
// Some more lines to initialize the variables
return tmp;
}
node ns[15000000];
int cnt=0;
node* create()
{
node *tmp=&ns[cnt++];
// Some more lines to initialize the variables
return tmp;
}
I was very confused I had no idea why it worked. I even added the assertion assert(cnt < 15000000)
and it still passed. I do not understand why my second solution is consuming less memory. It probably has something to do with how dynamic memory allocation works. Can anyone explain?
Here is the full code:
Name |
---|