### SAeed's blog

By SAeed, 3 years ago,

Hello CodeForces Community!

I would like to invite you all to participate on Tishreen-CPC 2018 contest on GYM. The contest was originally held in Syria, Lattakia for Tishreen University.

Problem Setters and Testers

I hope you will enjoy solving the problems we prepared. Please give your feedback on the problem set in the comments below, after the contest. The contest difficulty should be similar to a Div2 Codeforces round, However I would recommend participating as a team because it is a standard ACM-ICPC contest.

Contest Details:

Time: 19th May 2018 (12:00 hrs) (GMT+3). You can check your local time here.

Contest Length: 5 hours.

Number of Problems: 12 problems.

Good Luck! Hope to see you participating!!

Read more »

• +68

By SAeed, history, 4 years ago,

Hello CodeForces Community!

Gear up this October and accelerate your programming minds for this month's Mega Cook-Off. This is the last mega warm up which will help you win the final race in the upcoming ACM ICPC 2018. So hurry up, note down the details and be there. Joining me on the problem setting panel are:

• Problem Setters and Editorialists: SAeed (Saeed Sryhini) & Mhammad1 (Mohammad Shahhoud)
• Problem Tester: kingofnumbers (Hasan Jaddouh)
• Russian Translator: CherryTree (Sergey Kulik)
• Mandarin Translator: huzecong (Hu Zecong)
• Vietnamese Translator: VNOI Team

Note: Top 25 Indian students will be eligible for ACM ICPC regional travel reimbursement. Each of them shall be reimbursed an amount of upto INR 1500 upon producing the travel bills. For more details visit: https://www.codechef.com/icpc/2018.

I hope you will enjoy solving them. Please give your feedback on the problem set in the comments below, after the contest.

Contest Details:

Time: 22nd October 2017 (2130 hrs) to 23rd October 2017 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Contest link: https://www.codechef.com/COOK87

Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.

Prizes:

• Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://www.codechef.com/laddu. (For those who have not yet got their previous winning, please send an email to winners@codechef.com)

Good Luck! Hope to see you participating!!

Read more »

• +56

By SAeed, history, 4 years ago,

I was solving this problem, but when I tried to submit I got a strange error. The error is: Denial of judgement.

I tried submitting one more time but still got the same error. I opened my submission and saw that the code ran fine until test 38, where it says: verdict: Crashed. Here is a link to my submission.

Can any one help me or suggest something I can do?

UPD : It's fixed now thx.

Read more »

• +15

By SAeed, history, 5 years ago,

Hello everyone !!

I'm making a training contest tomorrow for some people using PC^2. unfortunately there is no internet connection in the place we are going to host the contest in, so I'm hosting the contest locally using PC^2.

Can anyone advise me with a good contest? I need the problems to be interesting for expert/specialist level contestants. I found many contests online, but what I need is a contest with problem statements and input/output files, so I would be able to add them into PC^2.

If anyone could help me with this I would really appreciate it. thanks in advance :D

Read more »

• +11

By SAeed, history, 5 years ago,

Hello everyone !!

I have this implementation for trie tree :

const int MAX_CHAR = 10;
struct trie {
trie* child[MAX_CHAR];
bool isLeaf;

trie() {
memset(child, 0, sizeof(child));
isLeaf = 0;
}

void insert(char *str) {
if(*str == '\0')
isLeaf = 1;
else {
int cur = *str - '0';
if(child[cur] == 0)
child[cur] = new trie();
child[cur]->insert(str+1);
}
}
};


I was wondering, what will happen in case of more than one test case? I know that C++ doesn't support garbage collector.

So, do I need to add the following destructor:

~trie(){
for(int i = 0; i < 10; i++) delete child[i];
}


Or can C++ delete this tree? I know bool isLeaf will be deleted at root node, and so is trie* child[MAX_CHAR];, but I'm not sure about the remaining part of my trie (the part where child array is pointing to).

Or may be there is another way of deleting this trie?

The reason I'm asking is because I'm afraid of MLE with big number of test cases. Can any one help?

Read more »

• 0

By SAeed, history, 5 years ago,

Is it my browser? or is Codeforces having a font size problem? My name in my profile page is weirdly large. When I open a problem, the right part (virtual contest and tags) also has a very large font size, is it a problem because of my browser (I'm using Maxthon)? or is everyone else having the same problem? here's a picture of how I see the problem page:

Read more »

• +68