摘要：
Problem IFRIENDSThere is a town with N citizens. It is known that some pairs of people are friends. According to the famous saying that The friends o... 阅读全文
摘要：
1stingTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3200Accepted Submission(s): 1230Problem Desc... 阅读全文
摘要：
畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30181Accepted Submission(s): 15847Problem Desc... 阅读全文
摘要：
小希的迷宫Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25598Accepted Submission(s): 7883Problem Desc... 阅读全文
摘要：
How Many TablesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13040Accepted Submission(s): 6368Pr... 阅读全文
摘要：
Farey SequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:11772Accepted:4585DescriptionThe Farey Sequence Fn for any integer n with n >= 2 i... 阅读全文
摘要：
Visible Lattice PointsTime Limit:1000MSMemory Limit:65536KTotal Submissions:5356Accepted:3136DescriptionA lattice point (x,y) in the first quadrant (x... 阅读全文
摘要：
本来不想写的以前写过一次没过现在每次打开ＨＤＵ都会显示没完成看着不爽直接暴力肯定超时其实那数组遍历一次就可以了注意下标变化的条件 1 #include 2 3 using namespace std; 4 5 int main() 6 { 7 int T; 8 cin>>T; ... 阅读全文
摘要：
约会果然是件头疼的问题看起来很简单列了个式子就不知道怎么做了数论题欺负我数学不好Attention：(Ax+b)%C==0有解条件为 b%gcd（A，C）==0;证明在代码里 1 #include 2 #include 3 using namespace std; 4 5 long long ... 阅读全文
摘要：
大水题为了心情好点去写的结果思路很明确过程有点曲折超大数字的计算用字符串来解决换成减法也许会难点 1 #include 2 #include 3 using namespace std; 4 5 int main() 6 { 7 int T; 8 cin>>T; 9 i... 阅读全文