链接: 传送门.
A
0的个数有1e6 所以不能直接比,分类讨论,注意细节就好,如果一个数小于另外一个数且0的个数又比它大,看他消耗多少个0能比它大,且剩下的个数0合法
void solve(){
scanf("%d%d%d%d",&x1,&p1,&x2,&p2);
if(x1==x2){
if(p1==p2) {
puts("=");return ;
}else if(p1>p2){
puts(">");return ;
}else{
puts("<");return ;
}
}else if(x1>x2){
if(p1>=p2){
puts(">");return;
}else{
int cnt =0;
while(x2<x1){
cnt++;
x2*=10;
}
p2-=cnt;
if(p2>p1){
puts("<");return;
}else if(p2==p1){
if(x1==x2){
puts("=");return;
}else{
puts("<");return;
}
}else{
puts(">");return;
}
}
}else if(x1<x2){
if(p1<=p2){
puts("<");return;
}else{
int cnt =0;
while(x1<x2){
cnt++;
x1*=10;
}
p1-=cnt;
if(p1>p2){
puts(">");return;
}else if(p1==p2){
if(x1==x2){
puts("=");return;
}else{
puts(">");return;
}
}else{
puts("<");return;
}
}
}
}
B
找到n/2对,去重,然后双指针找符合条件的就行,个数足够了,就退出
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+9;
int n,a[N],vis[1000009];
void solve(){
memset(vis,0,sizeof vis);
scanf("%d",&n);
for(int i = 0;i<n;i++) scanf("%d",&a[i]);
sort(a,a+n);
int len = unique(a,a+n)-a;
for(int i = 0;i < len;i++) vis[a[i]] = 1;
int ok = n/2,f = 0;
for(int i = 0;i<len;i++){
int j = i+1;
while(j<len&&!vis[a[j]%a[i]]){
f++;
printf("%d %d\n",a[j],a[i]);
if(f==ok) return;
j++;
}
i = j;
}
}
signed main()
{
int t;scanf("%d",&t);
while(t--) solve();
return 0;
}
C
二分就好,记得long long
我define 了long long ,但是我下面那个t案例忘改了,。。。一直t
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e3 + 9;
int n, h, a[N];
bool check(int k) {
int ok = 0;
for(int i = 1; i <= n - 1; i++) {
if(a[i + 1] - a[i] >= k) ok += k;
else ok += a[i + 1] - a[i];
}
ok += k;
//cout<<ok<<endl;
if(ok >= h)return true;
return false;
}
void solve() {
scanf("%lld%lld", &n, &h);
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
int l = 1,r = h;
while(l<r){
int mid = l+r>>1;
if(check(mid)) r = mid;
else l = mid+1;
}
printf("%lld\n",l);
}
signed main() {
int t;
scanf("%lld", &t);
while(t--) solve();
return 0;
}