文件操作练习。注意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 |
101976 | 2022212744 | aggylow | Accepted | 1080KB | 13ms | C | 1881 bytes | 2023-05-04 16:01:10 | |
101974 | 2022212744 | aggylow | Compile Error | 0KB | 0ms | C | 1976 bytes | 2023-05-04 15:58:20 | |
101972 | 2022212744 | aggylow | Compile Error | 0KB | 0ms | C | 2000 bytes | 2023-05-04 15:57:03 | |
101942 | 2022212744 | aggylow | *Accepted64994 | 1068KB | 14ms | C | 2144 bytes | 2023-05-04 15:36:05 | |
101939 | 2022212744 | aggylow | *Accepted64994 | 1068KB | 13ms | C | 2060 bytes | 2023-05-04 15:33:16 | |
101936 | 2022212744 | aggylow | Wrong Answer | 1068KB | 9ms | C | 2030 bytes | 2023-05-04 15:32:10 | |
101932 | 2022212744 | aggylow | Wrong Answer | 1068KB | 11ms | C | 2053 bytes | 2023-05-04 15:31:14 | |
88872 | 2022212744 | aggylow | Accepted | 1196KB | 12ms | C | 1887 bytes | 2023-04-14 16:05:05 | |
88859 | 2022212744 | aggylow | Wrong Answer | 1196KB | 10ms | C | 1868 bytes | 2023-04-14 15:50:36 | |
88854 | 2022212744 | aggylow | Wrong Answer | 1196KB | 12ms | C | 1867 bytes | 2023-04-14 15:37:40 | |
84484 | 2022212744 | aggylow | *Accepted64826 | 1192KB | 10ms | C | 1442 bytes | 2023-04-07 15:59:23 | |
84479 | 2022212744 | aggylow | Wrong Answer | 1192KB | 11ms | C | 1391 bytes | 2023-04-07 15:54:05 | |
84404 | 2022212744 | aggylow | Wrong Answer | 1192KB | 11ms | C | 1361 bytes | 2023-04-07 11:04:19 | |
84402 | 2022212744 | aggylow | Accepted | 1192KB | 12ms | C | 1357 bytes | 2023-04-07 11:02:48 | |
84399 | 2022212744 | aggylow | Wrong Answer | 1192KB | 12ms | C | 1355 bytes | 2023-04-07 11:02:05 | |
84397 | 2022212744 | aggylow | Accepted | 1192KB | 12ms | C | 1350 bytes | 2023-04-07 10:58:57 | |
84396 | 2022212744 | aggylow | Runtime Error | 1192KB | 6ms | C | 1348 bytes | 2023-04-07 10:58:30 | |
84391 | 2022212744 | aggylow | Wrong Answer | 1192KB | 12ms | C | 1409 bytes | 2023-04-07 10:44:08 | |
84385 | 2022212744 | aggylow | Wrong Answer | 1192KB | 12ms | C | 1413 bytes | 2023-04-07 10:36:14 | |
76410 | 2022212744 | aggylow | Wrong Answer | 1192KB | 10ms | C | 1361 bytes | 2023-03-31 16:05:44 | |
76398 | 2022212744 | aggylow | Wrong Answer | 1192KB | 10ms | C | 1370 bytes | 2023-03-31 16:00:37 | |
76392 | 2022212744 | aggylow | Wrong Answer | 1192KB | 12ms | C | 1368 bytes | 2023-03-31 15:54:57 | |
76388 | 2022212744 | aggylow | Wrong Answer | 1192KB | 13ms | C | 1368 bytes | 2023-03-31 15:53:23 | |
76346 | 2022212744 | aggylow | Runtime Error | 1192KB | 6ms | C | 1352 bytes | 2023-03-31 15:15:17 | |
75662 | 2022212744 | aggylow | Runtime Error | 1192KB | 6ms | C | 1352 bytes | 2023-03-31 00:00:42 |