Ferrarixxx's blog

By Ferrarixxx, history, 4 years ago, In English

Sorry to Disturb you but this time i have no idea where i am wrong

My Code : Approach Same as that of Editorial

Problem Link : Problem E Omkar and Duck

Editorial Link

It shows some error that i can't understand and moreover i can't debug this since i don't know the path the tester program has chosen.
So Please Help me out here.

Hoping for a Prompt Reply. :)

Full text and comments »

  • Vote: I like it
  • +13
  • Vote: I do not like it

By Ferrarixxx, history, 4 years ago, In English

Hi, Thanks for opening this Link :)

Here's the Problem Link: Problem D Link
My Submission Link: Please Click Me

I have Commented my logic which is almost same as that of editorial Very simple

Thanks For Reading

Hoping for a Prompt Reply.

Full text and comments »

  • Vote: I like it
  • -16
  • Vote: I do not like it

By Ferrarixxx, history, 4 years ago, In English

Hi, Thanks for opening this Link :)

Heres the Problem Link: Problem D Link
My Submission Link: Please Click Me

I have Commented my logic which is same as that of editorial Very simple

Thanks For Reading

Hoping for a Prompt Reply.

Full text and comments »

  • Vote: I like it
  • +5
  • Vote: I do not like it

By Ferrarixxx, history, 4 years ago, In English

Internship Online Round Problem

Given an Array of n elements s.t sum of (i)th and (n-i)th element is same for all i. (considering 1 indexed here).Then one element was removed from this array.

Now you are presented with n-1 elements and you need to find that missing element.
How will you do it?? (range of N is -> 10^5)

(Please give code as well if u can) :)

Thanks in Advance :)

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By Ferrarixxx, history, 4 years ago, In English

Hi Codeforces Community,

I don't know for what testcase my code fails, Please Help me
Code Link : Code
Problem Link: Problem B2

In below simple problem's code, I am not able to understand what mistake i have made in my code
Code Link : Code
Problem Link : Problem C

Thanks In Advance

Full text and comments »

  • Vote: I like it
  • -20
  • Vote: I do not like it

By Ferrarixxx, history, 5 years ago, In English

Hi guys ,
I think the editorial's solution (https://mirror.codeforces.com/blog/entry/78864)
for this (https://mirror.codeforces.com/contest/1367/problem/D) problem is wrong

Proof:
Try this test case :
1
cbazzkjbsdf
3
3 1 0

For the above testcase actual output should have been abc
but according to almost all codes(including editorialist's) its ksz

So am i correct ?? or have i made a mistake in understanding the problem??

I resort to your generous replies.

Thanks in Advance.

Full text and comments »

  • Vote: I like it
  • -9
  • Vote: I do not like it

By Ferrarixxx, history, 5 years ago, In English

Hi Guys,
The above picture shows my approach for this problem https://mirror.codeforces.com/contest/1354/problem/C1

Am basically using the interior angle subtended by 3 adjacent vertices and then to find the vertical ( perpendicular ) line's length using tan function
But am getting completely unexpected answer.

// -- MY CODE :


long double n;

cin >> n;

// long double angle = (((180 * (2*n — 2)) / (2*n) ) / 360) * 2 * 3.14

long double angle = ((((n — 1)) / n)) * 3.14;

cout << tan(angle) << endl;


PLEASE GUYS HELP ME FIND MY MISTAKE .
THANKS IN ADVANCE.

Full text and comments »

  • Vote: I like it
  • +6
  • Vote: I do not like it

By Ferrarixxx, history, 5 years ago, In English

Hi Guys,
I hope u are doing well

Actually
I cant understand why my code gives WA on 47 testcase
Even when my code is almost similar to the editorialist's code,

The testcase :
29 425 46 81
405 237 24 45 165 328 134 309 7 236 348 204 368 396 298 343 180 186 395 246 44 53 303 404 271 344 269 292 12

Actual answer : 2
Mycode's output : 1

Problem E Div 3 : https://mirror.codeforces.com/contest/1324/problem/E

My code Link : https://mirror.codeforces.com/contest/1324/submission/80940535

Editorial Link : https://mirror.codeforces.com/blog/entry/74714

Please give it a try.
Thanks in Advance.

Full text and comments »

  • Vote: I like it
  • -7
  • Vote: I do not like it

By Ferrarixxx, history, 5 years ago, In English

Hi Am writing this because am highly desperate to find my mistake.

Please help me find mistake in my approach which is same as that of editorial
except that i used map and priority_queue
For Problem C ( https://mirror.codeforces.com/contest/1350/problem/C )

Am getting WA on test case — 4
https://mirror.codeforces.com/contest/1350/submission/80297500

I HAVE COMMENTED MY APPROACH IN MY CODE , WRT ALL THE STEPS
PLEASE HAVE A LOOK

THANKS IN ADVANCE.

Editorial Link : https://mirror.codeforces.com/blog/entry/77284

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By Ferrarixxx, history, 5 years ago, In English

Question Link: https://mirror.codeforces.com/contest/1330/problem/B

My Solution Link: https://mirror.codeforces.com/contest/1330/submission/79321519

Applied Simple binary search and 2 pointer method to find ans and am getting right ans for the sample test cases I dont know where the flaw is in my code that it gives Wrong output for the extreme corner test case -> Test Case 3

I have commented my code , its very easy to understand ,

Please find my flaw in my code or approach.

Thanks in Advance.

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By Ferrarixxx, history, 5 years ago, In English

My Soln : https://mirror.codeforces.com/contest/1141/submission/73647747

Submissions Page : https://mirror.codeforces.com/contest/1141/status/E

Problem Link: https://mirror.codeforces.com/contest/1141/problem/E

I got this error ->" wrong output format Unexpected end of file — token expected " My Program/Code outputs the correct answer then why is this error coming.

Please see for urself that my output is correct , Please compare it with any other previously submitted code from the submissions page and check the correct output of 56th test case

Thanks in Advance .

Full text and comments »

  • Vote: I like it
  • +1
  • Vote: I do not like it