摘要:
最优化问题 常规动态规划 SOJ1162 I-Keyboard SOJ1685 Chopsticks SOJ1679 Gangsters SOJ2096 Maximum Submatrix SOJ2111 littleken bg SOJ2142 Cow Exhibition SOJ2505 The 阅读全文
摘要:
#include #include using namespace std; int main() { int a,b; label: cin>>a>>b; try { if(b==0)throw runtime_error("重输"); cout<<a/b<<endl; } catch(runtime_error err) ... 阅读全文