C
思路:C题这道题思路就是两个for循环前后遍历一遍,但是有很多小细节会导致不能AC,比如说lljj最多做n道题,比如说数据范围是1000,数组就开到了1000,这些小细节导致很多人wa。
代码
#include <stdio.h>
int n, k;
int a[1010];
int main()
{
scanf("%d%d",&n,&k);
int sum = 0;
for (int i = 1; i <= n; i ++ ) scanf("%d",&a[i]);
int i;
for (i = 1; i <= n; i ++ ){
if (a[i] <= k) sum ++;
else break;
}
for (int j = n; j > i; j -- ) {
if (a[j] <= k) sum ++;
else break;
}
printf("%d\n",sum);
return 0;
}
F
思路:这道题就是模拟二进制进位,遇二进一,注意的是C/C++不能把二进制转化成十进制加法,再把十进制转二进制输出,以为是107的数据范围,可以想一下 l o n g l o n g long long longlong才1063 ,但是python可以。
C/C++代码
#include <stdio.h>
#include <string.h>
#include <math.h>
const int N = 1e7 + 10;
int a[N],b[N],c[N];
int n, m;
int main()
{
scanf("%d%d",&n, &m);
for (int i = 1; i <= n; i ++ ) scanf("%d",&a[i]);
for (int i = 1; i <= m; i ++ ) scanf("%d",&b[i]);
int i;
for (i = 1; i <= n && i <= m; i ++ ) {
c[i] += (a[i] + b[i]);
if (c[i] >= 2) c[i + 1] ++, c[i] -= 2;
}
//如果n != m的话处理剩下的数
while (i <= n) {
c[i] += a[i];
if (c[i] >= 2) c[i + 1] ++, c[i] -= 2;
i ++;
}
while (i <= m) {
c[i] += b[i];
if (c[i] >= 2) c[i + 1] ++, c[i] -= 2;
i ++;
}
for (int j = 1; j < i; j ++ )
printf("%d ",c[j]);
if (c[i] != 0) printf("%d",c[i]);
puts("");
return 0;
}
Python代码
input()
a = "".join(input().split())[::-1]
b = "".join(input().split())[::-1]
res = int(a, 2) + int(b, 2)
while res > 0:
print(res & 1, end = " ")
res >>= 1