跳转至

十六届 JavaB 组暴力

第一题

逃离高塔

5分 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    int ans=0;
    for(int i=1;i<=2025;i++){
        if(1ll*i*i*i%10==3) ans++;
    }
    cout<<ans;
    return 0;
}

import java.util.*;

public class Main {

    public static void main(String[] args){
        int ans=0;
        for(int i=1;i<=2025;i++){
            if((long)i*i*i%10==3) ans++;
        }
        System.out.println(ans);
    }

}

ans=0
for i in range(1,2026):
    if i*i*i%10==3:
        ans+=1
print(ans)

第二题

消失的蓝宝

5分 
#include<iostream>
using namespace std;
typedef long long ll;

int main(){
    ll n=20240413;
    for(ll i=1;;i++){
        ll N=i*n-9999;
        if((N+20240413)%20250412==0){
            cout<<N;
            break;
        }
    }
    return 0;
}

import java.util.*;

public class Main {

    public static void main(String[] args){
        long n=20240413;
        for(long i=1;;i++){
            long N=i*n-9999;
            if((N+20240413)%20250412==0){
                System.out.println(N);
                break;
            }
        }
    }

}

n=20240413
i=1

while True:
    N=i*n-9999
    if (N+20240413)%20250412==0:
        print(N)
        break
    i+=1

第三题

电池分组

10分 
#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int a[N],n;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin>>T;
    while(T--){
        cin>>n;
        int sum=0;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            sum^=a[i];
        }
        if(sum==0) cout<<"YES\n";
        else cout<<"NO\n";
    }
    return 0;
}

import java.util.*;

public class Main {

    static final int N=1010;
    static int[] a=new int[N];

    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int T=sc.nextInt();
        while(T-->0){
            int n=sc.nextInt();
            int sum=0;
            for(int i=1;i<=n;i++){
                a[i]=sc.nextInt();
                sum^=a[i];
            }
            if(sum==0) System.out.println("YES");
            else System.out.println("NO");
        }
    }

}

import sys
input=sys.stdin.readline

T=int(input())
while T:
    T-=1
    n=int(input())
    a=list(map(int,input().split()))
    s=0
    for x in a:
        s^=x
    if s==0:
        print("YES")
    else:
        print("NO")

第四题

魔法科考试

10分 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=4e4+10;

bool st[N];
int n,m;
int a[N],b[N];
int cnt[N];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    for(int i=2;i<=40000;i++){
        if(st[i]) continue;
        for(int j=i+i;j<=40000;j+=i){
            st[j]=true;
        }
    }

    cin>>n>>m;

    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=m;i++) cin>>b[i];

    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a[i]+b[j]<=n+m && !st[a[i]+b[j]]){
                cnt[a[i]+b[j]]=1;
            }
        }
    }

    int ans=0;

    for(int i=2;i<=n+m;i++){
        if(cnt[i]){
            ans++;
        }
    }

    cout<<ans;
    return 0;
}

import java.util.*;

public class Main {

    static final int N = 40010;
    static boolean[] st = new boolean[N];
    static int[] a = new int[N];
    static int[] b = new int[N];
    static int[] cnt = new int[N];

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        for(int i=2;i<=40000;i++){
            if(st[i]) continue;
            for(int j=i+i;j<=40000;j+=i){
                st[j]=true;
            }
        }

        int n=sc.nextInt();
        int m=sc.nextInt();

        for(int i=1;i<=n;i++) a[i]=sc.nextInt();
        for(int i=1;i<=m;i++) b[i]=sc.nextInt();

        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                int s=a[i]+b[j];
                if(s<=n+m && !st[s]){
                    cnt[s]=1;
                }
            }
        }

        int ans=0;

        for(int i=2;i<=n+m;i++){
            if(cnt[i]!=0){
                ans++;
            }
        }

        System.out.println(ans);
    }
}

N=40010

st=[False]*N
a=[0]*N
b=[0]*N
cnt=[0]*N

for i in range(2,40001):
    if st[i]:
        continue
    j=i+i
    while j<=40000:
        st[j]=True
        j+=i

n,m=map(int,input().split())

arr=list(map(int,input().split()))
for i in range(n):
    a[i+1]=arr[i]

arr=list(map(int,input().split()))
for i in range(m):
    b[i+1]=arr[i]

for i in range(1,n+1):
    for j in range(1,m+1):
        s=a[i]+b[j]
        if s<=n+m and not st[s]:
            cnt[s]=1

ans=0
for i in range(2,n+m+1):
    if cnt[i]:
        ans+=1

print(ans)

第六题

数组翻转

3分 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;

int a[N],b[N],n;

void reverse(int l,int r){
    while(l<r){
        int t=a[l];
        a[l]=a[r];
        a[r]=t;
        l++;
        r--;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin>>n;

    for(int i=1;i<=n;i++){
        cin>>a[i];
        b[i]=a[i];
    }

    ll ans=0;

    for(int l=1;l<=n;l++){
        for(int r=l;r<=n;r++){

            reverse(l,r);

            int pre=a[1],cnt=1;

            for(int k=2;k<=n;k++){
                if(a[k]==a[k-1]){
                    cnt++;
                }else{
                    ans=max(ans,1ll*pre*cnt);
                    pre=a[k];
                    cnt=1;
                }
            }

            ans=max(ans,1ll*pre*cnt);

            for(int k=1;k<=n;k++) a[k]=b[k];
        }
    }

    cout<<ans;

    return 0;
}

import java.util.*;

public class Main {

    static final int N = 1000010;
    static int[] a = new int[N];
    static int[] b = new int[N];
    static int n;

    static void reverse(int l,int r){
        while(l<r){
            int t=a[l];
            a[l]=a[r];
            a[r]=t;
            l++;
            r--;
        }
    }

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        n=sc.nextInt();

        for(int i=1;i<=n;i++){
            a[i]=sc.nextInt();
            b[i]=a[i];
        }

        long ans=0;

        for(int l=1;l<=n;l++){
            for(int r=l;r<=n;r++){

                reverse(l,r);

                int pre=a[1],cnt=1;

                for(int k=2;k<=n;k++){
                    if(a[k]==a[k-1]){
                        cnt++;
                    }else{
                        ans=Math.max(ans,1L*pre*cnt);
                        pre=a[k];
                        cnt=1;
                    }
                }

                ans=Math.max(ans,1L*pre*cnt);

                for(int k=1;k<=n;k++) a[k]=b[k];
            }
        }

        System.out.println(ans);
    }
}

import sys
input=sys.stdin.readline

n=int(input())
a=[0]+list(map(int,input().split()))
b=a[:]

def reverse(l,r):
    while l<r:
        a[l],a[r]=a[r],a[l]
        l+=1
        r-=1

ans=0

for l in range(1,n+1):
    for r in range(l,n+1):

        reverse(l,r)

        pre=a[1]
        cnt=1

        for k in range(2,n+1):
            if a[k]==a[k-1]:
                cnt+=1
            else:
                ans=max(ans,pre*cnt)
                pre=a[k]
                cnt=1

        ans=max(ans,pre*cnt)

        for k in range(1,n+1):
            a[k]=b[k]

print(ans)
15分 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;

int a[N],n;
int m1[N],m2[N]; // m1[i] 表示数字 i 的连续段最大长度，m2[i] 次大

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin>>n;

    for(int i=1;i<=n;i++){
        cin>>a[i];
    }

    ll ans=0;

    int pre=a[1],cnt=1;

    for(int i=2;i<=n;i++){
        if(a[i]==a[i-1]){
            cnt++;
        }else{

            if(cnt>=m1[pre]){
                m2[pre]=m1[pre];
                m1[pre]=cnt;
            }else if(cnt>m2[pre]){
                m2[pre]=cnt;
            }

            pre=a[i];
            cnt=1;
        }
    }

    if(cnt>=m1[pre]){
        m2[pre]=m1[pre];
        m1[pre]=cnt;
    }else if(cnt>m2[pre]){
        m2[pre]=cnt;
    }

    for(int i=1;i<=1000000;i++){
        ans=max(ans,1ll*i*(m1[i]+m2[i]));
    }

    cout<<ans;

    return 0;
}

import java.util.*;

public class Main {

    static final int N = 1000010;
    static int[] a = new int[N];
    static int[] m1 = new int[N];
    static int[] m2 = new int[N];
    static int n;

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();

        for(int i=1;i<=n;i++){
            a[i] = sc.nextInt();
        }

        long ans = 0;

        int pre = a[1], cnt = 1;

        for(int i=2;i<=n;i++){
            if(a[i]==a[i-1]){
                cnt++;
            }else{

                if(cnt>=m1[pre]){
                    m2[pre]=m1[pre];
                    m1[pre]=cnt;
                }else if(cnt>m2[pre]){
                    m2[pre]=cnt;
                }

                pre=a[i];
                cnt=1;
            }
        }

        if(cnt>=m1[pre]){
            m2[pre]=m1[pre];
            m1[pre]=cnt;
        }else if(cnt>m2[pre]){
            m2[pre]=cnt;
        }

        for(int i=1;i<=1000000;i++){
            ans=Math.max(ans,1L*i*(m1[i]+m2[i]));
        }

        System.out.println(ans);
    }
}

import sys
input=sys.stdin.readline

N=1000010

a=[0]*N
m1=[0]*N
m2=[0]*N

n=int(input())
arr=list(map(int,input().split()))

for i in range(n):
    a[i+1]=arr[i]

ans=0

pre=a[1]
cnt=1

for i in range(2,n+1):
    if a[i]==a[i-1]:
        cnt+=1
    else:
        if cnt>=m1[pre]:
            m2[pre]=m1[pre]
            m1[pre]=cnt
        elif cnt>m2[pre]:
            m2[pre]=cnt
        pre=a[i]
        cnt=1

if cnt>=m1[pre]:
    m2[pre]=m1[pre]
    m1[pre]=cnt
elif cnt>m2[pre]:
    m2[pre]=cnt

for i in range(1,1000001):
    ans=max(ans,i*(m1[i]+m2[i]))

print(ans)

第七题

2的幂

3分 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N=510;

int n,k;
int a[N];
int ans=0x3f3f3f3f;

int calc(int x){
    int res=0;
    while(x%2==0){
        res++;
        x/=2;
    }
    return res;
}

void dfs(int u,int m2,int sum){
    if(sum>=ans){
        return;
    }

    if(m2>=k){
        ans=min(ans,sum);
    }

    if(u==n+1){
        return;
    }

    for(int i=a[u];i<=100000;i++){
        dfs(u+1,m2+calc(i),sum+i-a[u]);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin>>n>>k;

    for(int i=1;i<=n;i++){
        cin>>a[i];
    }

    dfs(1,0,0);

    cout<<ans;

    return 0;
}

import java.util.*;

public class Main {

    static final int N=510;

    static int n,k;
    static int[] a=new int[N];
    static int ans=0x3f3f3f3f;

    static int calc(int x){
        int res=0;
        while(x%2==0){
            res++;
            x/=2;
        }
        return res;
    }

    static void dfs(int u,int m2,int sum){
        if(sum>=ans){
            return;
        }

        if(m2>=k){
            ans=Math.min(ans,sum);
        }

        if(u==n+1){
            return;
        }

        for(int i=a[u];i<=100000;i++){
            dfs(u+1,m2+calc(i),sum+i-a[u]);
        }
    }

    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);

        n=sc.nextInt();
        k=sc.nextInt();

        for(int i=1;i<=n;i++){
            a[i]=sc.nextInt();
        }

        dfs(1,0,0);

        System.out.println(ans);
    }
}

import sys
input=sys.stdin.readline

n,k=map(int,input().split())
a=[0]+list(map(int,input().split()))

ans=10**18

def calc(x):
    res=0
    while x%2==0:
        res+=1
        x//=2
    return res

def dfs(u,m2,sumv):
    global ans

    if sumv>=ans:
        return

    if m2>=k:
        ans=min(ans,sumv)

    if u==n+1:
        return

    for i in range(a[u],100001):
        dfs(u+1,m2+calc(i),sumv+i-a[u])

dfs(1,0,0)

print(ans)

第八题

研发资源分配

3分 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N=1e5+10;
int a[N], b[N], n;
bool st[N];
ll ans=0;

void dfs(int u){
    if(u==n+1){
        ll sum=0;
        for(int i=1;i<=n;i++){
            if(a[i]>b[i]) sum+=i;
            else if(a[i]<b[i]) sum-=i;
        }
        ans=max(sum, ans); 
        return;
    }
    for(int i=1;i<=n;i++){
        if(st[i]) continue;
        st[i]=true;
        a[u]=i;
        dfs(u+1);
        st[i]=false;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin>>n;
    for(int i=1;i<=n;i++) cin>>b[i];

    dfs(1);

    cout<<ans;
    return 0;
}

import java.util.*;

public class Main {
    static final int N = 100010;
    static int[] a = new int[N], b = new int[N];
    static boolean[] st = new boolean[N];
    static int n;
    static long ans = 0;

    static void dfs(int u){
        if(u==n+1){
            long sum=0;
            for(int i=1;i<=n;i++){
                if(a[i]>b[i]) sum+=i;
                else if(a[i]<b[i]) sum-=i;
            }
            ans=Math.max(ans,sum);
            return;
        }
        for(int i=1;i<=n;i++){
            if(st[i]) continue;
            st[i]=true;
            a[u]=i;
            dfs(u+1);
            st[i]=false;
        }
    }

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        for(int i=1;i<=n;i++) b[i] = sc.nextInt();
        dfs(1);
        System.out.println(ans);
    }
}

import sys
input = sys.stdin.readline

n = int(input())
b = [0] + list(map(int,input().split()))
a = [0]*(n+1)
st = [False]*(n+1)
ans = -10**18

def dfs(u):
    global ans
    if u==n+1:
        sumv = 0
        for i in range(1,n+1):
            if a[i]>b[i]:
                sumv += i
            elif a[i]<b[i]:
                sumv -= i
        ans = max(ans,sumv)
        return
    for i in range(1,n+1):
        if st[i]: continue
        st[i] = True
        a[u] = i
        dfs(u+1)
        st[i] = False

dfs(1)
print(ans)
20分 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N=1e5+10;
struct node{
    int x,id;
}b[N]; 
ll s[N];
int n;

bool cmp(const node &x,const node &y){
    return x.x<y.x;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>b[i].x;
        b[i].id=i;
    }
    sort(b+1,b+n+1,cmp);
    for(int i=1;i<=n;i++) s[i]=s[i-1]+b[i].id;

    ll ans=0;
    for(int i=n;i>=1;i--){
        ans=max(ans,-b[i].id+s[i-1]);
    }
    cout<<ans;
    return 0; 
}

import java.util.*;

public class Main {
    static class Node {
        int x, id;
        Node(int x, int id){
            this.x=x; this.id=id;
        }
    }
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Node[] b = new Node[n+1];
        long[] s = new long[n+1];
        for(int i=1;i<=n;i++){
            int x = sc.nextInt();
            b[i] = new Node(x,i);
        }
        Arrays.sort(b, 1, n+1, (a,b1)->Integer.compare(a.x,b1.x));
        for(int i=1;i<=n;i++) s[i]=s[i-1]+b[i].id;
        long ans=0;
        for(int i=n;i>=1;i--){
            ans=Math.max(ans,-b[i].id+s[i-1]);
        }
        System.out.println(ans);
    }
}

n = int(input())
b = [(0,0)] + [(int(x),i+1) for i,x in enumerate(input().split())]
b = [b[0]] + sorted(b[1:], key=lambda x:x[0])
s = [0]*(n+1)
for i in range(1,n+1):
    s[i] = s[i-1]+b[i][1]
ans = 0
for i in range(n,0,-1):
    ans = max(ans, -b[i][1]+s[i-1])
print(ans)