First commit

Author: myk502

.vscode/launch.json

@@ -0,0 +1,21 @@
+{
+    // Use IntelliSense to learn about possible Node.js debug attributes.
+    // Hover to view descriptions of existing attributes.
+    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "type": "node",
+            "request": "launch",
+            "name": "Launch Program",
+            "program": "${workspaceRoot}/app.js",
+            "cwd": "${workspaceRoot}"
+        },
+        {
+            "type": "node",
+            "request": "attach",
+            "name": "Attach to Process",
+            "port": 5858
+        }
+    ]
+}

10月16 练习/A.cpp

@@ -0,0 +1,7 @@
+#include<bits/stdc++.h>
+
+int main(void)
+{
+
+    return 0;
+}

10月16 练习/F.c

@@ -0,0 +1,92 @@
+#include <cstdio>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+typedef long long ll;
+
+#define NMAX 1100
+
+struct xp{
+    int c,p;
+    bool operator < (const xp &b)const{
+        return (p==b.p)?(c<b.c):(p>b.p);
+    }
+};
+
+struct ad{
+    vector<xp> x;
+
+    void s(){sort(x.begin(),x.end());}
+    bool operator < (const ad &b)const{
+        (x[0].p==b.x[0].p)?(x[0].c<b.x[0].c):(x[0].p<b.x[0].p);
+    }
+};
+
+struct mu{
+    vector<ad> f;
+
+    void s(){
+        int ne=f.size(),i;
+        for(i=0;i<ne;i++)f[i].s();
+        sort(f.begin(),f.end());
+    }
+};
+
+void gen(int n,bool b,int op,mu &p){
+    if(b){
+        if(n%2){
+            ad a;
+            a.x.push_back((xp){1,1});
+            a.x.push_back((xp){-1,0});
+            p.f.push_back(a);
+            a.x.clear();
+            for(i=n-1;i>=0;i--)
+                a.x.push_back((xp){((i%2)?-1:1),i});
+            p.f.push_back(a);
+        }else{
+            int q,num=0;
+            int i;
+            for(q=n;!(q%2);q/=2)num++;
+            gen(q,true,num*op,p);
+        }
+    }else{
+        if(n%2){
+            ad a;
+            a.x.push_back((xp){1,1});
+            a.x.push_back((xp){-1,0});
+            p.f.push_back(a);
+            a.x.clear();
+            for(i=n-1;i>=0;i--)
+                a.x.push_back((xp){1,i});
+            p.f.push_back(a);
+        }else{
+            gen(n/2,true,op,p);
+        }
+    }
+    p.s();
+}
+
+mu p;
+
+int main(){
+    int n;
+    int i,j;
+
+    while(true){
+        scanf("%d",&n);
+        if(n==0)break;
+        gen(n,false,1,p);
+        for(i=0;i<p.x.size();i++){
+            vector<xp> &x=p.f[i].x;
+            for(j=0;j<x.size();j++){
+                if(x[j].c>0)putchar('+');
+                else putchar('-');
+                printf("%d ",x[j].p);
+            }
+            putchar('\n');
+        }
+        p.f.clear();
+    }
+}

10月16 练习/F.cpp

@@ -0,0 +1,122 @@
+#include <cstdio>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+typedef long long ll;
+
+#define NMAX 1100
+
+struct xp{
+    int c,p;
+    bool operator < (const xp &b)const{
+        return (p==b.p)?(c<b.c):(p>b.p);
+    }
+};
+
+struct ad{
+    vector<xp> x;
+
+    void s(){sort(x.begin(),x.end());}
+    bool operator < (const ad &b)const{
+        if(x[0].p!=b.x[0].p)return x[0].p<b.x[0].p;
+        //if(x.size()!=b.x.size())return x.size()<b.x.size();
+        int i;
+        for(i=0;i<x.size();i++)
+            if(x[i].c!=b.x[i].c)return x[i].c<b.x[i].c;
+    }
+};
+
+struct mu{
+    vector<ad> f;
+
+    void s(){
+        int ne=f.size();
+        int i;
+        for(i=0;i<ne;i++)f[i].s();
+        sort(f.begin(),f.end());
+    }
+};
+
+void gen(int n,bool b,int op,mu &p){
+    if(b){
+        if(n%2){
+            ad a;
+            int i;
+
+            a.x.push_back((xp){1,op});
+            a.x.push_back((xp){1,0});
+            p.f.push_back(a);
+            a.x.clear();
+            for(i=n-1;i>=0;i--)
+                a.x.push_back((xp){((i%2)?-1:1),i*op});
+            p.f.push_back(a);
+        }else{
+            int q,ndq;
+            for(q=n;!(q%2);q/=2);
+            ndq=n/q;
+            gen(q,true,ndq*op,p);
+        }
+    }else{
+        if(n%2){
+            ad a;
+            int i;
+
+            a.x.push_back((xp){1,op});
+            a.x.push_back((xp){-1,0});
+            p.f.push_back(a);
+            a.x.clear();
+            for(i=n-1;i>=0;i--)
+                a.x.push_back((xp){1,i*op});
+            p.f.push_back(a);
+        }else{
+            gen(n/2,true,op,p);
+            gen(n/2,false,op,p);
+        }
+    }
+}
+
+int n;
+mu p;
+
+void output(){
+    int i,j;
+
+    p.s();
+    int sp=p.f.size();
+    for(i=0;i<sp;i++){
+        vector<xp> &x=p.f[i].x;
+        int sx=x.size();
+
+        if(x[0].p==0)continue;
+        if(n!=1)putchar('(');
+
+        for(j=0;j<sx;j++){
+            if(j!=0&&x[j].c>0)putchar('+');
+            if(x[j].c<0)putchar('-');
+
+            if(x[j].p==0)putchar('1');
+            else if(x[j].p==1)putchar('x');
+            else{
+                printf("x^%d",x[j].p);
+            }
+        }
+        if(n!=1)putchar(')');
+    }
+    putchar('\n');
+}
+
+int main(){
+    int i,j;
+
+    //freopen("f.out","w",stdout);
+
+    while(true){
+        scanf("%d",&n);
+        if(n==0)break;
+        gen(n,false,1,p);
+        output();
+        p.f.clear();
+    }
+}

10月16 练习/F.exe

@@ -0,0 +1,20 @@
+#include<bits/stdc++.h>
+
+int main(void)
+{
+    int n;
+    int tmp,s;
+    int i;
+
+    while(true){
+        scanf("%d",&n);
+        if(n==0)break;
+        s=0;
+        for(i=0;i<n;i++){
+            scanf("%d",&tmp);
+            s+=tmp*tmp;
+        }
+        printf("%d\n",s);
+    }
+    return 0;
+}

10月16 练习/F.o

@@ -0,0 +1,47 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+#define NMAX 1000
+#define LMAX 100
+
+char str[2][LMAX+10];
+vector<int> c[NMAX+10];
+int d[NMAX+10];
+
+int main(void)
+{
+    int n=0,m,k,p;
+    int tmp1,tmp2;
+    int s;
+    int i,j;
+    int ne,pc;
+
+    while(true){
+        memset(d,0,sizeof(d));
+        for(i=0;i<=n;i++)c[i].clear();
+        scanf("%d%d%d",&n,&m,&k);
+        if(n==0&&m==0&&k==0)break;
+        scanf("%d",&p);
+        for(i=0;i<p;i++){
+            scanf("%s%d%s%d",str[0],&tmp1,str[1],&tmp2);
+            if(str[0][0]=='c')c[tmp1].push_back(tmp2);
+            else d[tmp1]++;
+        }
+        for(i=1;i<=n;i++)sort(c[i].begin(),c[i].end());
+        s=0;
+        for(i=1;i<=n;i++){
+            ne=c[i].size();
+            pc=0;
+            for(j=1;j<=m;j++){
+                if(pc<ne&&c[i][pc]==j){
+                    pc++;
+                    continue;
+                }
+                s+=k-d[j];
+            }
+        }
+        printf("%d\n",s);
+    }
+    return 0;
+}

10月16 练习/I.cpp

@@ -0,0 +1 @@
+

10月16 练习/I.exe

@@ -0,0 +1,53 @@
+#include <cstdio>
+
+using namespace std;
+
+typedef long long ll;
+
+int n;
+
+struct rab{
+    int d0,v,it;
+};
+
+rab r[2];
+char str[10];
+
+int ctod(char c){
+    switch(c){
+        case 'E':return 0;
+        case 'N':return 1;
+        case 'W':return 2;
+        case 'S':return 3;
+    }
+}
+
+struct pos{
+    int x,y;
+};
+
+struct cond{
+    int t;
+    pos p[2];
+
+    cond next()const{
+        int
+    }
+};
+
+int main(){
+    int n,k;
+    cond tc;
+    int i;
+
+    while(true){
+        scanf("%d",&n);
+        for(i=0;i<2;i++){
+            scanf("%s%d%d",str,&rab[i].v,&rab[i].it);
+            rab[i].d0=ctod(str[0]);
+        }
+        scanf("%d",&k);
+        tc.t=0;
+        for(i=0;i<k;i++)tc=tc.next();
+    }
+}

10月16 练习/I.o

@@ -0,0 +1,13 @@
+#include <cstdio>
+
+using namespace std;
+
+int main(){
+    int i;
+
+    for(i=1;i<=1100;i++){
+        printf("%d\n",i);
+    }
+    printf("0\n");
+    return 0;
+}