文件操作练习。注意B题的读取不能用struct。
D和谐词汇的题,输入是若干字符串,不以空行结束. 所以 gets(line); while (line[0]){... gets(line);}就会导致时间超限,代码在等空行,但in数据没有。应改为while(gets(line))。
/*文件练习B题. 读取一个包含7类数据的二进制文件,找到指定部分内容,并正确解释输出。
思路分析:主体框架是读取二进制文件, while (fread(buffer, buffLen, 1, infile) > 0){...}
因为二进制文件的记录长度是固定的,所以可以计算每条记录的长度,使用fseek直接定位到指定段;
所以用fseek的话,实际只需要读一次就可以。
但是这道题的特殊之处在于,一条记录内是顺序包含7种类型数据,是分多次写入,因此带来的麻烦是
虽然每段内容结构相同,但不能用struct进行整块读取。
因为struct的成员之间有内存空隙;除非源文件本身是用struct格式写入才行。
因此,可以直接定位,但必须分别读取,写出的代码冗长,且容易在变量名和输出格式上出错。
经测试,struct {含7种变量和数组}的长度为200, 但实际7种变量和数组的总长要小一些.
因此,可以直接定位,但必须分别读取,写出的代码冗长,且容易在变量名和输出格式上出错。
一种办法是:按总长度整块读取到字节数组中,然后再逐个定义对应类型的指针,按间接访问就可格式化解释输出。
例: char buffer[LEN];
int i=0; printf("%c\n", buffer[i]); i++;
short * hdPtr=&buffer[i]; printf("%hd\n", *hdPtr); i+=sizeof(short);
*/
RunID | User | Nick Name | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
102459 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 11ms | C | 1735 bytes | 2023-05-04 23:58:40 | |
102457 | 2022211321 | 路人明ing | Compile Error | 0KB | 0ms | C | 1741 bytes | 2023-05-04 23:58:21 | |
102448 | 2022211321 | 路人明ing | *Accepted65047 | 1196KB | 9ms | C | 2935 bytes | 2023-05-04 23:52:25 | |
102335 | 2022211321 | 路人明ing | *Accepted65033 | 1072KB | 14ms | C | 1916 bytes | 2023-05-04 23:03:06 | |
102316 | 2022211321 | 路人明ing | *Accepted65033 | 1072KB | 15ms | C | 1928 bytes | 2023-05-04 22:52:18 | |
102315 | 2022211321 | 路人明ing | Wrong Answer | 1072KB | 10ms | C | 1928 bytes | 2023-05-04 22:52:08 | |
102281 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 14ms | C | 1491 bytes | 2023-05-04 22:26:07 | |
102270 | 2022211321 | 路人明ing | Wrong Answer | 1192KB | 11ms | C | 1507 bytes | 2023-05-04 22:17:20 | |
102249 | 2022211321 | 路人明ing | Wrong Answer | 1192KB | 10ms | C | 1485 bytes | 2023-05-04 22:06:41 | |
102230 | 2022211321 | 路人明ing | Wrong Answer | 1192KB | 12ms | C | 1449 bytes | 2023-05-04 21:56:35 | |
102212 | 2022211321 | 路人明ing | Time Limit Exceed | 1192KB | 3529ms | C | 1441 bytes | 2023-05-04 21:48:02 | |
102199 | 2022211321 | 路人明ing | Output Limit Exceed | 1192KB | 3533ms | C | 1420 bytes | 2023-05-04 21:41:58 | |
102177 | 2022211321 | 路人明ing | *Accepted65979 | 1196KB | 10ms | C | 1718 bytes | 2023-05-04 21:16:41 | |
102171 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 11ms | C | 1716 bytes | 2023-05-04 21:15:01 | |
102165 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 10ms | C | 1703 bytes | 2023-05-04 21:13:33 | |
102157 | 2022211321 | 路人明ing | Wrong Answer | 1192KB | 13ms | C | 1541 bytes | 2023-05-04 21:09:23 | |
102148 | 2022211321 | 路人明ing | Wrong Answer | 1192KB | 13ms | C | 1541 bytes | 2023-05-04 21:03:33 | |
102145 | 2022211321 | 路人明ing | Wrong Answer | 1192KB | 11ms | C | 1542 bytes | 2023-05-04 20:59:29 | |
95759 | 2022211321 | 路人明ing | Time Limit Exceed | 1192KB | 7055ms | C | 1344 bytes | 2023-04-26 11:41:34 | |
75575 | 2022211321 | 路人明ing | *Accepted75531 | 1196KB | 8ms | C | 1752 bytes | 2023-03-30 23:25:23 | |
75570 | 2022211321 | 路人明ing | *Accepted75531 | 1196KB | 12ms | C | 1766 bytes | 2023-03-30 23:23:21 | |
74088 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 12ms | C | 1761 bytes | 2023-03-30 10:16:08 | |
71204 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 12ms | C | 1739 bytes | 2023-03-28 00:22:23 | |
71193 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 12ms | C | 1739 bytes | 2023-03-28 00:14:09 | |
71187 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 12ms | C | 1737 bytes | 2023-03-28 00:11:11 | |
71156 | 2022211321 | 路人明ing | Wrong Answer | 1196KB | 10ms | C | 1737 bytes | 2023-03-27 23:48:10 | |
70458 | 2022211321 | 路人明ing | Wrong Answer | 1192KB | 12ms | C | 1565 bytes | 2023-03-27 16:35:36 | |
70455 | 2022211321 | 路人明ing | Wrong Answer | 1068KB | 13ms | C | 1341 bytes | 2023-03-27 16:32:20 | |
70451 | 2022211321 | 路人明ing | Wrong Answer | 1068KB | 12ms | C | 1347 bytes | 2023-03-27 16:27:50 | |
68831 | 2022211321 | 路人明ing | Wrong Answer | 1068KB | 11ms | C | 1308 bytes | 2023-03-25 22:13:18 | |
68830 | 2022211321 | 路人明ing | Wrong Answer | 1068KB | 7ms | C | 1306 bytes | 2023-03-25 22:07:08 |