- 博客(15)
- 收藏
- 关注
RSS订阅原创 LINUX 磁盘调度
printf("移动总磁道数：%d\n",sum);printf("移动总磁道数：%d\n",sum);printf("移动总磁道数：%d\n",sum);printf("FCFS算法\n");printf("SSTF算法\n");printf("SCAN算法\n");printf("磁头移动轨迹：");printf("磁头移动轨迹：");printf("磁头移动轨迹：");// 采用look策略。
2023-12-12 10:40:10
382
原创 linux 替代算法
*减少一个空闲页面*/if(p1[page[i]].pfn==INVALID){//页面失效。if(p1[page[i]].pfn==INVALID) /*页面失效*/if(p1[page[i]].pfn==INVALID) /*页面失效*/if(freepf_head==NULL) /*无空闲页面*/if(freepf_head==NULL) /*无空闲页面*/if(freepf_head==NULL){//无空闲页面。
2023-11-21 11:05:44
54
原创 linux
int retval;int status;\n");sleep(1);\n");else {\n");\n");exit(0);else {");exit(0);
2023-10-31 10:34:18
48
1
原创 Codeforces Round #791 (Div. 2) C Rooks Defenders 三种解法
Codeforces Round #791 (Div. 2)C. Rooks Defenders
2022-05-16 22:16:58
308
原创 Codeforces Round #786 (Div. 3)ABCDE题解
Codeforces Round #786 (Div. 3) A - Number TransformationB - DictionaryC - Infinite ReplacementD - A-B-C SortE - Breaking the Wall
2022-05-04 11:42:55
415
原创 Codeforces Round #785 (Div. 2)ABC题解
Codeforces Round #785 (Div. 2)A. Subtle Substring SubtractionB. A Perfectly Balanced String?C. Palindrome Basis
2022-05-01 21:36:02
516
原创 Codeforces Round #782 (Div. 2)
Codeforces Round #782 (Div. 2)A - Red Versus BlueB - Bit FlippingC - Line Empire
2022-04-27 19:20:33
255
原创 Educational Codeforces Round 127 (Rated for Div. 2)ABC题解
Educational Codeforces Round 127 (Rated for Div. 2)A. String BuildingB. Consecutive Points SegmentC. Dolce Vita
2022-04-24 16:19:14
1326
原创 Codeforces Round #784 (Div. 4)题解
题目链接A - Division题意：根据分数输出段位。题解：签到题。code:#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll inf = 0x3f3f3f3f3f3f3f3f;void solve() { int n; cin >> n; if (n >= 1900) printf("Division 1\n"); else if (n >= 1
2022-04-23 20:17:12
1220
原创 Codeforces Round #783 (Div. 2)ABC题解
Codeforces Round #783 (Div. 2)A Direction ChangeB Social DistanceC Make it Increasing
2022-04-20 18:31:56
911
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人