Submission

Score: 0

User: Karatat007

Problemset: Abacus

Language: cpp

Time: 0.052 second

Submitted On: 2026-10-14 14:13:22

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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    ll arx[n+10];
    ll arv[n+10];
    ll jack = 0;
    ll jun = 0;
    for(int i = 0;i < n;++i){
        cin >> arx[i];
    }
    for(int i = 0;i < n;++i){
        cin >> arv[i];
    }
    bool turn = true;
    for(ll i = 0;i < n;++i){
        if(__gcd(__gcd(arx[i],arv[i]),i+1) > 1){
            if(turn){
                jack += arv[i];
                turn = !turn;
            }
            else{
                jun += arv[i];
                turn = !turn;
            }
        }
    }
    if(jack > jun) cout << "JACK" << '\n';
    else if(jack < jun) cout << "JUN" << '\n';
    else cout << "TIE" << '\n';
    cout << jack << ' ' << jun;
}