質問編集履歴
2
test
CHANGED
|
File without changes
|
test
CHANGED
|
File without changes
|
1
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -1,4 +1,86 @@
|
|
|
1
|
+
```ここに言語を入力
|
|
2
|
+
|
|
3
|
+
define N 4
|
|
4
|
+
|
|
5
|
+
typedef struct _QueueD {
|
|
6
|
+
|
|
7
|
+
char Datim[32];
|
|
8
|
+
|
|
9
|
+
}QueueD;
|
|
10
|
+
|
|
11
|
+
|
|
12
|
+
|
|
13
|
+
QueueD QueD[N]=
|
|
14
|
+
|
|
15
|
+
{
|
|
16
|
+
|
|
17
|
+
{NULL}
|
|
18
|
+
|
|
19
|
+
};
|
|
20
|
+
|
|
21
|
+
|
|
22
|
+
|
|
23
|
+
int q_num=0;
|
|
24
|
+
|
|
25
|
+
|
|
26
|
+
|
|
27
|
+
void enqueue(char *Datetime ){
|
|
28
|
+
|
|
29
|
+
int i;
|
|
30
|
+
|
|
31
|
+
QueueD *qDuptr;
|
|
32
|
+
|
|
33
|
+
qDuptr = &QueD;
|
|
34
|
+
|
|
35
|
+
|
|
36
|
+
|
|
37
|
+
strcpy((qDuptr+q_num)->Datim, Datetime);
|
|
38
|
+
|
|
39
|
+
|
|
40
|
+
|
|
41
|
+
if(q_num == N - 1){
|
|
42
|
+
|
|
43
|
+
q_num = 0;
|
|
44
|
+
|
|
45
|
+
}else{
|
|
46
|
+
|
|
47
|
+
q_num++;
|
|
48
|
+
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
|
|
54
|
+
|
|
55
|
+
int main{
|
|
56
|
+
|
|
57
|
+
char str[256];
|
|
58
|
+
|
|
59
|
+
QueueD *datep;
|
|
60
|
+
|
|
61
|
+
|
|
62
|
+
|
|
63
|
+
strcpy(Que->Datim, str); //strはある動作をするたびに文字列が入力されると仮定
|
|
64
|
+
|
|
65
|
+
enqueue(str);
|
|
66
|
+
|
|
67
|
+
datep = &QueD;
|
|
68
|
+
|
|
69
|
+
|
|
70
|
+
|
|
71
|
+
for(t=0; t < 4; t++ ){
|
|
72
|
+
|
|
73
|
+
if( f_puts( "日時：", fp ) < 0 ) goto ERR;
|
|
74
|
+
|
|
75
|
+
if( f_puts( (datep+t)->Datim, fp ) < 0 ) goto ERR;
|
|
76
|
+
|
|
77
|
+
if( f_puts( "\r\n", fp ) < 0 ) goto ERR;
|
|
78
|
+
|
|
79
|
+
Trace0("終端 \r\n");
|
|
80
|
+
|
|
81
|
+
}
|
|
82
|
+
|
|
1
|
-
### 前提・実現したいこと
|
|
83
|
+
``### 前提・実現したいこと
|
|
2
84
|
|
|
3
85
|
ある関数を実行するたびに、文字列が出力されます。
|
|
4
86
|
|
|
@@ -14,96 +96,6 @@
|
|
|
14
96
|
|
|
15
97
|
### 試したこと
|
|
16
98
|
|
|
17
|
-
文法的に問題がありますが下に参考として示します。
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
#define N 4
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
typedef struct _QueueD {
|
|
26
|
-
|
|
27
|
-
char Datim[32];
|
|
28
|
-
|
|
29
|
-
}QueueD;
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
QueueD QueD[N]=
|
|
34
|
-
|
|
35
|
-
{
|
|
36
|
-
|
|
37
|
-
{NULL}
|
|
38
|
-
|
|
39
|
-
};
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
int q_num=0;
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
void enqueue(char *Datetime ){
|
|
48
|
-
|
|
49
|
-
int i;
|
|
50
|
-
|
|
51
|
-
QueueD *qDuptr;
|
|
52
|
-
|
|
53
|
-
qDuptr = &QueD;
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
strcpy((qDuptr+q_num)->Datim, Datetime);
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
if(q_num == N - 1){
|
|
62
|
-
|
|
63
|
-
q_num = 0;
|
|
64
|
-
|
|
65
|
-
}else{
|
|
66
|
-
|
|
67
|
-
q_num++;
|
|
68
|
-
|
|
69
|
-
}
|
|
70
|
-
|
|
71
|
-
}
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
int main{
|
|
76
|
-
|
|
77
|
-
char str[256];
|
|
78
|
-
|
|
79
|
-
QueueD *datep;
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
strcpy(Que->Datim, str); //strはある動作をするたびに文字列が入力されると仮定
|
|
84
|
-
|
|
85
|
-
enqueue(str);
|
|
86
|
-
|
|
87
|
-
datep = &QueD;
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
for(t=0; t < 4; t++ ){
|
|
92
|
-
|
|
93
|
-
if( f_puts( "日時：", fp ) < 0 ) goto ERR;
|
|
94
|
-
|
|
95
|
-
if( f_puts( (datep+t)->Datim, fp ) < 0 ) goto ERR;
|
|
96
|
-
|
|
97
|
-
if( f_puts( "\r\n", fp ) < 0 ) goto ERR;
|
|
98
|
-
|
|
99
|
-
Trace0("終端 \r\n");
|
|
100
|
-
|
|
101
|
-
}
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
99
|
### 補足情報（FW/ツールのバージョンなど）
|
|
108
100
|
|
|
109
101
|
|