文件操作练习。注意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 |
80375 | 2022211346 | Joker | *Accepted73023 | 1196KB | 9ms | C | 1454 bytes | 2023-04-03 17:08:31 | |
79347 | 2022211346 | Joker | Accepted | 1068KB | 11ms | C | 898 bytes | 2023-04-02 21:13:42 | |
79344 | 2022211346 | Joker | Wrong Answer | 1068KB | 9ms | C | 881 bytes | 2023-04-02 21:09:35 | |
79343 | 2022211346 | Joker | Wrong Answer | 1068KB | 8ms | C | 881 bytes | 2023-04-02 21:08:40 | |
79263 | 2022211346 | Joker | Wrong Answer | 1068KB | 10ms | C | 876 bytes | 2023-04-02 20:33:54 | |
79140 | 2022211346 | Joker | Wrong Answer | 1068KB | 10ms | C | 865 bytes | 2023-04-02 19:56:25 | |
79124 | 2022211346 | Joker | Wrong Answer | 1068KB | 10ms | C | 873 bytes | 2023-04-02 19:51:21 | |
78461 | 2022211346 | Joker | Accepted | 1192KB | 12ms | C | 1214 bytes | 2023-04-02 11:04:19 | |
78459 | 2022211346 | Joker | Output Limit Exceed | 1192KB | 11ms | C | 1212 bytes | 2023-04-02 11:00:31 | |
78448 | 2022211346 | Joker | Wrong Answer | 1192KB | 10ms | C | 1098 bytes | 2023-04-02 10:33:28 | |
78434 | 2022211346 | Joker | Output Limit Exceed | 1192KB | 11ms | C | 1059 bytes | 2023-04-02 09:49:35 | |
78195 | 2022211346 | Joker | *Accepted73023 | 1196KB | 10ms | C | 1454 bytes | 2023-04-01 21:55:27 | |
78193 | 2022211346 | Joker | Wrong Answer | 1196KB | 12ms | C | 1444 bytes | 2023-04-01 21:53:50 | |
77775 | 2022211346 | Joker | Wrong Answer | 1196KB | 10ms | C | 1428 bytes | 2023-04-01 12:42:06 | |
77682 | 2022211346 | Joker | Accepted | 1192KB | 9ms | C | 1745 bytes | 2023-04-01 11:12:19 | |
77678 | 2022211346 | Joker | Wrong Answer | 1192KB | 10ms | C | 1744 bytes | 2023-04-01 11:07:40 | |
77675 | 2022211346 | Joker | Wrong Answer | 1192KB | 10ms | C | 1756 bytes | 2023-04-01 11:04:44 | |
77670 | 2022211346 | Joker | *Accepted69176 | 1200KB | 11ms | C | 1727 bytes | 2023-04-01 11:00:37 | |
77668 | 2022211346 | Joker | Runtime Error | 1200KB | 6ms | C | 1723 bytes | 2023-04-01 10:59:21 | |
77666 | 2022211346 | Joker | Wrong Answer | 1192KB | 10ms | C | 1755 bytes | 2023-04-01 10:58:43 | |
77661 | 2022211346 | Joker | Wrong Answer | 1192KB | 10ms | C | 1755 bytes | 2023-04-01 10:52:40 | |
77659 | 2022211346 | Joker | Runtime Error | 1192KB | 6ms | C | 1752 bytes | 2023-04-01 10:51:01 | |
77653 | 2022211346 | Joker | Wrong Answer | 1192KB | 11ms | C | 1801 bytes | 2023-04-01 10:33:08 | |
77651 | 2022211346 | Joker | Wrong Answer | 1192KB | 11ms | C | 1847 bytes | 2023-04-01 10:30:57 | |
77649 | 2022211346 | Joker | Wrong Answer | 1192KB | 12ms | C | 1846 bytes | 2023-04-01 10:29:16 | |
77641 | 2022211346 | Joker | Wrong Answer | 1192KB | 9ms | C | 1848 bytes | 2023-04-01 10:17:24 |