qq_45949701的博客

#include<stdio.h>#include<algorithm>#include<stdlib.h>using namespace std;//M<mp M最大值 m最小值 p参数//n=M/p 即最小值的限制条件 m>=n 考虑到n为小数时,故m>nint main() { int N; double p; scanf_s("%d %lf", &N, &p); int *num = (int*)m.

#include<stdio.h>int main() { int num; char c; scanf("%d %c", &num, &c); int h = 0; int sum = 0; if (num > 6) { //这里原来的写法是无限次的2的n次幂,越来越大,不再是单纯的*2 //旧写法:for (int i = 1; i < num/2; i = (2 * i + i) * 2 ) //问题出在最末尾的*2上 for (.

#include<stdio.h>#include<string.h>//注意!整数部分是[1-9] !!!int main() { char str[10001]; gets_s(str, 10001); int point = 2; int E = 0; //负数特征 if (str[0] == '-') { printf("-"); } //确定特殊字符位置 for (int i = 1; str[i] != 'E'; i++) { if (s.