扣分:10 When test group(9) step(1),the input is (8 6 8 9 8 7 2 4 5 1 2 ),time out. 扣分:5 When test group(10) step(1),the input is (8 8 8 9 8 7 2 4 5 1 2 ),time out.
测试组9步骤1输入(8 6 8 9 8 7 2 4 5 1 2)超时，扣10分。 测试组10步骤1输入(8 8 8 9 8 7 2 4 5 1 2)超时，扣5分。 [2025-11-17 21:34:44 | AI问答 | 73点数解答]
相关提问
- [DeepSeek] 扣分:10 When test group(9) step(1),the input is (8 6 8 9 8 7 2 4 5 1 2 ),time out. 扣分:5 When test group(10) step(1),the input is (8 8 8 9 8 7 2 4 5 1 2 ),time out.（73点数解答 | 2025-11-17 21:34:44）48
- [DeepSeek] time_space_table: /1213/sample.in:MLE mem=196608k time=158ms /1213/star0.in:MLE mem=196608k time=4ms /1213/star1.in:MLE mem=196608k time=4ms /1213/star2.in:MLE mem=196608k time=3ms /1213/star3.in:MLE mem=196608k time=2ms /1213/star4.in:MLE mem=196608k time=4ms /1213/star5.in:MLE mem=196608k time=2ms /1213/star6.in:MLE mem=196608k time=3ms /1213/star7.in:MLE mem=196608k time=3ms 上题内存超限，重写（714点数解答 | 2026-01-06 17:49:47）22
- [DeepSeek] #include <stdio.h> #include <string.h> #include <windows.h> #include <conio.h> // 假设 Schedle.h 中包含了所有未定义的常量和数组声明，如 dwlKey_PC_1、dwlKey_PC_2 等 #include "Schedle.h" // 定义 DWORDLONG 类型，这里假设它是 unsigned __int64 或等效的 64 位无符号整数类型 typedef unsigned __int64 DWORDLONG; class CShift { public: DWORDLONG mask[16]; int step[16]; CShift() { for (int i = 0; i < 16; i++) { step[i] = 2; mask[i] = 0xc000000; } step[0] = step[1] = step[8] = step[15] = 1; （861点数解答 | 2025-05-05 14:03:01）160
- [字节豆包] skill={ enable:"phaseUse", filter:function(event){ return event.player.num('h')>0; }, content:function(){ 'step 0' if(player.num('h')==0){ event.finish(); return; } 'step 1' // 选择两张手牌弃置 player.chooseCard('h',[2,2],'请选择两张手牌发动【灵魂能源max】'); 'step 2' if(!result.bool){ event.finish(); return; } 'step 3' // 弃置手牌 player.（1114点数解答 | 2026-01-20 21:22:49）21
- [字节豆包] 下面哪条命令用于判断文件test.txt是否存在？ a. [ test.txt -f ] b. if exist test.txt c. [ test.txt -e ] d. [ -f test.txt ]（62点数解答 | 2024-11-22 17:14:08）265
- [GPT] is it a cat? time limit per test 2 seconds memory limit per test 256 megabytes you were walking down the street and heard a sound. the sound was described by the string s consisting of lowercase and uppercase latin characters. now you want to find out if the sound was a cat meowing. for the sound to be a meowing, the string can only contain the letters 'm', 'e', 'o' and 'w', in either uppercase or lowercase. also: string must start with non-empty sequence consisting only of characters 'm' o（180点数解答 | 2024-12-17 01:45:05）277
- [字节豆包] // Photoshop CS6 Script to Convert an Image to a Hand-Drawn Sketch Style #target photoshop app.bringToFront(); if (app.documents.length > 0) { var doc = app.activeDocument; // Step 1: Duplicate the original layer var originalLayer = doc.activeLayer; var duplicatedLayer = originalLayer.duplicate(); duplicatedLayer.name = "Hand Drawn Sketch Layer"; // Step 2: Desaturate the duplicated layer desaturateLayer(); // Step 3: Duplicate the desaturated layer var d（164点数解答 | 2025-03-02 23:18:21）244
- [DeepSeek] 楼梯有 n 级台阶，每一步可以跨越 1 ~ 3 级台阶。请问一共有多少种上法。 函数原型 double Climb(int step); 说明：参数 step 为台阶数。函数值为爬楼梯的方法总数。 裁判程序 #include <stdio.h> double Climb(int step); int main() { int n; scanf("%d", &n); printf("%g\n", Climb(n)); return 0; } /* 你提交的代码将被嵌在这里 */ 要求：用递归方法完成函数的设计，不得使用循环语句。 输入样例1 15 输出样例1 5768（385点数解答 | 2025-05-18 11:29:47）201
- [字节豆包] { audio:2, audioname:["re_liufeng"], trigger:{ player:"phaseZhunbeiBegin", }, direct:true, content:function () { "step 0"; player.chooseTarget( get.prompt2(event.name), [1, 2], function (card, player, target) { return target.countCards("he") > 0; }, function (target) { return -get.attitude(_status.event.player, target); } ); "step 1"; if (result.bool) { result.targets.sortBySeat(); player.logSkill(event.name, result.targets); event.targets = result.targets; } else { event.finish(); } "step 2"; i（2075点数解答 | 2025-11-16 13:40:21）58
- [阿里通义] ========[cyj01.out]========= Expected | Yours 27604 | 11972450 ============================== ========[cyj02.out]========= Expected | Yours 5289 | 530127 ============================== ========[cyj03.out]========= Expected | Yours 343 | 12817 ============================== ========[cyj04.out]========= Expected | Yours 1403 | 1048464 ============================== ========[cyj05.out]========= Expected （1107点数解答 | 2026-01-08 12:17:38）20
- [阿里通义] ========[cyj01.out]========= Expected | Yours 27604 | 11972450 ============================== ========[cyj02.out]========= Expected | Yours 5289 | 530127 ============================== ========[cyj03.out]========= Expected | Yours 343 | 12817 ============================== ========[cyj04.out]========= Expected | Yours 1403 | 1048464 ============================== ========[cyj05.out]========= Expected （1316点数解答 | 2026-01-08 12:18:39）27
- [阿里通义] ========[cyj01.out]========= Expected | Yours 27604 | 11972450 ============================== ========[cyj02.out]========= Expected | Yours 5289 | 530127 ============================== ========[cyj03.out]========= Expected | Yours 343 | 12817 ============================== ========[cyj04.out]========= Expected | Yours 1403 | 1048464 ============================== ========[cyj05.out]========= Expected （980点数解答 | 2026-01-08 12:21:23）21