My orders
How it works
Examples
Reviews
Blog
Homework Answers
Submit
Sign in
How it works
Examples
Reviews
Homework answers
Blog
Contact us
Submit
Fill in the order form to get the price
Subject
Select Subject
Programming & Computer Science
Math
Engineering
Economics
Physics
Other
Category
C++
Software Engineering
Java | JSP | JSF
Databases | SQL | Oracle | MS Access
C
Python
Excel
C#
Visual Basic
Computer Networks
Functional Programming
Android
Assembler
UNIX/Linux Programming
ASP | ASP.NET
MatLAB
Wolfram Mathematica
MathCAD
Maple
Perl
Action Script | Flash | Flex | ColdFusion
Ruby | Ruby on Rails
Prolog
Objective-C | Swift
Algorithms
Web Development
HTML/JavaScript Web Application
NodeJS Web Application
Other
Deadline
Timezone:
Title
*
Task
*
{"ops":[{"attributes":{"bold":true},"insert":"Rotten Oranges"},{"insert":"\nTime Limit:\u00a02\u00a0sec\nMemory Limit:\u00a0128000\u00a0kB\nProblem Statement\nGiven a matrix of dimension n*m where each cell in the matrix can have values 0, 1 or 2 which has the following meaning:\n\n0: Empty cell\n1: Cells have fresh oranges\n2: Cells have rotten oranges\n\nSo we have to determine what is the minimum time in sec required so that all the oranges become rotten. A rotten orange at index [i,j] can rot other fresh orange at indexes [i-1,j], [i+1,j], [i,j-1], [i,j+1] (up, down, left and right) in 1 sec. If it is impossible to rot every orange then simply print -1.\nInput\nFirst line of input has two integers n & m .\nThen n lines follows having m space seperated integers which can be 0,1 or 2.\n\n"}]}
I need basic explanations
Special Requirements
Upload files (if required)
Drop files here to upload
Add files...
Account info
Already have an account?
Create an account
Name
*
E-mail
*
Password
*
The password must be at least 6 characters.
I agree with
terms & conditions
Create account & Place an order
Please fix the following input errors:
dummy
