文件操作练习。注意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 |
98160 | 2022211358 | www | Accepted | 1068KB | 11ms | C | 1066 bytes | 2023-04-30 13:51:53 | |
97453 | 2022211358 | www | Output Limit Exceed | 1068KB | 11ms | C | 1055 bytes | 2023-04-29 16:29:34 | |
97437 | 2022211358 | www | Runtime Error | 1068KB | 10ms | C | 1054 bytes | 2023-04-29 16:18:27 | |
97427 | 2022211358 | www | Output Limit Exceed | 1068KB | 11ms | C | 1040 bytes | 2023-04-29 16:11:01 | |
97423 | 2022211358 | www | Runtime Error | 1068KB | 12ms | C | 1038 bytes | 2023-04-29 16:07:15 | |
97401 | 2022211358 | www | Output Limit Exceed | 1068KB | 11ms | C | 923 bytes | 2023-04-29 15:24:06 | |
97400 | 2022211358 | www | Output Limit Exceed | 1068KB | 13ms | C | 922 bytes | 2023-04-29 15:23:09 | |
97398 | 2022211358 | www | Output Limit Exceed | 1068KB | 10ms | C | 906 bytes | 2023-04-29 15:16:34 | |
97391 | 2022211358 | www | Output Limit Exceed | 1068KB | 9ms | C | 917 bytes | 2023-04-29 15:13:09 | |
97387 | 2022211358 | www | Output Limit Exceed | 1068KB | 10ms | C | 900 bytes | 2023-04-29 15:08:42 | |
97382 | 2022211358 | www | Output Limit Exceed | 1068KB | 12ms | C | 894 bytes | 2023-04-29 15:04:01 | |
97320 | 2022211358 | www | Accepted | 1192KB | 13ms | C | 1829 bytes | 2023-04-29 13:44:48 | |
97290 | 2022211358 | www | Wrong Answer | 1192KB | 12ms | C | 1848 bytes | 2023-04-29 13:19:28 | |
90117 | 2022211358 | www | Time Limit Exceed | 1192KB | 5275ms | C | 1782 bytes | 2023-04-17 17:08:40 | |
90106 | 2022211358 | www | Time Limit Exceed | 1192KB | 5285ms | C | 1779 bytes | 2023-04-17 16:35:42 | |
89686 | 2022211358 | www | Accepted | 1196KB | 11ms | C | 2117 bytes | 2023-04-16 19:48:22 | |
89683 | 2022211358 | www | Runtime Error | 1200KB | 11ms | C | 2117 bytes | 2023-04-16 19:44:17 | |
89676 | 2022211358 | www | Output Limit Exceed | 1196KB | 11ms | C | 1920 bytes | 2023-04-16 19:32:31 | |
89675 | 2022211358 | www | Output Limit Exceed | 1196KB | 11ms | C | 1915 bytes | 2023-04-16 19:30:57 | |
88215 | 2022211358 | www | Runtime Error | 1200KB | 8ms | C | 1985 bytes | 2023-04-13 11:44:26 | |
88168 | 2022211358 | www | Output Limit Exceed | 1196KB | 11ms | C | 1900 bytes | 2023-04-13 11:09:12 | |
85055 | 2022211358 | www | Runtime Error | 1196KB | 10ms | C | 1726 bytes | 2023-04-08 17:16:44 | |
84982 | 2022211358 | www | Runtime Error | 1196KB | 9ms | C | 1656 bytes | 2023-04-08 16:29:25 | |
84964 | 2022211358 | www | Runtime Error | 1192KB | 9ms | C | 1525 bytes | 2023-04-08 16:13:19 | |
84962 | 2022211358 | www | Compile Error | 0KB | 0ms | C | 1528 bytes | 2023-04-08 16:11:47 | |
84947 | 2022211358 | www | Runtime Error | 1192KB | 9ms | C | 1496 bytes | 2023-04-08 15:51:37 | |
84943 | 2022211358 | www | Runtime Error | 1192KB | 10ms | C | 1524 bytes | 2023-04-08 15:44:48 | |
83534 | 2022211358 | www | Accepted | 1192KB | 12ms | C | 1704 bytes | 2023-04-05 23:21:47 | |
83517 | 2022211358 | www | Wrong Answer | 1192KB | 12ms | C | 1675 bytes | 2023-04-05 23:09:49 | |
83358 | 2022211358 | www | Wrong Answer | 1192KB | 13ms | C | 1666 bytes | 2023-04-05 22:03:56 |