diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 0000000000000000000000000000000000000000..a7cdac76c182c2f5bce8533edd496b92e5335d33
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,8 @@
+# 默认忽略的文件
+/shelf/
+/workspace.xml
+# 基于编辑器的 HTTP 客户端请求
+/httpRequests/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml
diff --git a/.idea/class-test-ci.iml b/.idea/class-test-ci.iml
new file mode 100644
index 0000000000000000000000000000000000000000..962e49fdd787b3965b066e765b6afd69903f8600
--- /dev/null
+++ b/.idea/class-test-ci.iml
@@ -0,0 +1,2 @@
+
+
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 0000000000000000000000000000000000000000..ea8ddd772a97687626f6d90d0979b2bf60e61c33
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,8 @@
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 0000000000000000000000000000000000000000..c8397c94c0e3faf3de616326ba8901e97fca11ca
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/test_results.json b/build/test_results.json
new file mode 100644
index 0000000000000000000000000000000000000000..96c2f9546c5532eac65609c4df0fd9e59cb897c1
--- /dev/null
+++ b/build/test_results.json
@@ -0,0 +1 @@
+{"channel": "gitee","courseId": 1558,"ext": "aaa","name": "","score": 5,"totalScore": 5}
diff --git a/exercises/01_helloworld.c b/exercises/01_helloworld.c
index e6100166bcb8fd1064fc94f2bb0e1a6952ba8bd1..0bab63fd8329c26ca392d3cb96c7a72ab62ad8e5 100644
--- a/exercises/01_helloworld.c
+++ b/exercises/01_helloworld.c
@@ -4,7 +4,7 @@ int main(){
// Print "Hello World!" to the console
-
+ printf("Hello World!\n");
return 0;
diff --git a/exercises/02_loop.c b/exercises/02_loop.c
index 3e361e61656c2d9ea05348a15fa275dcd3201b8a..b3218a8c9add6d74ea705910b2fa0d3f03fc0a4a 100644
--- a/exercises/02_loop.c
+++ b/exercises/02_loop.c
@@ -7,7 +7,9 @@
int main(void)
{
- //TODO
+ for (int i = 1; i <=10; ++i) {
+ printf("%d\n",i);
+ }
return 0;
}
\ No newline at end of file
diff --git a/exercises/03_nested_loops.c b/exercises/03_nested_loops.c
index d80c6903dd22e3305e35ff2bfb82f949e9975617..50c80f30cdd8e002b1f9b6b3ee79b014ef00cfb2 100644
--- a/exercises/03_nested_loops.c
+++ b/exercises/03_nested_loops.c
@@ -10,8 +10,14 @@
*/
int main(void)
-{
- //TODO
+{
+ for (int i = 1; i <= 9; i++) {
+ for (int j = 1; j <= i; j++) {
+ printf("%d*%d=%d\t", j, i, i * j);
+ }
+ printf("\n");
+ }
+ return 0;
return 0;
}
\ No newline at end of file
diff --git a/exercises/04_prime_number.c b/exercises/04_prime_number.c
index 28e3f5f8cd5dbb074c60d947c925a13d8918234e..a186d42bd4f214919ba1af456b098964590f096a 100644
--- a/exercises/04_prime_number.c
+++ b/exercises/04_prime_number.c
@@ -2,18 +2,30 @@
#include
//查找100以内的最大素数
+int is(int num) {
+ if (num <= 1)
+ return 0;
-int main(void)
-{
- int i, j;
- int max = 0;
+ int i;
+ for (i = 2; i <= sqrt(num); i++) {
+ if (num % i == 0)
+ return 0;
+ }
- for (i = 1; i <= 100; i++)
- {
- //TODO
- }
+ return 1;
+}
- printf("max = %d\n", max);
+int main(void) {
+ int i;
+ int max = 0;
- return 0;
+ for (i = 1; i <= 100; i++) {
+ if(is(i)){
+ max = i;
+ }
+ }
+
+ printf("max = %d\n", max);
+
+ return 0;
}
\ No newline at end of file
diff --git a/exercises/05_josephus_ring.c b/exercises/05_josephus_ring.c
index 330f2045f5cda70d21728503ef40accd04cea14f..746ce884d4432f1f3f98456f9c6e348ae854aef9 100644
--- a/exercises/05_josephus_ring.c
+++ b/exercises/05_josephus_ring.c
@@ -8,22 +8,37 @@
* 要求：输出每一个被淘汰人的编号，每淘汰一个人输出一行，格式为："%d out \n"(每输出一次换行)
*/
-#define ALL_NUM 100
-#define COUNT_NUM 3
-#define OUT_NUM 3
+#define ALL_NUM 100
+#define COUNT_NUM 3
+#define OUT_NUM 3
/* people id array such as (1,2,3,4,5,6) */
int people[ALL_NUM];
-int main(void)
-{
- int left; /* 剩余人数 */
- int pos; /* 当前报数位置 */
- int step; /* 当前报数 */
+int main(void) {
+ int left = ALL_NUM; /* 剩余人数 */
+ int pos = 0; /* 当前报数位置 */
+ int step = 0; /* 当前报数 */
- //TODO
-
-
+ for (int i = 0; i < ALL_NUM; ++i) {
+ people[i] = i + 1;
+ }
- return 0;
+ while (left > 0) {
+ if (people[pos] != 0) {
+ step++;
+ if (step == COUNT_NUM) {
+ printf("%d out \n", people[pos]);
+ people[pos] = 0;
+ left--;
+ step = 0;
+ }
+ }
+ pos++;
+ if (pos == ALL_NUM) {
+ pos = 0;
+ }
+ }
+
+ return 0;
}
\ No newline at end of file