{"problem":{"name":"F. Research projects","description":{"content":"Each year in NCD, students participate in school research projects. Each project must have a team of at least $1$ student and at most $6$ students. And each student can only participate in one project","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10216F"},"statements":[{"statement_type":"Markdown","content":"Each year in NCD, students participate in school research projects. Each project must have a team of at least $1$ student and at most $6$ students. And each student can only participate in one project.\n\nHowever, not all the students found teams to join this year. So the administration will set new projects to accommodate these students. Your job is to find out the minimum number of new projects to accommodate all these students.\n\nIn the first line $T$, the number of test cases.\n\nFor each test case you will be given ($N$, $K$) the number of students in the NCD and the number of students who have projects.\n\n$1 <= N, K <= 10^(18)$\n\nFor each test case print the least number of the new projects.\n\n## Input\n\nIn the first line $T$, the number of test cases.For each test case you will be given ($N$, $K$) the number of students in the NCD and the number of students who have projects.$1 <= N, K <= 10^(18)$\n\n## Output\n\nFor each test case print the least number of the new projects.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ T \\in \\mathbb{Z} $ be the number of test cases.  \nFor each test case, let $ N, K \\in \\mathbb{Z} $ denote the total number of students and the number of students already assigned to projects, respectively.  \n\n**Constraints**  \n1. $ 1 \\leq T \\leq \\text{unknown bound} $ (implied by input format)  \n2. $ 1 \\leq K \\leq N \\leq 10^{18} $  \n\n**Objective**  \nLet $ U = N - K $ be the number of unassigned students.  \nEach new project can accommodate at most $ 6 $ students.  \nFind the minimum number of new projects required:  \n$$\n\\left\\lceil \\frac{U}{6} \\right\\rceil\n$$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10216F","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}