B题
示例1
输入
2
2
1 -2 1
2
1 0 1
输出
No
Yes
就差一点点就打出来了嘤嘤嘤
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
ll a[n+5];
for(int i = 0 ; i <= n ; i++) scanf("%d",&a[i+1]);
if(n == 2)
{
int x = a[2]*a[2]-4*a[1]*a[3];
if(x >= 0) printf("No\n");
else printf("Yes\n");
continue;
}
else if(n <= 1)
{
printf("Yes\n");
continue;
}
else
{
printf("No\n");
continue;
}
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
int a[n+5];
for(int i = 0;i <= n;i++) scanf("%d",&a[i]);
if((n>2)||(n==2 && a[1]*a[1]-4*a[0]*a[2] >= 0))
printf("No\n");
else
printf("Yes\n");
}
}
最后半个小时卑微签到
J题
输入
3
12 1
101 9
991 1
输出
22
11
2
题目意思就是让你先把输入的数组倒过来比如1234–>4321,然后再做加法再倒回来输出
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
ll tr(ll a)
{
ll da = 0;
int index = 0;
while(a != 0)
{
da = da*10 + a%10;
a /= 10;
}
return da;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
ll a,b,aa,bb,ans,res;
scanf("%lld %lld",&a,&b);
// aa = tr(a);
// bb = tr(b);
ans = tr(a) + tr(b);
res = tr(ans);
printf("%lld\n",res);
}
return 0;
}