W

@will_kf617

ToDo

C
2 years ago
#include <stdio.h> int main() { printf("What should I do \n"); printf("1. 電子學第三章習題\n"); printf("2. 工程數學習題 \n"); printf("3. Queue + 期中考訂正 \n"); printf("4. 機率學\n"); printf("5. 電路學必考題目\n\n");

DataStructure_HW3

C
2 years ago
#include <stdio.h> int main() { printf("Hello world!\n"); return 0; }

Week 10

C
2 years ago
#include <stdio.h> #include <stdlib.h> int **pascal_dp(int n) { int col, row; int **data = (int **)malloc(sizeof(int *) * (n + 1)); for (col = 0; col <= n; col++) { data[col] = (int *)malloc(sizeof(int) * (col + 1)); data[col][0] = 1;

datastructure_midterm_parenthesis_matching_uncrossable

C
2 years ago
#include <stdio.h> #include <stdlib.h> #define SIZE 100 int stack[SIZE]; // store (left_brackets_pos) * 10 + encoded_left_bracket int top = -1; // stack functions int full(); int empty();

datastructure_midterm_parenthesis_matching_crossable

C
2 years ago
#include <stdio.h> #include <stdlib.h> #define SIZE 100 int stack[SIZE]; // store (left_brackets_pos) * 10 + encoded_left_bracket int top = -1; // stack functions int full(); int empty();

datastructure_midterm_SacrifingAElement

C
2 years ago
#include <stdio.h> #include <stdlib.h> #include <time.h> #define SIZE 100 typedef struct { int data[SIZE]; int front; int rear; } CircularQueue;

datastructure_midterm_totalInQueue

C
2 years ago
#include <stdio.h> #include <stdlib.h> #include <time.h> #define SIZE 100 typedef struct { int data[SIZE]; int front; int rear; int totalInQueue; // Total number of elements in the queue

datastructure_midterm_lastOperationIsAddq_lastOperationIsDeleteq

C
2 years ago
#include <stdio.h> #include <stdlib.h> #include <time.h> #define SIZE 100 typedef struct { int data[SIZE]; int front; int rear; int lastOperationIsAddq; // 0 for delete, 1 for addq

datastructure_midterm_stack

C
2 years ago
#include <stdio.h> #include <stdlib.h> #include <time.h> // use time() to get current time #define SIZE 100 typedef struct { int data[SIZE]; int top; } Stack;

期中考_Stack

C
2 years ago
#include <stdio.h> #include <stdlib.h> #include <time.h> // use time() to get current time #define SIZE 100 typedef struct { int data[SIZE]; int top; } Stack;

資料結構_第八周練習題

C
2 years ago
//411440281 Lu-Wei-Yi #include <stdio.h> #include <stdlib.h> #include <time.h> #define SIZE 100 struct queue { int A[SIZE]; int front,rear;

資料結構_第七週練習題

C
2 years ago
//411440281 Lu-Wei-Yi #include <stdio.h> #include <stdlib.h> #include <time.h> #define SIZE 100 struct stack { int A[SIZE]; int top;

資料結構_第六周作業

C
2 years ago
//411440281 Lu-Wei-Yi #include <stdio.h> #include <stdlib.h> #define SIZE 100 int top=-1; int A[SIZE]; int empty(){ return(top==-1);

Zerojudge_a010

C
2 years ago
#include <stdio.h> #include <math.h> int Factor[1000]; int cnt=0; //Find the factor of num int isPrime(int num){ int i; for(i=2;i<num;i++){ if(num%i==0){

資料結構_第三次作業_助教

C
2 years ago
//-------------- // // 411440281 Lu-Wei-Yi // Date : 2023/10/12 // //------------- #include <stdio.h> #include <stdlib.h> struct triango{ int a;

Practice

C++
3 years ago
#include <iostream> #include <algorithm> #include <typeinfo> using namespace std; int main() { auto array2= {1,2,3}; cout << max(array2) << "\n";

d065

C++
3 years ago
#include <iostream> using namespace std; int main() { int a,b,c; //三個人 int num[3]; for(int i;i<=2;i++){ cin>>a num[i]=a;

d073. 分組報告

C++
3 years ago
#include <iostream> using namespace std ; int main() { int sit,ans; cin>>sit; ans=sit/3+1; cout<<ans; }