第一次提交

eval_result.json

@@ -0,0 +1,9 @@
+{
+  "exercises": [],
+  "statistics": {
+    "total_exercations": 0,
+    "total_succeeds": 0,
+    "total_failures": 0,
+    "total_time": 0
+  }
+}

exercises/00_hello_world/main.cpp

@@ -6,6 +6,6 @@
 
 int main(int argc, char **argv) {
     // TODO: 在控制台输出 "Hello, InfiniTensor!" 并换行
-    std::cout : "Hello, InfiniTensor!" + std::endl;
+    std::cout << "Hello, InfiniTensor!" << std::endl;
     return 0;
 }

exercises/01_variable&add/main.cpp

@@ -5,6 +5,7 @@
 int main(int argc, char **argv) {
     // TODO: 补全变量定义并打印加法运算
     // x ?
+    int x = 42; // 定义变量 x 并赋值为 42
     std::cout << x << " + " << x << " = " << x + x << std::endl;
     return 0;
 }

exercises/02_function/main.cpp

@@ -5,6 +5,7 @@
 // NOTICE: 补充由内而外读法的机翻解释 <https://learn.microsoft.com/zh-cn/cpp/c-language/interpreting-more-complex-declarators?view=msvc-170>
 
 // TODO: 在这里声明函数
+int add(int a, int b);
 
 int main(int argc, char **argv) {
     ASSERT(add(123, 456) == 123 + 456, "add(123, 456) should be 123 + 456");
@@ -15,5 +16,5 @@ int main(int argc, char **argv) {
 }
 
 int add(int a, int b) {
-    // TODO: 补全函数定义，但不要移动代码行
+    return a + b;
 }

exercises/03_argument&parameter/main.cpp

@@ -8,19 +8,19 @@ void func(int);
 // TODO: 为下列 ASSERT 填写正确的值
 int main(int argc, char **argv) {
     auto arg = 99;
-    ASSERT(arg == ?, "arg should be ?");
+    ASSERT(arg == 99, "arg should be ?");
     std::cout << "befor func call: " << arg << std::endl;
     func(arg);
-    ASSERT(arg == ?, "arg should be ?");
+    ASSERT(arg == 99, "arg should be ?");
     std::cout << "after func call: " << arg << std::endl;
     return 0;
 }
 
 // TODO: 为下列 ASSERT 填写正确的值
 void func(int param) {
-    ASSERT(param == ?, "param should be ?");
+    ASSERT(param == 99, "param should be ?");
     std::cout << "befor add: " << param << std::endl;
     param += 1;
-    ASSERT(param == ?, "param should be ?");
+    ASSERT(param == 100, "param should be ?");
     std::cout << "after add: " << param << std::endl;
 }

exercises/04_static/main.cpp

@@ -10,10 +10,10 @@ static int func(int param) {
 
 int main(int argc, char **argv) {
     // TODO: 将下列 `?` 替换为正确的数字
-    ASSERT(func(5) == ?, "static variable value incorrect");
-    ASSERT(func(4) == ?, "static variable value incorrect");
-    ASSERT(func(3) == ?, "static variable value incorrect");
-    ASSERT(func(2) == ?, "static variable value incorrect");
-    ASSERT(func(1) == ?, "static variable value incorrect");
+    ASSERT(func(5) == 5, "static variable value incorrect");
+    ASSERT(func(4) == 6, "static variable value incorrect");
+    ASSERT(func(3) == 7, "static variable value incorrect");
+    ASSERT(func(2) == 8, "static variable value incorrect");
+    ASSERT(func(1) == 9, "static variable value incorrect");
     return 0;
 }

exercises/05_constexpr/main.cpp

@@ -18,8 +18,8 @@ int main(int argc, char **argv) {
 
     // TODO: 观察错误信息，修改一处，使代码编译运行
     // PS: 编译运行，但是不一定能算出结果……
-    constexpr auto ANS_N = 90;
-    constexpr auto ANS = fibonacci(ANS_N);
+    constexpr auto ANS_N = 30;
+    auto ANS = fibonacci(ANS_N);
     std::cout << "fibonacci(" << ANS_N << ") = " << ANS << std::endl;
 
     return 0;

exercises/06_array/main.cpp

@@ -11,13 +11,13 @@ unsigned long long fibonacci(int i) {
             return 1;
         default:
             // TODO: 补全三目表达式缺失的部分
-            return <condition> ? <cache> : (arr[i] = fibonacci(i - 1) + fibonacci(i - 2));
+            return arr[i] ? arr[i] : (arr[i] = fibonacci(i - 1) + fibonacci(i - 2));
     }
 }
 
 int main(int argc, char **argv) {
     // TODO: 为此 ASSERT 填写正确的值
-    ASSERT(sizeof(arr) == ?, "sizeof array is size of all its elements");
+    ASSERT(sizeof(arr) == 720, "sizeof array is size of all its elements");
     // ---- 不要修改以下代码 ----
     ASSERT(fibonacci(2) == 1, "fibonacci(2) should be 1");
     ASSERT(fibonacci(20) == 6765, "fibonacci(20) should be 6765");

exercises/07_loop/main.cpp

@@ -5,10 +5,16 @@
 // READ: 纯函数 <https://zh.wikipedia.org/wiki/%E7%BA%AF%E5%87%BD%E6%95%B0>
 static unsigned long long fibonacci(int i) {
     // TODO: 为缓存设置正确的初始值
-    static unsigned long long cache[96], cached;
+    static unsigned long long cache[96], cached{0};
+    cache[0] = 0;
+    cache[1] = 1;
     // TODO: 设置正确的循环条件
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    if(!cached)
+    {
+        cached = 2;
+        for (; cached <=96; ++cached) {
+            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        }
     }
     return cache[i];
 }

exercises/08_pointer/main.cpp

@@ -5,6 +5,11 @@ bool is_fibonacci(int *ptr, int len, int stride) {
     ASSERT(len >= 3, "`len` should be at least 3");
     // TODO: 编写代码判断从 ptr 开始，每 stride 个元素取 1 个元素，组成长度为 n 的数列是否满足
     // arr[i + 2] = arr[i] + arr[i + 1]
+    for(int i = 0; i < len - 2; i ++) {
+        if (ptr[(i + 2)*stride] != ptr[i*stride] + ptr[(i + 1)*stride]) {
+            return false;
+        }
+    }
     return true;
 }
 

exercises/09_enum&union/main.cpp

@@ -34,9 +34,9 @@ ColorEnum convert_by_pun(Color c) {
         ColorEnum e;
         Color c;
     };
-
     TypePun pun;
     // TODO: 补全类型双关转换
+    pun.c = c; // 将 Color 存入 union
 
     return pun.e;
 }

exercises/10_trivial/main.cpp

@@ -9,8 +9,15 @@ struct FibonacciCache {
 
 // TODO: 实现正确的缓存优化斐波那契计算
 static unsigned long long fibonacci(FibonacciCache &cache, int i) {
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    cache.cached = {0}; // 初始化缓存结构体
+    cache.cache[0] = 0;
+    cache.cache[1] = 1;
+    if(!cache.cached)
+    {
+        cache.cached = 2;
+        for (; cache.cached<16; ++cache.cached) {
+            cache.cache[cache.cached] = cache.cache[cache.cached - 1] + cache.cache[cache.cached - 2];
+        }
     }
     return cache.cache[i];
 }

exercises/11_method/main.cpp

@@ -1,13 +1,18 @@
 #include "../exercise.h"
 
 struct Fibonacci {
-    unsigned long long cache[128];
+    unsigned long long cache[128]={0, 1}; // 初始化前两个斐波那契数
     int cached;
 
     // TODO: 实现正确的缓存优化斐波那契计算
     unsigned long long get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        cached = 0; // 初始化缓存
+        if(!cached)
+        {
+            cached = 2; // 已经计算了前两个数
+            for (; cached<128; ++cached) {
+                cache[cached] = cache[cached - 1] + cache[cached - 2];
+            }
         }
         return cache[i];
     }

exercises/12_method_const/main.cpp

@@ -5,7 +5,9 @@
 struct Fibonacci {
     int numbers[11];
     // TODO: 修改方法签名和实现，使测试通过
-    int get(int i) {
+    constexpr int get(int i) const {
+        // 使用 constexpr 数组访问 Fibonacci 数列
+        return (i >= 0 && i < 11) ? numbers[i] : -1; // 返回 -1 表示索引越界
     }
 };
 

exercises/13_class/main.cpp

@@ -15,13 +15,16 @@ class Fibonacci {
 public:
     // TODO: 实现构造器
     // Fibonacci()
-
+    Fibonacci():cache{0,1}{}
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        if(!cached){
+            cached = 2;
+            for (; cached<16; ++cached) {
+                cache[cached] = cache[cached - 1] + cache[cached - 2];
+            }
         }
-        return cache[i];
+        return cache[i];        
     }
 };
 

exercises/14_class_destruct/main.cpp

@@ -11,15 +11,25 @@ class DynFibonacci {
 
 public:
     // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
+    DynFibonacci(int capacity): cache(new size_t[capacity]), cached(0) {
+        cache[0] = 0;
+        cache[1] = 1;
+    }
 
     // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    ~DynFibonacci(){
+        delete[] cache;
+        cached = 0;
+    }
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        if(!cached)
+        {
+            cached = 2;
+            for (; cached < i+1; ++cached) {
+                cache[cached] = cache[cached - 1] + cache[cached - 2];
+            }
         }
         return cache[i];
     }

exercises/15_class_clone/main.cpp

@@ -10,18 +10,34 @@ class DynFibonacci {
 
 public:
     // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
+    DynFibonacci(int capacity): cache(new size_t[capacity]), cached(0) {
+        cache[0] = 0;
+        cache[1] = 1;
+    }
 
     // TODO: 实现复制构造器
-    DynFibonacci(DynFibonacci const &) = delete;
+    DynFibonacci(const DynFibonacci& other){
+        cached = other.cached;
+        cache = new size_t[cached];
+        for(int i = 0;i<cached;i++)
+        {
+            cache[i] = other.cache[i];
+        }
+    }
 
     // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    ~DynFibonacci(){
+        delete[] cache;
+        cached = 0;
+    }
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        if(!cached){
+            cached = 2;
+            for (; cached<=i; ++cached) {
+                cache[cached] = cache[cached - 1] + cache[cached - 2];
+            }
         }
         return cache[i];
     }

exercises/16_class_move/main.cpp

@@ -12,36 +12,59 @@
 class DynFibonacci {
     size_t *cache;
     int cached;
-
+    int capacity; 
 public:
-    // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
-
-    // TODO: 实现移动构造器
-    DynFibonacci(DynFibonacci &&) noexcept = delete;
+    DynFibonacci(int capacity)
+        : cache(new size_t[capacity]), cached(0), capacity(capacity) {
+        if (capacity > 0) cache[0] = 0;
+        if (capacity > 1) cache[1] = 1;
+    }
 
-    // TODO: 实现移动赋值
-    // NOTICE: ⚠ 注意移动到自身问题 ⚠
-    DynFibonacci &operator=(DynFibonacci &&) noexcept = delete;
+    DynFibonacci(DynFibonacci &&other) noexcept
+        : cache(other.cache), cached(other.cached), capacity(other.capacity) {
+        other.cache = nullptr;
+        other.cached = 0;
+        other.capacity = 0;
+    }
 
-    // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    DynFibonacci &operator=(DynFibonacci &&other) noexcept {
+        if (this != &other) {
+            delete[] cache;
+            cache = other.cache;
+            cached = other.cached;
+            capacity = other.capacity;
+            other.cache = nullptr;
+            other.cached = 0;
+            other.capacity = 0;
+        }
+        return *this;
+    }
+    ~DynFibonacci() {
+        delete[] cache;
+        cache = nullptr;
+        cached = 0;
+        capacity = 0;
+    }
 
-    // TODO: 实现正确的缓存优化斐波那契计算
     size_t operator[](int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        ASSERT(i < capacity, "i out of range");
+        if (i >= cached) {
+            for (; cached <= i; ++cached) {
+                if (cached < 2) continue;
+                cache[cached] = cache[cached - 1] + cache[cached - 2];
+            }
         }
         return cache[i];
     }
 
-    // NOTICE: 不要修改这个方法
+    // 不要修改这个方法
     size_t operator[](int i) const {
+        ASSERT(i < capacity, "i out of range");
         ASSERT(i <= cached, "i out of range");
         return cache[i];
     }
 
-    // NOTICE: 不要修改这个方法
+    // 不要修改这个方法
     bool is_alive() const {
         return cache;
     }
@@ -63,4 +86,4 @@ int main(int argc, char **argv) {
     ASSERT(fib0[10] == 55, "fibonacci(10) should be 55");
 
     return 0;
-}
+}

exercises/17_class_derive/main.cpp

@@ -50,9 +50,9 @@ int main(int argc, char **argv) {
     B b = B(3);
 
     // TODO: 补全三个类型的大小
-    static_assert(sizeof(X) == ?, "There is an int in X");
-    static_assert(sizeof(A) == ?, "There is an int in A");
-    static_assert(sizeof(B) == ?, "B is an A with an X");
+    static_assert(sizeof(X) == 4, "There is an int in X");
+    static_assert(sizeof(A) == 4, "There is an int in A");
+    static_assert(sizeof(B) == 8, "B is an A with an X");
 
     i = 0;
     std::cout << std::endl