ICPC to Quera format translator

you can change dataset format easily by this program from domjudge format to quera class format! We will explain how it works below.

important hint: auto changer for quera testers is inactive yet. so you should use manual changing. e.g. this repo.

Quera Format

quera platform used this test structure +. this platform uses 2 way of judgment. input/output method and tester method.

running program

first clone this repo and change directory to repository directory. then using this command to run (maybe python3 instead of python):

python -m iqs.main

Format Table

version	checker	uses
v0	YES	quera
v1	NO	tcbank
v2	NO	space (sajjad university icpc contest)
v3	NO	internet icpc asia west (Tehran) 2024
v4	NO	icpc 2023 (asia west - onsite - Tehran)
v5 (not completed!)	YES	icpc 2022 (asia west - onsite - Tehran)
v6	NO	icpc world final 2021
v7 (not completed!)	YES	icpc 2024 (asia west - onsite - Tehran)

Version Structures

You can see the structures of the different versions in this section. Click on each section to expand it. You can see the uses of these versions in the Format Table.

version 0

./contest_name
    ./[problem_letter]
        problem.zip
            ./in
                input[test_case_number].txt
            ./out
                output[test_case_number].txt
            tester.cpp # tester file

test case example

/*
 * tester.cpp
 */
 
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(int argc, char const *argv[])
{
 
	ifstream test_in(argv[1]);    /* This stream reads from test's input file   */
	ifstream test_out(argv[2]);   /* This stream reads from test's output file  */
	ifstream user_out(argv[3]);   /* This stream reads from user's output file  */
 
	/* Your code here */
	/* If user's output is correct, return 0, otherwise return 1       */
 
	...
 
}

version 1

./contest_name
    ./[problem_letter]
        [test_case_number].in
        [test_case_number].ans
        tester.cpp # tester file

version 2

contest.zip
    [problem_letter].zip
        ./data
            ./secret
                [test_case_number].in
                [test_case_number].ans

hint: If the number of test cases is 2 digits, the first test case starts at 01.

version 3

[contest_name].zip
    ./tests-[problem_letter]
        [test_case_number].in
        [test_case_number].ans

There is a bit of instability in this version. It can be either completely normal or in the form x-y.in or .ans. Where x is 0 or 1 (zero means the test case is public and other means private) and y starts at 01.

version 4

[contest_name].zip
    ./testdata
        ./[problem_letter]-[problem_name]
            ./data
                ./samble
                    [test_case_number].in
                    [test_case_number].ans
                ./secret
                    [test_case_number].in
                    [test_case_number].ans

hint: files format x-y.in or .ans. Where x is 0 or 1 (zero means the test case is public and other means private) and y starts at 01.

version 5

[contest_name].zip
    ./testdata
        ./[problem_letter]
            [test_case_number].in
            [test_case_number].ans
            ./checker
                checker.cpp # + Makefile and testlib.h

hint: files format x-y.in or .ans. Where x is 0 or 1 (zero means the test case is public and other means private) and y starts at 01.

version 6

[contest_name].zip
    ./[contest_name]
        ./[problem_letter]-[problem_name]
            [test_case_number].in
            [test_case_number].ans

version 7

[contest_name].zip
    ./[problem_letter] # except __MAXOSX
        [test_case_number].in
        [test_case_number].ans
        ./checker
            checker.cpp # + Makefile and testlib.h

hint: files format x-y.in or .ans. Where x is 0 or 1 (zero means the test case is public and other means private) and y starts at 01.