摘要:
题目链接:http://codeforces.com/problemset/problem/1000/B代码:#include#include#include#include#include#include#include#include#include#includ... 阅读全文
摘要:
https://cn.vjudge.net/contest/245857#problem/C代码: #include#include#include#include#include#include#include#include#include#includeusin... 阅读全文
摘要:
https://cn.vjudge.net/contest/245857#problem/C代码: #include#include#include#include#include#include#include#include#include#includeusin... 阅读全文
摘要:
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 63309 Accepted Submissi... 阅读全文
摘要:
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 63309 Accepted Submissi... 阅读全文
摘要:
欧拉公式的推理和最终表达式:https://dayi.jd100.com/question/2051787/欧拉公式应用:题目:https://cn.vjudge.net/contest/242365#problem/H代码链接 :https://blog.csdn.... 阅读全文
摘要:
欧拉公式的推理和最终表达式:https://dayi.jd100.com/question/2051787/欧拉公式应用:题目:https://cn.vjudge.net/contest/242365#problem/H代码链接 :https://blog.csdn.... 阅读全文
摘要:
题目链接:https://cn.vjudge.net/contest/245287#problem/I代码:使用普通的队列和优先队列相比,优先队列能更快地找到目的变量。#include#include#include#include#include#include#i... 阅读全文
摘要:
题目链接:https://cn.vjudge.net/contest/245287#problem/I代码:使用普通的队列和优先队列相比,优先队列能更快地找到目的变量。#include#include#include#include#include#include#i... 阅读全文
摘要:
题目链接:https://cn.vjudge.net/contest/66569#problem/H题目大意: n代表母牛的个数,m代表给定的信息的组数。每一组数包括a,b. 代表b崇拜a(突然发现可以用tarjan算法做)。然后问你最终有多少母牛的地位是确定的。代码... 阅读全文