22772023-01-09 11:49:46rennKazamatacpp11Accepted 40/4043ms4456 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    
    vector<bool> kulcsok(n, false);
    vector<int> szobak(n);
    
    int inditasok = 0;
    int index = 0;
    
    for(int i = 0; i < n; i++)
    {
        cin >> szobak[i];
    }
    
    int i;
    int kulcs;
    
    while(index < n-1)
    {
        for(i = 0; i < n-1; i++)
        {
            kulcs = (szobak[i]+inditasok)%n;
            if(!kulcsok[kulcs])
            {
                kulcsok[kulcs] = true;
            }
            
            if(!kulcsok[i])
            {
                inditasok++;
                break;
            }
        }
        index = i;
    }
    
    cout << inditasok << endl;
    
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1812 KiB
2Accepted0/020ms2468 KiB
3Accepted2/22ms2324 KiB
4Accepted2/22ms2396 KiB
5Accepted2/22ms2384 KiB
6Accepted2/22ms2580 KiB
7Accepted2/22ms2792 KiB
8Accepted2/22ms3020 KiB
9Accepted2/22ms3008 KiB
10Accepted2/22ms3008 KiB
11Accepted2/241ms3836 KiB
12Accepted2/241ms3912 KiB
13Accepted2/241ms4036 KiB
14Accepted2/241ms4264 KiB
15Accepted2/239ms4204 KiB
16Accepted2/241ms4332 KiB
17Accepted2/239ms4324 KiB
18Accepted2/241ms4320 KiB
19Accepted2/239ms4324 KiB
20Accepted2/241ms4448 KiB
21Accepted2/239ms4452 KiB
22Accepted2/243ms4456 KiB