13307130498_Li Huiying_Assignment10

13307130498/assignment10/Decode the tree.cpp

@@ -0,0 +1,74 @@
+#include<iostream>
+#include<cstdio>
+#include<string>
+#include<string.h>
+using namespace std;
+
+struct node{
+    int fa,de;
+    int n;
+    int a[400];
+}nodes[400];
+int m,k,a[400];
+int ord[400],sum;
+bool f[400];
+string s,num;
+
+void dfs(int x){
+    printf("(%d",x);
+    for(int i=0;i<nodes[x].n;i++){
+        printf(" ");
+        dfs(nodes[x].a[i]);
+    }
+    printf(")");
+}
+
+int main(){
+    while(getline(cin,s))
+    if(s=="") printf("(1)\n");
+    else{
+        m=sum=0;
+        memset(a,0,sizeof(a));
+        memset(nodes,0,sizeof(nodes));
+        memset(f,1,sizeof(f));
+        for(int i=0;i<s.size();i++)
+        if(s[i]>='0'&&s[i]<='9'&&f[i]){
+            num="";
+            int j=i;
+            while(s[j]>='0'&&s[j]<='9'){
+                f[j]=0;
+                num+=s[j++];
+            }
+            k=0;
+            for(int j=0;j<=num.size()-1;j++){
+                k = k*10 + (num[j]-'0');
+            }
+            a[k]++;
+            ord[sum++]=k;
+            if(m<k) m=k;
+        }
+        memset(f,1,sizeof(f));
+        for(int i=0;i<sum;i++){
+            for(int j=1;j<=m;j++){
+                if(a[j]==0&&f[j]){
+                    k=j;
+                    f[j]=0;
+                    break;
+                }
+            }
+            nodes[k].fa=ord[i];
+            nodes[k].de=1;
+            a[ord[i]]--;
+            nodes[ord[i]].a[nodes[ord[i]].n++]=k;
+        }
+        for(int i=1;i<=m;i++){
+            if(nodes[i].de==0){
+                k=i;
+                break;
+            }
+        }
+        dfs(k);
+        printf("\n");
+    }
+    return 0;
+}

13307130498/assignment10/Distinct Sub-matrix.cpp

@@ -0,0 +1,36 @@
+#include<iostream>
+#include<cstdio>
+#include<set>
+#include<string>
+
+using namespace std;
+
+int main(void){
+    int t, n ,m;
+    cin>>t;
+    for(int cnt = 1;cnt <= t; cnt++){
+        set<long long> mat;
+        cin>>n>>m;
+        string *l = new string[n];
+        long long li[m], c;
+        int i,j,k,p,q;
+        for(i=0;i<n;i++)
+            cin>>l[i];
+        for(i=0;i<n;i++){
+            for(j=0;j<m;j++){
+                for(p=j;p<m;p++)
+                    li[p]=0;
+                for(k=i;k<n;k++){
+                    c = 0;
+                    for(q=j;q<m;q++){
+                        li[q]=(li[q]<<2)+l[k][q];
+                        c = (c<<4)+li[q]*li[q];
+                        mat.insert(c);
+                    }
+                }
+            }
+        }
+        cout<<"Case #"<<cnt<<": "<<mat.size()<<endl;
+    }
+    return 0;
+}

13307130498/assignment10/Language Cardinality.cpp

@@ -0,0 +1,49 @@
+#include<iostream>
+#include<cstdio>
+#include<string>
+#include<algorithm>
+#include<set>
+using namespace std;
+struct A{
+    string ori,rep;
+}ru[101];
+int size,i,j;
+string s,x;
+set<string> bef;
+void cal(string str){
+    for(int m=0;m<size;m++){
+        int jj=0;
+        while(str.find(ru[m].ori,jj)!=string::npos){
+            string newstr=str;
+            newstr.replace(newstr.find(ru[m].ori,jj),ru[m].ori.size(),ru[m].rep);
+            if(bef.count(newstr)==0){
+                bef.insert(newstr);
+                if(bef.size()>1000)throw "XYWBD";
+                cal(newstr);
+            }
+            jj=str.find(ru[m].ori,jj)+1;
+        }
+    }
+}
+int main(void){
+    cin>>s;
+    s=s.substr(1,s.size()-2);
+    i=j=0;
+    while(cin>>x){
+        j=x.find("->");
+        ru[i].ori=x.substr(1,j-2);
+        ru[i].rep=x.substr(j+3,x.size()-j-4);
+        i++;
+    }
+    size=i;
+    bef.insert(s);
+    try{
+        cal(s);
+    }
+    catch(const char *mm){
+        cout<<"Too many."<<endl;
+        return 0;
+    }
+    cout<<bef.size()<<endl;
+    return 0;
+}