/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 532.0 KiB
#2 Accepted 3ms 532.0 KiB
#3 Accepted 19ms 540.0 KiB
#4 Accepted 18ms 532.0 KiB
#5 Accepted 19ms 532.0 KiB
#6 Accepted 19ms 320.0 KiB
#7 Accepted 19ms 328.0 KiB
#8 Accepted 29ms 532.0 KiB
#9 Accepted 41ms 532.0 KiB
#10 Accepted 81ms 532.0 KiB
#11 Accepted 293ms 320.0 KiB
#12 Accepted 299ms 320.0 KiB
#13 Accepted 141ms 320.0 KiB
#14 Accepted 149ms 544.0 KiB
#15 Accepted 154ms 320.0 KiB
#16 Accepted 169ms 320.0 KiB
#17 Accepted 152ms 532.0 KiB
#18 Accepted 167ms 532.0 KiB
#19 Accepted 153ms 532.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 2e5 + 3, mod = 1e9 + 7;

int32_t main()
{

    //fast
    w(t)
    {
        int n;
        cin >> n;
        int ar[n + 1];
        for(int i = 1; i <= n; i++)cin >> ar[i];
        int mx = 0;
        for(int i = 1; i <= 100; i++)
        {
            for(int j = i; j <= 100; j++)
            {
                int x = 0, y = 0, z = 0;
                for(int k = 1; k <= n; k++)
                {
                    if(ar[k] % i == 0 and ar[k] % j == 0)z++;
                    else if(ar[k] % i == 0)x++;
                    else if(ar[k] % j == 0)y++;
                }
                int cnt = max(0, (n + 1) / 2 - x);
                int tnc = max(0, n / 2 - y);
                if(cnt + tnc == z)mx = max(mx, i + j);
                cnt = max(0, n / 2 - x), tnc = max(0, (n + 1) / 2 - y);
                if(tnc + cnt == z)mx = max(mx, i + j);
            }
        }
        cout << mx << endl;
    }
}

Information

Submit By
Type
Submission
Problem
P1076 Even Odd GCD (Easy Version)
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-09 14:31:48
Judged At
2024-11-11 02:22:32
Judged By
Score
100
Total Time
299ms
Peak Memory
544.0 KiB