13307130057_XiaoZhenchen_Assignment11

13307130057/assignment11/src/Deli Deli.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+#include <cstdio>
+#include <string>
+#include <map>
+using namespace std;
+int main()
+{
+    int l,n,i,j,len;
+    map<string,string> f;
+    string s,s1,s2;
+    cin>>l>>n;
+    for (i=0;i<l;i++)
+    {
+        cin>>s1>>s2;
+        f[s1]=s2;
+    }
+    for (i=0;i<n;i++)
+    {
+        cin>>s;
+        if (f.count(s)) cout<<f[s]<<endl;
+        else
+        {
+            len=s.length();
+            if (len==1)
+            {
+                if ((s[0]=='o')||(s[0]=='s')||(s[0]=='x')) cout<<s<<"es"<<endl;
+                else cout<<s<<'s'<<endl;
+            }
+            else
+            {
+                if ((s[len-1]=='h')&&((s[len-2]=='c')||(s[len-2]=='s'))) cout<<s<<"es"<<endl;
+                else if ((s[len-1]=='o')||(s[len-1]=='s')||(s[len-1]=='x')) cout<<s<<"es"<<endl;
+                else if ((s[len-1]=='y')&& !((s[len-2]=='a')||(s[len-2]=='o')||(s[len-2]=='i')||(s[len-2]=='e')||(s[len-2]=='u')))
+                {
+                    for (j=0;j<len-1;j++) cout<<s[j];
+                    cout<<"ies"<<endl;
+                }
+                else cout<<s<<'s'<<endl;
+            }
+        }
+    }
+    return 0;
+}

13307130057/assignment11/src/Expressions.cpp

@@ -0,0 +1,48 @@
+#include <cstdio>
+#include <iostream>
+using namespace std;
+struct tree
+{
+	char name;
+	int lc,rc;
+};
+int main()
+{
+	int t;
+	scanf("%d\n",&t);
+	while (t)
+	{
+		t--;
+		tree a[10000];
+		int i,m,n,stack[10000],queue[10000];
+		char c;
+		n=0;m=0;
+		c=getchar();
+		while (c!='\n')
+		{
+			a[m].name=c;
+			if ((c>96)&&(c<123))
+			{
+				a[m].lc=-1;
+				a[m].rc=-1;
+			}
+			else
+			{
+				n=n-2;
+				a[m].lc=stack[n];
+				a[m].rc=stack[n+1];
+			}
+			stack[n++]=m++;
+			c=getchar();
+		}
+		queue[0]=m-1;n=1;
+		for (i=0;i<m;i++)
+		{
+			if (a[queue[i]].lc!=-1) queue[n++]=a[queue[i]].lc;
+			if (a[queue[i]].rc!=-1) queue[n++]=a[queue[i]].rc;
+		}
+		for (i=m-1;i>=0;i--) putchar(a[queue[i]].name);
+		printf("\n");
+	}
+	return 0;
+}

13307130057/assignment11/src/Great Swerc.cpp

@@ -0,0 +1,72 @@
+#include <iostream>
+#include <cstdio>
+#include <string>
+using namespace std;
+struct node
+{
+    char name;
+    int num,head;
+}a[10];
+int t[10],sum,n,m;
+string s[10];
+void work(int x)
+{
+    if (x==0)
+    {
+        long long tot,number;
+        tot=0;
+        for (int i=0;i<n;i++)
+        {
+            number=0;
+            for (int j=0;j<s[i].length();j++)
+                for (int k=0;k<m;k++)
+                    if (s[i][j]==a[k].name)
+                    {
+                        number=number*10+a[k].num;
+                        break;
+                    }
+            if (i<n-1) tot=tot+number;
+        }
+        if (tot==number) sum++;
+        return;
+    }
+    for (int i=0;i<10;i++)
+    {
+        if ((t[i]==0)&& !((i==0)&&(a[x-1].head==0)))
+        {
+            a[x-1].num=i;
+            t[i]=1;
+            work(x-1);
+            t[i]=0;
+        }
+    }
+}
+int main()
+{
+    cin>>n;m=0;
+    for (int i=0;i<n;i++)
+    {
+        cin>>s[i];
+        for (int j=0;j<s[i].length();j++)
+        {
+            int tf=1;
+            for (int k=0;k<m;k++)
+                if (a[k].name==s[i][j])
+                {
+                    tf=0;
+                    break;
+                }
+            if (tf)
+            {
+                a[m].name=s[i][j];
+                a[m].num=0;
+                a[m].head=j;
+                m++;
+            }
+        }
+    }
+    sum=0;
+    work(m);
+    cout<<sum<<endl;
+    return 0;
+}