Submission #20,591

20591

2026-01-07 18:38:33

cpp17

Partially correct 49/50

43ms

1072 KiB

#include <iostream>
#include <vector>
#include <map>
#include <bits/stdc++.h> //igy nem kell a tobbi
using namespace std;

int main()
{
    int m, a, b, n, k;
    long long x;
    cin >> m >> x >> a >> b >> n >> k;
    vector <int> v(n);
    map <int, int> tav;
    int hat = pow(10,m);
    int mintav = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        x = x * a + b;
        x = (x / hat) % (hat * hat);
        v[i] = x;
        if (tav.count(x))
        {
            if (mintav > i - tav[x])
            {
                mintav = i - tav [x];
            }
        }
        tav[x] = i;
    }

    sort(v.begin(), v.end() -1);
    cout << mintav << endl;
    cout << v[n - k];
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	49/50
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	37ms	820 KiB
		3	Partially correct	1/2	1ms	508 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	4/4	2ms	540 KiB
		9	Accepted	4/4	4ms	552 KiB
		10	Accepted	4/4	7ms	480 KiB
		11	Accepted	4/4	7ms	748 KiB
		12	Accepted	4/4	14ms	708 KiB
		13	Accepted	4/4	14ms	856 KiB
		14	Accepted	4/4	32ms	1064 KiB
		15	Accepted	4/4	13ms	864 KiB
		16	Accepted	4/4	41ms	1072 KiB
		17	Accepted	4/4	43ms	820 KiB