{
   "question_id": 7400042,
   "question_title": "魔法少女锦姐姐",
   "question_content": "锦姐姐作为魔法少女有很多魔法石，每个魔法石都有一个符文，符文是一个数字。\n  \n 锦姐姐想知道她拥有某一种魔法石的数量。\n  \n  \n \n \n 输入\n \n \n 第一行输入一个数t，代表有t组数据\n  \n 每组数据的第一行输入两个数n，q，代表n个魔法石，q次询问\n  \n 接下来一行n个整数ai，表示每个魔法石的符文\n  \n 接下来q行，每行一个数x，代表符文为x\n  \n 数据范围：1<=t<=100,1<=n<=100000,1<=q<=1000,0<=ai<=100000,0<=x<=100000\n \n \n 输出\n \n \n 每组输出q行\n  \n 每行输出符文为x的魔法石的个数\n \n \n 样例输入Copy\n \n \n1\n5 2\n1 1 2 2 3\n2\n3 \n \n 样例输出Copy\n \n \n2\n1 ",
   "difficulty": "困难",
   "answer_id": 53347760,
   "answer_content": "<p>我帮你改良了一下&#xff0c;试试我这个代码</p>\n\n<pre>\n<code>#include&lt;stdio.h&gt;\n#include&lt;string.h&gt;\nint a[100001];\nint main()\n{\n    int t,i,n,q,x,y;\n    scanf(&#34;%d&#34;,&amp;t);\n    while(t--)\n    {\n\t\tmemset(a,0,sizeof(a));\n        scanf(&#34;%d %d&#34;,&amp;n,&amp;q);\n        for(i&#61;0;i&lt;n;i&#43;&#43;)\n\t\t{\n            scanf(&#34;%d&#34;,&amp;y);\n\t\t\ta[y]&#43;&#43;;\n\t\t }\n            while(q--)\n            {\n                scanf(&#34;%d&#34;,&amp;x);\n                printf(&#34;%d\\n&#34;,a[x]);\n            }\n    }\n    return 0;\n}</code></pre>\n\n<p> </p>",
   "tag_name": "c语言",
   "cpp": "#include<stdio.h>\n#include<string.h>\nint a[100001];\nint main()\n{\n\tint t,i,n,q,x,y;\n\tscanf(\"%d\",&t);\n\twhile(t--)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tscanf(\"%d %d\",&n,&q);\n\t\tfor(i=0;i<n;i++)\n\t\t{\n\t\t\tscanf(\"%d\",&y);\n\t\t\ta[y]++;\n\t\t }\n\t\t\twhile(q--)\n\t\t\t{\n\t\t\t\tscanf(\"%d\",&x);\n\t\t\t\tprintf(\"%d\\n\",a[x]);\n\t\t\t}\n\t}\n\treturn 0;\n}",
   "topic_link": "https://bbs.csdn.net/topics/600469964",
   "status": 0,
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解",
   "license": "csdn.net",
   "notebook": {
      "cpp": "https://codechina.csdn.net/csdn/csdn-daily-code/-/jupyter/master/data/notebook/answer/ipynb/cpp/126.ipynb?type=file"
   }
}