摘要： //看懂题目之后发现很水，最短路，数据小,直接flyod. 1 Source Code 2 3 Problem: 1847 User: eth1 4 Memory: 292K Time: 32MS 5 Language: C++ Result: Accepted 6 Source Code 7 #include <iostream> 8 #include <cstring> 9 #include <algorithm>10 using namespace std;11 #define maxx 100000012 int map[105][105];13 i 阅读全文

摘要： Source CodeProblem: 1745 User: eth1Memory: 280K Time: 360MSLanguage: C++ Result: AcceptedSource Code#include <iostream>#include <cstring>#include <algorithm>using namespace std;int f[10005],flag,n,k;bool ans[2][105];int main(){ int a; cin>>n>>k; for(int i=0;i<n;i++) 阅读全文