摘要:
#include<iostream> #include<cstring> #include<algorithm> using namespace std; int n,m; int dp[21][801],path[21][801]; int p[201],d[201],s[201],v[201]; 阅读全文
摘要:
#include<iostream> using namespace std; int d[5][5]; char c[5][5]; int mm = 65536; bool all = false; void change(int i,int j){ d[i][j] = 1-d[i][j]; if 阅读全文
摘要:
#include<iostream> #include<cstring> using namespace std; const int maxn = 105; int n,dp[maxn][maxn],len1,len2; char data1[maxn],data2[maxn]; int val[ 阅读全文
摘要:
#include<iostream> using namespace std; const int maxn = 355; int n,data[maxn][maxn],dp[maxn]; int main(){ cin>>n; for(int i=1;i<=n;i++){ for(int j=1; 阅读全文
摘要:
#include<iostream> using namespace std; const int maxn = 1005; int n,data[maxn],dp[maxn]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin>>n; 阅读全文
摘要:
#include<iostream> #include<cstring> #include<algorithm> using namespace std; const int maxn = 105; const int inf = 0x7f; int a[maxn],p[maxn],r[maxn], 阅读全文
摘要:
#include<iostream> using namespace std; const int maxn = 1005; double data[maxn]; int f[maxn],g[maxn],n,ans; int main(){ ios::sync_with_stdio(false); 阅读全文
摘要:
#include<iostream> #include<cstring> using namespace std; char dict[605][26]; char mes[305]; int dp[305]; int main(){ int W,L; while(cin>>W>>L){ cin>> 阅读全文
摘要:
#include<iostream> #include<cstring> using namespace std; const int maxn = 105; char a[maxn],b[maxn]; int dp[maxn][maxn]; int main(){ while(cin>>a>>b) 阅读全文