"I want to ask a question" - Ask them all here!

meta
,
203

It depends on what you are trying to do, so missing details doesn’t help.

Also this seems to be a problem from the June17 Long challenge, so it’s good that you missed the details and keep it that way :slight_smile:

204

As the problems were submitted on the behalf of your team, and not as you.
It won’t be added to your “recent activity”.

205

Thanks divyansh for helping him out :slight_smile:

206

Always happy to help :slight_smile:

1 Like
207

Ask this at comment section of problem. If its not violating rules, problem setter oughts to reply. Admin says that problem shouldnt be discussed on discuss while contest is live…

208

The editorials for snackdown should be available soon. If they dont come up after 24 hours from now, i will upgrade it into a question :slight_smile:

209

@ani_1107

No it is not allowed as it is an ongoing contest.

210

Discussing of problems of a live contests are against the rules. So, Nope :frowning:

211

This seems more like a feedback. Minor glitches during contest arent uncommon. Nevertheless, its upgraded to a question to allow anyone else with similar issue vent out his grievance there (which will strengthen your point).

212

Please provide the exact link to the question.

213

Its best if you move this to the question related to snackdown editorial.

214

Probably because when they made the mirror, everyone was able to see the solutions and some people used it for cheating, so they denied access and forgot to revoke that. And true :frowning: editorials are taking long. There is a post regarding that issue already here: Pleases upload Snackdown Elimination Round Editorials! - general - CodeChef Discuss

1 Like
215

If you have a specific problem you want solution of, you can request the fellow members of discuss to help you.

216

Firstly, dont spam discuss by asking same thing multiple times. Then, N varies from 1-10^9. For 10^9, you will exhaust the maximum recursion depth and hence get a SIGSEV. Your function has a limit upto which it can undergo recursion.

217

sorry for asking multiple times.what changes i have to do in my code?can u please tell me?

218

The changes are simple. First thing is, that the function repeats after every 6th number. Meaning-

F(1)=F(7), F(2)=F(8) and so on...

All you have to do is to compute the first 6 values of function (do some maths on paper!). Then, do N%6 and arr[N%6-1] is the answer. (To understand this, i repeat, DO it on paper, find out values of F(1), F(2)…F(8) in terms of A and B, and then it will make perfect sense!)

219

Thanks @vijju.:slight_smile:

220

In case you get stuck on implementation, you can view my code here-

https://www.codechef.com/viewsolution/13783648

221

Please give a link to the question, as well as your solution. Because without seeing your code, its not possible to pin-point the exact reason behind the error.

222

Hi,

Thanks for the reply. I would want to rectify the error myself at least till I give up… :slight_smile:

I am more keen in understanding, where in this website can I find the output the code is generating? I am just seeing a NZEC in the MySubmissions page; but not clear of what exception the code is throwing.

Regards,
Lalitha