12842 튀김 소보루 [미완]

모르겠다!

 

다음에 보자 튀소! 

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()
#define MAXV 10000005

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;

int     main()
{
    int n, s, m;
    scanf("%d %d %d", &n, &s, &m);

    vector<int> vm(m + 1);
    for (int i = 1; i <= m; i++)
        scanf("%d", &vm[i]);

    vector<int> time[1005];

    for (int i = 1; i <= vm.size(); i++)
    {
        time[0].push_back(i);
        for (int j = 1; j < 1005; j++)
        {
            if (vm[i] % j == 0)
                time[j].push_back(i);
        }
    }

    int last = n - s;
    int count = 1;
    for (int i = 0; i < 1005; i++)
    {
        for (int j = 0; j < time[i].size(); j++, count++)
        {
            if (count == last)
                printf("%d\n", time[i][j]);
        }
    }

    return 0;
}