文件操作练习。注意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 |
82434 | 2021211268 | ♠ | Accepted | 1240KB | 13ms | C | 1950 bytes | 2023-04-05 11:31:26 | |
82431 | 2021211268 | ♠ | Accepted | 1240KB | 11ms | C | 1948 bytes | 2023-04-05 11:28:26 | |
82430 | 2021211268 | ♠ | Wrong Answer | 1240KB | 13ms | C | 2018 bytes | 2023-04-05 11:26:53 | |
82428 | 2021211268 | ♠ | Wrong Answer | 1240KB | 13ms | C | 1947 bytes | 2023-04-05 11:24:42 | |
82427 | 2021211268 | ♠ | *Accepted64792 | 1192KB | 13ms | C | 2042 bytes | 2023-04-05 11:24:22 | |
82425 | 2021211268 | ♠ | Wrong Answer | 1240KB | 13ms | C | 1761 bytes | 2023-04-05 11:22:12 | |
82413 | 2021211268 | ♠ | Wrong Answer | 1240KB | 11ms | C | 1949 bytes | 2023-04-05 11:03:07 | |
82194 | 2021211268 | ♠ | Wrong Answer | 1240KB | 12ms | C | 1949 bytes | 2023-04-05 00:49:16 | |
82078 | 2021211268 | ♠ | Wrong Answer | 1240KB | 11ms | C | 1910 bytes | 2023-04-04 23:30:23 | |
82067 | 2021211268 | ♠ | Wrong Answer | 1240KB | 12ms | C | 1893 bytes | 2023-04-04 23:24:04 | |
81888 | 2021211268 | ♠ | Wrong Answer | 1240KB | 12ms | C | 1891 bytes | 2023-04-04 21:55:31 | |
78670 | 2021211268 | ♠ | Accepted | 1112KB | 11ms | C | 1553 bytes | 2023-04-02 15:04:23 | |
78663 | 2021211268 | ♠ | *Accepted65033 | 1112KB | 14ms | C | 1972 bytes | 2023-04-02 14:58:09 | |
78660 | 2021211268 | ♠ | *Accepted65033 | 1072KB | 10ms | C | 3522 bytes | 2023-04-02 14:57:14 | |
78658 | 2021211268 | ♠ | Wrong Answer | 1112KB | 11ms | C | 1627 bytes | 2023-04-02 14:54:26 | |
78292 | 2021211268 | ♠ | Wrong Answer | 1112KB | 9ms | C | 1556 bytes | 2023-04-01 23:27:53 | |
78287 | 2021211268 | ♠ | Output Limit Exceed | 1112KB | 13ms | C | 1593 bytes | 2023-04-01 23:23:49 | |
78215 | 2021211268 | ♠ | Accepted | 1240KB | 11ms | C | 1899 bytes | 2023-04-01 22:21:38 | |
67151 | 2021211268 | ♠ | Output Limit Exceed | 1076KB | 13ms | C | 1521 bytes | 2023-03-23 16:38:47 | |
67149 | 2021211268 | ♠ | Output Limit Exceed | 1076KB | 9ms | C | 1525 bytes | 2023-03-23 16:37:18 | |
67020 | 2021211268 | ♠ | Wrong Answer | 1112KB | 11ms | C | 1481 bytes | 2023-03-23 13:12:32 | |
67018 | 2021211268 | ♠ | Wrong Answer | 1112KB | 11ms | C | 1482 bytes | 2023-03-23 13:10:47 | |
66927 | 2021211268 | ♠ | Accepted | 1240KB | 11ms | C | 2105 bytes | 2023-03-23 11:31:28 | |
66902 | 2021211268 | ♠ | Wrong Answer | 1240KB | 11ms | C | 2041 bytes | 2023-03-23 11:11:09 |