Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.
  1. Admin area
  2. Problems
  3. PAD
  1. Status
  2. Ranking

Problem hidden

NAJPFC - PAD

no tags 

 a

Jarin has got a new task. She has to connect towers by wire.

Given

  1. Number of towers N (2<=N<=1000)

Added by:Najmuzzaman
Date:2014-10-26
Time limit:0.5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.