Submission #18011621


Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <cassert>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <numeric>
#include <iomanip>
//#include "atcoder/all"
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, n) for(int i=0;i<(n);i++)
#define P pair<int,int>
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
/*
namespace ori{
    template <typename T>
    void erase(std::vector<T> &v)
    {
        std::sort(v.begin(),v.end());
        v.erase(std::unique(v.begin(),v.end()),v.end());
        return;
    }

    template<typename T>
    int find_index(std::vector<T> v, T find, string key)
    {
        std::sort(v.begin(),v.end());
        if(key=="left")
        {
            return (std::distance(v.begin(),lower_bound(v.begin(),v.end(),find)));
        }
        if(key=="right")
        {
            return (std::distance(v.begin(),upper_bound(v.begin(),v.end(),find))-1);
        }
        else
        {
            return -1;
        }
    }
}
 */

vector<string> split(const string &s, char delim) {
    vector<string> elems;
    stringstream ss(s);
    string item;
    while (getline(ss, item, delim)) {
        if (!item.empty()) {
            elems.push_back(item);
        }
    }
    return elems;
}


const int x8[] = {0, 0, 1, -1, -1, 1, -1, 1};
const int y8[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int x4[] = {1, -1, 0, 0};
const int y4[] = {0, 0, -1, 1};
const int MOD = 1000000007;


void task()
{
    int n; cin >> n;
    vector<int> g(1001);
    rep(i,n){
        int a; cin >> a;
        for(int j = 2; j<=a;++j){
            if(a % j != 0) continue;
            g[j]++;
        }
    }
    int val = 0,ans;
    rep(i,1001){
        val = max(val,g[i]);
        if(val==g[i]) ans = i;
    }
    cout << ans  << endl;
}




int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    task();
    return 0;
}

Submission Info

Submission Time
Task B - Almost GCD
User udonman
Language C++ (GCC 9.2.1)
Score 200
Code Size 2356 Byte
Status AC
Exec Time 6 ms
Memory 3620 KiB

Compile Error

./Main.cpp: In function ‘void task()’:
./Main.cpp:97:13: warning: ‘ans’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   97 |     cout << ans  << endl;
      |             ^~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All answer_based_00.txt, answer_based_01.txt, answer_based_02.txt, answer_based_03.txt, answer_based_04.txt, handmade_00.txt, handmade_01.txt, handmade_02.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, same_00.txt, same_01.txt, same_02.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
answer_based_00.txt AC 6 ms 3520 KiB
answer_based_01.txt AC 2 ms 3592 KiB
answer_based_02.txt AC 2 ms 3480 KiB
answer_based_03.txt AC 4 ms 3592 KiB
answer_based_04.txt AC 2 ms 3520 KiB
handmade_00.txt AC 2 ms 3516 KiB
handmade_01.txt AC 2 ms 3556 KiB
handmade_02.txt AC 2 ms 3520 KiB
random_00.txt AC 3 ms 3424 KiB
random_01.txt AC 1 ms 3520 KiB
random_02.txt AC 2 ms 3524 KiB
random_03.txt AC 2 ms 3564 KiB
random_04.txt AC 2 ms 3588 KiB
same_00.txt AC 2 ms 3424 KiB
same_01.txt AC 3 ms 3620 KiB
same_02.txt AC 4 ms 3452 KiB
sample_01.txt AC 2 ms 3616 KiB
sample_02.txt AC 2 ms 3596 KiB
sample_03.txt AC 2 ms 3524 KiB