王小二的博客

Roads in the NorthTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2933 Accepted: 1442DescriptionBuilding and maintaining roads among communities in th

点击打开题目 1094 - Farthest Nodes in a Tree PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Given a tree (a connected graph with no cycles), you have to find the farthe

点击打开题目1094 - Farthest Nodes in a Tree   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGiven a tree (a connected graph

LabyrinthTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 4184 Accepted: 1564DescriptionThe northern part of the Pyramid contains a very large and

GodfatherTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7728 Accepted: 2741DescriptionLast years Chicago was full of gangster fights and strang

Problem Description 　　N planets are connected by M bidirectional channels that allow instant transportation. It’s always possible to travel between any two planets through these channels. 　　If we ca...

A:切题太少，不知道性质，本想拿着矩阵快速幂板子套着大数改改。。。 #include <bits/stdc++.h>using namespace std;string s;int main(){ cin >> s; if((s[s.length() - 1] - '0') & 1) printf("-1\n"); els