摘要：The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:16068Accepted:5566DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, s 阅读全文

摘要：NetworkTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have acc 阅读全文

摘要：SwordfishTime Limit: 2 Seconds Memory Limit: 65536 KB There exists a world within our worldA world beneath what we call cyberspace.A world protected by firewalls,passwords and the most advancedsecurity systems.In this world we hideour deepest secrets,our most incriminating information,and of course, 阅读全文

摘要：E - Number With The Given Amount Of DivisorsCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPractice CodeForces 27E DescriptionGiven the number n, find the smallest positive integer which has exactlyn divisors. It is guaranteed 阅读全文

摘要：NTATime Limit: 2 Seconds Memory Limit: 65536 KB The NTA (Non-deterministic Tree Automata) is a kind of tree structure device. The device is built in a set of operating rules. With these rules the device can produce several signals, which will form a signal system. In such a system, one signal is the 阅读全文

摘要：Agri-NetRuss Cox Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farm 阅读全文