Warm up 16 Choosing Numbers

Choosing Numbers

Time Limit: 10000ms, Special Time Limit:25000ms, Memory Limit:65536KB

Total submit users: 43, Accepted users: 39

Problem 12780 : No special judgement

Problem description

是这个argest，我TM左认右认都认不出来啊，你TM的去泰国做个手术看我能不能认出来！

You regularly play a game with friends, and you’re tired of losing. The goal of the game is to end up with the largest number in your hand at the end. Initially there is a set of unique numbers on the table. At each turn, a player chooses a number from the table and puts it in his hand. Seems simple, right? However, you may be required to discard numbers in your hand. During the game, each number can either be on the table, in a player’s hand, or in a discard pile. When a player chooses a number x from the table, x is compared with all other numbers y that are not on the table (including other players’ hands, your own hand, and those in the discard pile). If x and y have a common factor greater than 1, both are moved to (or remain in) the discard pile. The game ends when all numbers have been chosen from the table.

Input

Each input line describes the set of numbers on the table at the beginning of a game. The line begins with a number 1 ≤ n ≤ 1000. Following this are n unique positive integers, all in the range [2, 2 × 10^9]. These are the n numbers that are initially on the table. There are at most 1000 games in the input. Input ends at end of file.

Output

For each game print the number x from the table such that choosing x guarantees you win the game. Each game given has a unique winning number.

Sample Input

Sample Input 1
2 4 7
4 4 8 15 16
4 2 3 4 8

Sample Output

Sample Output 1
7
15
3

Problem Source

HNU Contest 

Submit   Discuss   Judge Status  Problems  Ranklist 

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 1305
#define ll long long
#define mod 1000000007
#define INF 0x7fffffff
#define eps 1e-8
int n, m;
ll gcd(ll n, ll m){ return m ? gcd(m, n%m) : n; }
ll a[maxn];
int vis[maxn];
int main(){
    /*int t;
    scanf("%d", &t);
    while (t--){
    scanf("%I64d", &n);

    }*/
    ll x, y, x1, x2, y1, y2, s1, s2;
    while (scanf("%d", &n) != EOF){
        for (int i = 0; i<n; i++)scanf("%I64d", &a[i]);
        int flag = 0;
        memset(vis, 0, sizeof vis);
        ll ma = -INF;
        sort(a, a + n);
        for (int i = n - 1; i >= 0; i--){
            int t = 0;
            if (!vis[i]){
                for (int j = 0; j < n; j++)
                if (i != j){
                    if (gcd(a[i], a[j]) == 1)t++;
                    else vis[j] = 1;
                }
                if (t == n - 1){printf("%I64d\n", a[i]); break;}
                else vis[i] = 1;
            }
        }
    }
    return 0;
}