CSES - Aalto Competitive Programming 2026 - wk3 - Mon

Submission details
Task:	Wario Kart I
Sender:	aalto26cm_030
Submission time:	2026-09-14 16:31:28 +0300
Language:	C++ (C++20)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.00 s	details
#7	ACCEPTED	0.00 s	details
#8	ACCEPTED	0.00 s	details
#9	ACCEPTED	0.00 s	details
#10	ACCEPTED	0.00 s	details
#11	ACCEPTED	0.00 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.00 s	details
#15	ACCEPTED	0.00 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.00 s	details
#18	ACCEPTED	0.00 s	details
#19	ACCEPTED	0.00 s	details
#20	ACCEPTED	0.00 s	details
#21	ACCEPTED	0.00 s	details
#22	ACCEPTED	0.00 s	details
#23	ACCEPTED	0.00 s	details
#24	ACCEPTED	0.00 s	details
#25	ACCEPTED	0.00 s	details
#26	ACCEPTED	0.00 s	details
#27	ACCEPTED	0.00 s	details
#28	ACCEPTED	0.00 s	details
#29	ACCEPTED	0.00 s	details
#30	ACCEPTED	0.00 s	details
#31	ACCEPTED	0.00 s	details
#32	ACCEPTED	0.00 s	details
#33	ACCEPTED	0.00 s	details
#34	ACCEPTED	0.00 s	details
#35	ACCEPTED	0.00 s	details
#36	ACCEPTED	0.00 s	details
#37	ACCEPTED	0.00 s	details
#38	ACCEPTED	0.00 s	details
#39	ACCEPTED	0.00 s	details
#40	ACCEPTED	0.00 s	details
#41	ACCEPTED	0.00 s	details
#42	ACCEPTED	0.00 s	details
#43	ACCEPTED	0.00 s	details
#44	ACCEPTED	0.00 s	details
#45	ACCEPTED	0.00 s	details
#46	ACCEPTED	0.00 s	details
#47	ACCEPTED	0.00 s	details
#48	ACCEPTED	0.00 s	details
#49	ACCEPTED	0.00 s	details
#50	ACCEPTED	0.00 s	details
#51	ACCEPTED	0.00 s	details
#52	ACCEPTED	0.00 s	details
#53	ACCEPTED	0.00 s	details
#54	ACCEPTED	0.00 s	details
#55	ACCEPTED	0.00 s	details
#56	ACCEPTED	0.01 s	details
#57	ACCEPTED	0.00 s	details
#58	ACCEPTED	0.01 s	details
#59	ACCEPTED	0.00 s	details
#60	ACCEPTED	0.07 s	details
#61	ACCEPTED	0.07 s	details
#62	ACCEPTED	0.04 s	details
#63	ACCEPTED	0.04 s	details
#64	ACCEPTED	0.12 s	details
#65	ACCEPTED	0.02 s	details
#66	ACCEPTED	0.11 s	details
#67	ACCEPTED	0.01 s	details
#68	ACCEPTED	0.06 s	details
#69	ACCEPTED	0.01 s	details

Code

#include <iostream>
#include <vector>
#include <functional>


void printNewLine(){std::cout << "\n";}
template<typename T, typename... Ts>
std::tuple<Ts...> tail(std::tuple<T,Ts...> as){
    return std::apply([](T &a, Ts... b){return std::make_tuple(b...);},as);
}

template<typename T>
void print(T a){std::cout << a;}

template<typename T, typename Ts>
void print(std::tuple<T,Ts> a){
    print(std::get<0>(a));
    print(" ");
    print(std::get<1>(a));
}

template<typename T, typename... Ts>
void print(std::tuple<T,Ts...> a){
    print(std::get<0>(a));
    print(" ");
    print(tail(a));
}
template<typename T>
void println(T a){print(a);printNewLine();}
template<typename T>
void printVec(std::vector<T> arr, int width = -1){
    if (width == -1) width = arr.size();
    for (int i = 0; i < (int)arr.size(); i++){
        if ((i%width) == width-1){
            print(" ");
            println(arr[i]);
        }else if ((i%width) == 0){        
            print(arr[i]);
        }else {
            print(" ");
            print(arr[i]);
        }
    }    
}

std::tuple<int> readInt1(){
    int a;
    std::cin >> a;
    return {a};
}
std::tuple<int,int> readInt2(){
    int a, b;
    std::cin >> a >> b;
    return {a,b};
}
std::tuple<int,int,int> readInt3(){
    int a, b, c;
    std::cin >> a >> b >> c;
    return {a,b,c};
}

std::vector<int> readVecInt(int n){
    std::vector<int> arr(n);
    for (int i = 0; i < n; i++){
        int a;
        std::cin >> a;
        arr[i] = a;
    }
    return arr;
}

std::vector<std::tuple<int,int>> readVecTup2(int n){
    std::vector<std::tuple<int,int>> arr(n);
    for (int i = 0; i < n; i++){
        int a, b;
        std::cin >> a;
        std::cin >> b;
        arr[i] = {a,b};
    }
    return arr;
}

std::vector<std::tuple<int,int,int>> readVecTup3(int n){
    std::vector<std::tuple<int,int,int>> arr(n);
    for (int i = 0; i < n; i++){
        int a, b, c;
        std::cin >> a;
        std::cin >> b;
        std::cin >> c;
        arr[i] = {a,b,c};
    }
    return arr;
}

template<typename T>
auto getTupleSort(){
    auto tupleSort = [](const std::tuple<T,T> &a, const std::tuple<T,T> &b){ 
        auto [ax, ay] = a;
        auto [bx, by] = b;
        return ay < by; };
    return tupleSort;
}


template<typename T>
void sortBy(std::vector<T> &arr){
    std::sort(arr.begin(),arr.end(),[](const T &a, const T &b){ return a < b; });
}


template<typename T>
T binarySearch(T min, T max, std::function<bool(T)> leq){
    if (min == max) return max;
    T guess = (min+max)/2;
    if (leq(guess)){
        return binarySearch(min,guess,leq);
    }else{
        return binarySearch(guess+1,max,leq);
    }
}

template<typename T>
T binarySearchDecending(T min, T max, std::function<bool(T)> leq){
    std::function<bool(T)> gt = [leq](T x){
        return !leq(x);
    };
    return binarySearch(min,max+1, gt)-1;
}

void carManufacturing(){
    auto [n, t] = readInt2();
    //auto [n, m, k] = readInt3();
    auto arr = readVecInt(n);
    double s = 0;
    for (int x: arr){
        s += 1.0/x;
    }
    std::function<bool(long long)> leq = [&arr,t](long long time){
        long long s = 0;
        for (int x : arr){
            s += time/x;
        }
        return t <= s;
    };
    println(binarySearch((long long)0,(long long)(t/s*(long long)n),leq));
}

template<typename T>
double avg(std::vector<T> &arr){
    double mult = 1.0/arr.size();
    double s = 0;
    for (T x : arr){
        s += mult*(double)x;
    }
    return s;
}
template<typename T>
T sum(std::vector<T> &arr){
    T s = 0;
    for (T x : arr){
        s += x;
    }
    return s;
}

void bottle(){
    auto [n] = readInt1();
    //auto [n, t] = readInt2();
    //auto [n, m, k] = readInt3();
    auto arr = readVecInt(n);
    double s = avg(arr);
    
    std::function<bool(long long)> leq = [&arr](long long t){
        long long s = 0;
        for (long long x : arr){
            if (x-t > 0){
                s += (x-t)/2;
            }else{
                s += (x-t);
            }
        }
        return 0 <= s;
    };
    println(binarySearchDecending((long long)0,(long long)(s),leq));
}

#include <set>
#include <algorithm>
void movie(){
    auto [n] = readInt1();
    auto arr = readVecInt(2*n);
    int* s = &arr[0];
    std::sort((long*)(s),(long*)(s)+n);
    int time = 0;
    int num = 0;
    for (int i = 0; i < n; i++){
        if (time <= arr[2*i]){
            time = arr[2*i+1];
            num += 1;
        }
    }
    println(num);
}

/*

    for (int i = 0; i < n; i++){
        int temp = arr[2*i+1];
        arr[2*i+1] = arr[2*i];
        arr[2*i] = temp;
    }
        */

void cow(){
    auto [n] = readInt1();
    auto dum = readVecInt(n);
    print(1);
    for (int i = 1; i < 30; i++){
        print(" ");
        if ((1<<i) <= 1000*1000*1000){
            print(1<<i);
        } else{
            print(0);
        }
    }    
}
template<typename T>
std::vector<T> cloneVec(std::vector<T> a){
    return a;
}

void castle(){
    auto [n] = readInt1();
    auto arr = readVecTup2(n);
    std::vector<std::tuple<int,int>> arr2 = cloneVec(arr);
    for (int i = 0; i < n; i++){
        auto [u,m] = arr[i];
        arr2[i] = {-(u+m),i};
    }
    sortBy(arr2);
    int us = 0;
    int ms = 0;
    printVec(arr2);
    for (int i = 0; i < n; i++){
        auto [s,idx] = arr2[i];
        auto [u,m] = arr[idx];
        if (i%2 == 0){
            us += u;
        } else {
            ms += m;
        }
    }
    println(us-ms);
}

template<typename T>
void extendedFibonachi(std::vector<T> &initial, int nlast, T upto, T mod ){
    for (int i = nlast; i <= upto; i++){
        initial[i] = 0;
        for (int n = 1; n <= nlast && n <= i; n++){
            initial[i] += initial[i-n];
            initial[i] %=mod;
        }
    }
}

void dice(){
    auto [n] = readInt1();
    std::vector<long long> arr(std::max(7,n+1));
    arr[0] = 1;
    for (int i = 0; i < 6; i++){
        arr[i+1] = 1<<i;
    }
    extendedFibonachi(arr,6,(long long)n,(long long)1000*1000*1000+7);
    println(arr[n]);
}

template<typename T>
std::vector<T> padding(std::vector<T> &initial, T num, int start, int end){
    std::vector<T> arr(start+initial.size()+end);
    for (int i = 0; i < start; i++){
        arr[i] = num;
    }
    for (int i = 0; i < (int)initial.size(); i++){
        arr[start+i] = initial[i];
    }
    for (int i = 0; i < end; i++){
        arr[start+initial.size()+i] = num;
    }
    return arr;
}

template<typename T>
int findMax(int start, int end, std::function<T(int)> &maxHeuristic){
    T initialGuess = maxHeuristic(start);
    int index = start;
    for (int i = start; i <= end; i++){
        if (initialGuess < maxHeuristic(i)){
            initialGuess = maxHeuristic(i);
            index = i;
        }
    }
    return index;
}

template<typename T>
void operateOnMax(int start, int end, std::function<T(int)> &maxHeuristic, std::function<void(int)> &found){
    found(findMax(start,end,maxHeuristic));
}
#include <stack>

template<typename T>
void stackOperate(T init,std::function<std::vector<T>(T)> operate){
    std::stack<T> stack;
    stack.push(init);
    while (!stack.empty()){
        T next = stack.top();
        stack.pop();
        std::vector<T> nextSteps = operate(next);
        for (T a : nextSteps){
            stack.push(a);
        }
    }
}

template<typename T>
void recursiveVectorSplit(int start, int end, int distl, int distr, std::function<T(int)> &maxHeuristic, std::function<void(int)> &found){
    if (start == end){
        return found(start);
    }else if (end < start){
        return;
    }
    std::tuple<int,int> range = {start,end};
    std::function<std::vector<std::tuple<int,int>>(std::tuple<int,int>)> splitter = [distl, distr,&maxHeuristic,&found](std::tuple<int,int> range){
        auto [start,end] = range;
        int idx = findMax(start, end, maxHeuristic);
        found(idx);
        std::vector<std::tuple<int,int>> next;
        if (idx+distl+1 <= end){
            next.push_back({idx+distl+1,end});
        }
        if (start <= idx-distr-1){
            next.push_back({start, idx-distr-1});
        }
        return next;
    };
    stackOperate(range,splitter);
}

void cardGame(){
    auto [n] = readInt1();
    auto arr = readVecInt(n);
    arr[0] = 0;
    arr[arr.size()-1] = 0;
    //printVec(arr);
    arr = padding(arr,0,1,1);
    //printVec(arr);
    std::function<int(int)> heuristic = [&arr](int idx){
        return arr[idx]-arr[idx-1]-arr[idx-2]-arr[idx+1]-arr[idx+2];
    };
    long long sum = 0;
    std::function<void(int)> operate = [&arr, &sum](int idx){
        arr[idx-2] = 0;
        arr[idx-1] = 0;
        sum += arr[idx];
        arr[idx+1] = 0;
        arr[idx+2] = 0;
        //printVec(arr);
    };
    //printVec(arr);
    //println(arr[arr.size()-1-2]);
    recursiveVectorSplit(2,(int)arr.size()-1-2,2,2,heuristic,operate);
    println(sum);
}
void mariocart(){
    auto [n,m,k] = readInt3();
    auto arr = readVecInt(m);
    std::set<int> c;
    for (int a : arr){ c.emplace(a);}
    int position = 0;
    for (int i = 1; i <=k; i++){
        if (c.find(position) != c.end()){
            position += 2;
        } else {
            position += 1;
        }
        position %= n;
    }
    println(position*100);
}


int main() {
    //carManufacturing();
    //bottle();
    //movie();
    //cow();
    //castle();
    //dice();
    //cardGame();
    mariocart();

    exit(0);
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 0 1` view save

correct output
`0` view save

user output
`0` view save

Test 2

Verdict: ACCEPTED

input
`1 1 4 0` view save

correct output
`0` view save

user output
`0` view save

Test 3

Verdict: ACCEPTED

input
`2 1 9 0` view save

correct output
`0` view save

user output
`0` view save

Test 4

Verdict: ACCEPTED

input
`3 0 7` view save

correct output
`100` view save

user output
`100` view save

Test 5

Verdict: ACCEPTED

input
`3 2 14 0 2` view save

correct output
`100` view save

user output
`100` view save

Test 6

Verdict: ACCEPTED

input
`3 2 9 1 2` view save

correct output
`100` view save

user output
`100` view save

Test 7

Verdict: ACCEPTED

input
`4 4 19 0 1 2 3` view save

correct output
`200` view save

user output
`200` view save

Test 8

Verdict: ACCEPTED

input
`4 1 18 0` view save

correct output
`0` view save

user output
`0` view save

Test 9

Verdict: ACCEPTED

input
`4 4 9 0 1 2 3` view save

correct output
`200` view save

user output
`200` view save

Test 10

Verdict: ACCEPTED

input
`5 3 15 2 3 4` view save

correct output
`400` view save

user output
`400` view save

Test 11

Verdict: ACCEPTED

input
`5 2 25 3 4` view save

correct output
`100` view save

user output
`100` view save

Test 12

Verdict: ACCEPTED

input
`5 2 4 0 4` view save

correct output
`100` view save

user output
`100` view save

Test 13

Verdict: ACCEPTED

input
`5 3 1 1 3 4` view save

correct output
`100` view save

user output
`100` view save

Test 14

Verdict: ACCEPTED

input
`5 5 23 0 1 2 3 4` view save

correct output
`100` view save

user output
`100` view save

Test 15

Verdict: ACCEPTED

input
`5 1 1 4` view save

correct output
`100` view save

user output
`100` view save

Test 16

Verdict: ACCEPTED

input
`5 5 24 0 1 2 3 4` view save

correct output
`300` view save

user output
`300` view save

Test 17

Verdict: ACCEPTED

input
`5 0 5` view save

correct output
`0` view save

user output
`0` view save

Test 18

Verdict: ACCEPTED

input
`5 5 0 0 1 2 3 4` view save

correct output
`0` view save

user output
`0` view save

Test 19

Verdict: ACCEPTED

input
`5 0 9` view save

correct output
`400` view save

user output
`400` view save

Test 20

Verdict: ACCEPTED

input
`10 6 30 3 4 5 6 7 8` view save

correct output
`200` view save

user output
`200` view save

Test 21

Verdict: ACCEPTED

input
`10 4 50 0 1 7 9` view save

correct output
`100` view save

user output
`100` view save

Test 22

Verdict: ACCEPTED

input
`10 4 9 0 4 5 9` view save

correct output
`200` view save

user output
`200` view save

Test 23

Verdict: ACCEPTED

input
`10 6 3 1 2 4 5 7 8` view save

correct output
`400` view save

user output
`400` view save

Test 24

Verdict: ACCEPTED

input
`10 10 45 0 1 2 3 4 5 6 7 8 9` view save

correct output
`0` view save

user output
`0` view save

Test 25

Verdict: ACCEPTED

input
`10 2 2 2 8` view save

correct output
`200` view save

user output
`200` view save

Test 26

Verdict: ACCEPTED

input
`10 9 48 0 1 2 3 4 5 6 8 9` view save

correct output
`600` view save

user output
`600` view save

Test 27

Verdict: ACCEPTED

input
`10 0 11` view save

correct output
`100` view save

user output
`100` view save

Test 28

Verdict: ACCEPTED

input
`10 9 0 0 2 3 4 5 6 7 8 9` view save

correct output
`0` view save

user output
`0` view save

Test 29

Verdict: ACCEPTED

input
`10 0 18` view save

correct output
`800` view save

user output
`800` view save

Test 30

Verdict: ACCEPTED

input
`100 55 297 1 2 5 7 8 10 11 13 14 18 21 26...` view save

correct output
`6900` view save

user output
`6900` view save

Test 31

Verdict: ACCEPTED

input
`100 42 499 0 2 3 8 9 12 14 18 19 20 22 23...` view save

correct output
`400` view save

user output
`400` view save

Test 32

Verdict: ACCEPTED

input
`100 44 92 2 6 7 9 10 11 12 13 15 17 18 2...` view save

correct output
`3200` view save

user output
`3200` view save

Test 33

Verdict: ACCEPTED

input
`100 55 35 1 2 4 5 9 12 14 15 20 21 22 24...` view save

correct output
`5400` view save

user output
`5400` view save

Test 34

Verdict: ACCEPTED

input
`100 97 451 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`8300` view save

user output
`8300` view save

Test 35

Verdict: ACCEPTED

input
`100 22 27 8 18 20 24 29 35 36 39 44 48 5...` view save

correct output
`3200` view save

user output
`3200` view save

Test 36

Verdict: ACCEPTED

input
`100 90 474 0 2 3 4 5 6 8 9 10 11 12 13 14...` view save

correct output
`1200` view save

user output
`1200` view save

Test 37

Verdict: ACCEPTED

input
`100 7 113 30 31 43 45 72 77 97` view save

correct output
`1900` view save

user output
`1900` view save

Test 38

Verdict: ACCEPTED

input
`100 88 5 0 1 2 3 5 6 7 9 10 11 12 13 14...` view save

correct output
`900` view save

user output
`900` view save

Test 39

Verdict: ACCEPTED

input
`100 1 182 50` view save

correct output
`8400` view save

user output
`8400` view save

Test 40

Verdict: ACCEPTED

input
`200 110 593 2 3 4 7 11 12 14 17 19 20 21 2...` view save

correct output
`14100` view save

user output
`14100` view save

Test 41

Verdict: ACCEPTED

input
`200 83 998 0 3 5 6 7 11 14 16 17 18 19 20...` view save

correct output
`19600` view save

user output
`19600` view save

Test 42

Verdict: ACCEPTED

input
`200 87 185 5 13 15 16 19 21 23 25 26 29 3...` view save

correct output
`6600` view save

user output
`6600` view save

Test 43

Verdict: ACCEPTED

input
`200 110 70 3 4 5 8 10 12 13 14 15 17 18 2...` view save

correct output
`11000` view save

user output
`11000` view save

Test 44

Verdict: ACCEPTED

input
`200 194 901 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`16700` view save

user output
`16700` view save

Test 45

Verdict: ACCEPTED

input
`200 44 55 2 16 17 18 22 23 31 37 40 41 4...` view save

correct output
`6800` view save

user output
`6800` view save

Test 46

Verdict: ACCEPTED

input
`200 179 948 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`17200` view save

user output
`17200` view save

Test 47

Verdict: ACCEPTED

input
`200 15 227 3 14 17 52 53 61 63 83 87 91 1...` view save

correct output
`4400` view save

user output
`4400` view save

Test 48

Verdict: ACCEPTED

input
`200 175 11 0 1 2 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`2100` view save

user output
`2100` view save

Test 49

Verdict: ACCEPTED

input
`200 2 364 99 100` view save

correct output
`16600` view save

user output
`16600` view save

Test 50

Verdict: ACCEPTED

input
`1000 549 2964 0 4 9 11 12 13 15 16 18 19 20 ...` view save

correct output
`60800` view save

user output
`60800` view save

Test 51

Verdict: ACCEPTED

input
`1000 417 4986 0 2 4 8 9 11 12 13 15 18 19 21...` view save

correct output
`6600` view save

user output
`6600` view save

Test 52

Verdict: ACCEPTED

input
`1000 436 925 0 1 2 4 5 8 9 10 13 16 18 25 2...` view save

correct output
`31700` view save

user output
`31700` view save

Test 53

Verdict: ACCEPTED

input
`1000 551 353 0 2 4 6 9 12 13 18 20 21 22 23...` view save

correct output
`54500` view save

user output
`54500` view save

Test 54

Verdict: ACCEPTED

input
`1000 967 4504 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`83100` view save

user output
`83100` view save

Test 55

Verdict: ACCEPTED

input
`1000 222 275 1 2 5 12 14 20 22 24 29 35 51 ...` view save

correct output
`33200` view save

user output
`33200` view save

Test 56

Verdict: ACCEPTED

input
`1000 893 4738 0 2 3 4 5 7 8 10 11 12 13 14 1...` view save

correct output
`90500` view save

user output
`90500` view save

Test 57

Verdict: ACCEPTED

input
`1000 76 1136 15 24 65 72 83 86 100 133 142 ...` view save

correct output
`22200` view save

user output
`22200` view save

Test 58

Verdict: ACCEPTED

input
`1000 874 55 0 1 2 3 4 5 6 7 8 9 10 11 13 1...` view save

correct output
`10200` view save

user output
`10200` view save

Test 59

Verdict: ACCEPTED

input
`1000 10 1822 7 13 133 142 218 316 495 499 5...` view save

correct output
`84100` view save

user output
`84100` view save

Test 60

Verdict: ACCEPTED

input
`100000 54882 296454 0 2 3 4 5 6 7 9 15 16 18 20 21...` view save

correct output
`5941200` view save

user output
`5941200` view save

Test 61

Verdict: ACCEPTED

input
`100000 41702 498646 4 5 6 7 9 11 14 17 18 23 24 29...` view save

correct output
`755600` view save

user output
`755600` view save

Test 62

Verdict: ACCEPTED

input
`100000 43600 92551 2 4 7 10 12 17 18 30 34 35 36 ...` view save

correct output
`3319100` view save

user output
`3319100` view save

Test 63

Verdict: ACCEPTED

input
`100000 55080 35366 1 2 3 4 6 7 8 12 13 14 15 17 2...` view save

correct output
`5465700` view save

user output
`5465700` view save

Test 64

Verdict: ACCEPTED

input
`100000 96704 450359 0 1 2 3 4 5 6 8 9 10 11 12 13 ...` view save

correct output
`8642700` view save

user output
`8642700` view save

Test 65

Verdict: ACCEPTED

input
`100000 22199 27593 6 14 28 38 39 45 46 48 49 50 5...` view save

correct output
`3364900` view save

user output
`3364900` view save

Test 66

Verdict: ACCEPTED

input
`100000 89287 473789 0 1 2 3 4 5 6 7 8 9 10 12 13 1...` view save

correct output
`9652600` view save

user output
`9652600` view save

Test 67

Verdict: ACCEPTED

input
`100000 7630 113681 0 8 18 24 27 64 69 85 92 102 1...` view save

correct output
`2231400` view save

user output
`2231400` view save

Test 68

Verdict: ACCEPTED

input
`100000 87344 5557 0 1 2 3 4 5 7 8 9 10 11 13 14 ...` view save

correct output
`1043700` view save

user output
`1043700` view save

Test 69

Verdict: ACCEPTED

input
`100000 1037 182250 34 264 299 412 456 495 653 655...` view save

correct output
`8414700` view save

user output
`8414700` view save

Aalto Competitive Programming 2026 - wk3 - Mon

Wario Kart I

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Test 65

Test 66

Test 67

Test 68

Test 69

Tasks

Submissions (aalto26cm_030)