曾覃朗 超级素数

.github/workflows/c-cpp.yml

@@ -0,0 +1,23 @@
+name: C/C++ CI
+
+on:
+  push:
+    branches: [ master ]
+  pull_request:
+    branches: [ master ]
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    steps:
+    - uses: actions/checkout@v2
+    - name: cppcheck-action
+      uses: deep5050/cppcheck-action@v2.0.0
+    - name: make
+      run: make
+    - name: make check
+      run: make check
+    - name: make distcheck
+      run: make distcheck

Course-3.cpp

@@ -0,0 +1,37 @@
+//求一元二次方程的根
+// 例如 ：y = x2 + 10x + 17
+// 当 x = 2, 求 y = 41
+// 当 y = 2, 求 x = ? 
+#include <stdio.h>
+#include <math.h>
+float mysqrt(float n) {
+  // how to guess
+  float x = n/2;
+  while(...) {
+   if (x*x > n) 
+      x = x/2;
+   else
+     x = (x+n)/2;
+  }
+  return 0.0f;
+}
+int main() {
+  float x1, x2;
+  float y, a, b, c, temp;
+  printf("Please input \n");
+  scanf("%f %f %f %f", &y, &a, &b, &c);
+  c =  c - y;
+  temp = b*b - 4* a*c;
+  if(temp >= 0) {
+    temp = sqrt(temp);
+    a = 2 * a;
+    x1 = (-b + temp)/(a);
+    x2 = (-b - temp)/(a);
+    printf("Results \n");
+    printf("%f\n", x1);  
+    printf("%f\n", x2);
+  }
+  else
+    printf("No Results \n");
+  return 0;
+} 

Eigen/plantuml

@@ -0,0 +1,16 @@
+@startuml
+
+PlainObjectBase <|-- Matrix
+PlainObjectBase <|-- Array
+
+MatrixBase <|-- PlainObjectBase
+ArrayBase <|-- PlainObjectBase
+
+DenseBase <|-- MatrixBase
+DenseBase <|-- ArrayBase 
+
+DenseCoeffsBase <|-- DenseBase 
+
+class EigenBase <<Derived>>
+EigenBase <|-- DenseCoeffsBase 
+@enduml

FCdemo.cpp

@@ -0,0 +1,69 @@
+#include <algorithm>
+#include <iostream>
+#include <set>
+#include <unordered_set>
+#include <string>
+#include <vector>
+//  -std=c++11
+using namespace std;
+//constant
+class Person
+{
+public:
+    Person(string lastname, string firstname)
+        : _firstname(firstname), _lastname(lastname)
+    {
+    }
+    string firstname() const
+    {
+        return _firstname;
+    }
+    string lastname() const
+    {
+        return _lastname;
+    }
+private:
+    const string _firstname = nullptr;
+    const string _lastname = nullptr;
+};
+
+class PersonSortCriterion
+{
+public:
+    bool operator()(const Person &p1, const Person &p2) const
+    {
+        return p1.lastname() < p2.lastname() ||
+               (p1.lastname() == p2.lastname() && p1.firstname() < p2.firstname());
+    }
+};
+class PersonSortCriterion1
+{
+public:
+    bool operator()(const Person &p1, const Person &p2) const
+    {
+        return p1.lastname() > p2.lastname() ||
+               (p1.lastname() == p2.lastname() && p1.firstname() > p2.firstname());
+    }
+};
+
+int main(void)
+{
+    set<Person, PersonSortCriterion1> coll;
+    //unordered_set<Person> coll;
+    Person p1("yu", "g");
+    Person p2("an", "yu");
+    Person p3("xiao", "ming");
+    Person p4("xi", "biaoge");
+    Person p5("u", "ong");
+    coll.insert(p1);
+    coll.insert(p2);
+    coll.insert(p3);
+    coll.insert(p4);
+    coll.insert(p5);
+    for (auto i : coll)
+    {
+        cout << i.lastname() << ", " << i.firstname() << endl;
+    }
+
+    return 0;
+}

HelloWorld.c

@@ -1,7 +1,23 @@
 #include <stdio.h>
 int main() {
-  printf("Hello World!\n");
-
-//try Jenkins again 
+  int x, y, z, temp;
+  // �����������������մӴ�С��� 
+  scanf("%d %d %d", &x, &y, &z); 
+  if ( y < z ) {
+  	temp = y;
+	y = z;
+	z = temp; 
+  }
+  else if ( x < y ) {
+  	temp = x;
+	x = y;
+	y = temp; 
+  }
+  else if ( y < z ) {
+  	temp = y;
+	y = z;
+	z = temp; 
+  }
+  printf("%d, %d, %d\n", x, y, z);
   return 0;
 }

Makefile

@@ -0,0 +1,13 @@
+all: main sp
+
+main:main.cpp
+	$(CXX) main.cpp -o main
+
+sp:SuperPrime_HW.cpp
+	$(CXX) SuperPrime_HW.cpp -o sp
+	$(CXX) SuperPrime_HW2.cpp -o sp
+
+check:
+
+
+distcheck:

Mixins.java

@@ -0,0 +1,72 @@
+/**
+ * 组合模式
+ * 在 TaggableImpl 中实现打标签的逻辑
+ *  Post 类和 TaggableImpl 类都实现 Taggable 接口
+ * Post 类中创建一个 TaggableImpl 实例并在实现 Taggable 时将相应方法调用委托过去。
+ */
+
+
+import java.util.List;
+import java.util.ArrayList;
+
+interface Entity {
+    public int getId();
+    public int getKind();
+}
+
+interface Taggable {
+    public void addTag(int tagId);
+    public List<Integer> getTags();
+}
+
+class TaggableImpl implements Taggable {
+    private Entity target;
+
+    public TaggableImpl(Entity target) {
+        this.target = target;
+    }
+
+    public void addTag(int tagId) {
+        int id = target.getId();
+        int kind = target.getKind();
+        System.out.println("insert into ... values "
+                + id + ", "
+                + kind + ", "
+                + tagId + ")");
+    }
+
+    public ArrayList<Integer> getTags() {
+        // query from database
+        return new ArrayList<Integer>();
+    }
+}
+
+class Post implements Entity, Taggable {
+    public final static int KIND = 1001;
+
+    private Taggable taggable;
+    private int id;
+    private String title;
+
+    public Post(int id, String title) {
+        this.id = id;
+        this.title = title;
+        this.taggable = new TaggableImpl(this);
+    }
+
+    public int getId() {
+        return id;
+    }
+
+    public int getKind() {
+        return KIND;
+    }
+
+    public void addTag(int tagId) {
+        taggable.addTag(tagId);  // delegate
+    }
+
+    public ArrayList<Integer> getTags() {
+        return taggable.getTags();  // delegate
+    }
+}

Operator.cpp

@@ -0,0 +1,45 @@
+#include <iostream>
+class Parent {
+public:
+  Parent(int n) {
+  	flag = n;
+  	std::cout << "Parent()" << flag << std::endl;
+  }
+  virtual ~Parent(){
+  	std::cout << "~~~Parent()" << flag << std::endl;
+  }
+  //other methods????
+  void show();
+private:
+  //attributes??
+  int flag;
+};
+class Child : public Parent {
+public:
+  Child(int n):Parent(n) {
+  	flag = n;
+  	std::cout << "Child()" << n << std::endl;
+  }
+  virtual ~Child(){
+  	std::cout << "~~~Child()" << flag << std::endl;
+  }
+  //other methods????
+  //function object 
+  void operator() (int n) {
+  }
+private:
+  //attributes??
+  int flag;
+  void operator= (const Child &c) {
+  	std::cout << "operator = " << flag << std::endl;
+  }
+};
+int main() {
+  Parent *p;
+  p = new Child(1);
+  Child c(2);
+  //c = Child(3);
+  //p->?????();
+  delete p;
+  return 0;
+}

PQPrime.c

@@ -0,0 +1,2 @@
+// 求 p 和 q
+// 当 p 和 q 都是素数，求 p 和 q

PQPrime.md

@@ -0,0 +1,3 @@
+$p^q + q^p$是一个素数，
+$p$和$q$也是素数，
+求$p$和$q$