![](https://img2022.cnblogs.com/blog/1959268/202205/1959268-20220520184700014-1360707308.png)
(十六进制 %x 20.0f是%f long 是%ld unsigned int %#o )
编程题:
整数浮点数的上溢下溢
strcpy函数代码
int search(char *s, char ch, int n)
{
int i;
int m = strlen(s);
for (i = 0; i<n && *(s + i) != ch; ++i);
if ( i>=m)
{
cout << "No find target!" << endl;
}
return i;
}