给这样一个规模为n的有向图,问从a到b再回到a有多少种最短的走法,方案数%1e9+7
1577: 走路问题
时间限制:1000 ms 内存限制:128 MB提交:6 解决:3
[ 提交][ 状态][ 讨论版]
题目描述
输入
一个数n
1<=n<=1e5
输出
一个数,方案数%1e9+7
样例输入
1
样例输出
1
提示
来源
한국어中文فارسیEnglishไทย
Anything about the Problems, Please Contact Admin:admin
All Copyright Reserved 2010-2024Xidian Programming Contest Online JudgeTEAM
GPL2.02003-2014HUSTOJ ProjectTEAM
Anything about the Problems, Please Contact Admin:admin
All Copyright Reserved 2010-2024Xidian Programming Contest Online JudgeTEAM
GPL2.02003-2014HUSTOJ ProjectTEAM