Skip to content

Instantly share code, notes, and snippets.

@CodeBoy2006

CodeBoy2006/config.cpeditor

Last active September 10, 2022 12:57
Show Gist options
  • Save CodeBoy2006/331337003d6b603c1fb7f1c3cc4d5f62 to your computer and use it in GitHub Desktop.
Save CodeBoy2006/331337003d6b603c1fb7f1c3cc4d5f62 to your computer and use it in GitHub Desktop.
Download ZIP
备份CPEditor配置
Raw
config.cpeditor
[General]
tab_width=4
cursor_width=1
geometry=@Rect(1468 225 813 600)
editor_font=@Variant(\0\0\0@\0\0\0\x1c\0J\0\x65\0t\0\x42\0r\0\x61\0i\0n\0s\0 \0M\0o\0n\0o@0\0\0\0\0\0\0\xff\xff\xff\xff\x5\x1\0\x32\x10)
use_custom_application_font=true
custom_application_font=@Variant(\0\0\0@\0\0\0\fe\xb9kc|\x97W\x6{\x80OS@(\0\0\0\0\0\0\xff\xff\xff\xff\x5\x1\0\x32\x10)
default_language=C++
format_on_manual_save=false
format_on_auto_save=false
editor_theme=Dracula
detached_run_terminal_program=xterm
detached_run_terminal_arguments=-e
auto_complete_parentheses=true
auto_remove_parentheses=true
tab_jump_out_parentheses=true
auto_indent=true
auto_save=false
auto_save_interval=1000
auto_save_interval_type=After the last modification
wrap_text=false
beta=false
replace_tabs=false
save_tests=false
maximized_window=false
check_update=true
opacity=100
view_mode=split
splitter_size=@ByteArray(\0\0\0\xff\0\0\0\x1\0\0\0\x2\0\0\x5q\0\0\0\0\x1\xff\xff\xff\xff\x1\0\0\0\x1\0)
right_splitter_size=@ByteArray(\0\0\0\xff\0\0\0\x1\0\0\0\x2\0\0\x1\n\0\0\bG\x1\xff\xff\xff\xff\x1\0\0\0\x2\0)
force_close=false
show_compile_and_run_only=false
display_eoln_in_diff=false
save_faster=false
default_time_limit=5000
output_length_limit=500000
output_display_length_limit=500000
message_length_limit=20000
html_diff_viewer_length_limit=50000
open_file_length_limit=200000
display_test_case_length_limit=500000
testcases_matching_rules=@Variant(\0\0\0\v\0\0\0\x2\0\0\0\x10\0(\0.\0*\0)\0\\\0.\0i\0n\0\0\0\f\0\\\0\x31\0.\0\x61\0n\0s), @Variant(\0\0\0\v\0\0\0\x2\0\0\0\x10\0(\0.\0*\0)\0\\\0.\0i\0n\0\0\0\f\0\\\0\x31\0.\0o\0u\0t)
input_file_save_path=./${basename}_${1-index}.in
answer_file_save_path=./${basename}_${1-index}.ans
default_file_paths_for_problem_urls=@Variant(\0\0\0\v\0\0\0\x2\0\0\0n\0\x63\0o\0\x64\0\x65\0\x66\0o\0r\0\x63\0\x65\0s\0.\0\x63\0o\0m\0/\0\x63\0o\0n\0t\0\x65\0s\0t\0/\0(\0[\0\x31\0-\0\x39\0]\0\\\0\x64\0*\0)\0/\0p\0r\0o\0\x62\0l\0\x65\0m\0/\0(\0[\0\x41\0-\0Z\0]\0[\0\x31\0-\0\x39\0]\0?\0)\0\0\0\x30\0M\0:\0/\0L\0Z\0O\0I\0/\0\x43\0o\0\x64\0\x65\0\x66\0o\0r\0\x63\0\x65\0s\0/\0\\\0\x31\0/\0\\\0\x32), @Variant(\0\0\0\v\0\0\0\x2\0\0\0>\0l\0u\0o\0g\0u\0.\0\x63\0o\0m\0.\0\x63\0n\0/\0p\0r\0o\0\x62\0l\0\x65\0m\0/\0(\0[\0\x31\0-\0\x39\0]\0\\\0\x64\0*\0)\0\0\0\x1c\0M\0:\0/\0L\0Z\0O\0I\0/\0L\0u\0o\0g\0u\0/), @Variant(\0\0\0\v\0\0\0\x2\0\0\0\x42\0\x61\0t\0\x63\0o\0\x64\0\x65\0r\0.\0j\0p\0/\0\x63\0o\0n\0t\0\x65\0s\0t\0s\0/\0(\0[\0\x41\0-\0Z\0]\0[\0\x31\0-\0\x39\0]\0?\0)\0\0\0$\0M\0:\0/\0L\0Z\0O\0I\0/\0\x41\0t\0\x43\0o\0\x64\0\x65\0r\0/\0\\\0\x31), @Variant(\0\0\0\v\0\0\0\x2\0\0\0J\0\x61\0\x63\0w\0i\0n\0g\0.\0\x63\0o\0m\0/\0p\0r\0o\0\x62\0l\0\x65\0m\0/\0\x63\0o\0n\0t\0\x65\0n\0t\0/\0(\0[\0\x31\0-\0\x39\0]\0\\\0\x64\0*\0)\0\0\0\"\0M\0:\0/\0L\0Z\0O\0I\0/\0\x41\0\x63\0W\0i\0n\0g\0/\0\\\0\x31)
test_cases_font=@Variant(\0\0\0@\0\0\0\x16\0\x43\0o\0u\0r\0i\0\x65\0r\0 \0N\0\x65\0w@\"\0\0\0\0\0\0\xff\xff\xff\xff\x2\x1\0\x32\x10)
extra_bottom_margin=false
message_logger_font=@Variant(\0\0\0@\0\0\0\x16\0\x43\0o\0u\0r\0i\0\x65\0r\0 \0N\0\x65\0w@\"\0\0\0\0\0\0\xff\xff\xff\xff\x2\x1\0\x32\x10)
save_file_on_compilation=true
save_file_on_execution=false
restore_old_problem_url=false
open_old_file_for_old_problem_url=false
locale=system
ui_style=default
run_on_empty_testcase=true
check_on_testcases_with_empty_output=false
test_case_maximum_height=300
auto_load_external_changes_if_no_unsaved_modification=true
ask_for_loading_external_changes=true
recent_files=M:/LZOI/obfu21670.cpp, M:/LZOI/obfuscate tool.cpp, M:/LZOI/PublicJudge/21670.cpp, M:/LZOI/Luogu/P8537.cpp, M:/LZOI/Luogu/P8538.cpp, M:/LZOI/Luogu/P1714.cpp, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon5.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon28.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon7.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon6.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon9.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon30.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon8.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon1.in, M:/LZOI/\x51fa\x9898/data-buy_watermelon/buy_watermelon11.in, M:/\x51fa\x9898/caryon.h, M:/\x51fa\x9898/T1_gen.cpp, M:/\x51fa\x9898/T1.cpp, M:/LZOI/AtCoder/abc076_c.cpp, M:/LZOI/AtCoder/arc147_b.cpp
number_of_problems_in_contest=5
first_time_user=false
show_only_monospaced_font=true
total_usage_time=873709
promotion_dialog_shown=true
auto_uncheck_accepted_testcases=false
full_screen_dialog_shown=true
file_problem_binding=M:/LZOI/AcWing/1066.cpp, https://www.acwing.com/problem/content/1066/, M:/LZOI/AcWing/1142.cpp, https://www.acwing.com/problem/content/1142/, M:/LZOI/AcWing/1193.cpp, https://www.acwing.com/problem/content/1193/, M:/LZOI/AcWing/243.cpp, https://www.acwing.com/problem/content/description/243/, M:/LZOI/AcWing/248.cpp, https://www.acwing.com/problem/content/248/, M:/LZOI/AcWing/3622.cpp, https://www.acwing.com/problem/content/3622/, M:/LZOI/AcWing/3647.cpp, https://www.acwing.com/problem/content/3647/, M:/LZOI/AcWing/3655.cpp, https://www.acwing.com/problem/content/3655/, M:/LZOI/AcWing/3718.cpp, https://www.acwing.com/problem/content/3718/, M:/LZOI/AcWing/3718_merge_sort.cpp, https://www.acwing.com/problem/content/description/3718/, M:/LZOI/AcWing/4272.cpp, https://www.acwing.com/problem/content/4272/, M:/LZOI/AcWing/4497.cpp, https://www.acwing.com/problem/content/4497/, M:/LZOI/AcWing/4498.cpp, https://www.acwing.com/problem/content/4498/, M:/LZOI/AcWing/4499.cpp, https://www.acwing.com/problem/content/4499/, M:/LZOI/AcWing/4522.cpp, https://www.acwing.com/problem/content/description/4522/, M:/LZOI/AcWing/4585.cpp, https://www.acwing.com/problem/content/description/4585/, M:/LZOI/AcWing/arc144_a.cpp, https://atcoder.jp/contests/arc144/tasks/arc144_a, M:/LZOI/AcWing/arc144_b.cpp, https://atcoder.jp/contests/arc144/tasks/arc144_b, M:/LZOI/AtCoder/abc076_c.cpp, https://atcoder.jp/contests/abc076/tasks/abc076_c, M:/LZOI/AtCoder/abc262_a.cpp, https://atcoder.jp/contests/abc262/tasks/abc262_a, M:/LZOI/AtCoder/abc262_b.cpp, https://atcoder.jp/contests/abc262/tasks/abc262_b, M:/LZOI/AtCoder/abc263_a.cpp, https://atcoder.jp/contests/abc263/tasks/abc263_a, M:/LZOI/AtCoder/abc263_b.cpp, https://atcoder.jp/contests/abc263/tasks/abc263_b, M:/LZOI/AtCoder/abc263_c.cpp, https://atcoder.jp/contests/abc263/tasks/abc263_c, M:/LZOI/AtCoder/abc263_d.cpp, https://atcoder.jp/contests/abc263/tasks/abc263_d, M:/LZOI/AtCoder/arc146_a.cpp, https://atcoder.jp/contests/arc146/tasks/arc146_a, M:/LZOI/AtCoder/arc146_b.cpp, https://atcoder.jp/contests/arc146/tasks/arc146_b, M:/LZOI/AtCoder/arc147_a.cpp, https://atcoder.jp/contests/arc147/tasks/arc147_a, M:/LZOI/AtCoder/arc147_b.cpp, https://atcoder.jp/contests/arc147/tasks/arc147_b, M:/LZOI/CodeForces/1706/a.cpp, https://codeforces.com/contest/1706/problem/A, M:/LZOI/CodeForces/1706/b.cpp, https://codeforces.com/contest/1706/problem/B, M:/LZOI/CodeForces/1706/c.cpp, https://codeforces.com/contest/1706/problem/C, M:/LZOI/CodeForces/1706/d1.cpp, "https://codeforces.com/contest/1706/problem/D1?locale=en", M:/LZOI/CodeForces/1711/B.cpp, https://codeforces.com/problemset/problem/1711/B, M:/LZOI/CodeForces/1712/A.cpp, https://codeforces.com/contest/1712/problem/A, M:/LZOI/CodeForces/1712/B.cpp, https://codeforces.com/contest/1712/problem/B, M:/LZOI/CodeForces/1712/C.cpp, https://codeforces.com/contest/1712/problem/C, M:/LZOI/CodeForces/1713/A.cpp, https://codeforces.com/contest/1713/problem/A, M:/LZOI/CodeForces/1715/A.cpp, https://codeforces.com/contest/1715/problem/A, M:/LZOI/CodeForces/1715/B.cpp, https://codeforces.com/contest/1715/problem/B, M:/LZOI/CodeForces/1715/C.cpp, https://codeforces.com/contest/1715/problem/C, M:/LZOI/CodeForces/1716/A.cpp, https://codeforces.com/contest/1716/problem/A, M:/LZOI/CodeForces/1716/B.cpp, https://codeforces.com/contest/1716/problem/B, M:/LZOI/CodeForces/1719/A.cpp, https://codeforces.com/contest/1719/problem/A, M:/LZOI/CodeForces/1719/B.cpp, https://codeforces.com/contest/1719/problem/B, M:/LZOI/CodeForces/1719/C.cpp, https://codeforces.com/contest/1719/problem/C, M:/LZOI/CodeForces/817/F.cpp, https://codeforces.com/problemset/problem/817/F, M:/LZOI/CodeForces/817/F_SegTree.cpp, https://codeforces.com/contest/817/problem/F, M:/LZOI/CodeForces/CF1106D.cpp, https://codeforces.com/contest/1106/problem/D, M:/LZOI/LZOJ/14.cpp, http://120.48.149.4:8888/p/14, M:/LZOI/Luogu/CF438D.cpp, https://codeforces.com/problemset/problem/438/D, M:/LZOI/Luogu/P1005.cpp, https://www.luogu.com.cn/problem/P1005, M:/LZOI/Luogu/P1016.cpp, https://www.luogu.com.cn/problem/P1016, M:/LZOI/Luogu/P1017.cpp, https://www.luogu.com.cn/problem/P1017, M:/LZOI/Luogu/P1024.cpp, https://www.luogu.com.cn/problem/P1024, M:/LZOI/Luogu/P1034.cpp, https://www.luogu.com.cn/problem/P1034, M:/LZOI/Luogu/P1041.cpp, https://www.luogu.com.cn/problem/P1041, M:/LZOI/Luogu/P1049.cpp, https://www.luogu.com.cn/problem/P1049, M:/LZOI/Luogu/P1064.cpp, https://www.luogu.com.cn/problem/P1064, M:/LZOI/Luogu/P1182.cpp, https://www.luogu.com.cn/problem/P1182, M:/LZOI/Luogu/P1295.cpp, https://www.luogu.com.cn/problem/P1295, M:/LZOI/Luogu/P1433.cpp, https://www.luogu.com.cn/problem/P1433, M:/LZOI/Luogu/P1516.cpp, https://www.luogu.com.cn/problem/P1516, M:/LZOI/Luogu/P1631.cpp, https://www.luogu.com.cn/problem/P1631, M:/LZOI/Luogu/P1714.cpp, https://www.luogu.com.cn/problem/P1714, M:/LZOI/Luogu/P1725.cpp, https://www.luogu.com.cn/problem/P1725, M:/LZOI/Luogu/P1950.cpp, https://www.luogu.com.cn/problem/P1950, M:/LZOI/Luogu/P1966.cpp, https://www.luogu.com.cn/problem/P1966, M:/LZOI/Luogu/P2105.cpp, https://www.luogu.com.cn/problem/P2105, M:/LZOI/Luogu/P2197.cpp, https://www.luogu.com.cn/problem/P2197, M:/LZOI/Luogu/P2868.cpp, https://www.luogu.com.cn/problem/P2868, M:/LZOI/Luogu/P5463.cpp, https://www.luogu.com.cn/problem/P5463, M:/LZOI/Luogu/P5681.cpp, https://www.luogu.com.cn/problem/P5681, M:/LZOI/Luogu/P7071.cpp, https://www.luogu.com.cn/problem/P7071, M:/LZOI/Luogu/P7072.cpp, https://www.luogu.com.cn/problem/P7072, M:/LZOI/Luogu/P7073.cpp, https://www.luogu.com.cn/problem/P7073, M:/LZOI/Luogu/P7074.cpp, https://www.luogu.com.cn/problem/P7074, M:/LZOI/Luogu/P7075.cpp, https://www.luogu.com.cn/problem/P7075, M:/LZOI/Luogu/P7076.cpp, https://www.luogu.com.cn/problem/P7076, M:/LZOI/Luogu/P7077.cpp, https://www.luogu.com.cn/problem/P7077, M:/LZOI/Luogu/P7909.cpp, https://www.luogu.com.cn/problem/P7909, M:/LZOI/Luogu/P7910.cpp, https://www.luogu.com.cn/problem/P7910, M:/LZOI/Luogu/P7911.cpp, https://www.luogu.com.cn/problem/P7911, M:/LZOI/Luogu/P7912.cpp, https://www.luogu.com.cn/problem/P7912, M:/LZOI/Luogu/P8463.cpp, https://www.luogu.com.cn/problem/P8463, M:/LZOI/Luogu/P8474.cpp, https://www.luogu.com.cn/problem/P8474, M:/LZOI/Luogu/P8537.cpp, "https://www.luogu.com.cn/problem/T204388?contestId=63506", M:/LZOI/Luogu/P8538.cpp, "https://www.luogu.com.cn/problem/P8538?contestId=63506", M:/LZOI/Luogu/T238894.cpp, "https://www.luogu.com.cn/problem/T238894?contestId=76483", M:/LZOI/Luogu/T250901.cpp, "https://www.luogu.com.cn/problem/T250901?contestId=73946", M:/LZOI/Luogu/UVA12555.cpp, https://www.luogu.com.cn/problem/UVA12555#submit, M:/LZOI/Luogu/abc260_a.cpp, https://atcoder.jp/contests/abc260/tasks/abc260_a, M:/LZOI/Luogu/abc260_b.cpp, https://atcoder.jp/contests/abc260/tasks/abc260_b, M:/LZOI/Luogu/abc260_c.cpp, https://atcoder.jp/contests/abc260/tasks/abc260_c, N:/OI/110.cpp, https://loj.ac/p/110, N:/OI/ACWing/1012.cpp, https://www.acwing.com/problem/content/1012/, N:/OI/ACWing/1014.cpp, https://www.acwing.com/problem/content/1014/, N:/OI/ACWing/1019.cpp, https://www.acwing.com/problem/content/1019/, N:/OI/ACWing/1022.cpp, https://www.acwing.com/problem/content/1022/, N:/OI/ACWing/1029.cpp, https://www.acwing.com/problem/content/1029/, N:/OI/ACWing/189.cpp, https://www.acwing.com/problem/content/189/, N:/OI/ACWing/203.cpp, https://www.acwing.com/problem/content/description/203/, N:/OI/ACWing/274.cpp, https://www.acwing.com/problem/content/274/, N:/OI/ACWing/6.cpp, https://www.acwing.com/problem/content/description/6/, N:/OI/P1003.cpp, https://www.luogu.com.cn/problem/P1003, N:/OI/P1004.cpp, https://www.luogu.com.cn/problem/P1004, N:/OI/P1008.cpp, https://www.luogu.com.cn/problem/P1008, N:/OI/P1013.cpp, https://www.luogu.com.cn/problem/P1013, N:/OI/P1014.cpp, https://www.luogu.com.cn/problem/P1014, N:/OI/P1020.cpp, https://www.luogu.com.cn/problem/P1020, N:/OI/P1046.cpp, https://www.luogu.com.cn/problem/P1046, N:/OI/P1047.cpp, https://www.luogu.com.cn/problem/P1047, N:/OI/P1219.cpp, https://www.luogu.com.cn/problem/P1219, N:/OI/P1379.cpp, https://www.luogu.com.cn/problem/P1379, N:/OI/P1537.cpp, https://www.luogu.com.cn/problem/P1537, N:/OI/P1880\x56db\x8fb9\x5f62\x4f18\x5316.cpp, https://www.luogu.com.cn/problem/P1880, N:/OI/P1908.cpp, https://www.luogu.com.cn/problem/P1908, N:/OI/P2615.cpp, https://www.luogu.com.cn/problem/P2615, N:/OI/P3475.cpp, https://www.luogu.com.cn/problem/P3475, N:/OI/P4342.cpp, https://www.luogu.com.cn/problem/P4342, N:/OI/P5569.cpp, https://www.luogu.com.cn/problem/P5569, N:/OI/P5690.cpp, https://www.luogu.com.cn/problem/P5690, N:/OI/POJ2443.cpp, "http://poj.org/problem?id=2443", N:/OI/SP1110.cpp, https://www.luogu.com.cn/problem/SP1110
[clang_format]
program=clang-format
arguments=
style=BasedOnStyle: Microsoft
[yapf]
program=python
arguments=-m yapf
style="[style]\nbased_on_style = pep8"
[cpp]
template_path=D:/Program Files (x86)/cpeditor/cpptemp.cpp
template_cursor_position_regex="fastio\\(\\);"
template_cursor_position_offset_type=end
template_cursor_position_offset_characters=4
compile_command="g++ -Wall -O2 -std=c++14 -Wno-error=parentheses -I \"D:/Program Files (x86)/cpeditor/include\" -DLOCAL"
output_path=${tmpdir}/${basename}
run_arguments=
parentheses=@Variant(\0\0\0\t\0\0\0\x5\0\0\0\a\0(\0\0\0\a\0)\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\a\0{\0\0\0\a\0}\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\a\0[\0\0\0\a\0]\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\a\0\"\0\0\0\a\0\"\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\a\0'\0\0\0\a\0'\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1)
compiler_output_codec=UTF-8
[java]
template_path=
compile_command=javac
run_arguments=
run_command=java
class_name=Main
output_path=${tmpdir}
template_cursor_position_regex=
template_cursor_position_offset_type=end
template_cursor_position_offset_characters=0
parentheses=@Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0(\0\0\0\x2\0\0\0)\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0{\0\0\0\x2\0\0\0}\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0[\0\0\0\x2\0\0\0]\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0\"\0\0\0\x2\0\0\0\"\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0'\0\0\0\x2\0\0\0'\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1)
compiler_output_codec=UTF-8
[python]
template_path=
template_cursor_position_regex=
template_cursor_position_offset_type=end
template_cursor_position_offset_characters=0
run_arguments=
run_command=python
parentheses=@Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0(\0\0\0\x2\0\0\0)\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0{\0\0\0\x2\0\0\0}\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0[\0\0\0\x2\0\0\0]\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0\"\0\0\0\x2\0\0\0\"\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1), @Variant(\0\0\0\t\0\0\0\x5\0\0\0\x2\0\0\0'\0\0\0\x2\0\0\0'\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1\0\0\0\x2\0\0\0\x1)
[competitive_companion]
enable=true
connection_port=12345
open_new_tab=true
set_time_limit_for_tab=true
head_comments=Date: ${time}\nProblem: ${json.name}\nContest: ${json.group}\nURL: ${json.url}\nMemory Limit: ${json.memoryLimit} MB\nTime Limit: ${json.timeLimit} ms
head_comments_time_format=yyyy-MM-dd HH:mm:ss
head_comments_powered_by_cp_editor=false
[hotkey]
format=
kill=
compile_run=F1
run=
compile=
change_view_mode=
snippets=
[hot_exit]
enable=true
auto_save=false
auto_save_interval=20000
[cf]
path=cf
show_toast_messages=true
[lsp]
path_cpp=clangd
path_java=
path_python=python
use_linting_cpp=true
use_linting_java=false
use_linting_python=true
use_autocomplete_cpp=false
use_autocomplete_java=false
use_autocomplete_python=false
delay_cpp=1000
delay_java=2000
delay_python=2000
args_cpp=
args_java=
args_python=-m pyls
[Language%20Config]
C%2B%2B\snippet\__int128="template<typename T> inline void read(T &x){\n x=0;T w=1,ch=getchar();\n while(!isdigit(ch)&&ch!='-')ch=getchar();\n if(ch=='-')w=-1,ch=getchar();\n while(isdigit(ch))x=(x<<3)+(x<<1)+(ch^'0'),ch=getchar();\n x=x*w;\n}\n\ntemplate<typename T> inline void print(T x, bool flag = 0)\n{\n\tif(!flag && x == 0){putchar('0'); return ;}\n\tif (!x && flag) return ;\n\tif (x < 0) putchar('-'),x = -x;\n\tprint(x / 10, 1);\n\tputchar(x % 10 + '0');\n}"
C%2B%2B\snippet\bignum="const double PI = acos(-1.0);\nstruct Complex{\n double x,y;\n Complex(double _x = 0.0,double _y = 0.0){\n x = _x;\n y = _y;\n }\n Complex operator-(const Complex &b)const{\n return Complex(x - b.x,y - b.y);\n }\n Complex operator+(const Complex &b)const{\n return Complex(x + b.x,y + b.y);\n }\n Complex operator*(const Complex &b)const{\n return Complex(x*b.x - y*b.y,x*b.y + y*b.x);\n }\n};\nvoid change(Complex y[],int len){\n int i,j,k;\n for(int i = 1,j = len/2;i<len-1;i++){\n if(i < j) swap(y[i],y[j]);\n k = len/2;\n while(j >= k){\n j = j - k;\n k = k/2;\n }\n if(j < k) j+=k;\n }\n}\nvoid fft(Complex y[],int len,int on){\n change(y,len);\n for(int h = 2;h <= len;h<<=1){\n Complex wn(cos(on*2*PI/h),sin(on*2*PI/h));\n for(int j = 0;j < len;j += h){\n Complex w(1,0);\n for(int k = j;k < j + h/2;k++){\n Complex u = y[k];\n Complex t = w*y[k + h/2];\n y[k] = u + t;\n y[k + h/2] = u - t;\n w = w*wn;\n }\n }\n }\n if(on == -1){\n for(int i = 0;i < len;i++){\n y[i].x /= len;\n }\n }\n}\nclass BigInt\n{\n#define Value(x, nega) ((nega) ? -(x) : (x))\n#define At(vec, index) ((index) < vec.size() ? vec[(index)] : 0)\n static int absComp(const BigInt &lhs, const BigInt &rhs)\n {\n if (lhs.size() != rhs.size())\n return lhs.size() < rhs.size() ? -1 : 1;\n for (int i = lhs.size() - 1; i >= 0; --i)\n if (lhs[i] != rhs[i])\n return lhs[i] < rhs[i] ? -1 : 1;\n return 0;\n }\n using Long = long long;\n const static int Exp = 9;\n const static Long Mod = 1000000000;\n mutable std::vector<Long> val;\n mutable bool nega = false;\n void trim() const\n {\n while (val.size() && val.back() == 0)\n val.pop_back();\n if (val.empty())\n nega = false;\n }\n int size() const { return val.size(); }\n Long &operator[](int index) const { return val[index]; }\n Long &back() const { return val.back(); }\n BigInt(int size, bool nega) : val(size), nega(nega) {}\n BigInt(const std::vector<Long> &val, bool nega) : val(val), nega(nega) {}\n\npublic:\n friend std::ostream &operator<<(std::ostream &os, const BigInt &n)\n {\n if (n.size())\n {\n if (n.nega)\n putchar('-');\n for (int i = n.size() - 1; i >= 0; --i)\n {\n if (i == n.size() - 1)\n printf(\"%lld\", n[i]);\n else\n printf(\"%0*lld\", n.Exp, n[i]);\n }\n }\n else\n putchar('0');\n return os;\n }\n friend BigInt operator+(const BigInt &lhs, const BigInt &rhs)\n {\n BigInt ret(lhs);\n return ret += rhs;\n }\n friend BigInt operator-(const BigInt &lhs, const BigInt &rhs)\n {\n BigInt ret(lhs);\n return ret -= rhs;\n }\n BigInt(Long x = 0)\n {\n if (x < 0)\n x = -x, nega = true;\n while (x >= Mod)\n val.push_back(x % Mod), x /= Mod;\n if (x)\n val.push_back(x);\n }\n BigInt(const char *s)\n {\n int bound = 0, pos;\n if (s[0] == '-')\n nega = true, bound = 1;\n Long cur = 0, pow = 1;\n for (pos = strlen(s) - 1; pos >= Exp + bound - 1; pos -= Exp, val.push_back(cur), cur = 0, pow = 1)\n for (int i = pos; i > pos - Exp; --i)\n cur += (s[i] - '0') * pow, pow *= 10;\n for (cur = 0, pow = 1; pos >= bound; --pos)\n cur += (s[pos] - '0') * pow, pow *= 10;\n if (cur)\n val.push_back(cur);\n }\n BigInt &operator=(const char *s){\n BigInt n(s);\n *this = n;\n return n;\n }\n BigInt &operator=(const Long x){\n BigInt n(x);\n *this = n;\n return n;\n }\n friend std::istream &operator>>(std::istream &is, BigInt &n){\n string s;\n is >> s;\n n=(char*)s.data();\n return is;\n }\n BigInt &operator+=(const BigInt &rhs)\n {\n const int cap = std::max(size(), rhs.size()) + 1;\n val.resize(cap);\n int carry = 0;\n for (int i = 0; i < cap - 1; ++i)\n {\n val[i] = Value(val[i], nega) + Value(At(rhs, i), rhs.nega) + carry, carry = 0;\n if (val[i] >= Mod)\n val[i] -= Mod, carry = 1;\n else if (val[i] < 0)\n val[i] += Mod, carry = -1;\n }\n if ((val.back() = carry) == -1) //assert(val.back() == 1 or 0 or -1)\n {\n nega = true, val.pop_back();\n bool tailZero = true;\n for (int i = 0; i < cap - 1; ++i)\n {\n if (tailZero && val[i])\n val[i] = Mod - val[i], tailZero = false;\n else\n val[i] = Mod - 1 - val[i];\n }\n }\n trim();\n return *this;\n }\n friend BigInt operator-(const BigInt &rhs)\n {\n BigInt ret(rhs);\n ret.nega ^= 1;\n return ret;\n }\n BigInt &operator-=(const BigInt &rhs)\n {\n rhs.nega ^= 1;\n *this += rhs;\n rhs.nega ^= 1;\n return *this;\n }\n friend BigInt operator*(const BigInt &lhs, const BigInt &rhs)\n {\n int len=1;\n BigInt ll=lhs,rr=rhs;\n ll.nega = lhs.nega ^ rhs.nega;\n while(len<2*lhs.size()||len<2*rhs.size())len<<=1;\n ll.val.resize(len),rr.val.resize(len);\n Complex x1[len],x2[len];\n for(int i=0;i<len;i++){\n Complex nx(ll[i],0.0),ny(rr[i],0.0);\n x1[i]=nx;\n x2[i]=ny;\n }\n fft(x1,len,1);\n fft(x2,len,1);\n for(int i = 0 ; i < len; i++)\n x1[i] = x1[i] * x2[i];\n fft( x1 , len , -1 );\n for(int i = 0 ; i < len; i++)\n ll[i] = int( x1[i].x + 0.5 );\n for(int i = 0 ; i < len; i++){\n ll[i+1]+=ll[i]/Mod;\n ll[i]%=Mod;\n }\n ll.trim();\n return ll;\n }\n friend BigInt operator*(const BigInt &lhs, const Long &x){\n BigInt ret=lhs;\n bool negat = ( x < 0 );\n Long xx = (negat) ? -x : x;\n ret.nega ^= negat;\n ret.val.push_back(0);\n ret.val.push_back(0);\n for(int i = 0; i < ret.size(); i++)\n ret[i]*=xx;\n for(int i = 0; i < ret.size(); i++){\n ret[i+1]+=ret[i]/Mod;\n ret[i] %= Mod;\n }\n ret.trim();\n return ret;\n }\n BigInt &operator*=(const BigInt &rhs) { return *this = *this * rhs; }\n BigInt &operator*=(const Long &x) { return *this = *this * x; }\n friend BigInt operator/(const BigInt &lhs, const BigInt &rhs)\n {\n static std::vector<BigInt> powTwo{BigInt(1)};\n static std::vector<BigInt> estimate;\n estimate.clear();\n if (absComp(lhs, rhs) < 0)\n return BigInt();\n BigInt cur = rhs;\n int cmp;\n while ((cmp = absComp(cur, lhs)) <= 0)\n {\n estimate.push_back(cur), cur += cur;\n if (estimate.size() >= powTwo.size())\n powTwo.push_back(powTwo.back() + powTwo.back());\n }\n if (cmp == 0)\n return BigInt(powTwo.back().val, lhs.nega ^ rhs.nega);\n BigInt ret = powTwo[estimate.size() - 1];\n cur = estimate[estimate.size() - 1];\n for (int i = estimate.size() - 1; i >= 0 && cmp != 0; --i)\n if ((cmp = absComp(cur + estimate[i], lhs)) <= 0)\n cur += estimate[i], ret += powTwo[i];\n ret.nega = lhs.nega ^ rhs.nega;\n return ret;\n }\n friend BigInt operator/(const BigInt &num,const Long &x){\n bool negat = ( x < 0 );\n Long xx = (negat) ? -x : x;\n BigInt ret;\n Long k = 0;\n ret.val.resize( num.size() );\n ret.nega = (num.nega ^ negat);\n for(int i = num.size() - 1 ;i >= 0; i--){\n ret[i] = ( k * Mod + num[i]) / xx;\n k = ( k * Mod + num[i]) % xx;\n }\n ret.trim();\n return ret;\n }\n bool operator==(const BigInt &rhs) const\n {\n return nega == rhs.nega && val == rhs.val;\n }\n bool operator!=(const BigInt &rhs) const { return nega != rhs.nega || val != rhs.val; }\n bool operator>=(const BigInt &rhs) const { return !(*this < rhs); }\n bool operator>(const BigInt &rhs) const { return !(*this <= rhs); }\n bool operator<=(const BigInt &rhs) const\n {\n if (nega && !rhs.nega)\n return true;\n if (!nega && rhs.nega)\n return false;\n int cmp = absComp(*this, rhs);\n return nega ? cmp >= 0 : cmp <= 0;\n }\n bool operator<(const BigInt &rhs) const\n {\n if (nega && !rhs.nega)\n return true;\n if (!nega && rhs.nega)\n return false;\n return (absComp(*this, rhs) < 0) ^ nega;\n }\n void swap(const BigInt &rhs) const\n {\n std::swap(val, rhs.val);\n std::swap(nega, rhs.nega);\n }\n};"
C%2B%2B\snippet\debug="template<class... T> constexpr auto min(T... a){ return min(initializer_list<common_type_t<T...>>{a...}); }\ntemplate<class... T> constexpr auto max(T... a){ return max(initializer_list<common_type_t<T...>>{a...}); }\ntemplate<class T> bool chmin(T& a, T b){ if(a > b) { a = b; return true; } return false; }\ntemplate<class T> bool chmax(T& a, T b){ if(a < b) { a = b; return true; } return false; }\ntemplate <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }\ntemplate <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }\ntemplate <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }\n#define debug(var) do{std::cout << #var << \" : \";out(var);}while(0)\ntemplate<class... T> void in(T&... a){(cin >> ... >> a);}\ntemplate<class T, class... Ts> void out(const T& a, const Ts&... b){cout << a; ((cout << ' ' << b), ...); cout << endl;}\ntemplate<typename T> void out(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << ' '; } std::cout << std::endl;}\ntemplate<typename T> void out(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ out(v); } }\ntemplate<typename T> void pin(vector<T> &u, vector<T> &v){ rep(i, 0, sz(v)) { cin >> u[i] >> v[i]; } }\ntemplate<typename T> void pin(vector<pair<T, T> > &v){ rep(i, 0, sz(v)) { cin >> v[i].first >> v[i].second; } }\ntemplate<typename T> void pd(T v){ for(auto [first_ad, second_ad] : v) cout << first_ad << \" \" << second_ad << endl; }\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\n#if __cplusplus >= 201703L\ntemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\ntemplate <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\n#endif\ntemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << \"deq[\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }\ntemplate <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }\ntemplate <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }"
C%2B%2B\snippet\fastio="#define DEBUG 1 // \x8c03\x8bd5\x5f00\x5173\nstruct IO {\n#define MAXSIZE (1 << 20)\n#define isdigit(x) (x >= '0' && x <= '9')\n char buf[MAXSIZE], *p1, *p2;\n char pbuf[MAXSIZE], *pp;\n#if DEBUG\n#else\n IO() : p1(buf), p2(buf), pp(pbuf) {}\n ~IO() { fwrite(pbuf, 1, pp - pbuf, stdout); }\n#endif\n inline char gc() {\n#if DEBUG // \x8c03\x8bd5\xff0c\x53ef\x663e\x793a\x5b57\x7b26\n return getchar();\n#endif\n if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin);\n return p1 == p2 ? ' ' : *p1++;\n }\n inline bool blank(char ch) {\n return ch == ' ' || ch == '\\n' || ch == '\\r' || ch == '\\t';\n }\n template <class T>\n inline void read(T &x) {\n register double tmp = 1;\n register bool sign = 0;\n x = 0;\n register char ch = gc();\n for (; !isdigit(ch); ch = gc())\n if (ch == '-') sign = 1;\n for (; isdigit(ch); ch = gc()) x = x * 10 + (ch - '0');\n if (ch == '.')\n for (ch = gc(); isdigit(ch); ch = gc())\n tmp /= 10.0, x += tmp * (ch - '0');\n if (sign) x = -x;\n }\n inline void read(char *s) {\n register char ch = gc();\n for (; blank(ch); ch = gc())\n ;\n for (; !blank(ch); ch = gc()) *s++ = ch;\n *s = 0;\n }\n inline void read(char &c) {\n for (c = gc(); blank(c); c = gc())\n ;\n }\n inline void push(const char &c) {\n#if DEBUG // \x8c03\x8bd5\xff0c\x53ef\x663e\x793a\x5b57\x7b26\n putchar(c);\n#else\n if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;\n *pp++ = c;\n#endif\n }\n template <class T>\n inline void write(T x) {\n if (x < 0) x = -x, push('-'); // \x8d1f\x6570\x8f93\x51fa\n static T sta[35];\n T top = 0;\n do {\n sta[top++] = x % 10, x /= 10;\n } while (x);\n while (top) push(sta[--top] + '0');\n }\n template <class T>\n inline void write(T x, char lastChar) {\n write(x), push(lastChar);\n }\n} io;"
C%2B%2B\snippet\stdc%2B%2B.h=#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>
C%2B%2B\snippet\%U5C0F%U5FEB%U8BFB="char buf[100010], *p1, *p2;\n#define getchar() p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++\ntemplate<class item>\ninline item read() {\n\titem res = 0;\n\tbool negative = 0;\n\tchar ch = getchar();\n\twhile (!isdigit(ch)) negative |= ch == '-', ch = getchar();\n\twhile (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();\n\treturn negative ? -res : res;\n}\ntemplate<class item>\ninline item read(item & t) {\n\tt = read<item>();\n\treturn t;\n}\ntemplate <typename T, typename... Args>\ninline void read(T& t, Args&... args) {\n\tread(t), read(args...);\n}"
C%2B%2B\snippet\%U706B%U8F66%U5934="#pragma GCC diagnostic error \"-std=c++14\"\n#pragma GCC target(\"avx\")\n#pragma GCC optimize(3)\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"inline\")\n#pragma GCC optimize(\"-fgcse\")\n#pragma GCC optimize(\"-fgcse-lm\")\n#pragma GCC optimize(\"-fipa-sra\")\n#pragma GCC optimize(\"-ftree-pre\")\n#pragma GCC optimize(\"-ftree-vrp\")\n#pragma GCC optimize(\"-fpeephole2\")\n#pragma GCC optimize(\"-ffast-math\")\n#pragma GCC optimize(\"-fsched-spec\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC optimize(\"-falign-jumps\")\n#pragma GCC optimize(\"-falign-loops\")\n#pragma GCC optimize(\"-falign-labels\")\n#pragma GCC optimize(\"-fdevirtualize\")\n#pragma GCC optimize(\"-fcaller-saves\")\n#pragma GCC optimize(\"-fcrossjumping\")\n#pragma GCC optimize(\"-fthread-jumps\")\n#pragma GCC optimize(\"-funroll-loops\")\n#pragma GCC optimize(\"-fwhole-program\")\n#pragma GCC optimize(\"-freorder-blocks\")\n#pragma GCC optimize(\"-fschedule-insns\")\n#pragma GCC optimize(\"inline-functions\")\n#pragma GCC optimize(\"-ftree-tail-merge\")\n#pragma GCC optimize(\"-fschedule-insns2\")\n#pragma GCC optimize(\"-fstrict-aliasing\")\n#pragma GCC optimize(\"-fstrict-overflow\")\n#pragma GCC optimize(\"-falign-functions\")\n#pragma GCC optimize(\"-fcse-skip-blocks\")\n#pragma GCC optimize(\"-fcse-follow-jumps\")\n#pragma GCC optimize(\"-fsched-interblock\")\n#pragma GCC optimize(\"-fpartial-inlining\")\n#pragma GCC optimize(\"no-stack-protector\")\n#pragma GCC optimize(\"-freorder-functions\")\n#pragma GCC optimize(\"-findirect-inlining\")\n#pragma GCC optimize(\"-fhoist-adjacent-loads\")\n#pragma GCC optimize(\"-frerun-cse-after-loop\")\n#pragma GCC optimize(\"inline-small-functions\")\n#pragma GCC optimize(\"-finline-small-functions\")\n#pragma GCC optimize(\"-ftree-switch-conversion\")\n#pragma GCC optimize(\"-foptimize-sibling-calls\")\n#pragma GCC optimize(\"-fexpensive-optimizations\")\n#pragma GCC optimize(\"-funsafe-loop-optimizations\")\n#pragma GCC optimize(\"inline-functions-called-once\")\n#pragma GCC optimize(\"-fdelete-null-pointer-checks\")\n\n///////////////// Compiler Optimize //////////////////////\n"
[proxy]
enabled=true
type=System
host_name=127.0.0.1
port=1080
user=
password=
[default_path]
names_and_paths=@Variant(\0\0\0\v\0\0\0\x2\0\0\0\xe\0\x63\0h\0\x65\0\x63\0k\0\x65\0r\0\0\0&\0M\0:\0/\0L\0Z\0O\0I\0/\0P\0u\0\x62\0l\0i\0\x63\0J\0u\0\x64\0g\0\x65), @Variant(\0\0\0\v\0\0\0\x2\0\0\0\b\0\x66\0i\0l\0\x65\0\0\0&\0M\0:\0/\0L\0Z\0O\0I\0/\0P\0u\0\x62\0l\0i\0\x63\0J\0u\0\x64\0g\0\x65), @Variant(\0\0\0\v\0\0\0\x2\0\0\0\x10\0s\0\x65\0t\0t\0i\0n\0g\0s\0\0\0\0), @Variant(\0\0\0\v\0\0\0\x2\0\0\0\x10\0t\0\x65\0s\0t\0\x63\0\x61\0s\0\x65\0\0\0&\0M\0:\0/\0L\0Z\0O\0I\0/\0P\0u\0\x62\0l\0i\0\x63\0J\0u\0\x64\0g\0\x65)
action\open_file\uses=${file}
action\open_file\changes="file, testcase, checker"
action\save_file\uses=${file}
action\save_file\changes="file, testcase, checker"
action\open_contest\uses=${contest}
action\open_contest\changes="contest, file, testcase, checker"
action\load_single_test_case\uses=${testcase}
action\load_single_test_case\changes=testcase
action\add_pairs_of_test_cases\uses=${testcase}
action\add_pairs_of_test_cases\changes=testcase
action\save_test_case_to_a_file\uses=${testcase}
action\save_test_case_to_a_file\changes=testcase
action\custom_checker\uses=${checker}
action\custom_checker\changes=checker
action\export_and_import_settings\uses=${settings}
action\export_and_import_settings\changes=settings
action\export_and_load_session\uses=${session}
action\export_and_load_session\changes=session
action\extract_and_load_snippets\uses=${snippets}
action\extract_and_load_snippets\changes=snippets
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment