Блог пользователя jerseyguy

Автор jerseyguy, история, 23 месяца назад, По-английски

problem statement :
given n students and m colleges
each student has a list of preferred colleges in which they want to take admission.
each college has a certain capacity to take students
assuming any college will accept any student
find a mapping such that max number of students can get admission and return max number of seats that can be occupied.

note: constraints were not given and students will take admission if they get a seat in their preferred college

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

»
23 месяца назад, # |
  Проголосовать: нравится +9 Проголосовать: не нравится

You should read about flow algorithms.