submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume 1334488854509162496,5943de78e026c83f7de9c648e5a9a906b7593729c227936dfc48fb625fe57c14,2020-12-03 21:25:11,Octave,5.0,1334488521828286464,1334477302199304192,1141715705586737152,"x = input(\"" \"");\ny = max(x);\nclc;\nfprintf(\""%d\"",y)",ACCEPTED,32,6192 1509710101404860416,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 09:51:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]，b=[7,1;8,3]，c=[5,9;6,2]\nd=[a ; b ; c]\nfprint(\""%d\"",d)",WRONG_ANSWER,25,7120 1509711634476662784,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-04-01 09:57:57,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%d ',4)\nfprintf('%d ',7)\nfprintf('%d\\n',5)\nfprintf('%d ',2)\nfprintf('%d ',8)\nfprintf('%d\\n',6)\nfprintf('%d ',5)\nfprintf('%d ',1)\nfprintf('%d\\n',9)\nfprintf('%d ',7)\nfprintf('%d ',3)\nfprintf('%d',2)",ACCEPTED,26,6764 1509712209840267264,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 10:00:14,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[4 2 5 7 7 8 1 3 5 6 9 2 ]\nprintf(new_v1)",WRONG_ANSWER,29,6500 1509714115349594112,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-01 10:07:48,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros = zeros(1,15);\nfprintf('%d ',myZeros)",ACCEPTED,26,7096 1509714823784316928,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:10:37,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew_v=reshape(D,[4,3])\ndisp(new_v);",WRONG_ANSWER,26,6440 1509715180077023232,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:12:02,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew_v=reshape(D,[4,3])\nfprintf('%d',round(reshape(D,[4,3])));",WRONG_ANSWER,27,6516 1509715427777404928,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:13:01,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros([1,15])",WRONG_ANSWER,26,6752 1509715560718499840,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:13:33,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros([1,15])\nfprintf('%d\\n',round(A));",WRONG_ANSWER,26,6508 1509715567660908544,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-01 10:13:35,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,26,6756 1509716029869015040,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 10:15:25,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:) , b(:) , c(:)];\nfprintf(\""%d %d %d\\n\"",d)",WRONG_ANSWER,27,6496 1509716067421347840,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-01 10:15:34,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"evens = 6:2:33;\nfprintf('%d ',evens)",ACCEPTED,26,6884 1509716378885439488,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:16:48,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros([1,15])\nfprintf('%d ',round(A));",WRONG_ANSWER,35,6684 1509717271652163584,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:20:21,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros([1,14])\nfprintf('%d ',round(A));\nfprintf('%d',round(c));",WRONG_ANSWER,27,6676 1509717445869404160,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 10:21:02,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:) , b(:) , c(:)];\nfprintf(\""%d %d %d\\n\"",transpose(d)(1:9));\nfprintf(\""%d %d %d\"",transpose(d)(10:12));",ACCEPTED,28,6740 1509717729798619136,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:22:10,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(1,15)",WRONG_ANSWER,26,6508 1509718009328844800,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:23:17,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 1:4\n d(i,2)=b(i);\nend\nfor i = 1:4\n d(i,3)=c(i);\nend\nfor i = 1:4\n for j = 1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend\n",ACCEPTED,26,6756 1509718052126687232,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 10:23:27,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\n\nd=[transpose(a(:)),transpose(b(:)),transpose(c(:))];\nfprintf(\""%d \"",d)",ACCEPTED,24,6380 1509718083224821760,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:23:34,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(1,15)\nfprintf(' %d',round(A));",WRONG_ANSWER,26,6744 1509718139843731456,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:23:48,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew_v=reshape(D,[4,3])\nfprintf('%d',new_v(1,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(1,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(1,3));\nfprintf('%d',new_v(2,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(2,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(2,3));\nfprintf('%d',new_v(3,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(3,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(3,3));\nfprintf('%d',new_v(4,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(4,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(4,3));",WRONG_ANSWER,25,6512 1509718529703559168,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 10:25:21,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew_v=horzcat(reshape(a,4,1),reshape(b,4,1),reshape(c,4,1));\nnew_v=transpose(new_v);\nfprintf('%d %d %d\\n',new_v(:,1:3));\nfprintf('%d %d %d',new_v(:,4));",ACCEPTED,29,6788 1509718933401853952,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:26:57,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew_v=reshape(D,[4,3])；\nfprintf('%d',new_v(1,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(1,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(1,3));\nfprintf('%d',new_v(2,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(2,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(2,3));\nfprintf('%d',new_v(3,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(3,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(3,3));\nfprintf('%d',new_v(4,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(4,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(4,3));",WRONG_ANSWER,27,6760 1509718957884006400,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:27:03,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew_v=reshape(D,[4,3]);\nfprintf('%d',new_v(1,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(1,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(1,3));\nfprintf('%d',new_v(2,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(2,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(2,3));\nfprintf('%d',new_v(3,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(3,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(3,3));\nfprintf('%d',new_v(4,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(4,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(4,3));",ACCEPTED,26,6636 1509719018565632000,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:27:17,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(1,12);\nfor i = 1:4\n d(i)=a(i);\nend\nfor i = 1:4\n d(4+i)=b(i);\nend\nfor i = 1:4\n d(8+i)=c(i);\nend\nfor i = 1:12\n fprintf(\""%d \"",d(i));\nend",ACCEPTED,27,6428 1509719029346557952,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:27:20,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(1,15)\n",WRONG_ANSWER,28,6748 1509719558054625280,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 10:29:26,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew_v1=[reshape(a,1,4),reshape(b,1,4),reshape(c,1,4)];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d ',new_v1);",ACCEPTED,28,6500 1509719627041701888,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:29:42,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"zeros(1,15)\n",WRONG_ANSWER,27,6504 1509720043273412608,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:31:22,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"\nfprintf('%d',round(zeros(1,15)));",PRESENTATION_ERROR,25,6504 1509720166820831232,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:31:51,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"\nfprintf('%d ',round(zeros(1,15)));",ACCEPTED,26,6536 1509720339659710464,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 10:32:32,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfprintf('%d %d %d\\n',([a(:),b(:),c(:)])')",ACCEPTED,25,6768 1509720349548314624,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:32:35,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew=reshape(D,[1,12]);\nfor i=1:11\n fprintf('%d',new(1,i));\n fprintf('%c',' ');\nend;\nfprintf('%d',new(1,12));",PRESENTATION_ERROR,28,6764 1509720365089046528,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 10:32:38,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,5;2,7];\n>>b=[7,1;8,3];\n>>c=[5,9;6,2];\n>>d(4,3)=0;\n>>d(1:4)=a;\n>>d(5:8)=b;\n>>d(9:12)=c;\n>>fprintf('%d\\n',d)",WRONG_ANSWER,24,6636 1509720486992297984,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:33:08,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew=reshape(D,[1,12]);\nfor i=1:12\n fprintf('%d',new(1,i));\n fprintf('%c',' ');\nend;",ACCEPTED,30,6496 1509720995492102144,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 10:35:09,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfprintf('%d ',[a(:),b(:),c(:)])",ACCEPTED,27,6616 1509721563267481600,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 10:37:24,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);\n a(:,2),b(:,2),c(:,2)];\nnew_=new';\nfprintf('%d %d %d\\n',new'(1:3,1:3));\nfprintf('%d %d %d',new'(1:3,4));",ACCEPTED,26,6752 1509722033202225152,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 10:39:16,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);\n a(:,2),b(:,2),c(:,2)];\nnew_=new';\nfprintf('%d %d %d\\n',new'(1:3,1:3));\nfprintf('%d %d %d',new'(1:3,4));",ACCEPTED,26,6508 1509722173529489408,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-01 10:39:50,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4 5; 2 7];\nb = [7 1; 8 3];\nc = [5 9; 6 2];\nA = a(:);\nB = b(:);\nC = c(:);\nnew_v = [A B C];\nfprintf('%d ',new_v)",ACCEPTED,29,6660 1509722661616451584,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 10:41:46,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);\n a(:,2),b(:,2),c(:,2)];\nnew_=new';\nfprintf('%d %d %d\\n',new_(1:3,1:3));\nfprintf('%d %d %d',new_(1:3,4));",ACCEPTED,31,6672 1509723170905620480,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:43:47,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"new=[4,2,5,7,7,8,1,3,5,6,9,2]\nfprintf('%d ',round(new))",WRONG_ANSWER,28,6784 1509723229849739264,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 10:44:01,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1);\n a(:,2);\n b(:,1);\n b(:,2);\n c(:,1);\n c(:,2)];\nfprintf('%d ',new)",ACCEPTED,34,6752 1509723231156797440,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:44:02,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1,2,-1,5,6,7,-4,3];\nB=ones(1,8)*nan;\nfor i=1:8\n if A(1,i)>0\n B(1,i)=A(1,i)*A(1,i)*A(1,i);\n end\n if A(1,i)<0\n B(1,i)=0;\n end\nend\nfor j=1:8\n fprintf('%d',B(1,j))\n fprintf('%c',' ')\nend",ACCEPTED,28,6764 1509723231983910912,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:44:02,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"new=[4,2,5,7,7,8,1,3,5,6,9,2]\nfprintf('%d ',round(new))",WRONG_ANSWER,26,6912 1509723357610868736,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:44:32,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfor i = 1:l\n fprintf(\""%d \"",B(i));\nend",WRONG_ANSWER,28,6504 1509723402502504448,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:44:43,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"new=[4,2,5,7,7,8,1,3,5,6,9,2]\nfprintf('%d ',round([4,2,5,7,7,8,1,3,5,6,9,2]))",WRONG_ANSWER,28,6888 1509723561596649472,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:45:21,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"\nfprintf('%d ',round([4,2,5,7,7,8,1,3,5,6,9,2]))",ACCEPTED,24,6536 1509723878360440832,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:46:36,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"fprintf('%d ',round([4,2,5,7,7,8,1,3,5,6,9,2]))",WRONG_ANSWER,25,6508 1509723901716955136,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:46:42,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfor i = 1:l\n fprintf(\""%d \"",B(i));\nend",WRONG_ANSWER,28,6500 1509723967513001984,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:46:57,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"fprintf('%d ',round( [1 8 0 125 216 343 0 27]))",ACCEPTED,29,6516 1509724267205246976,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:48:09,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"fprintf('%d ',round( [6 8 10 12 14 16 18 20 22 24 26 28 30 32]))",ACCEPTED,26,6492 1509724386444279808,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:48:37,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%d ',round( [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 \n]))",WRONG_ANSWER,26,6516 1509724435656048640,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:48:49,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%f ',round( [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 \n]))",WRONG_ANSWER,27,6512 1509724625452498944,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:49:34,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=zeros(1,100);\nfor i = 1:14\n A(i)=2*i+4;\nend\nfor i = 1:14\n fprintf(\""%d \"",A(i))\nend",ACCEPTED,25,6508 1509724940743360512,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 10:50:49,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"fprintf('%d ',([1; 8; 0; 125; 216; 343; 0; 27 ])')",ACCEPTED,30,6564 1509725186768650240,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 10:51:48,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[];\nA=ones(1,100)*nan;\nfor i=6:33\n if mod(i,2)~=0\n A(1,i)=0;\n else\n A(1,i)=i;\n end\nend\nfor j=6:33\n if A(1,j)~=0\n fprintf('%d',A(1,j))\n fprintf('%c',' ')\n end\nend",ACCEPTED,27,6752 1509725203151601664,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:51:52,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\nfor i = 1:20\n fprintf(\""%.2f \"",x(i));\nend",ACCEPTED,30,10600 1509725330776612864,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 10:52:22,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"fprintf('%d ',([6; 8; 10; 12; 14; 16; 18; 20; 22; 24; 26; 28; 30; 32 ])')",ACCEPTED,34,6504 1509725396659175424,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 10:52:38,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\na=reshape(a,4,1)\nb=reshape(b,4,1)\nc=reshape(c,4,1)\nd=[a,b,c]\nfprintf('%d\\n',round(d))",WRONG_ANSWER,26,6508 1509725523223863296,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:53:08,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%.2f ',round( [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ]))\n",WRONG_ANSWER,26,6496 1509725550543994880,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:53:15,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%f ',round( [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ]))\n",WRONG_ANSWER,25,6660 1509725582505426944,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 10:53:22,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%d ',round( [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ]))\n",WRONG_ANSWER,26,6720 1509725674659209216,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 10:53:44,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\na=reshape(a,4,1)\nb=reshape(b,4,1)\nc=reshape(c,4,1)\nd=[a,b,c]\ndisp(d)",WRONG_ANSWER,27,6756 1509725931135139840,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:54:45,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfor i = 1:15\n fprintf(\""%d \"",x(i))\nend",ACCEPTED,27,6976 1509726035645448192,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-01 10:55:10,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nB = zeros(1,8);\nfor i = 1:8\n if A(1,i) < 0 \n B(1,i) = 0;\n else \n B(1,i) = A(1,i)*A(1,i)*A(1,i);\n end\nend\nfprintf('%d ',B)",ACCEPTED,26,6760 1509726051223822336,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 10:55:14,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nB(find(A<0))=0;\nfprintf('%d ',B)",ACCEPTED,26,6508 1509726149041815552,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 10:55:37,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"fprintf('%d ',vec=6:2:33)",ACCEPTED,25,6760 1509726353061986304,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:56:26,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfor i = 1:l\n fprintf(\""%d \"",B(i));\nend",WRONG_ANSWER,26,6764 1509726681416433664,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:57:44,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfprintf(\""B= [\"");\nfor i = 1:l-1\n fprintf(\""%d \"",B(i));\nend\nfprintf(\""%d]\"",B(l));",WRONG_ANSWER,25,6512 1509726916621983744,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 10:58:40,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfprintf(\""B= [\"");\nfor i = 1:l-1\n fprintf(\""%d \"",B(i));\nend\nfprintf(\""%d]\"",B(l));",WRONG_ANSWER,27,6764 1509727548081274880,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 11:01:11,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=reshape(a,4,1)\nb=reshape(b,4,1)\nc=reshape(c,4,1)\nd=[a,b,c]\nfprintf('%d\\n',round(d))",WRONG_ANSWER,27,6508 1509727662075633664,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 11:01:38,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",WRONG_ANSWER,26,6760 1509727926308397056,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-04-01 11:02:41,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"fprintf('%d %d %d %d %d %d %d %d %d %d %d %d ',4,2,5,7,7,8,1,3,5,6,9,2)",ACCEPTED,27,6508 1509728334296735744,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:04:18,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"fprintf('%d ',round( [6 8 10 12 14 16 18 20 22 24 26 28 30 32]))",ACCEPTED,25,6648 1509728364181151744,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:04:26,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%d ',round( [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ]))\n",WRONG_ANSWER,29,6504 1509728370034835456,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 11:04:27,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"\nfprintf('%.2f ',theta=0:(2*pi/19):2*pi)",ACCEPTED,29,6484 1509728378054344704,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-04-01 11:04:29,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"fprintf('%d %d %d %d %d %d %d %d ',1,8,0,125,216,343,0,27)",ACCEPTED,26,6872 1509728417074790400,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:04:38,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%f ',round( [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ]))\n",WRONG_ANSWER,27,6764 1509728650299793408,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-01 11:05:34,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4 5; 2 7];\nb = [7 1; 8 3];\nc = [5 9; 6 2];\nA = a(:);\nB = b(:);\nC = c(:);\nnew_v = [A B C];\nfor j = 1:4\n for i = 1:3\n fprintf('%d',new_v(j,i))\n if(i~=3)\n fprintf(' ')\n end\n end\n if(j~=4)\n fprintf('\\n')\n end\nend",ACCEPTED,30,6500 1509728749620912128,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-04-01 11:05:57,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"fprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d ',6,8,10,12,14,16,18,20,22,24,26,28,30,32)",ACCEPTED,26,6508 1509728821364482048,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 11:06:15,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=(6:33);\nB=A(find(rem(A,2)==0));\nfprintf('%d ',B);",ACCEPTED,35,8632 1509729193550241792,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 11:07:43,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",WRONG_ANSWER,25,6380 1509729228258107392,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 11:07:52,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15)\nfprintf(\""%d\"",a)",WRONG_ANSWER,30,6500 1509729294350385152,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 11:08:07,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15)\ndisp(a)",WRONG_ANSWER,28,6624 1509729461422096384,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 11:08:47,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"maZeros=zeros(1,15)",WRONG_ANSWER,27,6528 1509729596102033408,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-04-01 11:09:19,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f ',0.00,0.33,0.66,0.99,1.32,1.65,1.98,2.31,2.65,2.98,3.31,3.64,3.97,4.30,4.63,4.96,5.29,5.62,5.95,6.28 \n)",ACCEPTED,29,6504 1509729617904754688,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 11:09:24,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"\nfprintf('%d ',myZeros=zeros(15,1))\n",ACCEPTED,30,6516 1509729943600119808,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:10:42,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%.2f ',([0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ]))\n",ACCEPTED,26,6752 1509730083220840448,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-04-01 11:11:15,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"fprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d ',0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)",ACCEPTED,25,6632 1509730250656727040,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:11:55,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%.2f ',([0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ]))",WRONG_ANSWER,27,6568 1509731550023475200,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 11:17:05,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\nfprintf('%.2f ',x);",ACCEPTED,26,6632 1509731694265589760,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 11:17:40,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=linspace(6,32,14);\nfprintf('%d ',a);",ACCEPTED,26,6572 1509732157914972160,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-04-01 11:19:30,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(1,15);\nfprintf('%d ',A);",ACCEPTED,25,6380 1509732212115333120,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 11:19:43,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a);",ACCEPTED,25,6760 1509732539933745152,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:21:01,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new=[4,7,5;2,8,6;5,1,9;7,3,2]",WRONG_ANSWER,26,6504 1509732775241023488,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 11:21:57,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros);",ACCEPTED,25,6380 1509734415780118528,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:28:28,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n A(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',A(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,28,6752 1509735033328467968,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:30:56,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n A(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',A(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,27,6504 1509735158037708800,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:31:25,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n A(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%.2f',A(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,25,6692 1509735185838391296,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:31:32,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n A(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',A(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,25,6504 1509735198525325312,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-04-01 11:31:35,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=zeros(4,3);\nnew(:,[1,2,3])=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',new')",ACCEPTED,25,6504 1509735306286219264,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:32:01,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"clear\nA=linspace(0,2*pi,20);\nfor i=1:20\n A(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',A(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,27,6516 1509735785398099968,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:33:55,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,26,6764 1509735911533404160,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 11:34:25,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,5;2,7];\n>>b=[7,1;8,3];\n>>c=[5,9;6,2];\n>>new(4,3)=0;\n>>new(1:4)=a;\n>>new(5:8)=b;\n>>new(9:12)=c;\n>>fprintf('%d\\n',new)",WRONG_ANSWER,27,6636 1509736283252031488,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:35:54,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,26,6640 1509737253579931648,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-04-01 11:39:45,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:),b(:),c(:)];\nnew=new(:)';\nfprintf('%d ',new)",ACCEPTED,25,6628 1509737995640389632,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 11:42:42,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"scanf(\""A= [\"");\nb=scanf(\""%d\"");\nc=[];\n\nfor i = [1:length(b)]\n if b(i) > 0\n c(i) = b(i)^3;\n else\n c(i)= 0;\n end\nend\n\nprintf(\""%d \"",c)\n",WRONG_ANSWER,27,6752 1509738336805076992,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:44:03,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=ones(1,15)*0;\nfor i=1:15\n fprintf('%d',A(1,i))\n fprintf('%c',' ')\nend\n",ACCEPTED,29,6748 1509738384363454464,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 11:44:15,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A=input('');\nB=A.*A.*A;\nB((B<0))=0;\nB,WRONG_ANSWER,26,6688 1509738574974435328,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 11:45:00,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"scanf(\""A= [\"");\nb=scanf(\""%d\"");\nc=[];\n\nfor i = [1:length(b)]\n if b(i) > 0\n c(i) = b(i)^3;\n else\n c(i)= 0;\n end\nend\n\nprintf(\""%d \"",c)\n",WRONG_ANSWER,28,6636 1509738616431665152,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:45:10,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=[4 7 5]\na2=[2 8 6]\n a3=[5 1 9]\na4=[7 3 2]\nfprintf('%d ',a1)\nfprintf('\\n')\nfprintf('%d ',a2)\nfprintf('\\n')\nfprintf('%d ',a3)\nfprintf('\\n')\nfprintf('%d ',a4)",WRONG_ANSWER,25,6504 1509738701043359744,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 11:45:30,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"\nc=[];\n\nfor i = [1:length(A)]\n if A(i) > 0\n c(i) = A(i)^3;\n else\n c(i)= 0;\n end\nend\n\nprintf(\""%d \"",c)\n",WRONG_ANSWER,28,6756 1509738875412430848,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-04-01 11:46:12,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"filter=logical(A>0);\nB=A.^3.*filter;\nfprintf('%d ',B)",WRONG_ANSWER,26,6496 1509739233694072832,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-04-01 11:47:37,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nfilter=logical(A>0);\nB=A.^3.*filter;\nfprintf('%d ',B)",ACCEPTED,28,6496 1509739464124104704,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-04-01 11:48:32,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf('%d ',a)",ACCEPTED,29,6656 1509740265245392896,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-01 11:51:43,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",WRONG_ANSWER,27,6480 1509740330043924480,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-04-01 11:51:58,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,26,6568 1509740632128716800,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-04-01 11:53:10,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros)",ACCEPTED,27,6644 1509741283568607232,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 11:55:46,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"\nc=[6:2:32];\nprintf(\""%d \"",c);",ACCEPTED,25,6760 1509741478459572224,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 11:56:32,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=[4 7 5]\na2=[2 8 6]\n a3=[5 1 9]\na4=[7 3 2]\nfprintf('%d ',a1)\nfprintf('\\n')\nfprintf('%d ',a2)\nfprintf('\\n')\nfprintf('%d ',a3)\nfprintf('\\n')\nfprintf('%d ',a4)",WRONG_ANSWER,26,6380 1509741649889165312,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 11:57:13,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"\nc=[];\n\nfor i = [1:length(A)]\n if A(i) > 0\n c(i) = A(i)^3;\n else\n c(i)= 0;\n end\nend\n\nprintf(\""B= [\"")\n\nprintf(\""%d \"",c(1:length(c)-1))\nprintf(\""%d\"",c(length(c)))\nprintf(\""]\"")\n",WRONG_ANSWER,26,6692 1509742058687840256,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 11:58:51,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"scanf(\""A= [\"");\nA=scanf(\""%d\"");\n\n\nc=[];\n\nfor i = [1:length(A)]\n if A(i) > 0\n c(i) = A(i)^3;\n else\n c(i)= 0;\n end\nend\n\n\nprintf(\""B= [\"")\n\nprintf(\""%d \"",c(1:length(c)-1))\nprintf(\""%d\"",c(length(c)))\nprintf(\""]\"")",WRONG_ANSWER,27,6752 1509742201601089536,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:59:25,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,26,6380 1509742266851147776,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 11:59:40,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,26,6496 1509743001005342720,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 12:02:35,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"\n\na=[0:(2*pi)/19:2*pi];\n\nprintf(\""%.2f \"",a)\n",ACCEPTED,26,6760 1509743684936105984,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 12:05:18,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"\nc=zeros(15)(1:15);\nprintf(\""%d \"",c);",ACCEPTED,24,6764 1509744896147808256,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 12:10:07,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",WRONG_ANSWER,25,6628 1509744928220921856,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 12:10:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new=[4,7,5;2,8,6;5,1,9;7,3,2]\nfprintf('%d %d %d\\n',new)",WRONG_ANSWER,26,6508 1509745260815810560,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 12:11:34,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,25,6760 1509745286493339648,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 12:11:40,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,28,6496 1509745372511690752,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 12:12:01,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\nfprintf('%d %d %d\\n',[4,7,5;2,8,6;5,1,9;7,3,2])",WRONG_ANSWER,25,6376 1509745398968631296,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 12:12:07,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\nfprintf('%d %d %d\\n',[4,7,5;2,8,6;5,1,9;7,3,2])",WRONG_ANSWER,25,6760 1509746081948852224,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 12:14:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,7,5;2,8,6;5,1,9;7,3,2];\n>>fprintf('%d\\n',a)",WRONG_ANSWER,26,6636 1509746397322764288,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-04-01 12:16:05,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%d %d %d\\n',[4 8 9;7 6 7;5 5 3;2 1 2])\n",ACCEPTED,26,6504 1509746591254798336,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 12:16:51,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfprintf('%d',A(1,1));\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,28,6508 1509746645550063616,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 12:17:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,7,5;2,8,6;5,1,9;7,3,2];\n>>a",WRONG_ANSWER,26,6548 1509746697466429440,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 12:17:17,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%d',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,33,12088 1509747757764673536,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-01 12:21:29,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,27,6508 1509751473242734592,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 12:36:15,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfor i = 1:l-1\n fprintf(\""%d \"",B(i));\nend",WRONG_ANSWER,26,6752 1509752100536016896,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 12:38:45,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nB",WRONG_ANSWER,26,6508 1509752704251551744,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-01 12:41:09,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfor i = 1:l\n fprintf(\""%d \"",B(i))\nend\n ",ACCEPTED,26,6508 1509754026430390272,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 12:46:24,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,7,5;2,8,6;5,1,9;7,3,2];\n>>fprintf('%d\\n',a)",WRONG_ANSWER,29,8328 1509754049359085568,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 12:46:29,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,7,5;2,8,6;5,1,9;7,3,2];\n>>fprintf('%d',a)",WRONG_ANSWER,27,6636 1509754142411284480,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 12:46:52,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\nfprintf('%d',a)",WRONG_ANSWER,24,6384 1509754752456024064,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 12:49:17,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,a = [4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf(a),WRONG_ANSWER,27,6516 1509754917114445824,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 12:49:56,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,a = [4 7 5;2 8 6;5 1 9;7 3 2];\ndisp(a),PRESENTATION_ERROR,25,6552 1509755486023016448,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 12:52:12,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[4,2,5,7,7,8,1,3,5,6,9,2 ]\nprintf(new_v1)",WRONG_ANSWER,25,6748 1509755999350571008,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 12:54:14,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d',a)",WRONG_ANSWER,25,6384 1509756556232507392,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 12:56:27,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[a;b;c ]\nprintf(new_v1)",WRONG_ANSWER,25,6500 1509757026976751616,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 12:58:19,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d',a')",PRESENTATION_ERROR,26,6764 1509757527629848576,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 13:00:19,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nnew_v=[A,B,C]\n",WRONG_ANSWER,25,6504 1509757588231782400,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 13:00:33,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a')",ACCEPTED,29,6496 1509757612148539392,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 13:00:39,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\na_vec = [a(:,1); a(:,2)];\nb_vec = [b(:,1); b(:,2)];\nc_vec = [c(:,1); c(:,2)];\nnew_v = [a_vec, b_vec, c_vec];\nfprintf(\""%d %d %d\\n\"", transpose(new_v));\nclear;",ACCEPTED,25,6752 1509757745997897728,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 13:01:11,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nfprintf(new_v=[A,B,C])\n",WRONG_ANSWER,26,6520 1509758588905472000,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 13:04:32,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a =[4 2 5 7 7 8 1 3 5 6 9 2];\nfprintf('%d ',a)",ACCEPTED,27,6384 1509759114108559360,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 13:06:37,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"a = [1 8 0 125 216 343 0 27];\nfprintf('%d ',a)",ACCEPTED,24,7012 1509759251743916032,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 13:07:10,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a')",ACCEPTED,25,6752 1509759253399830528,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 13:07:10,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a = [6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf('%d ',a)",ACCEPTED,25,6748 1509759289002647552,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 13:07:19,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nfprintf('%d\\n',new_v=[A,B,C])\n",WRONG_ANSWER,27,6496 1509759340242894848,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 13:07:31,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nd=[a(:),b(:),c(:)]\nfprintf('%d %d %d\\n',d')",WRONG_ANSWER,25,6760 1509759438087618560,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 13:07:54,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = [0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28];\nfprintf('%.2f ',a)",ACCEPTED,24,6760 1509759558124404736,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-04-01 13:08:23,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ];\nfprintf('%d ',a)",ACCEPTED,28,6660 1509759697803952128,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 13:08:56,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',d')",ACCEPTED,26,6484 1509761519158657024,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 13:16:10,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;3 8];\nc=[5 9;6 2];\nnew(4,3)=0;\nnew(1:4)=a;\nnew(5:8)=b;\nnew(9:12)=c;\nfprintf('%d %d %d\\n',new')",WRONG_ANSWER,26,6500 1509761783640449024,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 13:17:13,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew(4,3)=0;\nnew(1:4)=a;\nnew(5:8)=b;\nnew(9:12)=c;\nfprintf('%d %d %d\\n',new')",ACCEPTED,25,6748 1509762077199056896,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 13:18:23,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[a‘;b’;c’ ]\nprintf(new_v1)",WRONG_ANSWER,25,6484 1509762581606055936,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 13:20:24,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:),b(:),c(:)];\nfprintf('%d ',d(:))",ACCEPTED,25,6756 1509763610572849152,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 13:24:29,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[reshape(a',1,4);reshape(b',1,4);reshape(c',1,4) ]\nprintf(new_v1)",WRONG_ANSWER,27,6508 1509763876401012736,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:25:32,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfprintf(v)",WRONG_ANSWER,28,6488 1509763904036552704,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:25:39,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfprintf(v);",WRONG_ANSWER,26,6500 1509764029197942784,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 13:26:09,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=reshape([reshape(a',1,4);reshape(b',1,4);reshape(c',1,4) ],1,12)\nprintf(new_v1)",WRONG_ANSWER,26,6764 1509764077772177408,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 13:26:20,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=reshape([reshape(a',1,4);reshape(b',1,4);reshape(c',1,4) ],1,12)\nprintf(new_v1)",WRONG_ANSWER,29,6756 1509764286947147776,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 13:27:10,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew(1,12)=0;\nnew(1:4)=a;\nnew(5:8)=b;\nnew(9:12)=c;\nfprintf('%d ',new)\n",ACCEPTED,25,6756 1509764378457636864,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 13:27:32,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[reshape(a',1,4) reshape(b',1,4) reshape(c',1,4) ]\nprintf(new_v1)",WRONG_ANSWER,25,6748 1509764545944584192,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:28:12,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfprintf(format,v);",WRONG_ANSWER,27,6624 1509764933985648640,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:29:44,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfprintf(\""%d\"",v);",WRONG_ANSWER,26,6508 1509766021036728320,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:34:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfor i=1:4\n for j=1:3\n fprintf(\""%d \"",v(i,j));\n end\n fprintf(\""\\n\"")\nend",PRESENTATION_ERROR,27,6504 1509766066875547648,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:34:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfor i=1:4\n for j=1:3\n fprintf(\""%d \"",v(i,j));\n end\nend",PRESENTATION_ERROR,27,7332 1509767030604972032,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:38:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfor i=1:3\n for j=1:3\n fprintf(\""%d \"",v(i,j));\n end\n fprintf(\""\\n\"")\nend\n for j=1:3\n fprintf(\""%d \"",v(4,j));\n end",PRESENTATION_ERROR,31,8488 1509767660221063168,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 13:40:34,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf('%d ',a)",ACCEPTED,24,6748 1509767840206307328,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:41:17,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nv(4,3)=0;\n\nfor i=1:4\n v(i)=a(i);\n v(i+4)=b(i);\n v(i+8)=c(i);\nend \nfor i=1:3\n for j=1:2\n fprintf(\""%d \"",v(i,j));\n end\n fprintf(\""%d\"",v(i,3));\n fprintf(\""\\n\"")\nend\n for j=1:2\n fprintf(\""%d \"",v(4,j));\n end\n fprintf(\""%d\"",v(4,3));",ACCEPTED,28,6468 1509768511064989696,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 13:43:57,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,8,9;7,6,7;5,5,3;2,1,2;];\nfprintf('%d %d %d\\n',round(a));",ACCEPTED,28,6676 1509768680232288256,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 13:44:38,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,2,5,7,7,8,1,3,5,6,9,2];\nfprintf('%d ',round(a));",ACCEPTED,29,9384 1509768691511607296,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 13:44:40,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,26,6636 1509769311433097216,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 13:47:08,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nfprint('%d ',myZeros)",WRONG_ANSWER,27,6632 1509769423056945152,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 13:47:35,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nfprintf('%d ',myZeros)",ACCEPTED,25,6508 1509769636307107840,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 13:48:26,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[reshape(a',1,4) reshape(b',1,4) reshape(c',1,4) ]\nfprintf('1')",WRONG_ANSWER,29,6500 1509771082268246016,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:54:10,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=reshape(a,1,4);\nb=reshape(b,1,4);\nc=reshape(c,1,4);\nv=[a,b,c];\nfprintf(\""%d\"",v[1]);\nfor i=2:12\nfprintf(\"" %d\"",v[i]);\nend",WRONG_ANSWER,27,6640 1509771508115931136,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:55:52,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=reshape(a,1,4);\nb=reshape(b,1,4);\nc=reshape(c,1,4);\nv=[a,b,c];\nfprintf(\""%d\"",v(1));\nfor i=2:12\nfprintf(\"" %d\"",v(i));\nend",PRESENTATION_ERROR,26,6780 1509771614795423744,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 13:56:17,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=reshape(a,1,4);\nb=reshape(b,1,4);\nc=reshape(c,1,4);\nv=[a,b,c];\n\nfor i=1:12\nfprintf(\""%d \"",v(i));\nend",ACCEPTED,24,6748 1509772621101228032,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:00:17,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=reshape(a,1,4);\nb=reshape(b,1,4);\nc=reshape(c,1,4);\nv=[a,b,c];\n\n\nfprintf(v);\n",WRONG_ANSWER,28,6496 1509772743788814336,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 14:00:46,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nfprintf('%d ',[A(1),B(1),C(1)])\nfprintf('\\n')\nfprintf('%d ',[A(2),B(2),C(2)])\nfprintf('\\n')\nfprintf('%d ',[A(3),B(3),C(3)])\nfprintf('\\n')\nfprintf('%d ',[A(4),B(4),C(4)])",PRESENTATION_ERROR,25,6760 1509773096903073792,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 14:02:11,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nfprintf('%d %d %d',A(1),B(1),C(1))\nfprintf('\\n')\nfprintf('%d %d %d',A(2),B(2),C(2))\nfprintf('\\n')\nfprintf('%d %d %d',A(3),B(3),C(3))\nfprintf('\\n')\nfprintf('%d %d %d',A(4),B(4),C(4))",ACCEPTED,27,6512 1509773440406618112,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:03:33,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=reshape(a,1,4);\nb=reshape(b,1,4);\nc=reshape(c,1,4);\nv=[a,b,c];\n\n\nfprintf(FORMAT,v);\n",WRONG_ANSWER,25,6756 1509773755924701184,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 14:04:48,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nfprintf('%d ',A,B,C)\n",ACCEPTED,26,6496 1509775517674258432,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:11:48,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"for i=1:length(A)\nif(A(i)<0)\n B(i)=0; continue;\n end\nB(i)=A(i)^3;\nend\nfprintf('%d ',B);",WRONG_ANSWER,28,6640 1509775732438564864,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:12:39,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"B=[1,8,0,125,216,343,0,27];\n\nfprintf('%d ',B);",ACCEPTED,29,6504 1509775937281548288,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:13:28,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6, 8 ,10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32 \n];\nfprintf('%d ',A);",ACCEPTED,32,12336 1509776472478203904,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:15:35,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"B=[1,8,0,125,216,343,0,27];\n\nfprintf('%d ',B);",ACCEPTED,27,6508 1509777278669570048,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:18:48,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linespace(0,6.28,20);\nfprintf('%.2f ',a);",WRONG_ANSWER,26,6752 1509777322625040384,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:18:58,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[0];\ninput('A=');\nfor i=1:length(A)\n if A(i)>0\n A(i)=A(i).^2;\n else \n A(i)=0;\n end \nend\nfor i=1:length(A)\n printf(\""%d \"",A(i));\nend",WRONG_ANSWER,25,6752 1509777392712695808,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:19:15,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,6.28,20);\nfprintf('%.2f ',a);",WRONG_ANSWER,26,6760 1509777472491716608,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:19:34,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[0];\ninput('');\nfor i=1:length(A)\n if A(i)>0\n A(i)=A(i).^2;\n else \n A(i)=0;\n end \nend\nfor i=1:length(A)\n printf(\""%d \"",A(i));\nend",WRONG_ANSWER,31,8524 1509777727443320832,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:20:35,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[0];\ninput('');\nfor i=1:length(A)\n if A(i)>0\n A(i)=A(i).^2;\n else \n A(i)=0;\n end \nend\nfor i=1:length(A)\n fprintf(\""%d \"",A(i));\nend",WRONG_ANSWER,26,6908 1509778158626160640,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:22:17,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a);",ACCEPTED,26,6756 1509778350243667968,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:23:03,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"for i=1:15\nA(i)=i;\nend\nfprintf('%d ',A);",WRONG_ANSWER,26,6504 1509778449538056192,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:23:27,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"for i=1:1\nA(i)=0;\nend\nfprintf('%d ',A);",WRONG_ANSWER,26,6764 1509778534985981952,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-01 14:23:47,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"for i=1:15\nA(i)=0;\nend\nfprintf('%d ',A);",ACCEPTED,26,6516 1509778676836614144,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:24:21,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"input('');\nfor i=1:length(A)\n if A(i)>0\n A(i)=A(i).^2;\n else \n A(i)=0;\n end \nend\nfor i=1:length(A)\n fprintf(\""%d \"",A(i));\nend",WRONG_ANSWER,26,6500 1509779037748084736,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 14:25:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new=[4,7,5;2,8,6;5,1,9;7,3,2]",WRONG_ANSWER,28,6508 1509779896581324800,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-04-01 14:29:12,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=linspace(1,8,8);\nfor a=1:8\n if A(a)<0\n B(a)=0;\n else B(a)=A(a)*A(a)*A(a);\n end\nend\nfprintf('%d ',B)\n ",ACCEPTED,29,7000 1509779903474130944,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:29:14,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32]\nfprintf('%d ',a);",WRONG_ANSWER,27,6760 1509779924977598464,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:29:19,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32]\nfprintf('%d ',a)",WRONG_ANSWER,26,6760 1509780322510266368,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:30:53,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32]\nfprintf('%d',a);",WRONG_ANSWER,27,6504 1509780441807290368,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:31:22,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32];\nfprintf('%d ',a);",ACCEPTED,28,6744 1509780621048242176,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 14:32:05,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nok=A>0;\nB=A.*A.*A.*ok;\nfprintf('%d ',B)",ACCEPTED,26,6508 1509781066344185856,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 14:33:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nA=a'\nB=b'\nC=c'\nnew_v=[A,B,C]",WRONG_ANSWER,26,6372 1509781907314720768,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 14:37:11,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nA=a'\nB=b'\nC=c'\nd=[A,B,C]\nnew_v=d'",WRONG_ANSWER,27,6760 1509781924045799424,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:37:15,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2.*pi,20);\nfprintf('%.2f ',a);",ACCEPTED,27,6744 1509782847816818688,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 14:40:55,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:) ;\nb1=b(:);\nc1=c(:) ;\nnew_v=[a1,b1,c1];\nfid=fopen('D:\\matlab\\1.txt.txt');\nfprintf(fid,'%d %d %d\\n','new_v') ; \nfclose(fid) ;",WRONG_ANSWER,29,8500 1509784008326209536,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 14:45:32,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\n",WRONG_ANSWER,26,6532 1509784110134550528,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 14:45:56,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:) ;\nb1=b(:);\nc1=c(:) ;\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v') ; ",ACCEPTED,27,6508 1509784659089252352,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 14:48:07,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\n\n\nnew_v=[a(1,.1),b(1,1),c(1,.1);a(2,.1),b(2,1),c(2,1);a(1,2),b(1,2),c(1,2);a(2,2),b(2,2),c(2,2)]",WRONG_ANSWER,28,6676 1509784684032049152,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:48:13,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"z=myZeros(1,15);\nfprintf('%d ',z);",WRONG_ANSWER,32,7928 1509784733861109760,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 14:48:25,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,">> a=[4,5;2,7]\n\na =\n\n 4 5\n 2 7\n\n>> b=[7,1;8,3]\n\nb =\n\n 7 1\n 8 3\n\n>> \n>> c=[5,9;6,2]\n\nc =\n\n 5 9\n 6 2\n\n>> a=a(:)\n\na =\n\n 4\n 2\n 5\n 7\n\n>> b=b(:)\n\nb =\n\n 7\n 8\n 1\n 3\n\n>> c=c(:)\n\nc =\n\n 5\n 6\n 9\n 2\n\n>> a=[a;b;c]\n\na =\n\n 4\n 2\n 5\n 7\n 7\n 8\n 1\n 3\n 5\n 6\n 9\n 2\n\n>> a=a'\n\na =\n\n 4 2 5 7 7 8 1 3 5 6 9 2\n",WRONG_ANSWER,28,6632 1509784783775956992,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:48:37,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"z=zeros(1,15);\nfprintf('%d ',z);",ACCEPTED,27,6508 1509784866622685184,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 14:48:57,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33];\nfprintf(\""%d \"",A)",ACCEPTED,28,6992 1509785065503162368,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 14:49:44,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,a=a(:)\nb=b(:)\nc=c(:)\na=[a;b;c]\na=a'\n,WRONG_ANSWER,27,6528 1509785283762995200,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 14:50:36,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\n\n\nnew_v=[a(1,1),b(1,1),c(1,1);a(2,1),b(2,1),c(2,1);a(1,2),b(1,2),c(1,2);a(2,2),b(2,2),c(2,2)]",WRONG_ANSWER,29,6508 1509785699435298816,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 14:52:15,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\na=a(:)\nb=b(:)\nc=c(:)\na=[a;b;c]\na=a'\n",WRONG_ANSWER,27,6500 1509786550183485440,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-01 14:55:38,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1, 2, -1, 5, 6, 7, -4, 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,26,6640 1509786567409491968,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:55:42,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1,2,-1,5,6,7,-4,3];\nfor i=1:length(A)\n if A(i)>0\n A(i)=A(i).^2;\n else \n A(i)=0;\n end \nend\nfor i=1:length(A)\n fprintf(\""%d \"",A(i));\nend",WRONG_ANSWER,28,6660 1509786671105269760,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:56:07,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1,2,-1,5,6,7,-4,3];\nfor i=1:length(A)\n if A(i)>0\n A(i)=A(i).^2;\n else \n A(i)=0;\n end \nend\n\nfprintf(\""%d \"",A);\n",WRONG_ANSWER,29,6612 1509786730995007488,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-01 14:56:21,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1,2,-1,5,6,7,-4,3];\nfor i=1:length(A)\n if A(i)>0\n A(i)=A(i).^3;\n else \n A(i)=0;\n end \nend\n\nfprintf(\""%d \"",A);\n",ACCEPTED,27,6636 1509787573176860672,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 14:59:42,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\n\n\nnew_v=[a(1,1),b(1,1),c(1,1),a(2,1),b(2,1),c(2,1),a(1,2),b(1,2),c(1,2),a(2,2),b(2,2),c(2,2)]",WRONG_ANSWER,30,6768 1509787631243640832,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 14:59:56,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14;\nA=linspace(0,2*PI,20);\nfprintf(\""%.2f \"",A)",WRONG_ANSWER,29,6660 1509788067245735936,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 15:01:40,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.1415;\nA=linspace(0,2*PI,20);\nfprintf(\""%.2f \"",A)",ACCEPTED,28,6508 1509788430849949696,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 15:03:07,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=a(:);\nb=b(:);\nc=c(:);\na=[a;b;c];\na=a';\n",WRONG_ANSWER,28,6508 1509788488185249792,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-04-01 15:03:20,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=linspace(0,0,15);\nfprintf(\""%d \"",A)",ACCEPTED,27,6500 1509789698187427840,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 15:08:09,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v=[a(:);b(:);c(:)]\n",WRONG_ANSWER,28,8348 1509790400235790336,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 15:10:56,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=a(:);B=b(:);C=c(:);\nnew_v=[A,B,C]",WRONG_ANSWER,28,6508 1509790466333097984,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 15:11:12,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nA=a(:)\nB=b(:)\nC=c(:)\nnew_v1=[A',B',C']\n",WRONG_ANSWER,28,6876 1509791248693157888,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 15:14:18,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na2=a';\nb2=b';\nc2=c';\na1=a2(:) ;\nb1=b2(:);\nc1=c2(:) ;\nnew_v=[a1,b1,c1];\nfprintf('%d ',new_v) ; ",WRONG_ANSWER,28,6748 1509791356142837760,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 15:14:44,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\n\na1=a(:) ;\nb1=b(:);\nc1=c(:) ;\nnew_v=[a1,b1,c1];\nfprintf('%d ',new_v) ; ",ACCEPTED,28,6780 1509793493411790848,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 15:23:14,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,a=a(:)\nb=b(:)\nc=c(:)\nnew=[a b c],WRONG_ANSWER,28,7056 1509795756752068608,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-04-01 15:32:13,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n new_v=[reshape(a,4,1),reshape(b,4,1),reshape(c,4,1)];\ndisp(new_v)",PRESENTATION_ERROR,28,6764 1509795781946523648,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 15:32:19,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]；\nb=[7,1;8,3]；\nc=[5,9;6,2]；\nfprintf('%d',a=a(:));\nfprintf('%d',b=b(:));\nfprintf('%d',c=c(:));\nfprintf('%d',new=[a b c]);\n\n",WRONG_ANSWER,29,7012 1509796162316099584,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 15:33:50,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=[0 0 0 0 0 0 0 0 ];\nfor k=1:1:8\n if A(k)>0\n B(k)=A(k)^3;\n else\n B(k)=0;\n end\nend\nfprintf('%d ',B);",ACCEPTED,28,6632 1509796394948976640,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 15:34:45,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=reshape(a,1,4);B=reshape(b,1,4);C=reshape(c,1,4);\nnew_v=[A;B;C];\nfprintf('%d%d%d\\n',new_v)",PRESENTATION_ERROR,27,6496 1509796473121685504,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 15:35:04,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=reshape(a,1,4);B=reshape(b,1,4);C=reshape(c,1,4);\nnew_v=[A;B;C];\nfprintf('%d %d %d\\n',new_v)",ACCEPTED,27,6908 1509797052220014592,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-01 15:37:22,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,5,2,7]\n>>b=[7,1;8,3]\n>>c=[5,9;6,2]\n>>k\nk=[a',b',c']",WRONG_ANSWER,28,6504 1509797676434677760,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 15:39:51,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=a(:);B=b(:);C=c(:);\nnew_v=[A,B,C];\nfprintf('%d %d %d ',new_v)",ACCEPTED,26,6512 1509797798349783040,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 15:40:20,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\n\na_h = [transpose(a(:,1)),transpose(a(:,2))];\nb_h = [transpose(b(:,1)),transpose(b(:,2))];\nc_h = [transpose(c(:,1)),transpose(c(:,2))];\n\nnew_h = [a_h, b_h, c_h];\n\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,26,6764 1509797840708788224,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 15:40:30,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=cell(1,8)\nfor(int i=0;i<8;i++)\n{\nif(A(i)>=0){\nB(i)=A(i)^3\n}\nelse{\nB(i)=0\n}\n}\nprintf(B)",WRONG_ANSWER,27,6508 1509801141901295616,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 15:53:37,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"% scanf(\""A= [\"");\n% A=scanf(\""%d\"");\n\nA= [1 2 -1 5 6 7 -4 3]\nc=[];\n\nfor i = [1:length(A)]\n if A(i) > 0\n c(i) = A(i)^3;\n else\n c(i)= 0;\n end\nend\n\nprintf(\""%d \"",c)\n% printf(\""B= [\"")\n\n% printf(\""%d \"",c(1:length(c)-1))\n% printf(\""%d\"",c(length(c)))\n% printf(\""]\"")",WRONG_ANSWER,29,6648 1509801221735677952,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-04-01 15:53:56,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"% scanf(\""A= [\"");\n% A=scanf(\""%d\"");\n\nA= [1 2 -1 5 6 7 -4 3];\nc=[];\n\nfor i = [1:length(A)]\n if A(i) > 0\n c(i) = A(i)^3;\n else\n c(i)= 0;\n end\nend\n\nprintf(\""%d \"",c)\n% printf(\""B= [\"")\n\n% printf(\""%d \"",c(1:length(c)-1))\n% printf(\""%d\"",c(length(c)))\n% printf(\""]\"")",ACCEPTED,26,6508 1509801558481133568,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 15:55:16,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\n[n,m]=size(A);\nnum=n*m;\na=1;\nwhile a<=num\nif A(a)>0\nA(a)=A(a)*A(a)*A(a);\nelse A(a)=0;\nend\na=a+1;\nend\nfprintf('%d %d %d %d %d %d %d %d',A) ",PRESENTATION_ERROR,29,6764 1509801594619256832,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 15:55:25,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a = [6:2:33];\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,29,6568 1509801605679636480,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 15:55:28,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\n[n,m]=size(A);\nnum=n*m;\na=1;\nwhile a<=num\nif A(a)>0\nA(a)=A(a)*A(a)*A(a);\nelse A(a)=0;\nend\na=a+1;\nend\nfprintf('%d %d %d %d %d %d %d %d ',A) ",ACCEPTED,29,6756 1509802083816980480,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 15:57:22,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for k=6:1:33\n if mod(k,2)==0\n B(k-5)=k;\n else \n continue;\n end\nend\nfor i=1:1:27\n if B(i)~=0\n fprintf('%d ',B(i));\n end\nend",ACCEPTED,28,6512 1509802787305783296,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 16:00:09,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = round(linspace(0, 2*pi, 20), 2);\nfprintf(\""%.2f \"", a);\nfprintf(\""\\n\"");\nclear;",WRONG_ANSWER,27,6452 1509803221697265664,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 16:01:53,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A= [1 2 -1 5 6 7 -4 3];\nA(A<0)=0；\nB=A.^3；\ndisp(B);,WRONG_ANSWER,26,6636 1509803285607440384,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-04-01 16:02:08,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\ng=[[a(:,1);a(:,2)],[b(:,1);b(:,2)],[c(:,1);c(:,2)]];\nfor i=1:4\n for j=1:2\n fprintf('%d ',g(i,j))\n end\n fprintf('%d\\n',g(i,3))\nend",ACCEPTED,30,6508 1509804006564790272,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:05:00,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:),b(:),c(:)];\nfprintf(new);",WRONG_ANSWER,29,6656 1509804417049575424,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-04-01 16:06:38,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\ng=[[a(:,1);a(:,2)]',[b(:,1);b(:,2)]',[c(:,1);c(:,2)]'];\nfor i=1:12\n fprintf('%d ',g(1,i))\nend",ACCEPTED,26,6776 1509804452796792832,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:06:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:),b(:),c(:)];\nfprintf(\""%d\"",new);",WRONG_ANSWER,25,6508 1509804835867607040,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:08:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:),b(:),c(:)];\nfprintf('%d',new);",WRONG_ANSWER,26,6504 1509806203484069888,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 16:13:44,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33\nfprintf('%d',A)",WRONG_ANSWER,28,6632 1509806240090390528,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 16:13:53,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfprintf('%d',A);",PRESENTATION_ERROR,27,6408 1509806270574592000,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 16:14:00,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a(15) = 0;\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,30,6636 1509806382663172096,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 16:14:27,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33];\nfprintf('%d',A);",PRESENTATION_ERROR,27,6756 1509806426486824960,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 16:14:37,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(a,b,n)\nb=linspace(0,2*pi,20)\n\n",WRONG_ANSWER,27,6796 1509806428725018624,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 16:14:38,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33];\nfprintf(,A);",WRONG_ANSWER,28,6660 1509806480314957824,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 16:14:50,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,A=[6:2:33];disp(A);,PRESENTATION_ERROR,26,6764 1509806513274634240,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 16:14:58,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(a,b,n)\ny=linspace(0,2*pi,20)\nprintf(y)\n",WRONG_ANSWER,28,6500 1509806812819243008,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 16:16:09,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,A=[6:2:33]\n,WRONG_ANSWER,26,6644 1509806960563601408,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 16:16:44,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=zeros(1,14);\nk=1;\nfor i=(6:2:33)\na(1,k)=i;\nk=k+1;\nend\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d',a) ",PRESENTATION_ERROR,27,6760 1509806981569404928,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 16:16:49,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=zeros(1,14);\nk=1;\nfor i=(6:2:33)\na(1,k)=i;\nk=k+1;\nend\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d ',a) ",ACCEPTED,33,10160 1509807237764317184,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-04-01 16:17:51,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=(A.*A).*A;\nB(find(B<0))=0;\nfor i=1:8\n fprintf('%d ',B(i))\nend",ACCEPTED,26,6500 1509807686139609088,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 16:19:37,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\nfprintf('%.2f ',x)\n",ACCEPTED,25,6632 1509807856990388224,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 16:20:18,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = linspace(0, 2*pi, 20);\nfprintf(\""%.2f \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,6760 1509808624996810752,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-04-01 16:23:21,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfor i=1:1:15\n fprintf('%d ',a(i));\nend\n",ACCEPTED,30,6488 1509808749106266112,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-04-01 16:23:51,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew1(1,1:4)=a(:);\nnew1(1,5:8)=b(:);\nnew1(1,9:12)=c(:);\nfprintf('%-2d',new1)\n",ACCEPTED,27,6760 1509809558432342016,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 16:27:04,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:2:33\nfprintf('%d',i)\nend",PRESENTATION_ERROR,25,6748 1509809667789701120,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-04-01 16:27:30,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B)",ACCEPTED,26,6760 1509810094250483712,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 16:29:12,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:2:33\nfprintf('%d',‘ ’,i)\nend",WRONG_ANSWER,29,6760 1509810329130778624,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 16:30:08,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:2:33\nfprintf('%d','',i)\nend",PRESENTATION_ERROR,26,6644 1509810467760914432,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:30:41,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:),b(:),c(:)];\n\ndisp(new);",PRESENTATION_ERROR,26,6508 1509810692999962624,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-04-01 16:31:34,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6:2:33];\ni=1;\nwhile a(i)<33\n fprintf('%d ',a(i));\n i=i+1;\nend",ACCEPTED,27,6760 1509811974261800960,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 16:36:40,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"B(1,8)=0;\nfor i=1:8\n if A(i>0)\n B(i)=A(i)^2;\n end;\nfprintf('%d ',B)",WRONG_ANSWER,25,6864 1509812977561853952,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 16:40:39,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"B(1,8)=0;\nfor i=1:8\n A(i)=input;\n if A(i>0)\n B(i)=A(i)^2;\n else \n B(i)=0;\n end;\nfprintf('%d ',B)",WRONG_ANSWER,27,6500 1509813007370043392,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 16:40:46,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\n\nnew_h = [a(:), b(:), c(:)];\n\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,6692 1509813090064941056,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-01 16:41:06,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"B(1,8)=0;\nA=input\nfor i=1:8\n if A(i>0)\n B(i)=A(i)^2;\n else \n B(i)=0;\n end;\nfprintf('%d ',B)",WRONG_ANSWER,30,6760 1509813228903956480,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-04-01 16:41:39,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"b=[6:33];\nb(find(mod(b,2)==1))=[];\nfprintf('%d ',b)",ACCEPTED,26,6660 1509813331819593728,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 16:42:03,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\n\nnew_v = [a(:); b(:); c(:)];\nnew_h = transpose(new_v);\n\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,29,6756 1509813401617842176,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 16:42:20,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta= linspace (0,2*pi,20);\nfprintf('%.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f ',theta)",ACCEPTED,26,6384 1509813557327183872,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 16:42:57,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\nnew_v = [a(:), b(:), c(:)];\nfprintf(\""%d %d %d\\n\"", transpose(new_v));\nclear;",ACCEPTED,25,6752 1509813762553643008,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 16:43:46,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15)；\nfprintf('d% d% d% d% d% d% d% d% d% d% d% d% d% d% d% ',a)",WRONG_ANSWER,28,6768 1509814454659940352,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-04-01 16:46:31,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"p=pi;\na=linspace(0,2*p,20);\nfor i=1:20\nfprintf('%.2f ',a(i))\nend",ACCEPTED,27,6508 1509814579323879424,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:47:01,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:), b(:), c(:)];\nformatSpec='%d %d %d\\n';\n\nfprintf('%d %d %d\\n',new');",ACCEPTED,28,6700 1509814705512873984,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 16:47:31,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15)；\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d ',myZeros)",WRONG_ANSWER,29,6860 1509814770465865728,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-04-01 16:47:46,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d ',myZeros)",ACCEPTED,27,6748 1509814792490991616,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:47:52,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:), b(:), c(:)];\nformatSpec='%d %d %d\\n';\n\nfprintf('%d %d %d\\n',new');",WRONG_ANSWER,26,6508 1509814831657402368,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:48:01,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:), b(:), c(:)];\nformatSpec='%d %d %d\\n';\n\nfprintf('%d %d %d\\n',new);",PRESENTATION_ERROR,25,6508 1509814902196371456,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 16:48:18,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:), b(:), c(:)];\n\n\nfprintf('%d %d %d ',new);",ACCEPTED,35,6800 1509815313825366016,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-04-01 16:49:56,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta= linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,27,6640 1509816493335789568,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-04-01 16:54:37,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"fprintf('%d ',zeros(1,15))",ACCEPTED,25,6376 1509816725909946368,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-04-01 16:55:33,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros([1,15]);\nfor i=1:15\n fprintf('%d ',a(i));\nend",ACCEPTED,28,6636 1509818342621200384,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:01:58,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=[1:size(A)];\nj=1;\nfor i = A\n if i >0\n B(j)=i^3;\n j=j+1;\n else\n B(j)=0;\n j=j+1;\n end\nend\nfprintf('%d ',B)",ACCEPTED,28,6912 1509819699823206400,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:07:22,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:33];\nfor i = A\n if mod(i,2)==0;\n fprintf('%d ',i);\n end\nend\n\n ",ACCEPTED,29,6500 1509820005963890688,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-01 17:08:35,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1, 2, -1, 5, 6, 7, -4, 3];\nB = A .^ 3;\nlogical_neg = B < 0;\nB(logical_neg) = 0;\n\nfprintf(\""%d \"", B);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,6504 1509820626469224448,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:11:03,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=[6:33];\nfor i = A\n if mod(i,2)==0;\n fprintf('%d ',i);\n end\nend\n\n ",WRONG_ANSWER,25,6752 1509820790470705152,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:11:42,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfor i =theta;\n fprintf('%.2f',i)\nend\n ",PRESENTATION_ERROR,25,6984 1509820848215252992,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:11:55,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfor i =theta;\n fprintf('%.2f ',i)\nend\n ",ACCEPTED,30,7144 1509821514000728064,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:14:34,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=ones(1,15)*0",WRONG_ANSWER,27,6768 1509821665735434240,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:15:10,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=ones(1,15)*0\nfprintf('%d ',myZeros)",WRONG_ANSWER,27,6752 1509822044871155712,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-04-01 17:16:41,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=ones(1,15)*0;\nfprintf('%d ',myZeros)",ACCEPTED,27,6512 1509825528444583936,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 17:30:31,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,>> a=a(:)\n>> b=b(:)\n>> c=c(:)\n>> d=[a b c]\n,WRONG_ANSWER,27,6512 1509825582745608192,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 17:30:44,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,>> a=a(:);\n>> b=b(:);\n>> c=c(:);\n>> d=[a b c];\n,WRONG_ANSWER,25,6696 1509825645705576448,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 17:30:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,>> a=a(:);\n>> b=b(:);\n>> c=c(:);\n>> d=[a b c];\n\n,WRONG_ANSWER,26,6504 1509825845556502528,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 17:31:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\na=a(:)\nb=b(:)\nc=c(:)\nd=[a b c]\n\n",WRONG_ANSWER,26,6508 1509825988326416384,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-01 17:32:21,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,5;2,7]\n>>b=[7,1;8,3]\n>>c=[5,9;6,2]\n>>a=a(:)\n>>b=b(:)\n>>c=c(:)\n>>d=[a b c]\n\n",WRONG_ANSWER,26,6564 1509838142068842496,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-01 18:20:39,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[reshape(a,4,1),reshape(b,4,1),reshape(c,4,1)];\ni=1;\nwhile(i<=4)\n fprintf('%d %d %d',new_v(i,:));\n fprintf('\\n');\n i=i+1;\nend\n",ACCEPTED,26,6764 1509841433989308416,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-04-01 18:33:44,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[reshape(a,4,1),reshape(b,4,1),reshape(c,4,1)]';\nfprintf('%d %d %d\\n',new_v)",ACCEPTED,35,6684 1509849259904696320,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-04-01 19:04:49,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n new_v=[reshape(a,4,1),reshape(b,4,1),reshape(c,4,1)];\n for i=1:4\nfprintf('%d %d %d\\n',new_v(i,:))\n end",ACCEPTED,26,6760 1509857969755275264,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 19:39:26,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"zeros(1,15)",WRONG_ANSWER,30,9228 1509857998411489280,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 19:39:33,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"zeros(1,15)",WRONG_ANSWER,28,9260 1509858135888191488,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-01 19:40:06,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15)",WRONG_ANSWER,27,6504 1509866252046057472,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-04-01 20:12:21,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew(1:4,1) = a(1:4);\nnew(1:4,2) = b(1:4);\nnew(1:4,3) = c(1:4);\nfprintf('%d %d %d\\n',new'(1:9));\nfprintf('%d %d %d',new'(10:12));",ACCEPTED,30,6616 1509867237322350592,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-04-01 20:16:16,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew(1:4) = a(1:4);\nnew(5:8) = b(1:4);\nnew(9:12) = c(1:4);\nnew = new';\nfprintf('%d ',new);",ACCEPTED,26,6800 1509870319707971584,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-04-01 20:28:30,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB= A>=0;\nA = A.*B;\nA = A.^3;\nfprintf('%d ',A);",ACCEPTED,28,9128 1509870585151324160,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-04-01 20:29:34,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a = [6:2:32];\nfprintf('%d ',a);",ACCEPTED,29,6884 1509871284555710464,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-04-01 20:32:20,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=[0:2*pi/19:2*pi];\nfprintf('%0.2f ', theta);",ACCEPTED,27,6568 1509871752400961536,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-04-01 20:34:12,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a = zeros(1,15);\nfprintf('%d ', a);",ACCEPTED,26,6628 1509874368744882176,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-04-01 20:44:36,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,28,6760 1509875198688591872,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-04-01 20:47:54,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[reshape(a,4,1),reshape(b,4,1),reshape(c,4,1)];\nfprintf('%d ',new)",ACCEPTED,26,6748 1509878788187373568,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:02:09,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A = zeros(1,15);\nfprintf(\""%d \"",A);",ACCEPTED,29,6500 1509879497361022976,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:04:59,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A = linspace(0,2*pi,20);\nfprintf('%.2f ',A);",ACCEPTED,25,6632 1509881199261220864,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:11:44,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"x = 6:2:33;\nfprintf('%d ',x)",ACCEPTED,27,7984 1509883380417576960,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-04-01 21:20:24,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\na=a(:)\nb=b(:)\nc=c(:)\nd=[a b c]\nfprintf('%d',d)",WRONG_ANSWER,26,6752 1509884055940325376,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:23:05,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf('1')",WRONG_ANSWER,29,6760 1509884126219354112,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:23:22,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf(new_v1)",WRONG_ANSWER,29,8492 1509884154737156096,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:23:29,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nprintf(new_v1)",WRONG_ANSWER,27,6476 1509884726222929920,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:25:45,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf('%n',new_v1)",WRONG_ANSWER,25,6496 1509884828207431680,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:26:10,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf('%n',new_v1)",WRONG_ANSWER,27,6500 1509884853750743040,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:26:16,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf('%n',new)",WRONG_ANSWER,27,6760 1509885202544869376,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:27:39,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf('%n',new)",WRONG_ANSWER,28,6504 1509885564367233024,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:29:05,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf(\""%n\"",new)",WRONG_ANSWER,32,6696 1509885867049181184,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:30:17,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf(\""%d\"",new)",WRONG_ANSWER,26,6500 1509886387007930368,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-04-01 21:32:21,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=a(:);\nb=b(:);\nc=c(:);\nd=[a b c];\nfprintf('%d %d %d\\n',d');\n",ACCEPTED,25,6888 1509886835000705024,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-04-01 21:34:08,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a b c];\nfprintf('%d ',d);\n",ACCEPTED,29,6492 1509887862068314112,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:38:13,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\nfprintf(\""%d \"",new)",WRONG_ANSWER,26,6512 1509888077098532864,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:39:04,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1 = [a(:,1);a(:,2)];\nb1 = [b(:,1);b(:,2)];\nc1 = [c(:,1);c(:,2)];\nx = [a1,b1,c1];\nfprintf('%d ',x)",ACCEPTED,25,6512 1509888403663577088,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:40:22,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\n\n\nfprintf(\""%d \"",new(1:11))\nfprintf('%d',new(12))",WRONG_ANSWER,25,6380 1509888578506604544,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:41:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1 = [a(:,1);a(:,2)];\nb1 = [b(:,1);b(:,2)];\nc1 = [c(:,1);c(:,2)];\nx = [a1,b1,c1];\nfprintf('%d %d %d\\n',x)",WRONG_ANSWER,30,6492 1509888639550504960,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-04-01 21:41:18,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nb=A.^3;\nb(b<0)=0;\nfprintf('%d ',b);",ACCEPTED,28,6508 1509888840523939840,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-04-01 21:42:06,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"vec=[6:2:33];\nfprintf('%d ',vec);",ACCEPTED,26,6752 1509888981189877760,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-04-01 21:42:40,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=(6:2:33);\nfprintf('%d ',a)",ACCEPTED,27,6436 1509889512431304704,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-01 21:44:46,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=input('');\nb=input('');\nc=input('');\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];\nfprintf('%d ',new);",WRONG_ANSWER,25,6772 1509889567720620032,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-01 21:44:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=input('');\nb=input('');\nc=input('');\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];\nfprintf('%d',new);",WRONG_ANSWER,26,6500 1509890283314184192,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:47:50,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1 = [a(:,1);a(:,2)];\nb1 = [b(:,1);b(:,2)];\nc1 = [c(:,1);c(:,2)];\nx = [a1,b1,c1];\n% disp(x)\nfprintf('%d %d %d\\n',x.')",ACCEPTED,26,6508 1509890373791080448,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:48:12,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4) ]\n\n\n",WRONG_ANSWER,25,6496 1509890698878271488,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-01 21:49:29,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];,WRONG_ANSWER,27,6752 1509890972576743424,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-04-01 21:50:34,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)\n",ACCEPTED,25,6636 1509891184598810624,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:51:25,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15)",WRONG_ANSWER,28,6512 1509891741141843968,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 21:53:38,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15)\nfprintf('%d ',myZeros)",WRONG_ANSWER,27,6520 1509891807232221184,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-04-01 21:53:53,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(15,1);\nfprintf('%d ',a)\n",ACCEPTED,27,6432 1509892518367346688,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-01 21:56:43,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];\nfprintf('%d',new);",WRONG_ANSWER,26,6504 1509892580379295744,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:56:58,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = input('');\nA =A.*A.*A;\nA(A<0)=0;\nfprintf('%d ',A)",WRONG_ANSWER,30,6504 1509892785069719552,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 21:57:47,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nA =A.*A.*A;\nA(A<0)=0;\nfprintf('%d ',A)",ACCEPTED,27,6508 1509892836387864576,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-04-01 21:57:59,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,27,6656 1509893887177621504,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-04-01 22:02:09,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf('%d ',a);",ACCEPTED,25,6508 1509894130717253632,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 22:03:07,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"fprintf('%d ',zeros(1,15))\n",ACCEPTED,25,6636 1509894739881189376,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 22:05:33,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"fprintf('%d ',[4,2,5,7,7,8,1,3,5,6,9,2])\n\n\n",ACCEPTED,27,6756 1509896532459610112,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 22:12:40,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%d ',[4,7,5])\nfprintf('\\n')\nfprintf('%d ',[2,8,6])\nfprintf('\\n')\nfprintf('%d ',[5,1,9])\nfprintf('\\n')\nfprintf('%d ',[7,3])\nfprintf('%d',2)\n",PRESENTATION_ERROR,26,6764 1509896711325704192,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 22:13:23,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%d ',[4,7,5])\nfprintf('\\n')\nfprintf('%d ',[2,8,6])\nfprintf('\\n')\nfprintf('%d ',[5,1,9])\nfprintf('\\n')\nfprintf('%d ',[7,3])\nfprintf('%d ',2)\n",PRESENTATION_ERROR,27,6508 1509896798818156544,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 22:13:44,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%d ',[4,7,5])\nfprintf('\\n')\nfprintf('%d ',[2,8,6])\nfprintf('\\n')\nfprintf('%d ',[5,1,9])\nfprintf('\\n')\nfprintf('%d ',[7,3,2])\n\n",PRESENTATION_ERROR,27,6508 1509897743827566592,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 22:17:29,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%d ',[4,7])\nfprintf('%d ',[4,7])\nfprintf('%d',[5])\nfprintf('\\n')\nfprintf('%d ',[2,8])\nfprintf('%d',[6])\nfprintf('\\n')\nfprintf('%d ',[5,1])\nfprintf('%d',[9])\nfprintf('\\n')\nfprintf('%d ',[7,3])\nfprintf('%d',[2])\n\n",WRONG_ANSWER,25,6380 1509897997729759232,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-01 22:18:29,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf('%d ',[4,7])\nfprintf('%d',[5])\nfprintf('\\n')\nfprintf('%d ',[2,8])\nfprintf('%d',[6])\nfprintf('\\n')\nfprintf('%d ',[5,1])\nfprintf('%d',[9])\nfprintf('\\n')\nfprintf('%d ',[7,3])\nfprintf('%d',[2])",ACCEPTED,25,6760 1509912404930682880,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-01 23:15:44,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1 = [a(:,1);a(:,2)];\nb1 = [b(:,1);b(:,2)];\nc1 = [c(:,1);c(:,2)];\nx = [a1,b1,c1];\n% disp(x)\nfprintf('%d %d %d\\n',x')",ACCEPTED,26,6508 1509921097288613888,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-01 23:50:17,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];\ni=1;\nwhile i<=3\nif i=3\nfprintf('%d %d %d',new(i,:));\nelse\nfprintf('%d %d %d/n',new(i,:));\nend",WRONG_ANSWER,26,6896 1509921670454403072,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-01 23:52:33,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];\ni=1;\nwhile i<=3\nif i==3\nfprintf('%d %d %d',new(i,:));\nelse\nfprintf('%d %d %d/n',new(i,:));\ni++;\nend",WRONG_ANSWER,26,6892 1509924316744089600,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 00:03:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];\nfprintf('%d ',new(1));\nfprintf('%d ',new(2));\nfprintf('%d\\n',new(3));\n",WRONG_ANSWER,26,6488 1509925506965929984,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 00:07:48,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew=[a(1) b(1) c(1);a(2) b(2) c(2);a(3) b(3) c(3);a(4) b(4) c(4)];\ni=1;\nj=1\nwhile i<=3\nwhhile j<=3\nif j<3\nfprintf('%d ',new(i,j));\nelse\nfprintf('%d\\n',new(i,j));\nj=j+1;\nend\ni=1+1;\nend\n",WRONG_ANSWER,26,6504 1510043926480379904,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 07:58:21,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d',B);",PRESENTATION_ERROR,29,10656 1510072959804989440,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 09:53:44,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[reshape(a,1,4),reshape(b,1,4),reshape(c,1,4)];\nfprintf('%d ',new_v1)",ACCEPTED,24,6368 1510076599440916480,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 10:08:11,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nA(A<0)=0;\nA=A.^3;\nfprintf('%d ',A)",ACCEPTED,28,6888 1510076945181589504,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 10:09:34,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"b=6:2:33;\nfprintf('%d ',b)",ACCEPTED,25,6384 1510079006992384000,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 10:17:45,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros);",ACCEPTED,24,6748 1510079208113455104,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 10:18:33,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,26,6668 1510080356229406720,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 10:23:07,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,24,6788 1510080499430604800,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 10:23:41,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6:2:33];\nfprintf('%d ',a)",ACCEPTED,27,6508 1510080600052686848,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-02 10:24:05,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nA =A.^3;\nA(A<0)=0;\nfprintf('%d ',A)",ACCEPTED,25,6764 1510081302077239296,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 10:26:53,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf('%d ',a)",ACCEPTED,24,6384 1510084352112738304,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-02 10:39:00,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A = linspace(0,2*pi,20);\nfprintf('%.2lf ',A);",WRONG_ANSWER,25,6372 1510084381154099200,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-04-02 10:39:07,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A = linspace(0,2*pi,20);\nfprintf('%.2f ',A);",ACCEPTED,26,6508 1510085351632158720,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 10:42:58,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta);",ACCEPTED,28,6636 1510093744095453184,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 11:16:19,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"B(1,8)=0;\nA=input('')\nfor i=1:8\n if A(i>0)\n B(i)=A(i)^2;\n else \n B(i)=0;\n end;\nfprintf('%d ',B)",WRONG_ANSWER,24,6732 1510094398322262016,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 11:18:55,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nacol=a(:);\nbcol=b(:);\nccol=c(:);\nnew=horzcat(acol,bcol,ccol)';\nfprintf('%d %d %d\\n',new);",ACCEPTED,32,6632 1510095446794133504,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 11:23:05,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nacol=a(:);\nbcol=b(:);\nccol=c(:);\nnew=horzcat(acol,bcol,ccol);\nnew_v1=new(:)';\nfprintf('%d ',new_v1);\n",ACCEPTED,28,6768 1510096991073222656,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 11:29:13,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfprintf('%d ',A)",ACCEPTED,25,6536 1510099504144445440,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 11:39:12,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfprintf('%.2f ',A)",ACCEPTED,25,6380 1510099665924218880,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 11:39:51,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A(1,15)=0;\nfprintf('%d ',A)",ACCEPTED,24,6384 1510102358443814912,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 11:50:33,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2]\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)']\nnew_v=new'",WRONG_ANSWER,25,7248 1510102489993965568,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 11:51:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)']\nnew_v=new'",WRONG_ANSWER,26,6892 1510103051348303872,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 11:53:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2]\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)']\nnew_v=new'\nfprintf(new_v)",WRONG_ANSWER,25,6504 1510103148952678400,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 11:53:41,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2]\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)']\nnew_v=new'\nfprintf(%d\\n,new_v)",WRONG_ANSWER,26,6504 1510103308256538624,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 11:54:19,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nnew_v=new';\nfprintf(%d\\n,new_v);",WRONG_ANSWER,26,6760 1510104573795495936,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 11:59:21,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nnew_v=new';\nfprintf('%d\\n',new_v);",WRONG_ANSWER,24,6756 1510107717058519040,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:11:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2]\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)']\nnew_v=new'\nfprintf('%d',new_v)",WRONG_ANSWER,25,6788 1510107774767218688,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:12:04,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"fprintf('%d ',[6 8 10 12 14 16 18 20 22 24 26 28 30 32 \n])",ACCEPTED,25,6760 1510107834854273024,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:12:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2]\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)']\nfprintf('%d',new')",WRONG_ANSWER,25,6760 1510107896625061888,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:12:33,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)']\nfprintf('%d',new')",WRONG_ANSWER,28,6752 1510107917495918592,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:12:38,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nfprintf('%d',new')",WRONG_ANSWER,26,6496 1510107956876238848,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:12:48,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nfprintf('%d',new');",WRONG_ANSWER,26,6500 1510107981315719168,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:12:53,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nfprintf('%d\\n',new');",WRONG_ANSWER,24,6760 1510108042187108352,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:13:08,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%d ',[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 \n])",WRONG_ANSWER,28,6736 1510108111472816128,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:13:24,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%.f ',[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 \n])",WRONG_ANSWER,24,6376 1510108139872448512,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:13:31,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%.2f ',[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 \n])",ACCEPTED,29,6488 1510109481056952320,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:18:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nnew_v=new';\nfprintf('%d %d %d\\n',new_v);",WRONG_ANSWER,25,6760 1510109637696155648,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:19:28,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nnew_v=new';\nfprintf('%d %d %d\\n',new_v);",WRONG_ANSWER,24,6752 1510110590704939008,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:23:15,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1)',a(:,2)';b(:,1)',b(:,2)';c(:,1)',c(:,2)'];\nfprintf('%d %d %d\\n',new);",ACCEPTED,25,6504 1510113302562095104,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:34:02,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4)];\nfprintf(\""%d \"",new_v1)\n\n",ACCEPTED,26,6504 1510113674411765760,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:35:31,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nfprintf('%d ',a,b,c)",ACCEPTED,24,6504 1510114328555417600,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:38:07,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[reshape(a,4,1) reshape(b,4,1) reshape(c,4,1)]",WRONG_ANSWER,26,6504 1510116870341390336,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:48:13,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"a=[1 2 -1 5 6 7 -4 3];\nb=a.^3;\nb(b<0)=0;\nfprintf('%d ',b)",ACCEPTED,25,6756 1510118755987222528,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:55:42,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"B=zeros(1,8);\nA=input('A=');\nfor i=1:8\n if A(i)>0\n B(i)=A(i)*A(i)*A(i);\n end\n if A(i)<0\n B(i)=0;\n end\nend\nfprintf(\""%d \"",B)",WRONG_ANSWER,28,6888 1510119167726542848,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 12:57:20,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=a(:);\nb=b(:);\nc=c(:);\nd=[a b c];\nfprintf('%d ',d)\n",WRONG_ANSWER,25,6892 1510119190630907904,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 12:57:26,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=a(:);\nb=b(:);\nc=c(:);\nd=[a b c];\nfprintf('%d ',d);\n",WRONG_ANSWER,27,6500 1510119289272549376,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 12:57:49,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf('%d ',a)",ACCEPTED,25,6504 1510119407087083520,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 12:58:17,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"fprintf('%d ',[1 8 0 125 216 343 0 27 \n])",ACCEPTED,27,6752 1510120292893454336,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:01:49,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprontf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d','a')",WRONG_ANSWER,26,6628 1510120328746909696,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:01:57,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprontf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a')",WRONG_ANSWER,25,6764 1510120443716976640,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:02:25,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprontf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d','a')",WRONG_ANSWER,24,6760 1510120566488449024,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:02:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d','a')",WRONG_ANSWER,25,6768 1510120764937203712,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:03:41,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a)",WRONG_ANSWER,26,6508 1510121053622759424,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:04:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a);",WRONG_ANSWER,26,6816 1510121788159180800,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 13:07:45,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=0:(2*pi/19):2*pi;\nfprintf('%.2f ',theta)",ACCEPTED,28,6500 1510121913221472256,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:08:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a);",WRONG_ANSWER,25,6664 1510122022930608128,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:08:41,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a);",WRONG_ANSWER,26,6760 1510122062765187072,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:08:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5;2 8 6;5 1 9;7 3 2];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a);",WRONG_ANSWER,24,6784 1510122287696592896,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-02 13:09:44,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=a(:);\nb=b(:);\nc=c(:);\nd=[a b c];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',d);",WRONG_ANSWER,26,6760 1510123440237535232,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-04-02 13:14:19,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf('%d ',a)",ACCEPTED,26,6628 1510125219943636992,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 13:21:23,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s')\nB(1:8)=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(a)=0;\n a=a+1;\n A(i+1)=0;\n elseif (A(i)>=49&&A(i)<=57)\n B(a)=A(i);\n a=a+1;\n end\nend\nfor i=1:8\n B(i)=hex2dec(B(i))\nend\nfprintf('%d ',B.*B.*B)\n \n ",WRONG_ANSWER,25,6508 1510125471567593472,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 13:22:23,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s')\nB(1:8)=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(a)=0;\n a=a+1;\n A(i+1)=0;\n elseif (A(i)>=49&&A(i)<=57)\n B(a)=A(i);\n a=a+1;\n end\nend\nfor i=1:8\n B(i)=hex2dec(B(i))\nend\nfprintf('%d ',B.*B.*B)",WRONG_ANSWER,24,6504 1510131872353050624,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-02 13:47:49,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\nnew_v=[a(:),b(:),c(:)]\n",WRONG_ANSWER,29,6380 1510132099369025536,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 13:48:44,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:8)=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(a)=0;\n a=a+1;\n A(i+1)=0;\n elseif (A(i)>=49&&A(i)<=57)\n B(a)=A(i)-48;\n a=a+1;\n end\nend\nfprintf('%d ',B.*B.*B)",WRONG_ANSWER,29,6624 1510133694718144512,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-04-02 13:55:04,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nacol=a(:);\nbcol=b(:);\nccol=c(:);\nnew=horzcat(acol,bcol,ccol);\nfprintf('%d %d %d\\n',new');\n%a=[4,5;2,7];\n%b=[7,1;8,3];\n%c=[5,9;6,2];\n%d=zeros(4,3);\n%for i = 1:4\n % d(i,1)=a(i);\n%end\n%for i = 1:4\n % d(i,2)=b(i);\n%end\n%for i = 1:4\n % d(i,3)=c(i);\n%end\n%for i = 1:4\n % for j = 1:3\n % fprintf(\""%d\"",d(i,j));\n % if(j!=3)\n % fprintf(\"" \"");\n % end\n % if(j==3)\n % fprintf(\""\\n\"");\n %end\n %end\n%end",ACCEPTED,24,6500 1510139424012853248,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 14:17:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\ne=reshape(a,1,4)\nf=reshape(b,1,4)\ng=reshape(c,1,4)\nh=e'\ni=f'\nj=g'\nnew_v=[h,i,j]",WRONG_ANSWER,26,6748 1510139498112348160,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 14:18:08,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B)",WRONG_ANSWER,28,6512 1510143307811799040,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 14:33:16,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\ne=reshape(a,1,4);\nf=reshape(b,1,4);\ng=reshape(c,1,4);\nh=e';\ni=f';\nj=g';\nnew_v=[h,i,j];\nfprintf(new_v)",WRONG_ANSWER,25,6504 1510143418062729216,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 14:33:42,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\ne=reshape(a,1,4);\nf=reshape(b,1,4);\ng=reshape(c,1,4);\nh=e';\ni=f';\nj=g';\nnew_v=[h,i,j];\nfprintf('new_v')",WRONG_ANSWER,30,6664 1510147587554500608,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 14:50:16,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\ne=reshape(a,1,4);\nf=reshape(b,1,4);\ng=reshape(c,1,4);\nh=e';\ni=f';\nj=g';\nnew_v=[h,i,j];\nfprintf('%d %d %d\\n',new_v')\n",ACCEPTED,25,6500 1510147853146218496,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 14:51:20,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\ne=reshape(a,1,4);\nf=reshape(b,1,4);\ng=reshape(c,1,4);\nh=e';\ni=f';\nj=g';\nnew_v=[h,i,j];\nfprintf('%d ',new_v)",ACCEPTED,25,6632 1510153539372539904,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 15:13:55,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros)\n",ACCEPTED,24,6380 1510154150443610112,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-04-02 15:16:21,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=reshape(a,[],1);\nb=reshape(b,[],1);\nc=reshape(c,[],1);\nnew_v=[a,b,c];\ndisp(new_v)",PRESENTATION_ERROR,30,6752 1510155042123825152,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 15:19:54,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6:2:33];\nfprintf('%d ',a)",ACCEPTED,27,6636 1510156465955270656,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-04-02 15:25:33,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nnew_v=[A,B,C];\nnew2=new_v';\nfprintf('%d %d %d\\n',round(new2))\n",ACCEPTED,26,6764 1510156809427369984,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 15:26:55,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,28,6640 1510159477236129792,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-04-02 15:37:31,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nnew_v1=[A',B',C'];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d \\n',round(new_v1))",ACCEPTED,28,6872 1510160829806166016,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 15:42:53,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\na=A.^3;\nb=[(a>=0)];\nB=a.*b;\nB=abs(B);\nfprintf('%d ',B)",ACCEPTED,28,6740 1510161202213679104,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:44:22,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]；\nb=[7,1;8,3]；\nc=[5,9;6,2]；\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1;b1;c1]",WRONG_ANSWER,26,6532 1510161444733804544,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:45:20,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]；\nb=[7,1;8,3]；\nc=[5,9;6,2]；\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1;b1;c1];\nfprintf(new_v)",WRONG_ANSWER,26,6512 1510161556808527872,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:45:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1;b1;c1];\nfprintf(new_v)",WRONG_ANSWER,27,6780 1510161763113758720,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-04-02 15:46:36,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nlogi=A<0;\nA(logi)=0;\nB=A.^3;\nfprintf('%d ',B)",ACCEPTED,28,6564 1510161838368505856,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:46:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1;b1;c1]",WRONG_ANSWER,24,6748 1510161990848233472,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:47:30,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1]",WRONG_ANSWER,28,6760 1510162191390490624,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:48:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1]",WRONG_ANSWER,25,6500 1510162244208816128,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:48:31,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(new_v)",WRONG_ANSWER,24,6764 1510162451944304640,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:49:20,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(new_v)",WRONG_ANSWER,25,6508 1510162530458025984,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:49:39,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(new_v);",WRONG_ANSWER,29,6496 1510162893193474048,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-04-02 15:51:05,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:32;\nfprintf('%d ',A);",ACCEPTED,25,6636 1510163163893854208,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:52:10,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf new_v",WRONG_ANSWER,26,6512 1510164443060105216,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-04-02 15:57:15,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=reshape(a,[],1);\nb=reshape(b,[],1);\nc=reshape(c,[],1);\nnew_v=[a,b,c];\nnew_v=new_v.';\nnew_v=reshape(new_v,[],1);\nfprintf('%d %d %d\\n',new_v)\n",ACCEPTED,27,6784 1510164570996039680,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 15:57:45,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(new_v)",WRONG_ANSWER,26,6760 1510165759619850240,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-04-02 16:02:29,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=reshape(a,1,[]);\nb=reshape(b,1,[]);\nc=reshape(c,1,[]);\nnew=[a,b,c];\nfprintf('%d ',new)\n",ACCEPTED,24,6752 1510165931098501120,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 16:03:10,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7]\nb=[7 1;8 3]\nc=[5 9;6 2]\nnew_v=zeros(4,3)\nnew_v(:,1)=a(:)\nnew_v(:,2)=b(:)\nnew_v(:,3)=c(:)\ndisp(new_v)",WRONG_ANSWER,28,6748 1510166607229239296,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:05:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(new_v)",WRONG_ANSWER,24,6508 1510166651895111680,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:06:02,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf new_v",WRONG_ANSWER,28,6860 1510166671460265984,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:06:06,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf new_v ;",WRONG_ANSWER,27,6656 1510166924847833088,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-04-02 16:07:07,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros);",ACCEPTED,28,6736 1510167025715376128,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:07:31,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];",WRONG_ANSWER,30,6756 1510167184617127936,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:08:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,B=A.^3,WRONG_ANSWER,28,6512 1510167409586466816,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:09:02,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nnew_v ",WRONG_ANSWER,30,6756 1510169345116430336,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-04-02 16:16:44,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\n\nfor a=1:8;\nif A(a)>0;\n B(a)=A(a).^3;\n else\n B(a)=0;\n end\n end\nfprintf('%d ',B)\n",ACCEPTED,27,6760 1510169729444700160,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 16:18:15,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,25,6764 1510170039968722944,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-04-02 16:19:29,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:32;\nfprintf('%d ',a)",ACCEPTED,28,6748 1510171179389153280,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-04-02 16:24:01,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,25,6764 1510171623546249216,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-04-02 16:25:47,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=linspace(0,0,15);\nfprintf('%d ',a)",ACCEPTED,25,6368 1510172184383414272,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 16:28:01,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=zeros(4,3);\nnew_v(:,1)=a(:);\nnew_v(:,2)=b(:);\nnew_v(:,3)=c(:);\ndisp(new_v);",PRESENTATION_ERROR,25,6384 1510173597708673024,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-04-02 16:33:38,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.1415926;\ntheta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta);",ACCEPTED,28,6784 1510174232381091840,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 16:36:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"a=[1,2;2,3]",WRONG_ANSWER,27,6504 1510174547385905152,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 16:37:24,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=[a(1),b(1),c(1)\na(2),b(2),c(2)\na(3),b(3),c(3)\na(4),b(4),c(4)\n]\n\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,25,6892 1510174600268234752,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 16:37:37,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a =[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v=[a(:);b(:);c(:)]'",WRONG_ANSWER,28,6628 1510174759173091328,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 16:38:14,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,\nnew_v=[a(:);b(:);c(:)],WRONG_ANSWER,25,6516 1510175014309683200,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 16:39:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,\nnew_v=[a(:);b(:);c(:)]\nfprintf,WRONG_ANSWER,32,6776 1510175393822892032,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 16:40:46,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nfor i=1:1:8;\nif B(i)<0;\nB(i)=0;\nend;\nend;\ndisp(B);,PRESENTATION_ERROR,25,6760 1510175427586310144,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 16:40:54,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew_v1=zeros(1,12);\nnew_v1(1:1:4)=(a(:))';\nnew_v1(5:1:8)=(b(:))';\nnew_v1(9:1:12)=(c(:))';\ndisp(new_v1);",PRESENTATION_ERROR,28,6652 1510176860646498304,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 16:46:35,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2]\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)]\n\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,27,6388 1510177172441939968,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:47:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\ndisp (new_v) ",WRONG_ANSWER,27,6504 1510177229991985152,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:48:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(new_v) ",WRONG_ANSWER,25,6504 1510177269636001792,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 16:48:13,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,new_v=[a(:);b(:);c(:)],WRONG_ANSWER,27,6764 1510178781293797376,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 16:54:13,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];\ndisp(myzeros);",PRESENTATION_ERROR,28,6756 1510179415673159680,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:56:45,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(new_v) ",WRONG_ANSWER,29,6568 1510179445930868736,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 16:56:52,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)];\nfprintf('%d',new_v)",PRESENTATION_ERROR,27,6500 1510180147570274304,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:59:39,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(\""%d %d %d\\n\"" new_v) ",WRONG_ANSWER,24,6644 1510180207125196800,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 16:59:53,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(\""%d %d %d\\n\"",new_v) ",WRONG_ANSWER,26,6740 1510180414970281984,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:00:43,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(\""%d %d %d\\n\"",new_v) ",WRONG_ANSWER,27,6760 1510180516062126080,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:01:07,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf(\""%d %d %d\\n\"",new_v') ",ACCEPTED,28,6880 1510180664971771904,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:01:42,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d %d %d\"",new_v')",WRONG_ANSWER,27,6496 1510180685813997568,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:01:47,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d %d %d\"",new_v)",WRONG_ANSWER,25,6792 1510180741043318784,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:02:01,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\"",new_v)",WRONG_ANSWER,31,6720 1510180937425371136,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:02:47,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\"",new_v)",WRONG_ANSWER,26,6664 1510181023810711553,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:03:08,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d %d %d %d %d %d %d %d %d %d %d %d\"",new_v)",WRONG_ANSWER,25,6504 1510181282298552320,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:04:10,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(new_v)",WRONG_ANSWER,28,6924 1510181652197142528,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:05:38,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\\n\"",new_v)",WRONG_ANSWER,28,6760 1510181678395310080,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:05:44,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\"",new_v)",WRONG_ANSWER,25,6508 1510181721512755200,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 17:05:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)]\n \n\n\n\n\n\n\n\n\n",WRONG_ANSWER,30,6556 1510181921434984448,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 17:06:42,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2]\nprintf([a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)])\n \n\n\n\n\n\n\n\n\n",WRONG_ANSWER,26,6380 1510181997527318528,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:07:00,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\"",new_v)",WRONG_ANSWER,26,6764 1510182060697186304,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:07:15,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\"",new_v')",WRONG_ANSWER,26,6768 1510182191191646208,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:07:46,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d %d %d %d %d %d %d %d %d %d %d %d\"",new_v')",WRONG_ANSWER,26,6500 1510182657861218304,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:09:38,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\"",new_v')",WRONG_ANSWER,26,6764 1510182715167993856,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:09:51,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(new_v')",WRONG_ANSWER,27,6512 1510182892751904768,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:10:34,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,a=6:2:33;\nfprintf(a'),WRONG_ANSWER,29,6500 1510183127435067392,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:11:30,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d\\n\"",a')",PRESENTATION_ERROR,25,6508 1510183155474718720,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 17:11:36,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)]",WRONG_ANSWER,25,6504 1510183172717502464,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:11:40,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d\\t\"",a')",PRESENTATION_ERROR,26,6512 1510183682466770944,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:13:42,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\\0\"",new_v')",WRONG_ANSWER,26,6500 1510183711408742400,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:13:49,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d\\o\"",new_v')",WRONG_ANSWER,25,6508 1510183765511069696,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:14:02,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d \"",new_v')",WRONG_ANSWER,27,6656 1510183833865641984,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:14:18,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,[1,4]);\nb1=reshape(b,[1,4]);\nc1=reshape(c,[1,4]);\nnew_v=[a1;b1;c1];\nfprintf(\""%d \"",new_v')",ACCEPTED,31,6752 1510183913070878720,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 17:14:37,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d \"",a')",ACCEPTED,24,6496 1510185734434078720,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 17:21:51,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)]';\nfprintf('%-d ',new_v)",ACCEPTED,26,6760 1510189610008178688,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 17:37:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:))),reshape(b,1,length(b(:))),reshape(c,1,length(c(:)))];\nfprintf('%d\\n',a);",WRONG_ANSWER,25,6504 1510189816745422848,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-04-02 17:38:04,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B)",WRONG_ANSWER,25,6756 1510189931938332672,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 17:38:32,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\na=A.^3;\nb=[(a>=0)];\nB=a.*b;\nB=abs(B);\nfprintf('%d ',B)",ACCEPTED,26,6640 1510190009906978816,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 17:38:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfprintf('%d',new)\n \n\n\n\n\n\n\n\n\n",WRONG_ANSWER,26,6504 1510190307974463488,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 17:40:02,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 8 0 125 216 343 0 27];\n\nfprintf('%d ',A)",ACCEPTED,26,6496 1510190348127264768,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 17:40:11,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 8 0 125 216 343 0 27];\na=A.^3;\nb=[(a>=0)];\nB=a.*b;\nB=abs(B);\nfprintf('%d ',B)",WRONG_ANSWER,26,6760 1510190374995976192,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-04-02 17:40:18,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\na=A.^3;\nb=[(a>=0)];\nB=a.*b;\nB=abs(B);\nfprintf('%d ',B)",ACCEPTED,25,6388 1510191786886782976,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 17:45:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:)));reshape(b,1,length(b(:)));reshape(c,1,length(c(:)))];\nfprintf('%d\\n',d.');",WRONG_ANSWER,27,6760 1510191884848947200,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 17:46:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:)));reshape(b,1,length(b(:)));reshape(c,1,length(c(:)))];\nfprintf('%d\\n',round(d.'));",WRONG_ANSWER,24,6528 1510192093674954752,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 17:47:07,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:)));reshape(b,1,length(b(:)));reshape(c,1,length(c(:)))];\ne=d.';\nfprintf('%d\\n',round(e));",WRONG_ANSWER,25,6764 1510192165213003776,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 17:47:24,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:)));reshape(b,1,length(b(:)));reshape(c,1,length(c(:)))];\ne=d.';\ndisp(e);",PRESENTATION_ERROR,27,6764 1510192300449947648,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 17:47:57,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfprintf('%d',new)\n \n\n\n\n\n\n\n\n\n",WRONG_ANSWER,26,6748 1510192511946452992,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 17:48:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,>>mat=[4 7 5;2 8 6; 5 1 9;7 3 2],WRONG_ANSWER,24,6752 1510193297401180160,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 17:51:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprint('%d',new_v)",WRONG_ANSWER,24,6656 1510195287288594432,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 17:59:49,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:)));reshape(b,1,length(b(:)));reshape(c,1,length(c(:)))];\ne=d.';\nfor i=1:4\n for j=1:3\n if(j==3)\n fprintf('%d\\n',e(i,j))\n else\n fprintf('%d ',e(i,j))\n end\n end\nend",ACCEPTED,28,6496 1510196118636851200,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 18:03:07,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d ',new_v1)",ACCEPTED,28,6504 1510196124575985664,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 18:03:08,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:))) reshape(b,1,length(b(:))) reshape(c,1,length(c(:)))];\nfprintf('%d ',d(1,1:11));\nfprintf('%d',d(1,12));",PRESENTATION_ERROR,26,6508 1510196264666284032,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 18:03:42,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nd=[reshape(a,1,length(a(:))) reshape(b,1,length(b(:))) reshape(c,1,length(c(:)))];\nfprintf('%d ',d(1,1:11));\nfprintf('%d ',d(1,12));",ACCEPTED,26,6508 1510196361764421632,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 18:04:05,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)]';\nfprintf('%-d %-d %-d\\n',new_v)\n",ACCEPTED,28,6760 1510201987902599168,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 18:26:26,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"IsC=1;\nwhile(1)\n if(IsC)\n x=input(,'c');\n if(x==']')\n break;\n else if(x==' '||x=='[')\n IsC=0;\n end\n else\n x=input(,'d');\n IsC=1;\n if(x<=0)\n frpintf('0 ');\n else\n fprintf('%d ',x*x*x);\n end\n end\nend",WRONG_ANSWER,30,6760 1510202154711343104,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:27:06,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\n b=[7,1;8,3]\n c=[5,9;6,2]\n a1=a(:)\n b2=b(:)\n c2=c(:)\n new=[a1,b2,c2]\n fprintf('%d %d %d %d\\n',new)",WRONG_ANSWER,26,6496 1510202586698760192,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 18:28:49,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf('%d\\t',a);",PRESENTATION_ERROR,24,6372 1510202669917945856,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 18:29:09,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nd=[0 0 0 ;0 0 0 ;0 0 0 ]\nd=[a(:)';b(:)';c(:)']\ne=d'\nprintf（e）",WRONG_ANSWER,26,6656 1510202703296217088,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-02 18:29:17,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=roundn(A(1,i),-2);\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",WRONG_ANSWER,27,6760 1510202830278225920,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 18:29:47,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf('%d ',a);",ACCEPTED,27,6508 1510203635254517760,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:32:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\n new=[a1,b2,c2];\n fprintf('%d %d %d %d\\n',new);",WRONG_ANSWER,25,6504 1510204378657153024,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:35:56,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\n new=[a1,b2,c2];\n fprintf('%d %d %d %d\\n',new)",WRONG_ANSWER,25,6756 1510205401429794816,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 18:40:00,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:,1),a(:,2);b(:,1),b(:,2);c(:,1),c(:,2)];\nfprintf('%d %d %d\\n',new_v)\n \n\n\n\n\n\n\n\n\n",WRONG_ANSWER,25,6692 1510205833953538048,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:41:43,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\n new=[a1,b2,c2];\n for i = 1:4\n for j = 1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n ",WRONG_ANSWER,25,6500 1510206025780031488,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:42:29,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\n new=[a1,b2,c2];\nfor i = 1:4\n for j = 1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend\n ",WRONG_ANSWER,24,6500 1510206062724734976,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-02 18:42:38,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,new_v=[a(:)';b(:)';c(:)']',WRONG_ANSWER,26,6508 1510206174175780864,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:43:04,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\n new=[a1,b2,c2];\nfor i = 1:4\n for j = 1:3\n fprintf(\""%d\"",new(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend\n ",ACCEPTED,25,6504 1510206341527236608,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-02 18:43:44,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v=[a(:)';b(:)';c(:)']'",WRONG_ANSWER,26,6508 1510206666146668544,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 18:45:02,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[0 0 0 ;0 0 0 ;0 0 0 ];\nd=[a(:)';b(:)';c(:)'];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n',d)",ACCEPTED,26,6492 1510206819862986752,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 18:45:38,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=[a(:,1);a(:,2)];\nb1=[b(:,1);b(:,2)];\nc1=[c(:,1);c(:,2)];\nnew_v=[a1,b1,c1];\nfprintf('%d \\n',new_v)\n \n\n\n\n\n\n\n\n\n",WRONG_ANSWER,25,6764 1510207204020019200,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-02 18:47:10,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\n B(1,i)=(round(A(1,i)*100))/100;\nend\nfor j=1:20\n fprintf('%3.2f',B(1,j))\n fprintf('%c',' ')\nend",ACCEPTED,25,6500 1510208334309449728,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:51:39,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n if(j!=12)\n fprintf(\"" \"");\n end\n end\n",PRESENTATION_ERROR,26,6492 1510208863458648064,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:53:46,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n if(j!=12)\n fprintf(\"" \"");\n end\n end\n",PRESENTATION_ERROR,24,6756 1510209317802434560,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 18:55:34,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n if(j!=12)\n fprintf(\"" \"");\n end\nend\n",PRESENTATION_ERROR,29,6756 1510209721885147136,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 18:57:10,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,6.28,20);\nfprintf('%.2f',a);\n",WRONG_ANSWER,25,6496 1510211206143930368,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:03:04,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,6.2832,20);\nfprintf('%.2f ',a);\n",ACCEPTED,28,6500 1510211831435509760,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:05:33,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(15);\nfprintf('%d ',a)",WRONG_ANSWER,26,6664 1510211939505946624,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:05:59,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf('%d ',a);",ACCEPTED,26,6752 1510212072473227264,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-02 19:06:31,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nd=new_v';\nfprintf('%d %d %d\\n',d(1:3))\nfprintf('%d %d %d\\n',d(4:6))\nfprintf('%d %d %d\\n',d(7:9))\nfprintf('%d %d %d',d(10:12))",ACCEPTED,26,6512 1510212135027077120,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:06:46,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n if(j!=12)\n fprintf(\"" \"");\n end\nend",PRESENTATION_ERROR,26,6764 1510213421290635264,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-02 19:11:52,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:)',b(:)',c(:)'];\nfprintf('%d ',new_v1(:))",ACCEPTED,30,6636 1510214441994940416,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 19:15:56,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];",WRONG_ANSWER,26,6760 1510214816160411648,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 19:17:25,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A= [1 2 -1 5 6 7 -4 3];\nB=(A>0);\nC=1:8;\nfor j=1:8\n if(B(j)!=0)\n c[j]=A[j]^2;\n end\n if(B(j)==0)\n c[j]=0;\n end\nend\nfor i=1:8\n fprintf('%d'C[i]);\n if(i!=8)\n fprintf(' ');\n end\nend,WRONG_ANSWER,29,6896 1510215490735063040,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 19:20:06,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('new_v:%d\\n',new_v);",WRONG_ANSWER,26,6652 1510215529502470144,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 19:20:15,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n fprintf(\"" \"");\nend\n",ACCEPTED,27,6508 1510215694088232960,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 19:20:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('new_v:%d',new_v);",WRONG_ANSWER,23,6752 1510215783535230976,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 19:21:15,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('')\n[m,n]=size(x)\nfor i=1:n\n u=x(1,i);\n if(x(1,i)<=0)\n fprintf('0 ')\n else\n fprintf('%d ',u*u*u)\n end\nend\n",WRONG_ANSWER,26,6760 1510215807194755072,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:21:21,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf('%d',new(1,j));\n if(j!=12)\n fprintf(' ');\n end\nend",PRESENTATION_ERROR,26,6632 1510215957959012352,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:21:57,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf('%d',new(1,j));\n if(j!=12)\n fprintf(' ');\n end\nend",PRESENTATION_ERROR,26,6508 1510216203704557568,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-02 19:22:56,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6:2:33];\nfprintf('%d ',a)",ACCEPTED,28,6508 1510216232959827968,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:23:03,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf('%d ',new(1,j));\nend",ACCEPTED,25,6384 1510216523401523200,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 19:24:12,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n a1=a([1;2;3;4]);\n b1=b([1;2;3;4]);\n c1=c([1;2;3;4]);\n A=[a1 b1 c1];\n fprintf('%d',A)",WRONG_ANSWER,30,6620 1510216851049242624,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 19:25:30,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n a1=a([1;2;3;4]);\n b1=b([1;2;3;4]);\n c1=c([1;2;3;4]);\n A=[a1 b1 c1];\n fprintf('%d' A);",WRONG_ANSWER,25,6756 1510216872167563264,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 19:25:35,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n a1=a([1;2;3;4]);\n b1=b([1;2;3;4]);\n c1=c([1;2;3;4]);\n A=[a1 b1 c1];\n fprintf('%d' A)",WRONG_ANSWER,28,6752 1510217516553990144,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-02 19:28:09,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,26,6768 1510218015256735744,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:30:07,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,a=[4 7 5;2 8 6;5 1 9;7 3 2],WRONG_ANSWER,25,6636 1510218791485267968,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 19:33:13,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:) b(:) c(:)];\nfprintf(new_v);",WRONG_ANSWER,28,6744 1510219011409403904,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-02 19:34:05,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a(1:15)=0;\nfprintf('%d ',a)",ACCEPTED,28,6760 1510219691443765248,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:36:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"clear;clc;\na = [4,5;2,7];\nb = [7,6;8,3];\nc = [5,9;6,2];\n\nnew_v = [a(:),b(:),c(:)]; \nfprintf(\""%d %d %d\\n\"", new_v');\n",WRONG_ANSWER,26,6692 1510220188129050624,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:38:46,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4,5;2,7];\nb = [7,6;8,3];\nc = [5,9;6,2];\nnew_v = [a(:),b(:),c(:)]; \nfprintf(\""%d %d %d\\n\"", new_v');\n",WRONG_ANSWER,28,6500 1510220299478888448,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:39:12,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\nnew_v = [a(:),b(:),c(:)]; \nfprintf(\""%d %d %d\\n\"", new_v');\n",ACCEPTED,25,6500 1510220502077628416,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:40:00,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\nnew_v1 = [a(:);b(:);c(:)]';\nfprintf(\""%d\\n\"",new_v1);",PRESENTATION_ERROR,26,6752 1510220658877489152,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:40:38,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\nnew_v1 = [a(:);b(:);c(:)]';\nfprintf(\""%d\\n\"",'new_v1');",WRONG_ANSWER,24,6764 1510220857766461440,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 19:41:25,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n a1=a([1;2;3;4]);\n b1=b([1;2;3;4]);\n c1=c([1;2;3;4]);\n A=[a1 b1 c1];\nfprintf('%d %d %d\\n',A')",ACCEPTED,26,6780 1510220888698908672,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:41:33,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"clear;clc;\na = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\n\nnew_v1 = [a(:);b(:);c(:)];\nfprintf(\""%d\\n\"",new_v1);",WRONG_ANSWER,25,6748 1510220973000224768,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:41:53,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"clear;clc;\na = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\n\nnew_v1 = [a(:);b(:);c(:)];\nfprintf(\""%d\\n\"",new_v1);",PRESENTATION_ERROR,24,6508 1510221051240771584,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:42:11,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\n\nnew_v1 = [a(:);b(:);c(:)];\nfprintf(\""%d\\n\"",new_v1);",PRESENTATION_ERROR,28,7348 1510221178038775808,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:42:42,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\n\nnew_v = [a(:),b(:),c(:)]; \nfprintf(\""%d %d %d\\n\"", new_v');",ACCEPTED,25,6512 1510221329839026176,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:43:18,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\n\nnew_v1 = [a(:);b(:);c(:)];\nfprintf(\""%d\\n\"",new_v1');",PRESENTATION_ERROR,25,6508 1510221579803312128,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:44:17,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"a = [1,2,-1,5,6,7,-4,3];\na(a<0) = 0;\na(a>0) = a(a>0).^3;\nfprintf('%d ', a);",ACCEPTED,28,6500 1510221691519328256,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:44:44,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"b = 6:2:33;\nfprintf(\""%d \"",b);",ACCEPTED,29,7400 1510221876222619648,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:45:28,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*pi,20);\ntheta = roundn(theta,-2);\nfprintf(\""%.2f \"", theta);",WRONG_ANSWER,27,6748 1510221917226680320,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 19:45:38,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v=[a1,a2,a3];\ndisp(new_v);",WRONG_ANSWER,28,6748 1510221967310319616,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:45:50,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros = zeros(1,15);\nfprintf(\""%d \"", myZeros);",ACCEPTED,25,6636 1510222131030781952,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 19:46:29,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=a([1 2 3 4]);b1=b([1 2 3 4]);\nc1=c([1 2 3 4]);\nA=[a1 b1 c1];\nfprintf('%d ',A)",ACCEPTED,26,6764 1510222731047485440,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:48:52,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*3.1415,20);\ntheta = roundn(theta,-2);\nfprintf(\""%.2f \"", theta);",WRONG_ANSWER,24,6768 1510222764027297792,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:49:00,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*3.141592,20);\ntheta = roundn(theta,-2);\nfprintf(\""%.2f \"", theta);",WRONG_ANSWER,26,6508 1510222859502239744,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:49:22,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*3.1415926,20);\ntheta = roundn(theta,-2);\nfprintf(\""%.2f \"", theta);",WRONG_ANSWER,25,6636 1510223180525879296,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:50:39,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4,5;2,7];\nb = [7,1;8,3];\nc = [5,9;6,2];\n\nnew_v1 = [a(:);b(:);c(:)]';\nfprintf(\""%d \"",new_v1);",ACCEPTED,25,6660 1510223660865961984,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:52:34,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*3.14159265358,20);\ntheta = roundn(theta,-2);\nfprintf(\""%.2f \"", theta);",WRONG_ANSWER,29,6748 1510223813617774592,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:53:10,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*3.14159265358,20);\ntheta = roundn(theta,2);\nfprintf(\""%.2f \"", theta);",WRONG_ANSWER,30,6496 1510224237151477760,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 19:54:51,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,25,6700 1510224909564788736,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 19:57:31,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*3.14159265358,20);\ntheta = roundn(theta,-2);\nfprintf(\""%.2f \"", theta);",WRONG_ANSWER,29,6760 1510225051123277824,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:58:05,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a([1;2;3;4]);\nb1=b([1;2;3;4]);\nc1=c([1;2;3;4]);\nnew=[a1 b1 c1]';\nfor j=1:4\nfprintf('%d ',new((1:3),j));\nfprintf('\\n');\nend\n\n",PRESENTATION_ERROR,27,6748 1510225458133614592,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 19:59:42,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a([1;2;3;4]);\nb1=b([1;2;3;4]);\nc1=c([1;2;3;4]);\nnew=[a1 b1 c1]';\nfor j=1:4\nfprintf('%d ',new((1:2),j));\nfprintf('%d ',new(3,j));\nid(j~=4)fprintf('\\n');\nend\n\n",WRONG_ANSWER,24,6756 1510225584067592192,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 20:00:12,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a([1;2;3;4]);\nb1=b([1;2;3;4]);\nc1=c([1;2;3;4]);\nnew=[a1 b1 c1]';\nfor j=1:4\nfprintf('%d ',new((1:3),j));\nid(j!=4)fprintf('\\n');\nend\n\n",WRONG_ANSWER,28,6584 1510226057114509312,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 20:02:05,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a([1;2;3;4]);\nb1=b([1;2;3;4]);\nc1=c([1;2;3;4]);\nnew=[a1 b1 c1]';\nfor j=1:4\n fprintf('%d\\t',new((1:3),j));\n if(j~=3);fprintf('\\n');\n end\nend\n",PRESENTATION_ERROR,32,6568 1510226307065667584,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 20:03:04,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a([1;2;3;4]);\nb1=b([1;2;3;4]);\nc1=c([1;2;3;4]);\nnew=[a1 b1 c1]';\nfor j=1:4\n fprintf('%d ',new((1:2),j));\n fprintf('%d ',new((3,j));\n fprintf('\\n');\nend\n",WRONG_ANSWER,26,6784 1510226589362569216,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 20:04:12,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a([1;2;3;4]);\nb1=b([1;2;3;4]);\nc1=c([1;2;3;4]);\nnew=[a1 b1 c1]';\nfor j=1:4\n fprintf('%d ',new((1:2),j));\n fprintf('%d',new(3,j));\n fprintf('\\n');\nend\n\n\n",ACCEPTED,30,6676 1510226635752300544,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-04-02 20:04:23,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a([1;2;3;4]);\nb1=b([1;2;3;4]);\nc1=c([1;2;3;4]);\nnew=[a1 b1 c1]';\nfor j=1:4\n fprintf('%d ',new((1:2),j));\n fprintf('%d',new(3,j));\n fprintf('\\n');\nend",ACCEPTED,29,6496 1510227185436811264,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-02 20:06:34,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta = linspace(0,2*3.14159265358,20);\nfprintf(\""%.2f \"", theta);",ACCEPTED,26,6780 1510227354730229760,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 20:07:14,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfor j=1:12\n fprintf('%d',new(1,j));\n if(j!=12)\n fprintf(\"" \"");\n end\nend",PRESENTATION_ERROR,25,6780 1510227392072118272,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 20:07:23,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfor j=1:12\n fprintf('%d',new(1,j));\n if(j!=12)\n fprintf(\"" \"");\n \nend",WRONG_ANSWER,28,6508 1510227641910575104,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 20:08:23,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfor i=1:12\n fprintf('%d',new(1,i));\n if(i!=12)\n fprintf(\"" \"");\n end\nend",PRESENTATION_ERROR,27,6692 1510227737003835392,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 20:08:45,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfor i=1:12\nfprintf('%d',new(1,i));\nif(i!=12)\nfprintf(\"" \"");\nend\nend",PRESENTATION_ERROR,25,6760 1510228629753053184,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 20:12:18,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfor i=1:12\nfprintf('%d',new(1,i));\nfprintf(\"" \"");\nend\n",ACCEPTED,25,6752 1510230208907964416,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 20:18:35,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v1=[a1',b1',c1'];\nfor i=1:12\nfprintf('%d',new_v1(1,i));\nfprintf(\"" \"");\nend\n",ACCEPTED,25,6508 1510231559705083904,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 20:23:57,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= input('');\nA(A<0)=0;\nA=A.^3;\nfprintf('%d ',A)",WRONG_ANSWER,24,6512 1510231671906910208,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 20:24:23,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= input('');\nA(A<0)=0;\nA=A.^3;\nfprintf('%d ',A)",WRONG_ANSWER,24,6624 1510231777453105152,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 20:24:49,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A>0;\nC=1:8;\nfor j=1:8\n if(B(1,j)>0)\n C(1,j)=A(1,j)^3;\n end\n if(B(1,j)==0)\n C(1,j)=0;\n end\nend\nfor i=1:8\n fprintf('%d',C(1,i));\n fprintf(\"" \"");\nend",ACCEPTED,26,6780 1510232014288674816,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-04-02 20:25:45,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nA(A<0)=0;\nA=A.^3;\nfprintf('%d ',A)",ACCEPTED,31,6492 1510234247415816192,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 20:34:38,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"C=1;14;\na=6;\nfor j=1:14\n C(1,j)=a;\n a=a+2;\nend\nfor i=1:14\n fprintf(\""%d\"",C(1,i));\n fprintf(\"" \"");\nend",ACCEPTED,27,6748 1510234717436637184,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 20:36:30,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:) b(:) c(:)]",WRONG_ANSWER,27,6496 1510235166839533568,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:38:17,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=zeros(1,20);\nfor i=1:20\n \ntheta(i)=roundn((i-1)*2*pi/19,-2);\nend\nfprintf(\""%.2f \"",theta)",WRONG_ANSWER,29,6760 1510235457505345536,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 20:39:26,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\n[m,n]=size(x);\nA=str2num(x(4:n-1));\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(x(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend",WRONG_ANSWER,25,6500 1510235887035084800,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 20:41:08,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\n[m,n]=size(x);\nA=str2num(x(4:n-1));\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend",WRONG_ANSWER,28,6492 1510236084999118848,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 20:41:56,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nfprintf('%d ',myZeros)",ACCEPTED,30,6568 1510236300224360448,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 20:42:47,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\n[m,n]=size(x);\nA=str2num(x(5:n-1));\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend",WRONG_ANSWER,25,6516 1510236391685898240,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:43:09,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4)];\nfprintf(\""%d \"",new_v1)\n\n",ACCEPTED,27,6512 1510236458156683264,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:43:25,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"fprintf('%d ',[1 8 0 125 216 343 0 27 \n])",ACCEPTED,26,6508 1510236521022185472,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 20:43:40,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,fprintf('1 8 0 125 216 343 0 27 '),ACCEPTED,26,6636 1510236525789835264,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:43:41,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"fprintf('%d ',[6 8 10 12 14 16 18 20 22 24 26 28 30 32 \n])",ACCEPTED,25,6588 1510236599514390528,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 20:43:58,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,2,5,7];\nb=[7,8,1,3];\nc=[5,6,9,2];\nnew_v=cat(2,a',b',c');\ndisp(new_v);\n",PRESENTATION_ERROR,33,6752 1510236699603066880,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 20:44:22,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf('%d ',a)",ACCEPTED,26,6496 1510236783139745792,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:44:42,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=zeros(1,20);\nfor i=1:20\n \ntheta(i)=roundn((i-1)*2*pi/19,-2);\nend\nfprintf(\""%.2f \"",theta)",WRONG_ANSWER,25,6512 1510236877294026752,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:45:05,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=zeros(1,20);\nfor i=1:20\n \ntheta(i)=(i-1)*2*pi/19;\nend\nfprintf('%.2f ',theta)",ACCEPTED,25,6376 1510236991059783680,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 20:45:32,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\n[m,n]=size(x);\nA=str2num(x(5:n-1));\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend",WRONG_ANSWER,25,6508 1510237415506571264,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-02 20:47:13,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = input('', 's');\nB = str2num(A);\nB = B .^ 3;\nlogical_neg = B < 0;\nB(logical_neg) = 0;\n\nfprintf(\""%d \"", B);\nfprintf(\""\\n\"");",WRONG_ANSWER,27,6756 1510237612278149120,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 20:48:00,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,fprintf('1 8 0 125 216 343 0 27 '),ACCEPTED,29,6496 1510237706521239552,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 20:48:22,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\n[m,n]=size(x);\nA=str2num(x(5:n-1));\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend",WRONG_ANSWER,26,6388 1510237837084454912,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:48:53,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15)\nfprintf('%d ',myZeros)\n",WRONG_ANSWER,25,6496 1510237972082323456,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:49:26,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros)\n",ACCEPTED,28,6496 1510238187849904128,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 20:50:17,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 \n];\nfprintf('%0.2f ',a)",ACCEPTED,34,6496 1510239486210564096,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 20:55:27,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"thera=zeros(1,20);\nthera(:)=0.00:2*pi/19:2*pi;\nfor i=1:20;\n fprintf(\""%0.2f\"",thera(1,i));\n fprintf(\"" \"");\nend",ACCEPTED,26,6564 1510239683430203392,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 20:56:14,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B)\n\n",WRONG_ANSWER,27,6764 1510239850497720320,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:56:53,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[reshape(a,4,1) reshape(b,4,1) reshape(c,4,1)];\nfor i=1:4\n fprintf(\""%d \"",new_v(i)) \n fprintf(\""%d \"",new_v(i+4)) \n fprintf(\""%d\\n\"",new_v(i+8)) \nend",ACCEPTED,26,6504 1510239873717387264,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 20:56:59,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4)];\nfprintf(\""%d \"",new_v1)\n\n",ACCEPTED,25,6504 1510240671737704448,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:00:09,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"x=reshape(6:2:33,1,14)",WRONG_ANSWER,26,6764 1510240706064433152,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-02 21:00:17,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfor i=1:15\n fprintf(\""%d\"",myZeros(1,i))\n fprintf(\"" \"")\nend",ACCEPTED,26,6508 1510240899605852160,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:01:04,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"x=reshape(6:2:33,1,14)；\nfor i=1:14\n fprintf('%d ',x(1,i))\nend",WRONG_ANSWER,28,6636 1510241003357429760,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:01:28,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"x=reshape(6:2:33,1,14);\nfor i=1:14\n fprintf('%d ',x(1,i))\nend",ACCEPTED,28,6508 1510241859418341376,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:04:52,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\nfor i=1:20\n fprintf('%d ',x(1,i))\nend",WRONG_ANSWER,30,6656 1510241885590253568,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 21:04:59,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v')\n\n\n\n\n\n\n\n\n",ACCEPTED,26,6764 1510242067275464704,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:05:42,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\nfor i=1:20\n fprintf('%.2f ',x(1,i))\nend",ACCEPTED,29,6420 1510242746807967744,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 21:08:24,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 1:4\n d(i,2)=b(i);\nend\nfor i = 1:4\n d(i,3)=c(i);\nend\nfor i = 1:4\n for j = 1:3\n fprintf('%d',d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend",ACCEPTED,25,6632 1510243696691994624,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 21:12:10,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(\""\"");\nB=zeros(8);\nfor i=1:8\n if (A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n else\n B(i)=0;\n end\nend\nfprintf(\""%d \"",B)",WRONG_ANSWER,25,6760 1510243978360479744,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:13:18,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nfor i = 1:length(A(:))\n if (A(1,i)>0)\n B (1,i)=A(1,i)^3;\n else B(1,i)=0;\n end\nend\nfprintf('%d ',B)\n\n ",ACCEPTED,26,6760 1510244007350235136,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-02 21:13:24,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ,WRONG_ANSWER,25,6516 1510244865933197312,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 21:16:49,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(\""\"");\nB=zeros(1,length(A));\nfor i=1:length(A)\n if (A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n else\n B(i)=0;\n end\nend\nfprintf(\""%d \"",B)",WRONG_ANSWER,26,6508 1510245323921289216,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 21:18:38,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=zeros(1,length(A));\nfor i=1:length(A)\n if (A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n else\n B(i)=0;\n end\nend\nfprintf(\""%d \"",B)",WRONG_ANSWER,25,6508 1510245350886469632,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 21:18:45,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]；\nB=zeros(1,length(A));\nfor i=1:length(A)\n if (A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n else\n B(i)=0;\n end\nend\nfprintf(\""%d \"",B)",WRONG_ANSWER,25,6512 1510245377797668864,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 21:18:51,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=zeros(1,length(A));\nfor i=1:length(A)\n if (A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n else\n B(i)=0;\n end\nend\nfprintf(\""%d \"",B)",ACCEPTED,29,6416 1510245416779530240,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-04-02 21:19:01,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=zeros(1,20);\nfor i=1:20\n \ntheta(i)=(i-1)*2*pi/19;\nend\nfprintf('%.2f ',theta)",ACCEPTED,28,6752 1510246253790097408,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 21:22:20,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)]'",WRONG_ANSWER,25,6376 1510246448997199872,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:23:07,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',new_v);",WRONG_ANSWER,27,6380 1510246508417904640,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 21:23:21,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)]'\nfprintf('%d',new_v)",WRONG_ANSWER,27,6760 1510246520208637952,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 21:23:24,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)]'\nfprintf('%d',new_v)",WRONG_ANSWER,27,6760 1510246561015021568,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:23:33,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',new_v);",WRONG_ANSWER,26,6628 1510247063782047744,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 21:25:33,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d',B);",PRESENTATION_ERROR,33,6764 1510247409551536128,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:26:56,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',new_v');",WRONG_ANSWER,26,6636 1510247540241854464,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-02 21:27:27,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnewvector=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',newvector.')\n\n\n\n",ACCEPTED,25,6508 1510247577600520192,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 21:27:36,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d',B);",PRESENTATION_ERROR,28,6500 1510247593949917184,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:27:40,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',new_v');",ACCEPTED,25,6752 1510247841657667584,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 21:28:39,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nfor n=1:8\n if A(n)>0\n A(n)=A(n)^3;\n else A(n)=0;\n \n end\nend\nfprintf('%d ',A)",ACCEPTED,27,6764 1510247876169129984,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 21:28:47,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfor i=1:8\nfprintf('%d',B(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,28,6560 1510248553871458304,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:31:28,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d',new_v1);",PRESENTATION_ERROR,24,6492 1510248732583092224,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-02 21:32:11,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnewvector=[a(:),b(:),c(:)];\nfprintf('%d ',newvector)",ACCEPTED,24,6896 1510248778056462336,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 21:32:22,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf('%d ',a)",ACCEPTED,26,6772 1510248974895149056,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-02 21:33:09,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:4\n for j=1:1:3\n if(j~=3)\n fprintf('%d ',new(i,j));\n else\n fprintf('%d',new(i,j));\n end\n end\n if(i~=4)\n fprintf('\\n');\n end\nend\n",ACCEPTED,31,6752 1510249049659162624,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:33:27,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d',new_v1');",WRONG_ANSWER,26,6772 1510249352304091136,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:34:39,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"k=0;\nfor i = 6:33\n if(mod(i,2)==0)\n k=k+1;\n a(1,k)=i;\nend\nend\nfprintf('%d,a')",WRONG_ANSWER,25,6492 1510249388396077056,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:34:47,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"k=0;\nfor i = 6:33\n if(mod(i,2)==0)\n k=k+1;\n a(1,k)=i;\nend\nend\nfprintf('%d,a')",WRONG_ANSWER,26,6484 1510249496150667264,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-02 21:35:13,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7]\n\na =\n\n 4 5\n 2 7\n\n>> b=[7,1;8,3]\n\nb =\n\n 7 1\n 8 3\n\n>> c=[5,9;6,2]\n\nc =\n\n 5 9\n 6 2\n\n>> A=reshape(a,[4,1])\n\nA =\n\n 4\n 2\n 5\n 7\n\n>> B =reshape(b,[4,1])\n\nB =\n\n 7\n 8\n 1\n 3\n\n>> C =reshape(c,[4,1])\n\nC =\n\n 5\n 6\n 9\n 2\n\n>> new_v=[A B C]\n\nnew_v =\n\n 4 7 5\n 2 8 6\n 5 1 9\n 7 3 2\n",WRONG_ANSWER,28,6640 1510249657473261568,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:35:52,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"k=0;\nfor i = 6:33\n if(mod(i,2)==0)\n k=k+1;\n a(1,k)=i;\nend\nend\nfprintf('%d',a)",PRESENTATION_ERROR,25,6512 1510249671434825728,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:35:55,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"k=0;\nfor i = 6:33\n if(mod(i,2)==0)\n k=k+1;\n a(1,k)=i;\nend\nend\nfprintf('%d',a)",PRESENTATION_ERROR,25,6492 1510249704834613248,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 21:36:03,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nc_1=a(:)';\nc_2=b(:)';\nc_3=c(:)';\nnew_v=cat(1,c_1,c_2,c_3);\nfprintf('%d %d %d\\n',round(new_v));",ACCEPTED,25,6764 1510249712493412352,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:36:05,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"k=0;\nfor i = 6:33\n if(mod(i,2)==0)\n k=k+1;\n a(1,k)=i;\nend\nend\nfprintf('%d ',a)",ACCEPTED,25,6760 1510249742693130240,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:36:12,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d\\n',new_v1);",PRESENTATION_ERROR,25,6764 1510250108854595584,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-02 21:37:39,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7]\n\na =\n\n 4 5\n 2 7\n\n>> b=[7,1;8,3]\n\nb =\n\n 7 1\n 8 3\n\n>> c=[5,9;6,2]\n\nc =\n\n 5 9\n 6 2\n\n>> A=reshape(a,[4,1])\n\nA =\n\n 4\n 2\n 5\n 7\n\n>> B =reshape(b,[4,1])\n\nB =\n\n 7\n 8\n 1\n 3\n\n>> C =reshape(c,[4,1])\n\nC =\n\n 5\n 6\n 9\n 2\n\n>> new_v=[A B C]\n\nnew_v =\n\n 4 7 5\n 2 8 6\n 5 1 9\n 7 3 2\n\n>> fprintf(new_v)",WRONG_ANSWER,24,6752 1510250267949285376,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-02 21:38:17,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:12\n fprintf('%d ',new(i));\nend\n",ACCEPTED,26,6764 1510250294793560064,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:38:24,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d\\n',new_v1);",WRONG_ANSWER,25,6384 1510250407233732608,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:38:50,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d',new_v1);",PRESENTATION_ERROR,26,6892 1510250422573031424,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:38:54,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\nx=strcat(x,';');\neval(x);\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend\n\n",WRONG_ANSWER,27,6760 1510250557896781824,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 21:39:26,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nc_a=a(:);\nc_b=b(:);\nc_c=c(:);\nnew_v1=cat(2,c_a,c_b,c_c);\nfprintf('%d ',round(new_v1));",ACCEPTED,26,6508 1510250565103869952,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:39:28,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d',new_v1);",WRONG_ANSWER,29,6760 1510250602210148352,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 21:39:37,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)]';\nfprintf('%d ',new_v)",ACCEPTED,26,6512 1510250858624184320,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:40:38,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi = 3.14;\na = linspace(0,20,2*pi);\nfprintf('%.2f ',a)",WRONG_ANSWER,26,6752 1510251117492432896,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 21:41:40,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152," b=linspace(0,2*pi,20);\n fprintf('%.2f ',b)",ACCEPTED,25,6380 1510251132115050496,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:41:43,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi = 3.14;\na = linspace(0,2*pi,20);\nfprintf('%.2f ',a)",WRONG_ANSWER,28,6664 1510251190377398272,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 21:41:57,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B);",WRONG_ANSWER,26,6756 1510251322548305920,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:42:29,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi = 3.1415;\na = linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,26,6672 1510251429017247744,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-04-02 21:42:54,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"b=linspace(0,0,15);\n fprintf('%d ',b)",ACCEPTED,24,6756 1510251900854747136,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:44:46,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend\n\n",WRONG_ANSWER,26,6556 1510252051359686656,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 21:45:22,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros)",ACCEPTED,24,6908 1510252064507555840,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:45:25,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend\n\n",WRONG_ANSWER,30,6576 1510252108695093248,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:45:36,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend\n\n",WRONG_ANSWER,25,6768 1510252142006984704,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:45:44,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n fprintf('0 ')\n else\n B(1,i)=u*u*u;\n fprintf('%d ',u*u*u)\n end\nend\n\n",WRONG_ANSWER,24,6536 1510252451469848576,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:46:58,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v1=[a(:),b(:),c(:)];\nfprintf('%d ',new_v1);",ACCEPTED,29,6756 1510252518604423168,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 21:47:14,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfor i=1:15\nfprintf(\""%d\"",myZeros(1,i));\nfprintf(\"" \"")\nend",ACCEPTED,25,6764 1510252916539744256,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:48:49,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"zeros(1,15);\nfor i=1:15\n fprintf('%d ',x(1,i))\nend",WRONG_ANSWER,25,6748 1510252944327008256,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 21:48:55,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfor i=1:15\n fprintf('%d ',x(1,i))\nend",ACCEPTED,32,6496 1510253103575613440,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-04-02 21:49:33,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1,b1,c1];\nfor i=1:4\n fprintf('%d',new(i,1));\n for j=2:3\n fprintf(' %d',new(i,j));\n end\n if(i!=4)\n fprintf('\\n');\n end\nend",ACCEPTED,29,6760 1510253501413191680,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-02 21:51:08,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B)",WRONG_ANSWER,24,6756 1510253786857824256,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 21:52:16,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:);b(:);c(:)]\n\nfprintf('%d %d %d %d %d %d %d %d %d',d)",WRONG_ANSWER,25,6384 1510253911700553728,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 21:52:46,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:);b(:);c(:)];\n\nfprintf('%d %d %d %d %d %d %d %d %d',d)",PRESENTATION_ERROR,29,7416 1510254182745595904,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 21:53:50,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:);b(:);c(:)];\n\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d',d)",PRESENTATION_ERROR,27,6516 1510254205812994048,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 21:53:56,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:);b(:);c(:)];\n\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d ',d)",ACCEPTED,29,6760 1510255161536036864,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-02 21:57:44,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n A=reshape(a,[4,1]);B =reshape(b,[4,1]);C =reshape(c,[4,1]);\nd=[A B C];\nnew_v=d';\nfprintf('%d %d %d\\n',new_v)",ACCEPTED,25,6496 1510255585387962368,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 21:59:25,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:) b(:) c(:)];\ng=[new(1,:),new(2,:),new(3,:),new(4,:)];\nfprintf('%d %d %d\\n',g)",ACCEPTED,30,6660 1510255844313657344,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 22:00:27,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=zeros(4,3);\nnew_v(:,1)=a(:);\nnew_v(:,2)=b(:);\nnew_v(:,3)=c(:);\nfor i=1:4\nfor j=1:3\nfprintf('%d',new_v(i,j));\nif(j!=3)\nfprintf(\"" \"");\nend\nif(j==3)\nfprintf(\""\\n\"");\nend\nend\nend",ACCEPTED,26,6496 1510256170313015296,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:01:44,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfor i=1:n\n fprintf('%d ',B(1,i))\nend\n\n",WRONG_ANSWER,24,6780 1510256179733422080,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-04-02 22:01:47,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfprintf('%d',new(1));\nfor i=2:12\n fprintf(' %d',new(i));\nend",PRESENTATION_ERROR,27,6496 1510256356431060992,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-04-02 22:02:29,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfor i=1:12\n fprintf('%d ',new(i));\nend",ACCEPTED,25,6504 1510256671335211008,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-02 22:03:44,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA1=a(:);B1=b(:);C1=c(:);\nA=A1';B=B1';C=C1';\nnew_v1=horzcat(A,B,C);\nfprintf('%d ',new_v1)",ACCEPTED,24,6508 1510256842579525632,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 22:04:25,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,6.28,20);\nfor i=1:20\nfprintf(\""%.2f\"",theta(1,i));\nfprintf(\"" \"");\nend",WRONG_ANSWER,28,6508 1510257031571398656,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:05:10,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%d ',B.*B.*B);",WRONG_ANSWER,24,6540 1510257056309403648,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:05:16,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%d ',B.*B.*B);",WRONG_ANSWER,27,6764 1510257185241579520,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 22:05:46,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 5;2 7];\nb=[7 1;8 3];\nc=[5 9;6 2];\nnew_v1=zeros(1,12);\nnew_v1(1:1:4)=(a(:))';\nnew_v1(5:1:8)=(b(:))';\nnew_v1(9:1:12)=(c(:))';\nfor i=1:12\nfprintf(\""%d\"",new_v1(1,i));\nfprintf(\"" \"");\nend\n",ACCEPTED,28,6760 1510257792207155200,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-04-02 22:08:11,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.^3;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,27,6640 1510257867797446656,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:08:29,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfor i=1:n\n fprintf('%d ',B(1,i))\nend\n\n",WRONG_ANSWER,25,6760 1510258069744250880,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:09:17,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d ',round(B))\n\n",WRONG_ANSWER,25,6760 1510258197893365760,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 22:09:48,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nfor i=1:1:8;\nif B(i)<0;\nB(i)=0;\nend;\nend;\nfor i=1:8\nfprintf(\""%d\"",B(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,25,6496 1510258233096159232,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-04-02 22:09:56,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfprintf(\""%d \"",A)",ACCEPTED,25,6636 1510258312151130112,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:10:15,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%d ',B.*B.*B);",WRONG_ANSWER,25,6372 1510258350210244608,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:10:24,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d %d %d %d %d %d %d %d ',B)\n\n",WRONG_ANSWER,29,6552 1510258436234690560,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:10:45,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d %d %d %d %d %d %d %d',B)\n\n",WRONG_ANSWER,26,6656 1510258605944074240,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:11:25,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d ',round(B))\n\n",WRONG_ANSWER,27,6764 1510258634587521024,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:11:32,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d ',round(B))\n\n",WRONG_ANSWER,27,6760 1510258659417255936,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-04-02 22:11:38,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d ',round(B))\n\n",WRONG_ANSWER,26,6780 1510259011663294464,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:13:02,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf(\""B=[\"");fprintf('%d ',B.*B.*B);fprintf(\""]\"");",WRONG_ANSWER,30,6684 1510259151624298496,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:13:35,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf(\""B= [\"");fprintf('%d ',B.*B.*B);fprintf(\""]\"");",WRONG_ANSWER,28,6752 1510259162885275648,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:13:38,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf(\""B= [\"");fprintf('%d ',B.*B.*B);fprintf(\""]\"");",WRONG_ANSWER,27,6520 1510259219902099456,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:13:51,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%d ',B.*B.*B);",WRONG_ANSWER,25,6380 1510259694839918592,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-04-02 22:15:45,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfprintf('%.2f ',A);",ACCEPTED,25,6508 1510259774015795200,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:16:04,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%f ',B.*B.*B);",WRONG_ANSWER,26,6632 1510260057110343680,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-04-02 22:17:11,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros);",ACCEPTED,28,6640 1510260331490402304,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-02 22:18:16,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;\nB((B<0))=0;\nfor i=1:1:length(B)\n fprintf('%d ',B(i));\nend",WRONG_ANSWER,25,6512 1510260675884703744,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 22:19:39,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nn=length(A);\nfor i=1:n\n if A(1,i)>0\n A(1,i)=A(1,i)*A(1,i)*A(1,i);\n else\n A(1,i)=0;\n end\nend\nB=A;\nfprintf('%d ',B)",ACCEPTED,25,6764 1510260801952899072,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:20:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%.0f ',B.*B.*B);",WRONG_ANSWER,24,6636 1510261307161010176,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-04-02 22:22:09,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"new_v1=[4,2,5,7,7,8,1,3,5,6,9,2];\nfprintf('%d ',new_v1)",ACCEPTED,24,6752 1510261504954724352,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-02 22:22:56,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfor i=1:1:length(B)\n fprintf('%d ',B(i));\nend",ACCEPTED,26,6768 1510261549146456064,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 22:23:07,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"B=[];\nA= [1 2 -1 5 6 7 -4 3];\ni=1;\nfor b=A \nif b>0\nB(i)=b*b*b;\nelse\n B(i)=0;\nend\nfprintf('%d ',B(i))\ni=i+1;\nend\n",ACCEPTED,25,6508 1510261853446860800,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 22:24:19,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];\nfor i=1:15\nfprintf(\""%d\"",myzeros(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,28,6640 1510262007277154304,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-04-02 22:24:56,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB= [1 8 0 125 216 343 0 27];\nfprintf('%d ',B)",ACCEPTED,25,6644 1510262287830499328,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-04-02 22:26:03,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf('%d ',A)",ACCEPTED,26,6512 1510262331678482432,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 22:26:13,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for b=6:33 \nif b/2==0\nfprintf('%d ',b)\nend\ni=i+1\nend\n",WRONG_ANSWER,30,6748 1510262544630411264,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 22:27:04,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:33\n if rem(i,2)==0\n fprintf('%d ',i);\n end\nend",ACCEPTED,26,6752 1510263022651043840,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 22:28:58,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d ',round(B))",WRONG_ANSWER,25,6736 1510263318069731328,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-02 22:30:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;A= [1 2 -1 5 6 7 -4 3];\nfor i=1:length(B);\nif B(i)<0\nB(i)=0;\nend\nend\nfprintf('%d ',B)",WRONG_ANSWER,26,6572 1510263445131247616,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:30:39,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6 8 10 12 14 16 18 20 22 24 26 28 30 32 ];\nfprintf('%d ',A);",ACCEPTED,25,6640 1510263588979826688,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 22:31:13,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=(6:33);\nB=(1:14);\nj=1;\nfor i=6:33\n if A(i)\n B(j)=A(i);\n j++;\n end\nend\nfprintf('%d ',B);",WRONG_ANSWER,27,6500 1510263671925108736,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 22:31:33,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"\nfor b=6:33 \nif mod(b,2) ==0\nfprintf('%d ',b)\nend\nend\n",ACCEPTED,25,6500 1510264278150111232,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-04-02 22:33:57,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A = linspace(0,6.283,20);\nfprintf('%4.2f ',A)",ACCEPTED,28,6752 1510264541119115264,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-02 22:35:00,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;\nfor i=1:length(B);\nif B(i)<0\nB(i)=0;\nend\nend\nfprintf('%d ',B)",WRONG_ANSWER,26,6384 1510265202082705408,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 22:37:38,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfor i=1:20\nfprintf('%3.2f ',a(i))\nend",ACCEPTED,26,6644 1510265319562240000,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-02 22:38:06,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\na1=a(1:2,1)\na2=a(1:2,2)\nb1=b(1:2,1)\nb2=b(1:2,2)\nc1=c(1:2,1)\nc2=c(1:2,2)\nnew_v1=cat(2,a1,b1,c1)\nnew_v2=cat(2,a2,b2,c2)\nnew_v=cat(1,new_v1,new_v2)",WRONG_ANSWER,28,6500 1510265335009861632,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-04-02 22:38:09,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(15,1,\""int8\"");\nfprintf('%d ',A)",ACCEPTED,24,6636 1510265336778584064,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-04-02 22:38:10,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,28,6488 1510265760068288512,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 22:39:51,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=zeros(1,14);\nfor i=6:2:32\nfor j=1:14\nA(1,j)=i;\nend\nend\nfor k=1:14\nfprintf(\""%d\"",A(1,k));\nfprintf(\"" \"");\nend",WRONG_ANSWER,28,6736 1510265895264018432,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 22:40:23,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=(6:2:32);\nfor i=1:14\nfprintf(\""%d\"",a(1,i));\nfprintf(\"" \"")\nend",ACCEPTED,26,6764 1510266100796768256,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 22:41:12,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zero(1,20);\nfor i=1:20\nfprintf('%d ',a(i))\nend",WRONG_ANSWER,27,6536 1510266283975335936,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-02 22:41:56,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfor i=1:1:length(A)\n fprintf('%d ',A(i));\nend",ACCEPTED,25,6504 1510266331890335744,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 22:42:07,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,20);\nfor i=1:20\nfprintf('%d ',a(i))\nend",WRONG_ANSWER,25,6764 1510266409505931264,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-02 22:42:26,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfor i=1:15\nfprintf('%d ',a(i))\nend",ACCEPTED,26,6636 1510266429638590464,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 22:42:30,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:32;\nfor i=1:14\nfprintf(\""%d\"",a(1,i));\nfprintf(\"" \"")\nend",ACCEPTED,26,6504 1510266474719698944,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 22:42:41,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=(6:2:32);\nfor i=1:14\nfprintf(\""%d\"",a(1,i));\nfprintf(\"" \"")\nend",ACCEPTED,29,6500 1510267540721758208,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 22:46:55,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28];\nfor i=1:20\nfprintf(\""%.2f\"",theta(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,26,6764 1510267645702266880,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-02 22:47:20,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.*A.*A;\nfor i=1:length(B);\nif B(i)<0\nB(i)=0;\nend\nend\nfprintf('%d ',B)",WRONG_ANSWER,28,6500 1510268320745406464,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:50:01,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v')",WRONG_ANSWER,28,6512 1510268542527074304,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:50:54,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v)",PRESENTATION_ERROR,26,6504 1510268650811420672,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:51:20,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n','new_v')",WRONG_ANSWER,27,6744 1510268819960586240,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:52:00,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n','new_v')",WRONG_ANSWER,24,6380 1510268871029702656,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-04-02 22:52:12,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi = 3.1415;\ntheta = linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,25,6508 1510268968359256064,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:52:36,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v')",WRONG_ANSWER,24,6488 1510269105789091840,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:53:08,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v')",WRONG_ANSWER,25,6752 1510269693663469568,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:55:29,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v')",WRONG_ANSWER,25,6764 1510269812415524864,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 22:55:57,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na1=reshape(a,[4,1]);\nb1=reshape(b,[4,1]);\nc1=reshape(c,[4,1]);\nnew_v=[a1,b1,c1];\nfprintf('%d %d %d\\n',new_v')",ACCEPTED,26,6744 1510270792322379776,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 22:59:51,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 1:4\n d(i,2)=b(i);\nend\nfor i = 1:4\n d(i,3)=c(i);\nend\nfor i = 1:4\n for j = 1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend\n",ACCEPTED,25,6504 1510271683993661440,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:03:23,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d',new_v)",PRESENTATION_ERROR,27,6748 1510271693369204736,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-02 23:03:25,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v=cat(2,a1,b1,c1);\nfor i=1:3;\n for j=1:2;\n fprintf (\""%d \"",new_v(i,j))\n end;\n fprintf (\""%d\\n\"",new_v(i,3))\nend;\nfor j=1:2;\n fprintf (\""%d \"",new_v(4,j))\nend;\nfprintf (\""%d\"",new_v(4,3))",ACCEPTED,26,6680 1510271750917976064,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-02 23:03:39,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v=cat(2,a1,b1,c1);\nfor i=1:3;\n for j=1:2;\n fprintf (\""%d \"",new_v(i,j))\n end;\n fprintf (\""%d\\n\"",new_v(i,3))\nend;\nfor j=1:2;\n fprintf (\""%d \"",new_v(4,j))\nend;\nfprintf (\""%d\"",new_v(4,3))",ACCEPTED,28,6500 1510271844859076608,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-02 23:04:01,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[0,0,0,0,0,0,0,0,0,0,0,0,0,0];\nA(:)=6:2:33;\nfprintf('%d ',A)\n",ACCEPTED,24,6756 1510271882322599936,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:04:10,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"y=linspace(0,2*pi,20);\nfprintf('%.2f ',y);",ACCEPTED,29,6760 1510272067601784832,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:04:55,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d ',new_v)",ACCEPTED,24,6508 1510272221074288640,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 23:05:31,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(12,1);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 5:8\n d(i,1)=b(i);\nend\nfor i = 9:12\n d(i,1)=c(i);\nend\nfor i = 1:11\n fprintf(\""%d \"",d(i,1));\nend;\nfprintf(\""%d\"",d(12,1));",WRONG_ANSWER,25,6512 1510272426709704704,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 23:06:20,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros=zeros(1,15);\nfprintf('%d ',myzeros)",ACCEPTED,26,6640 1510272469863624704,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:06:30,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 ];\nfprintf('%d ',myZeros);",WRONG_ANSWER,25,6748 1510272485962637312,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 23:06:34,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(12,1);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 5:8\n d(i,1)=b(i-4);\nend\nfor i = 9:12\n d(i,1)=c(i-8);\nend\nfor i = 1:12\n fprintf(\""%d \"",d(i,1));\nend;",ACCEPTED,25,6504 1510272523525550080,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:06:43,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nfprintf('%d ',myZeros);",ACCEPTED,23,6752 1510272825255936000,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-02 23:07:55,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfor i=1:20\nfprintf(\""%.2f\"",theta(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,26,6756 1510273035009613824,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 23:08:45,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B)",WRONG_ANSWER,24,6384 1510273049949724672,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:08:49,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf(\""B= [1 8 0 125 216 343 0 27]\"");",WRONG_ANSWER,24,6496 1510273136906035200,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:09:10,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%.0f ',B.*B.*B);",WRONG_ANSWER,26,6512 1510273225798840320,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:09:31,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:1:33];\nnew=A(find(mod(A,2)==0));\nfprintf('%d ',new)",ACCEPTED,24,6376 1510273233005199360,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 23:09:32,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B)",ACCEPTED,25,6384 1510273868149383168,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-04-02 23:12:04,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"fprintf('%.2f ',theta=0:(2*pi/19):2*pi)",ACCEPTED,24,6376 1510273989103448064,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-04-02 23:12:33,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"for i=0:2*pi/19:2*pi\n \n fprintf('%4.2f ',i);\n \nend\n",ACCEPTED,28,6500 1510274071459151872,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-02 23:12:52,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=[];\nfor i=1:20\nfor j=0.00:0.33:6.28\nA(1,i)=j;\nend\nend\nfor k=1:20\nfprintf(\""%d\"",A(1,k));\nfprintf(\"" \"");\nend",WRONG_ANSWER,29,6644 1510274094474027008,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-02 23:12:58,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v=cat(2,a1,b1,c1);\nfprintf(\""%d \"",new_v(1:4,1:2))\nfprintf(\""%d \"",new_v(1:3,3))\nfprintf(\""%d\"",new_v(4,3))",PRESENTATION_ERROR,26,6512 1510274234931605504,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-02 23:13:31,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v=cat(2,a1,b1,c1);\nfprintf(\""%d \"",new_v(:))\n",ACCEPTED,26,6500 1510274476742893568,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:14:29,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.1415926;\ntheta=[0:0.33:2*PI];\nfprintf('%d ',theta)",WRONG_ANSWER,27,6492 1510274687350751232,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:15:19,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%.0f ',B.*B.*B);",WRONG_ANSWER,25,6512 1510274694216282112,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:15:21,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.1415926;\ntheta=[0:0.33:2*PI];\nfprintf('%d',theta)",WRONG_ANSWER,25,6504 1510274716882300928,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:15:26,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.1415926;\ntheta=[0:0.33:2*PI];\nfprintf('%d ',theta)",WRONG_ANSWER,25,6756 1510274758163185664,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:15:36,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159265357;\ntheta=[0:0.33:2*PI];\nfprintf('%d ',theta)",WRONG_ANSWER,24,6756 1510275055182823424,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-04-02 23:16:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1,b1,c1];\nnew_v=new';\nnew_x=new_v(:);\nnew_z=new_x';\nfor i=0:3;\n for j=1:3;\n fprintf('%d',new_z(j+i.*3))\n fprintf(' ')\n end\n fprintf('\\n')\nend",PRESENTATION_ERROR,26,6748 1510275163965747200,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:17:13,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.1415;\ntheta=[0:0.33:2*PI];\nfprintf('%d ',theta)",WRONG_ANSWER,26,6752 1510275786375294976,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-04-02 23:19:41,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1,b1,c1];\nnew_v=new';\nnew_x=new_v(:);\nnew_z=new_x';\nfor i=0:2;\n for j=1:2;\n fprintf('%d ',new_z(j+i.*3))\n end\n fprintf('%d',new_z(3+i.*3))\n fprintf('\\n')\nend\nfor j=1:2;\n fprintf('%d ',new_z(j+3.*3))\nend\nfprintf('%d',new_z(3+3.*3))",ACCEPTED,25,6500 1510275859730751488,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:19:59,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.1415;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2d ',theta)",WRONG_ANSWER,25,6384 1510275928755138560,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:20:15,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159265357;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2d ',theta)",WRONG_ANSWER,24,6512 1510276648884125696,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 23:23:07,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:1:33];\nnew=A(find(mod(A,2)==0));\nfprintf('%d ',new)",ACCEPTED,25,6508 1510276678773465088,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:23:14,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159265358;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2d ',theta)",WRONG_ANSWER,27,6644 1510276812050939904,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-02 23:23:46,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfprintf('%d%d%d\\n',new_v);",WRONG_ANSWER,32,8684 1510276841789284352,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:23:53,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159265358;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2f ',theta)",WRONG_ANSWER,32,6564 1510276969190539264,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:24:23,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1,2,-1,5,6,7,-4,3];\nB=ones(1,8)*nan;\nfor i=1:8\n if A(1,i)>0\n B(1,i)=A(1,i)*A(1,i)*A(1,i);\n end\n if A(1,i)<0\n B(1,i)=0;\n end\nend\nfor j=1:8\n fprintf('%d',B(1,j))\n fprintf('%c',' ')\nend",ACCEPTED,29,6568 1510277260883410944,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:25:33,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.141592653;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2f ',theta)",WRONG_ANSWER,25,6508 1510277376952385536,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:26:00,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2f ',theta)",WRONG_ANSWER,25,6384 1510277680426512384,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-02 23:27:13,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfprintf('%d %d %d\\n',new_v.');",ACCEPTED,27,6496 1510277905950588928,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:28:07,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159;\ntheta=[0:0.33:2*PI];\nfprintf('%.2f ',theta)",WRONG_ANSWER,26,6632 1510277949517553664,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:28:17,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2f',theta)",WRONG_ANSWER,24,6760 1510277989727072256,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:28:27,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159;\ntheta=[0:0.33:2*PI];\nfprintf('%0.2f ',theta)",WRONG_ANSWER,25,6556 1510278462320275456,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:30:19,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A;\nfor i=1:length(A);\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%.0f ',B.*B.*B);",WRONG_ANSWER,25,6748 1510278987804196864,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:32:24,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.1415;\nA=linspace(0,2*PI,20);\nfprintf(\""%.2f \"",A)",ACCEPTED,26,6500 1510278991240060928,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:32:25,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A;\nfor i=1:8;\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%d ',B.*B.*B);",ACCEPTED,26,6632 1510279185007243264,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:33:11,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(15,1);\nfprintf('&d ',myZeros)",WRONG_ANSWER,26,6496 1510279376843399168,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:33:57,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('&d ',myZeros)",WRONG_ANSWER,26,6748 1510279465577365504,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:34:18,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('&d',myZeros)",WRONG_ANSWER,29,6512 1510279716094210048,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-02 23:35:18,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B)",ACCEPTED,27,6508 1510279731802423296,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:35:22,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('&d',myZeros)",WRONG_ANSWER,27,6744 1510279848715182080,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:35:50,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf(myZeros)",WRONG_ANSWER,28,6500 1510280297765756928,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:37:37,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf(‘%d',myZeros)",WRONG_ANSWER,25,6504 1510280413562101760,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-02 23:38:04,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"B=[6:2:33];\nfprintf (\""%d \"",B)\n",ACCEPTED,25,6752 1510280871692070912,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:39:54,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf(‘%d ',myZeros)",WRONG_ANSWER,25,6500 1510280948493971456,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-02 23:40:12,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"\na=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a,b,c];\nfprintf('%d\\0',new)",PRESENTATION_ERROR,26,6388 1510281146252484608,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:40:59,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf(\""%d \"",myZeros)",ACCEPTED,24,6496 1510281328971870208,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 23:41:43,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6;\nb=33;\nc=fix((b-a+1)/2);\nd=zeros(c,1);\nfor i=a:b;\nif (i%2)==0;\nfor j=1:c;\n d(j,1)=i;\n i=i+2;\nend\nend\nelse\ni=i+1;\nfor j=1:c;\n d(j,1)=i;\n i=i+2;\nend\nend\nend\nfor i = 1:c\n fprintf(\""%d \"",d(i,1));\nend\n",WRONG_ANSWER,26,6508 1510282140766826496,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 23:44:56,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf(\""%d \"",myZeros)",ACCEPTED,24,6760 1510282308195598336,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-02 23:45:36,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"\na=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a,b,c];\nfprintf('%d ',new)",ACCEPTED,24,6496 1510282623230500864,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:46:51,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nok=A>0;\nB=A.*A.*A.*ok;\nfprintf('%d ',B)",ACCEPTED,26,6760 1510282753487532032,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-02 23:47:22,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5,2,7],\nb=[7,1,8,3],\nc=[5,9,6,2],\nd=a+b,\ne=b+c,\nnew_v=[d,e]\nprintf{new_v}",WRONG_ANSWER,25,6752 1510282950486876160,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-02 23:48:09,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,475\n286\n519\n732,WRONG_ANSWER,25,6504 1510282968560132096,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-04-02 23:48:14,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\njudge=A>0;\nB=A.*A.*A.*judge;\nfprintf('%d ',B)",ACCEPTED,24,6380 1510282997022679040,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-02 23:48:20,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,4 7 5\n2 8 6\n5 1 9\n7 3 2,WRONG_ANSWER,23,6640 1510283099590189056,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-02 23:48:45,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,printf{4 7 5\n2 8 6\n5 1 9\n7 3 2},WRONG_ANSWER,24,6640 1510283211471974400,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-04-02 23:49:11,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\njudge=A>0;\nB=A.*A.*A.*judge;\nfprintf('%d ',B)",ACCEPTED,27,6620 1510283372173811712,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:49:50,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=(6:33);\nB=(1:14);\nj=1;\nfor i=6:33;\n if A(i);\n B(j)=A(i);\n j=j+1;\n end\nend\nfprintf('%d ',B);",WRONG_ANSWER,25,6508 1510283523504300032,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-02 23:50:26,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=(6:33);\nB=(1:14);\nj=1;\nfor i=6:33;\n if A(i);\n B(j)=A(i);\n end\n j=j+1;\nend\nfprintf('%d ',B);",WRONG_ANSWER,24,6748 1510283954447335424,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-02 23:52:09,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6;\nb=33;\nc=fix((b-a+1)/2);\nd=zeros(c,1);\nj=1;\nfor i=a:b;\nif 1>mod(i,2);\n d(j,1)=i;\n j=j+1;\nend\nend\nfor i = 1:c\n fprintf(\""%d \"",d(i,1));\nend\n",ACCEPTED,26,6516 1510284673065283584,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-02 23:55:00,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f ',round(A(i),2));\nend",WRONG_ANSWER,26,6636 1510286358651748352,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-03 00:01:42,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f ',A(i));\nend",ACCEPTED,26,6512 1510287036879093760,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-03 00:04:24,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZero=zeros(1,15);\nfor i=1:1:15\n fprintf('%d ',myZero(i));\nend",ACCEPTED,24,6504 1510287994069598208,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:08:12,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,fprintf{4 7 5\n2 8 6\n5 1 9\n7 3 2},WRONG_ANSWER,27,6640 1510288295342260224,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:09:24,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,>>fprintf\n{4 7 5\n2 8 6\n5 1 9\n7 3 2},WRONG_ANSWER,28,6484 1510288447331983360,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-03 00:10:00,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088," \nA= [1 2 -1 5 6 7 -4 3];\n \nfor i=1:8\n \n if A(i)>=0\n B(i)= A(i)*A(i)*A(i);\n else \n B(i)=0;\n end \n\nend\nfprintf('%d ',B)",ACCEPTED,24,6756 1510289142905696256,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-03 00:12:46,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"b=1;\nfor i=6:2:33 \nB(b)= i;\nb=b+1;\nend\nfprintf('%d ',B)",ACCEPTED,27,6496 1510289273130446848,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-03 00:13:17,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.14;\ntheta=linspace(0,2.*pi,20);\nfprintf (\""%.2f \"",theta)\n",WRONG_ANSWER,26,6508 1510289805233709056,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-03 00:15:24,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152," \n fprintf('%d ',zeros(15,1));",ACCEPTED,25,6512 1510290837094678528,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-03 00:19:30,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,6.28,20);\nB=roundn(A,-2);\nfprintf('%g ',B)\n\n",WRONG_ANSWER,28,6504 1510290927897894912,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:19:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"fprintf new_v={4,7,5;2,8,6;5,1,9;7,3,2}\n",WRONG_ANSWER,26,6748 1510291367779721216,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:21:36,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new_v=[4,7,5;2,8,6;5,1,9;7,3,2]\nfprintf{new_v}\n\n",WRONG_ANSWER,24,6508 1510291621739905024,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:22:37,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,new_v=[4 7 5;2 8 6;5 1 9;7 3 2]\nfprintf\n\n,WRONG_ANSWER,24,6760 1510291643486826496,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-03 00:22:42,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.1415926;\ntheta=linspace(0,2.*pi,20);\nfprintf (\""%.2f \"",theta)\n",ACCEPTED,24,6760 1510291684251267072,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:22:52,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,fprintf[4 7 5;2 8 6;5 1 9;7 3 2]\n\n\n,WRONG_ANSWER,26,6496 1510291887558115328,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-03 00:23:40,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:33;\nB=1:14;\nj=1;\nfor i=1:28\n if mod(A(i),2)==0\n B(j)=A(i);\n j=j+1;\n end\nend\nfprintf('%d ',B);",ACCEPTED,28,6624 1510292005632696320,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-04-03 00:24:08,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:33;\nB=1:14;\nj=1;\nfor i=1:28\n if mod(A(i),2)==0\n B(j)=A(i);\n j=j+1;\n end\nend\nfprintf('%d ',B);",ACCEPTED,26,6496 1510292065896456192,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-03 00:24:23,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(1,15);\nfprintf('%d ',A)",ACCEPTED,26,6500 1510292418514513920,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:25:47,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new_v=[4 7 5;2 8 6;5 1 9;7 3 2]\nfprintf('a: %f', a);\n\n",WRONG_ANSWER,25,6508 1510292468163035136,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:25:58,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5;2 8 6;5 1 9;7 3 2]\nfprintf('a: %f', a);\n\n",WRONG_ANSWER,26,6376 1510292791188086784,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-04-03 00:27:15,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=linspace(0,0,15);\nfprintf (\""%d \"",myZeros)",ACCEPTED,25,6772 1510293119744696320,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:28:34,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5;2 8 6;5 1 9;7 3 2]\nfid=fopen('d:\\chr.txt','wt')\nfprintf(fid,'%8.4f %8.3f %6.2f\\n',a') \nfclose(fid) ",WRONG_ANSWER,26,6760 1510293299533537280,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 00:29:17,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"d=zeros(15,1);\nfor i = 1:15\n fprintf(\""%d \"",d(i,1));\nend;",ACCEPTED,27,6740 1510294962872868864,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 00:35:53,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v=[a1,b1,c1];\ndisp(new_v);",PRESENTATION_ERROR,24,6380 1510296564118994944,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:42:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5]\nfprintf('%d\\n',round(a));\nb=[2 8 6]\nfprintf('%d\\n',round(b));\nc=[5 1 9]\nfprintf('%d\\n',round(c));\nd=[7 3 2]\nfprintf('%d\\n',round(d));\n",WRONG_ANSWER,28,6508 1510296653437427712,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:42:36,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d\\n',round(a));\nb=[2 8 6];\nfprintf('%d\\n',round(b));\nc=[5 1 9];\nfprintf('%d\\n',round(c));\nd=[7 3 2];\nfprintf('%d\\n',round(d));\n",PRESENTATION_ERROR,25,6384 1510300143114403840,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:56:28,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d ',round(a));\nend;\nprintf（\""/n\"");\nend;\nb=[2 8 6];\nfprintf('%d ',round(b));\nend;\nprintf（\""/n\"");\nend;\nc=[5 1 9];\nfprintf('%d ',round(c));\nend;\nprintf（\""/n\"");\nend;\nd=[7 3 2];\nfprintf('%d ',round(d));\nend;\nprintf（\""/n\"");\nend;\n",WRONG_ANSWER,25,6504 1510300318059552768,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:57:10,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d ',round(a));\nend;\nprintf（\""\\n\"");\nend;\nb=[2 8 6];\nfprintf('%d ',round(b));\nend\nprintf（\""\\n\"");\nend\nc=[5 1 9];\nfprintf('%d ',round(c));\nend\nprintf（\""\\n\"");\nend\nd=[7 3 2];\nfprintf('%d ',round(d));\nend\nprintf（\""\\n\"");\nend\n",WRONG_ANSWER,25,6764 1510300379019567104,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:57:25,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d ',round(a));\n\nprintf（\""\\n\"");\n\nb=[2 8 6];\nfprintf('%d ',round(b));\n\nprintf（\""\\n\"");\n\nc=[5 1 9];\nfprintf('%d ',round(c));\n\nprintf（\""\\n\"");\n\nd=[7 3 2];\nfprintf('%d ',round(d));\n\nprintf（\""\\n\"");\n\n",WRONG_ANSWER,25,6380 1510300403492601856,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:57:30,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d ',round(a));\n\nprintf（\""\\n\"");\n\nb=[2 8 6];\nfprintf('%d ',round(b));\n\nprintf（\""\\n\"");\n\nc=[5 1 9];\nfprintf('%d ',round(c));\n\nprintf（\""\\n\"");\n\nd=[7 3 2];\nfprintf('%d ',round(d));\n\nprintf（\""\\n\"");\n\n",WRONG_ANSWER,25,6508 1510300593468862464,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:58:16,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d ',round(a));\n\nfprintf（\"" \\n\"");\n\nb=[2 8 6];\nfprintf('%d ',round(b));\n\nfprintf（\""\\n\"");\n\nc=[5 1 9];\nfprintf('%d ',round(c));\n\nfprintf（\""\\n\"");\n\nd=[7 3 2];\nfprintf('%d ',round(d));\n\n",WRONG_ANSWER,24,6380 1510301024996179968,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 00:59:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d ',round(a));\nfprintf('\\n')\nb=[2 8 6];\nfprintf('%d ',round(b));\nfprintf('\\n')\nc=[5 1 9];\nfprintf('%d ',round(c));\nfprintf('\\n')\nd=[7 3 2];\nfprintf('%d ',round(d));\nfprintf('\\n')\n",PRESENTATION_ERROR,25,6496 1510301083641667584,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:00:13,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d',round(a));\nfprintf('\\n')\nb=[2 8 6];\nfprintf('%d',round(b));\nfprintf('\\n')\nc=[5 1 9];\nfprintf('%d',round(c));\nfprintf('\\n')\nd=[7 3 2];\nfprintf('%d',round(d));\nfprintf('\\n')\n",PRESENTATION_ERROR,26,6748 1510301924779974656,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:03:33,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7 5];\nfprintf('%d',round(a));\nfprintf('\\n');\nb=[2 8 6];\nfprintf(' %d',round(b));\nfprintf('\\n');\nc=[5 1 9];\nfprintf(' %d',round(c));\nfprintf('\\n');\nd=[7 3 2];\nfprintf(' %d',round(d));\nfprintf('\\n');\n",PRESENTATION_ERROR,25,6500 1510302895140593664,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-04-03 01:07:24,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\n fprintf('%.2f ',x);",ACCEPTED,25,6516 1510303219879112704,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:08:42,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7];\ne=[5];\nfprintf('%d ',a);\nfprintf('%d',e);\nfprintf('\\n');\nb=[2 8];\nf=[6];\nfprintf('%d ',b);\nfprintf('%d',f);\nfprintf('\\n');\nc=[5 1];\ng=[9];\nfprintf('%d ',c);\nfprintf('%d',g);\nfprintf('\\n');\nd=[7 3];\nk=[2];\nfprintf('%d ',d);\nfprintf('%d',k);\nfprintf('\\n');\n",ACCEPTED,24,6496 1510303915212103680,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:11:28,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 2 5 7 7 8 1 3 5 6 9 2];\nfprintf(\""%d \"")",WRONG_ANSWER,24,6636 1510303945863348224,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:11:35,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4 2 5 7 7 8 1 3 5 6 9 2];\nfprintf(\""%d \"",a)",ACCEPTED,24,6644 1510304061559758848,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:12:03,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"a=[1 8 0 125 216 343 0 27]\nfprintf(\""%d \"",a)",WRONG_ANSWER,24,6752 1510304115179012096,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:12:15,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"a=[1 8 0 125 216 343 0 27];\nfprintf(\""%d \"",a);",ACCEPTED,24,6640 1510304220976136192,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 01:12:41,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",new_v(i,j));\n if(j~=3)\n fprintf(\"" \"");\n end\n end\n if(i~=4)\n fprintf(\""\\n\"");\n end\nend",WRONG_ANSWER,26,6508 1510304301423616000,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:13:00,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf(\""%d \"",a);",ACCEPTED,24,6632 1510304562757386240,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:14:02,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28];\nfprintf(\""%f \"",a);",WRONG_ANSWER,25,6760 1510304895450308608,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:15:21,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28];\nfprintf(\""%3.2f \"",a);",ACCEPTED,24,6764 1510305060210958336,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 01:16:01,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ];\nfprintf(\""%d \"",a);",ACCEPTED,25,6504 1510425661817614336,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:15:14,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nzeros(4,3);\nfor i=1:4;\nd(i,1)=a(i);\nend\nfor i=1:4;\nd(i,2)=b(i);\nend\nfor i=1:4;\nd(i,3)=c(i);\nend\nfor i=1:4\n forj=1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n if(j==3)\n fprintf(\""/n\"");\n end\n end\n end",WRONG_ANSWER,27,6880 1510425694551236608,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:15:22,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nzeros(4,3);\nfor i=1:4;\nd(i,1)=a(i);\nend\nfor i=1:4;\nd(i,2)=b(i);\nend\nfor i=1:4;\nd(i,3)=c(i);\nend\nfor i=1:4\n forj=1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n if(j==3)\n fprintf(\""/n\"");\n end\n end\n end",WRONG_ANSWER,24,6504 1510425916801937408,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:16:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i=1:4;\nd(i,1)=a(i);\nend\nfor i=1:4;\nd(i,2)=b(i);\nend\nfor i=1:4;\nd(i,3)=c(i);\nend\nfor i=1:4\n forj=1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n if(j==3)\n fprintf(\""/n\"");\n end\n end\n end",WRONG_ANSWER,27,6892 1510426277953028096,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:17:41,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*PI,20);\nfprint(\""%2f\"",a)\n ",WRONG_ANSWER,29,6500 1510426305505411072,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:17:48,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*PI,20);\nfprint(\""%2f\"",a')\n ",WRONG_ANSWER,24,6380 1510426350691377152,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:17:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i=1:4\nd(i,1)=a(i);\nend\nfor i=1:4\nd(i,2)=b(i);\nend\nfor i=1:4\nd(i,3)=c(i);\nend\nfor i=1:4\n forj=1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n if(j==3)\n fprintf(\""/n\"");\n end\n end\nend",WRONG_ANSWER,25,6764 1510426467409739776,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:18:26,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprint(\""%2f\"",a')\n ",WRONG_ANSWER,27,6760 1510426492709781504,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:18:32,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprint(\""%2f\"",a)\n ",WRONG_ANSWER,24,6384 1510426519280697344,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:18:39,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprint(\""%f\"",a)\n ",WRONG_ANSWER,29,10500 1510426541486071808,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:18:44,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i=1:4\nd(i,1)=a(i);\nend\nfor i=1:4\nd(i,2)=b(i);\nend\nfor i=1:4\nd(i,3)=c(i);\nend\nfor i=1:4\n forj=1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""/n\"");\n end\n end\nend",WRONG_ANSWER,26,6500 1510426549328146432,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:18:46,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprint(\""%f\"",a)\n ",WRONG_ANSWER,26,6492 1510426611786072064,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:19:01,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i=1:4\nd(i,1)=a(i);\nend\nfor i=1:4\nd(i,2)=b(i);\nend\nfor i=1:4\nd(i,3)=c(i);\nend\nfor i=1:4\n forj=1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend",WRONG_ANSWER,26,6508 1510426838470881280,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:19:55,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i=1:4\nd(i,1)=a(i);\nend\nfor i=1:4\nd(i,2)=b(i);\nend\nfor i=1:4\nd(i,3)=c(i);\nend\nfor i=1:4\n forj=1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend",WRONG_ANSWER,25,6508 1510426973516161024,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:20:27,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprint(\""%f\\n\"",a)\n ",WRONG_ANSWER,25,6888 1510427045405257728,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:20:44,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf(\""%f\\n\"",a)\n ",WRONG_ANSWER,26,6492 1510427222673321984,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:21:26,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf(\""%f \"",a)\n ",WRONG_ANSWER,25,6508 1510427570374008832,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:22:49,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 1:4\n d(i,2)=b(i);\nend\nfor i = 1:4\n d(i,3)=c(i);\nend\nfor i = 1:4\n for j = 1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend",ACCEPTED,24,6508 1510427868092821504,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 09:24:00,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7];\n>> b=[7,1;8,3];\n>> c=[5,9;6,2];\n>> a1=a';\n>> A=a1(:);\n>> B=b(:);\n>> C=c(:);\n>> D=[A B];\n>> new_v=[D C]",WRONG_ANSWER,25,6628 1510428120430538752,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:25:00,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf(\""%.2f \"",a)\n ",WRONG_ANSWER,28,6500 1510428227339153408,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:25:26,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf(\""%.2f \"",theta)\n ",ACCEPTED,24,6760 1510428789577760768,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:27:40,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeroes=zeros(15);\na=myZeroes(1:);\nfprintf(\""%d \"",a)",WRONG_ANSWER,23,6636 1510429228088049664,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:29:25,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(15);\na=myZeros(1,:);\nfprintf(\""%d \"",a)",ACCEPTED,24,6504 1510429366692474880,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:29:58,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(1,12);\nfor i=1:4\nd(i)=a(i);\nend\nfor i=5:8\nd(i)=b(i-4);\nend \nfor i=9:12\nd(i)=c(i-8);\nend\nfor i=1:12\nfprintf(\""%d\"",d(i));\nif(i!=12)\nfprintf(\"" \"");\nend\nend\n",PRESENTATION_ERROR,24,6748 1510429524608565248,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 09:30:35,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7];\n>> b=[7,1;8,3];\n>> c=[5,9;6,2];\n>> a1=a';\n>> A=a1(:);\n>> B=b(:);\n>> C=c(:);\n>> D=[A B];\n>> new_v=[D C]\ndisp(new_v)",WRONG_ANSWER,25,6628 1510429555403874304,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:30:43,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(1,12);\nfor i=1:4\nd(i)=a(i);\nend\nfor i=5:8\nd(i)=b(i-4);\nend \nfor i=9:12\nd(i)=c(i-8);\nend\nfor i=1:12\nfprintf(\""%d\"",d(i));\nfprintf(\"" \"");\nend\n",ACCEPTED,28,6756 1510430054521856000,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 09:32:42,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nnew_v=[D C];\ndisp(new_v)",PRESENTATION_ERROR,26,6896 1510430089678512128,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 09:32:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nnew_v=[D C];",WRONG_ANSWER,25,6784 1510430121881649152,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 09:32:58,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nnew_v=[D C];\ndisp(new_v)",PRESENTATION_ERROR,29,6748 1510430253956816896,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-04-03 09:33:29,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,[4,1]);\nB=reshape(b,[4,1]);\nC=reshape(c,[4,1]);\nD=[A;B;C];\nnew_v=reshape(D,[4,3]);\nfprintf('%d',new_v(1,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(1,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(1,3));\nfprintf('%d',new_v(2,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(2,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(2,3));\nfprintf('%d',new_v(3,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(3,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(3,3));\nfprintf('%d',new_v(4,1));\nfprintf('%c',' ');\nfprintf('%d',new_v(4,2));\nfprintf('%c',' ');\nfprintf('%d\\n',new_v(4,3));",ACCEPTED,24,6768 1510430276979351552,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:33:35,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"B=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end\nend\nfprintf(\""%d \"",B)\n \n ",WRONG_ANSWER,26,6512 1510430362169131008,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:33:55,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end\nend\nfprintf(\""%d \"",B)\n \n ",WRONG_ANSWER,25,6504 1510430502372859904,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:34:28,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end\nend\nfprintf(\""%d \"",B)\n \n ",WRONG_ANSWER,27,6604 1510430526456553472,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:34:34,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end\nend\nfprintf(\""%d \"",B')\n \n ",WRONG_ANSWER,29,6752 1510431062919888896,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:36:42,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end\nend\nfprintf(\""%d \"",B(1,1:7),\""%d\"",B(1,8))\n \n ",WRONG_ANSWER,24,6760 1510431210644004864,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:37:17,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end\nend\nfprintf(\""%d \"",B(1,1:7))\nfprintf(\""%d\"",B(1,8))\n \n ",WRONG_ANSWER,26,6504 1510431749900746752,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:39:26,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end;\nend;\nfprintf(\""%d \"",B(1,1:7))\nfprintf(\""%d\"",B(1,8))\n \n ",WRONG_ANSWER,30,6636 1510431810303647744,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:39:40,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end;\nend;\nfprintf(\""%d \"",B(1,1:7))\nfprintf(\""%d\"",B(1,8))\n \n ",WRONG_ANSWER,26,6516 1510432239933865984,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:41:23,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8\n if A(1,i)<0\n B(1,i)=0\n end;\nend;\nfprintf(\""%d \"",B(1,1:7))\nfprintf(\""%d\"",B(1,8))\n \n ",WRONG_ANSWER,25,6508 1510432481323905024,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-03 09:42:20,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"x=[6:2:33];\nfprintf('%d %d ',x)",ACCEPTED,26,6612 1510432481802600448,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 09:42:20,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=a(:);B=b(:);C=c(:);\nD=[A;B];\nE=[D;C];\nnew_v1=E'",WRONG_ANSWER,24,6512 1510432805800730624,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 09:43:38,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA=a(:);B=b(:);C=c(:);\nD=[A;B];\nE=[D;C];\nnew_v1=E';\nfprintf('%d ',new_v1);",ACCEPTED,26,6620 1510433618123440128,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:46:51,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:7))\nfprintf(\""%d\"",B(1,8))\n \n ",PRESENTATION_ERROR,23,6380 1510433849057624064,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:47:46,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))\n \n ",ACCEPTED,27,6760 1510433863084105728,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:47:50,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nl=length(A);\nB=zeros(1,50);\nfor i=1:l\nif(A(i)>0)\nB(i)=A(i)*A(i)*A(i);\nend \nend \nfor i=1:l\nfprintf(\""%d\"",B(i));\nfprintf(\"" \"");\nend\n",ACCEPTED,29,6792 1510434304970080256,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-03 09:49:35,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nfor i=1:length(B);\nif B(i)<0\nB(i)=0;\nend\nend\nfprintf('%d ',B)",ACCEPTED,25,6384 1510434629398949888,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-03 09:50:52,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152," x=linspace(0,2*3.14159,20);\n fprintf('%4.2f ',x)",ACCEPTED,29,6488 1510434988611727360,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:52:18,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=zeros(1,100);\nfor i=1:14\nA(i)=(i+2)*2;\nend\nfor i=1:14\nfprintf(\""%d\"",A(i));\nfprintf(\"" \"");\nend\n",ACCEPTED,25,6500 1510435385348022272,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-03 09:53:53,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros)",ACCEPTED,25,6760 1510435713157316608,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:55:11,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\nfprintf(\""%d\"",A(i));\nfprintf(\"" \"");\nend",WRONG_ANSWER,26,6492 1510435852692877312,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:55:44,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfor i=1:20\nfprintf(\""%.2f\"",A(i));\nfprintf(\"" \"");\nend",ACCEPTED,27,6508 1510436142687055872,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:56:53,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(8)\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))\n \n ",WRONG_ANSWER,23,6384 1510436338787545088,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-04-03 09:57:40,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(1,15);\nfor i=1:15\nfprintf(\""%d\"", A(i));\nfprintf(\"" \"");\nend",ACCEPTED,25,6748 1510436662877220864,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:58:57,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))\n \n ",WRONG_ANSWER,25,6764 1510436757685268480,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:59:20,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))\n \n ",WRONG_ANSWER,24,6760 1510436840233910272,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 09:59:39,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))\n \n ",WRONG_ANSWER,26,6784 1510437221503987712,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:01:10,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A=[1 2 -1 5 6 7 -4 3];\nB=[0 0 0 0 0 0 0 0];\nfor i=1:8\n if A(i)>0\n B(i)=A(i)^3;\n else\n B(i)=0;\n end\nend\n,WRONG_ANSWER,29,6752 1510437248126509056,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 10:01:17,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=;\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))\n \n ",WRONG_ANSWER,24,6380 1510437313410121728,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:01:32,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=[0 0 0 0 0 0 0 0];\nfor i=1:8\n if A(i)>0\n B(i)=A(i)^3;\n else\n B(i)=0;\n end\nend\nfprintf('%d ',B);",ACCEPTED,27,6504 1510437688284430336,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-04-03 10:03:02,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1',b1',c1'];\nfor i=1:12\n fprintf('%d ',new(i))\nend",ACCEPTED,24,6760 1510437796203872256,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-04-03 10:03:27,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('')\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))\n \n ",WRONG_ANSWER,25,6760 1510438032746569728,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:04:24,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,A=[0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nj=1;\nfor i=6:33\n if i%2=0\n A(j)=i;\n j=j+1;\n end\nend,WRONG_ANSWER,24,6628 1510438097796030464,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:04:39,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nj=1;\nfor i=6:33\n if i%2=0\n A(j)=i;\n j=j+1;\n end\nend\nfprintf('%d ',A);",WRONG_ANSWER,24,6760 1510438579091140608,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:06:34,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nj=1;\nfor i=6:33\n if mod(i,2)==0\n A(j)=i;\n j=j+1;\n end\nend\nfprintf('%d ',A);",ACCEPTED,24,6380 1510438653595107328,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:06:52,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"j=1;\nfor i=6:33\n if mod(i,2)==0\n A(j)=i;\n j=j+1;\n end\nend\nfprintf('%d ',A);",ACCEPTED,25,6384 1510438675162947584,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:06:57,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:33\n if mod(i,2)==0\n A(j)=i;\n j=j+1;\n end\nend\nfprintf('%d ',A);",WRONG_ANSWER,24,6380 1510438728118956032,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:07:10,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:33\n if mod(i,2)==0\n A(j+1)=i;\n j=j+1;\n end\nend\nfprintf('%d ',A);",WRONG_ANSWER,24,6748 1510438790224015360,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:07:24,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"j=1;\nfor i=6:33\n if mod(i,2)==0\n A(j)=i;\n j=j+1;\n end\nend\nfprintf('%d ',A);",ACCEPTED,24,6508 1510439283546013696,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:09:22,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=0.33:0.33:6.28;\nfprintf('%d ',A);",WRONG_ANSWER,25,6640 1510439304748220416,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:09:27,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=0.33:0.33:6.28;\nfprintf('%d ',A)",WRONG_ANSWER,25,6496 1510439370536607744,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:09:43,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=0:0.33:6.28;\nfprintf('%.2f ',A)",WRONG_ANSWER,24,6380 1510439487930253312,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:10:11,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\n\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',d);",WRONG_ANSWER,25,6756 1510439528912797696,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:10:20,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\n\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d',a);",WRONG_ANSWER,25,6752 1510439765677793280,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:11:17,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\n\nfprintf('%d',round(a);",WRONG_ANSWER,23,6756 1510439766389551104,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:11:17,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=0.00:(pi/10):(2*pi);\nfprintf('%.2f ',A)",WRONG_ANSWER,26,6528 1510439809386635264,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:11:27,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\n\nfprintf('%d',a;",WRONG_ANSWER,23,6372 1510439851072548864,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:11:37,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\n\nfprintf('%d',a);",WRONG_ANSWER,26,6384 1510439952039108608,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:12:01,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,a=[4 5;2 7]\nb=[7 1;8 3]\nc=[5 9;6 2]\nnew_v=[a1 b1 c1;a2 b2;c2;a3 b3 c3;a4 b4; c4]\nprint(new_v),WRONG_ANSWER,26,6512 1510440041113542656,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:12:23,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=0.00:(2*pi/19):(2*pi)\nfprintf('%.2f ',A)",WRONG_ANSWER,25,6496 1510440098822971392,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:12:36,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=0.00:(2*pi/19):(2*pi);\nfprintf('%.2f ',A)",ACCEPTED,25,6624 1510440154577125376,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:12:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,7,5;2,8,6;5,1,9;7,3,2];\n\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d',a);",WRONG_ANSWER,24,6752 1510440253834784768,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:13:13,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 5;2 7]\nb=[7 1;8 3]\nc=[5 9;6 2]\nnew_v=[a1 b1 c1;a2 b2;c2;a3 b3 c3;a4 b4; c4]\nfprintf('%d',new_v)",WRONG_ANSWER,24,6380 1510440430155481088,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-04-03 10:13:55,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:8\n if B(i)<0 B(i)=0;\n end\nend\nfor j=1:8\n fprintf('%d ',B(j))\nend\n",ACCEPTED,23,6384 1510440558957817856,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:14:26,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros=zeros(1,15);\nfprintf('%d ',myzeros)",ACCEPTED,25,6744 1510441156776706048,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-04-03 10:16:49,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6:2:32];\nfor i=1:14\n fprintf('%d ',a(i))\nend",ACCEPTED,30,6496 1510441330118356992,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:17:30,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nnew_v=[D C];\nmyzeros=zeros(1,15);\nfor i=1:3\n fprintf('%d ',new_v(i));\nend\nfor i=4:6\n fprintf('%d ',new_v(i));\nend\nfor i=7:9\n fprintf('%d ',new_v(i));\nend\nfor i=10:12\n fprintf('%d ',new_v(i));\nend",WRONG_ANSWER,24,6764 1510441433382121472,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:17:55,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nnew_v=[D C];\nfor i=1:3\n fprintf('%d ',new_v(i));\nend\nfor i=4:6\n fprintf('%d ',new_v(i));\nend\nfor i=7:9\n fprintf('%d ',new_v(i));\nend\nfor i=10:12\n fprintf('%d ',new_v(i));\nend",WRONG_ANSWER,24,6512 1510441549741776896,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:18:22,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nE=[D C];\nnew_v=E'\nfor i=1:3\n fprintf('%d ',new_v(i));\nend\nfor i=4:6\n fprintf('%d ',new_v(i));\nend\nfor i=7:9\n fprintf('%d ',new_v(i));\nend\nfor i=10:12\n fprintf('%d ',new_v(i));\nend",WRONG_ANSWER,25,6760 1510441950092288000,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:19:58,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nE=[D C];\nnew_v=E';\nfor i=1:2\n fprintf('%d ',new_v(i));\nend\nfprintf('%d\\n',new_v(3));\nfor i=4:6\n fprintf('%d ',new_v(i));\nend\nfor i=7:9\n fprintf('%d ',new_v(i));\nend\nfor i=10:12\n fprintf('%d ',new_v(i));\nend",PRESENTATION_ERROR,24,6760 1510442069796995072,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:20:26,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nE=[D C];\nnew_v=E';\nfor i=1:2\n fprintf('%d ',new_v(i));\nend\nfprintf('%d\\n',new_v(3));\nfor i=4:5\n fprintf('%d ',new_v(i));\nend\nfprintf('%d\\n',new_v(6));\nfor i=7:8\n fprintf('%d ',new_v(i));\nend\nfprintf('%d\\n',new_v(9));\nfor i=10:12\n fprintf('%d ',new_v(i));\nend",PRESENTATION_ERROR,24,6760 1510442182426640384,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:20:53,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d %d\\n',new_v)",WRONG_ANSWER,28,6744 1510442191805104128,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-04-03 10:20:55,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nD=[A B];\nE=[D C];\nnew_v=E';\nfor i=1:2\n fprintf('%d ',new_v(i));\nend\nfprintf('%d\\n',new_v(3));\nfor i=4:5\n fprintf('%d ',new_v(i));\nend\nfprintf('%d\\n',new_v(6));\nfor i=7:8\n fprintf('%d ',new_v(i));\nend\nfprintf('%d\\n',new_v(9));\nfor i=10:11\n fprintf('%d ',new_v(i));\nend\nfprintf('%d',new_v(12));",ACCEPTED,30,6496 1510442284100218880,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:21:17,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,8,9;7,6,7;5,5,3;2,1,2];\n\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d\\n',a);",ACCEPTED,29,6748 1510442776591200256,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-04-03 10:23:15,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[0:pi*2/19:pi*2];\nfor i=1:20\n fprintf('%.2f ',a(i))\nend",ACCEPTED,24,6760 1510443230796574720,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:25:03,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)]';\nfprintf('%d %d %d\\n',new_v)",ACCEPTED,24,6376 1510443459478417408,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:25:58,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf('%d ',B(1,1:8))",ACCEPTED,24,6860 1510443681567358976,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:26:51,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)];\nfprintf('%d ',new_v)",ACCEPTED,25,6640 1510443846440710144,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:27:30,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3；\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\n end;\nfprintf(\""%d\"",B(1,1:8))",WRONG_ANSWER,30,6648 1510443860643168256,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-03 10:27:33,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=zeros(1,14);\nfor i=1:14\nA(i)=2*i+4;\nend\nfor k=1:14\nfprintf(\""%d\"",A(1,k));\nfprintf(\"" \"");\nend",ACCEPTED,26,6512 1510444090265264128,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-04-03 10:28:28,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfor i=1:15\n fprintf('%d ',a(i))\nend",ACCEPTED,26,6640 1510444590129102848,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:30:27,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0]\nfprintf('&d ',myZeros)",WRONG_ANSWER,25,6976 1510445647933300736,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:34:39,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:);b(:);c(:)];\nfprintf(\""%d\"",new')\n",PRESENTATION_ERROR,27,6508 1510446008294588416,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:36:05,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:);b(:);c(:)];\nfprintf(\""%d\"",new');\n",PRESENTATION_ERROR,25,6748 1510446048018296832,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:36:15,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=[0 0 0 0 0];\nmyZeros=[a(:),a(:),a(:)];\nfprintf('%d ',myZeros);",ACCEPTED,24,6384 1510446496331218944,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:38:02,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.^3;\nfor i=1:length(A)\n if A(i)<0\n B(i)=0;\n end\nend\nfprintf('%d',B)",WRONG_ANSWER,24,6796 1510446652393611264,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:38:39,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.^3;\nfor i=1:length(A)\n if A(i)<0\n B(i)=0;\n end\nend\nfprintf('%d ',B)",WRONG_ANSWER,26,6376 1510446668138299392,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:38:43,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.^3;\nfor i=1:length(A)\n if A(i)<0\n B(i)=0;\n end\nend\nfprintf('%d ',B)",WRONG_ANSWER,27,6876 1510446774765350912,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:39:08,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfprintf(\""%d \"",a(:)',b(:)',c(:)');\n",ACCEPTED,26,6504 1510446987995377664,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:39:59,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:length(A)\n if A(i)<0\n B(i)=0;\n end\nend\nfprintf('%d ',B)\n",ACCEPTED,25,6508 1510448013016166400,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:44:03,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%8.2f ',a)",PRESENTATION_ERROR,23,6756 1510448161562181632,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:44:39,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%8.2f',a)",PRESENTATION_ERROR,25,6372 1510448318646710272,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:45:16,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%8.2f',a);",PRESENTATION_ERROR,26,6384 1510448465007493120,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:45:51,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<=0;\n B(1,i)=0;\n end;\n end;\nfprintf(\""%d\"",B(1,1:8))",PRESENTATION_ERROR,26,6524 1510448548898496512,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:46:11,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<=0;\n B(1,i)=0;\n end;\n end;\nfprintf(\""%d \"",B(1,1:8))",ACCEPTED,25,6508 1510448623727800320,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:46:29,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4 5; 2 7];\nb = [7 1; 8 3];\nc = [5 9; 6 2];\nnew_v = [a(:), b(:), c(:)];\nfprintf(\""%d %d %d\\n\"", transpose(new_v));\nclear;",ACCEPTED,24,6644 1510448754671050752,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:47:00,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfprintf('%d ',A)",ACCEPTED,27,6748 1510448781799079936,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:47:07,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%8.2f',theta);",PRESENTATION_ERROR,24,6628 1510448814283964416,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:47:14,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%8.2f ',theta);",PRESENTATION_ERROR,25,6508 1510448831967879168,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:47:18,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4 5; 2 7];\nb = [7 1; 8 3];\nc = [5 9; 6 2];\n\nnew_v = [a(:); b(:); c(:)];\nnew_h = transpose(new_v);\n\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,26,6480 1510448950226280448,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:47:47,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nB = A .^ 3;\nlogical_neg = B < 0;\nB(logical_neg) = 0;\nfprintf(\""%d \"", B);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,25,6508 1510448960542994432,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:47:49,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33]\nfprintf(\""%d \"",A\n",WRONG_ANSWER,25,6636 1510449017728135168,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:48:03,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a = [6:2:33];\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,28,6612 1510449076037349376,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:48:17,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = linspace(0, 2*pi, 20);\nfprintf(\""%.2f \"", a);\nfprintf(\""\\n\"");\nclear;\n",ACCEPTED,24,6380 1510449147248787456,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-04-03 10:48:34,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a(15) = 0;\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,7492 1510449236402368512,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:48:55,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"Pi=3.14159\ntheta=linspace(0,2Pi,20)\nfprintf('%4.2f',theta)",WRONG_ANSWER,26,6500 1510449242337853440,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:48:56,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33]\nfprintf(\""%d \"",A)\n",WRONG_ANSWER,32,6760 1510449286746599424,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:49:07,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33];\nfprintf(\""%d \"",A);\n",ACCEPTED,29,6496 1510449733201444864,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:50:53,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.14;\ntheta=linspace(0,2*pi,20);",WRONG_ANSWER,25,6536 1510449807515578368,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:51:11,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%4.2f ',theta);",ACCEPTED,24,6636 1510449826617712640,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-03 10:51:16,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=[];\nfor i=1:19\nA[i+1]=roundn(6.28/(20-i),-2);\nend\nfor k=2:20\nfprintf(\""%d\"",A(1,k));\nfprintf(\"" \"");\nend\n",WRONG_ANSWER,25,6760 1510449974277455872,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:51:51,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.14;\ntheta=linspace(0,2*pi,20);\nfprintf(\""%d \"",theta)",WRONG_ANSWER,24,6380 1510450192511287296,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:52:43,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,6.28318,20);\nfprintf('%4.2f ',theta)",ACCEPTED,25,6384 1510450311238905856,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-04-03 10:53:11,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=linspace(6,32,14);\nfprintf('%d ',a);",ACCEPTED,26,6500 1510450459584323584,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-04-03 10:53:47,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A;\nfor i=1:length(A);\n x=A(i);\n if A(i)<=0;\n B(i)=0;\n else\n B(i)=x*x*x;\n end\nend\nfprintf('%d ',B)",ACCEPTED,28,6500 1510450582083166208,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-04-03 10:54:16,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"X = zeros([1 15]);\nfprintf('%d ',X);",ACCEPTED,24,6632 1510450642232950784,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:54:30,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(15);\nfprints('%d ',myZeros)",WRONG_ANSWER,25,6392 1510450729767530496,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:54:51,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprints('%d ',myZeros)",WRONG_ANSWER,25,6636 1510450778572996608,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:55:03,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(15);\nfprintf('%d ',myZeros)",WRONG_ANSWER,26,6728 1510450952317845504,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-04-03 10:55:44,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros)",ACCEPTED,30,6492 1510451029778980864,a6de37df55e6b27e41225d72391fe6a3bbb776ced56224dd09dd3f46942db33b,2022-04-03 10:56:02,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new = [a(:) b(:) c(:)]\nfprintf(,new)",WRONG_ANSWER,27,6748 1510451030088630272,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:56:03,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"\ntheta=linspace(0,2*pi,20);\nfprintf(\""%d \"",roundn(theta,2));",WRONG_ANSWER,24,6500 1510451935215239168,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 10:59:38,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\ndigits(3);\nb=vpa(theta);\nfprintf(\""%d \"",b);",WRONG_ANSWER,27,6516 1510452232636985344,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-04-03 11:00:49,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\nfprintf(\""%3.2f \"",x);",ACCEPTED,25,6760 1510453520502222848,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-04-03 11:05:56,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:32;\nfprintf(\""%d \"",a);",ACCEPTED,26,6508 1510453737117052928,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 11:06:48,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nB=theta;\nfor i=0:2*pi/20:2*pi;\n roundn(B(),-2);\n end;\nfprintf(\""%d \"",B())",WRONG_ANSWER,27,6508 1510453991472230400,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-03 11:07:49,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfprintf('%.2f ',A)\n",ACCEPTED,23,6748 1510454057134059520,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 11:08:04,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nB=theta;\nfprintf(\""%d \"",round(B,-2))",WRONG_ANSWER,25,6752 1510454165951082496,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 11:08:30,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*3.14,20);\nfprintf(\""%d \"",theta)",WRONG_ANSWER,25,6384 1510454408773197824,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-04-03 11:09:28,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if B(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf('%d ',B)\n",ACCEPTED,26,6440 1510454528108806144,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 11:09:57,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf(\""%d \"",myZeros)",ACCEPTED,24,6756 1510458589202440192,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 11:26:05,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\na1=a(:)\nb1=b(:)\nc1=c(:)\nnew=[a1,b1,c1]\nfprintf(new)",WRONG_ANSWER,27,6752 1510458786266345472,a6de37df55e6b27e41225d72391fe6a3bbb776ced56224dd09dd3f46942db33b,2022-04-03 11:26:52,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:);b(:);c(:)];\nnew_v=reshape(new,4,3);\nfor i=1:4\n for j=1:3\n fprintf('%d',new_v(i,j));\n if(j==3)\n fprintf(\""\\n\"");\n else\n fprintf(\"" \"");\n end\n end\nend\n\n",ACCEPTED,31,6748 1510459258624667648,a6de37df55e6b27e41225d72391fe6a3bbb776ced56224dd09dd3f46942db33b,2022-04-03 11:28:44,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:);b(:);c(:)];\nfprintf('%d ',new);",ACCEPTED,29,6568 1510460087377739776,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 11:32:02,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:),b(:),c(:)];\nfprintf(\""%d%d%d\\n\"",v);",WRONG_ANSWER,26,6740 1510461316149428224,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 11:36:55,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2]\na1=reshape(a,4,1)\n b1=reshape(b,4,1)\n c1=reshape(c,4,1)\n new=[a1b1c1]",WRONG_ANSWER,24,6508 1510461577211297792,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 11:37:57,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:),b(:),c(:)];\ndisp(v);",PRESENTATION_ERROR,27,6504 1510461925473476608,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 11:39:20,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:),b(:),c(:)];\nfprintf(\""%d %d %d\\n\"",transpose(v);",WRONG_ANSWER,24,6504 1510463033343623168,a6de37df55e6b27e41225d72391fe6a3bbb776ced56224dd09dd3f46942db33b,2022-04-03 11:43:44,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=[];\nL=numel(A);\nfor i=1:L\n if A(i)>0\n B(i)=A(i).^3;\n else\n B(i)=0;\n end\nend\nfprintf('%d ',B);\n",ACCEPTED,24,6508 1510463350013575168,a6de37df55e6b27e41225d72391fe6a3bbb776ced56224dd09dd3f46942db33b,2022-04-03 11:45:00,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfprintf('%d ',A);",ACCEPTED,25,6508 1510463991326306304,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 11:47:33,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2]\na1=reshape(a,4,1)\n b1=reshape(b,4,1)\n c1=reshape(c,4,1)\n new=[a1b1c1]",WRONG_ANSWER,26,6752 1510464479749357568,a6de37df55e6b27e41225d72391fe6a3bbb776ced56224dd09dd3f46942db33b,2022-04-03 11:49:29,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a);",ACCEPTED,27,6516 1510464538289987584,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 11:49:43,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7],b=[7,1;8,3],c=[5,9;6,2];\na1=reshape(a,4,1);\n b1=reshape(b,4,1);\n c1=reshape(c,4,1);\n new=[a1 b1 c1];\n fprintf(new)",WRONG_ANSWER,25,6508 1510464771157016576,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 11:50:39,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\na1=reshape(a,4,1);\nb1=reshape(b,4,1);\nc1=reshape(c,4,1);\nnew=[a1 b1 c1];\nfprintf(new)",WRONG_ANSWER,25,6380 1510464863423315968,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 11:51:01,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,4,1);\nb1=reshape(b,4,1);\nc1=reshape(c,4,1);\nnew=[a1 b1 c1];\nfprintf(new)",WRONG_ANSWER,28,6756 1510464981149769728,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-04-03 11:51:29,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"A=[4 5; 2 7];\nB=[7 1; 8 3];\nC=[5 9; 6 2];\nNEW(4,3)=zeros();\nfor i=1:4\n for j=1:3\n if(j==1)\n NEW(i,j)=A(i);\n end\n if(j==2)\n NEW(i,j)=B(i);\n end\n if(j==3)\n NEW(i,j)=C(i);\n end\n end\nend\nfor i=1:4\n for j=1:3\n if(i==4)\n if(j~=3)\n fprintf('%d',NEW(i,j))\n fprintf('%c',\"" \"")\n else\n fprintf('%d',NEW(i,j))\n end\n else\n if(j~=3&&i~=4)\n fprintf('%d',NEW(i,j))\n fprintf('%c',\"" \"")\n else\n fprintf('%d',NEW(i,j))\n fprintf('%c\\n','')\n end\n end\n end\nend",ACCEPTED,24,6500 1510464995077779456,a6de37df55e6b27e41225d72391fe6a3bbb776ced56224dd09dd3f46942db33b,2022-04-03 11:51:32,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros);",ACCEPTED,26,6384 1510465200855072768,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 11:52:21,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,4,1);\nb1=reshape(b,4,1);\nc1=reshape(c,4,1);\nnew=[a1 b1 c1];\nfprintf('%d',new)",WRONG_ANSWER,24,6632 1510466300903026688,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 11:56:43,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1,b1,c1];\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",new(i,j));\n if(j<3)\n fprintf(\"" \"");\n end\n end\n fprintf(\""\\n\"");\nend\n\n\n\n\n",ACCEPTED,26,6500 1510466463424462848,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-04-03 11:57:22,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nA=[a(:,1);a(:,2)]\nB=[b(:,1);b(:,2)]\nC=[c(:,1);c(:,2)]\nnew=[A B C]\ndisp(new)",WRONG_ANSWER,24,6508 1510466611403157504,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 11:57:57,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:),b(:),c(:)];\nfprintf(\""%d %d %d\\n\"",transpose(v));\nclear;",ACCEPTED,25,6764 1510467180554706944,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 12:00:13,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,4,1);\nb1=reshape(b,4,1);\nc1=reshape(c,4,1);\nnew=[a1 b1 c1];\nfprintf('%d %d %d\\n',new')",ACCEPTED,24,6384 1510468066843967488,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 12:03:44,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=reshape(a,1,4);\nb1=reshape(b,1,4);\nc1=reshape(c,1,4);\nnew=[a1 b1 c1];\nfprintf('%d ',new)",ACCEPTED,25,6544 1510468530306170880,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 12:05:35,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1,b1,c1];\nfor i=1:3\n for j=1:4\n fprintf(\""%d\"",new(j,i));\n if(j<5)\n fprintf(\"" \"");\n end\n end\nend",ACCEPTED,27,6508 1510468772753174528,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 12:06:33,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))",ACCEPTED,24,6764 1510469554102951936,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-04-03 12:09:39,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"A=[4 5; 2 7];\nB=[7 1; 8 3];\nC=[5 9; 6 2];\nnew_v1(12)=zeros();\nfor(k=0:2)\n for(j=1:2)\n for(i=1:2)\n if(k==0)\n new_v1(4*k+(j-1)*2+i)=A(i,j);\n elseif(k==1)\n new_v1(4*k+(j-1)*2+i)=B(i,j);\n else\n new_v1(4*k+(j-1)*2+i)=C(i,j);\n end\n end\n end\nend\nfor(i=1:12)\nfprintf('%d',new_v1(i));\nfprintf('%c',\"" \"");\nend",ACCEPTED,26,6760 1510472196350894080,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 12:20:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d',B);",PRESENTATION_ERROR,30,6524 1510473090253545472,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 12:23:42,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfor j=1:8\n fprintf(\""%d\"",B(1,j));\n if(j<9)\n fprintf(\"" \"");\n end\nend",ACCEPTED,25,6760 1510475679292547072,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 12:33:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d',new_v)",WRONG_ANSWER,25,6652 1510475712695984128,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-04-03 12:34:07,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfprintf('%.2f ',A);\n",ACCEPTED,24,6760 1510475716524109824,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 12:34:08,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d',new_v')",PRESENTATION_ERROR,24,6508 1510476091726848000,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-04-03 12:35:38,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,26,6760 1510476521709387776,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 12:37:20,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:) b(:) c(:)];\nfprintf('%d %d %d\\n',new_v)",WRONG_ANSWER,25,6504 1510477204663713792,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 12:40:03,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[reshape(a,4,1) reshape(b,4,1) reshape(c,4,1)];\nfprintf('%d %d %d\\n',new_v')",ACCEPTED,24,6508 1510477976394678272,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-04-03 12:43:07,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",d(j,i));\n if(j~=3)\n fprintf(\"" \"");\n end\n end\n if(i~=4)\n fprintf(\""\\n\"");\n end\nend\n",WRONG_ANSWER,25,6476 1510478130297004032,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 12:43:44,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:2:33\n fprintf('%d',i);\n fprintf(' ');\n\nend",ACCEPTED,25,6760 1510478292715958272,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 12:44:22,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4)];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d',new_v1)",PRESENTATION_ERROR,29,6496 1510478414473682944,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 12:44:52,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4)];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d ',new_v1)",ACCEPTED,24,6932 1510478480046702592,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 12:45:07,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:);b(:);c(:)];\nfprintf(%d\\n,transpose(v));\nclear;",WRONG_ANSWER,28,6504 1510478503543922688,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-04-03 12:45:13,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\n b=[7,1;8,3];\n c=[5,9;6,2];\n a1=a(:);\n b2=b(:);\n c2=c(:);\nnew=[a1',b2',c2'];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n if(j!=12) \n fprintf(\"" \"");\n end \n end\n fprintf(\"" \"");",ACCEPTED,29,6752 1510478566675857408,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 12:45:28,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:);b(:);c(:)];\nfprintf(\""%d\\n\"",transpose(v));\nclear;",PRESENTATION_ERROR,24,6760 1510479317103951872,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-04-03 12:48:27,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfor i=1:12\n fprintf(\""%d \"",new_v(i))\nend\n",ACCEPTED,24,6752 1510479347696660480,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-04-03 12:48:34,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=[a(:,1);a(:,2)];\nB=[b(:,1);b(:,2)];\nC=[c(:,1);c(:,2)];\nnew=[A B C];\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",new(i,j));\n if(j~=3)\n fprintf(\"" \"");\n end\n end\n if(i~=4)\n fprintf(\""\\n\"");\n end\nend",ACCEPTED,25,6632 1510479861851766784,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 12:50:37,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15,1);\nfor i=1:15\n fprintf('%d',myZeros(1,i));\n fprintf(' ');\nend\n\n ",ACCEPTED,24,6780 1510479947105918976,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 12:50:57,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:);b(:);c(:)];\nfprintf(\""%d\"",transpose(v));\nclear;",PRESENTATION_ERROR,23,6504 1510479995768233984,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 12:51:09,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nv=[a(:);b(:);c(:)];\nfprintf(\""%d \"",transpose(v));\nclear;",ACCEPTED,27,6500 1510480374009839617,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-04-03 12:52:39,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),a(:,2),b(:,1),b(:,2),c(:,1),c(:,2)];\nfprintf(\""%d \"",new);",ACCEPTED,24,6380 1510480990731366400,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 12:55:06,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4,5;2,7]\nb = [7,1;8,3]\nc = [5,9;6,2]\nnew_v=[a(:),b(:),c(:)];\nnew_v",WRONG_ANSWER,27,6756 1510481836173574144,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-04-03 12:58:27,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nd=new_v.';\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",d(j,i));\n if(j~=3)\n fprintf(\"" \"");\n end\n end\n if(i~=4)\n fprintf(\""\\n\"");\n end\nend\n",ACCEPTED,25,6760 1510483339113787392,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-04-03 13:04:26,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nfor(i=1:8)\nif(A(i)>0)\n fprintf('%d',A(i)*A(i)*A(i));\n fprintf('%c',\"" \"");\nelse\n fprintf('%d',0);\n fprintf('%c',\"" \"");\nend\nend",ACCEPTED,29,6500 1510484651503665152,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-04-03 13:09:39,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:32];\nfor(i=1:14)\n fprintf('%d',A(i));\n fprintf('%c',\"" \"");\nend",ACCEPTED,27,6504 1510486094873452544,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 13:15:23,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfor i=1:20\n fprintf('%.2f',theta(1,i));\n fprintf(' ');\nend\n\n",ACCEPTED,28,6496 1510486102472802304,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 13:15:24,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb2=b(:);\nc2=c(:);\nnew_v=[a1,b2,c2];\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",new_v(i,j));\n if(j~=3||i~=4)\n fprintf(\"" \"");\n end\n end\n if(i~=4)\n fprintf(\""\\n\"");\n end\nend",PRESENTATION_ERROR,24,6756 1510487316748431360,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 13:20:14,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew=ones(4,3)\nnew(:,1)=a(:)\nnew(:,2)=b(:)\nnew(:,3)=c(:)",WRONG_ANSWER,26,6760 1510488011115458560,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-04-03 13:23:00,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=zeros(1,33);\nn=0;\nm=1;\nfor i=6:33\n if(mod(i,2)~=1)\n a(1,m)=i;\n m=m+1;\n n=n+1;\n end\nend\nfor i=1:n\n fprintf(\""%d \"",a(1,i));\nend",ACCEPTED,28,8732 1510488254080180224,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 13:23:57,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=ones(4,3);\nnew(:,1)=a(:);\nnew(:,2)=b(:);\nnew(:,3)=c(:);\nfprintf(new);",WRONG_ANSWER,28,6764 1510488341433675776,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 13:24:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb2=b(:);\nc2=c(:);\nnew_v=[a1,b2,c2];\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",new_v(i,j));\n if(j==3&i==4)\n else\n fprintf(\"" \"");\n end\n end\n if(i<4)\n fprintf(\""\\n\"");\n end\nend\n ",PRESENTATION_ERROR,24,6764 1510489136501747712,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 13:27:28,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb2=b(:);\nc2=c(:);\nnew_v=[a1,b2,c2];\nfor i=1:4\n for j=1:3\n fprintf(\""%d\"",new_v(i,j));\n if(j~=3)\n fprintf(\"" \"");\n end\n end\n if(i~=4)\n fprintf(\""\\n\"");\n end\nend\n ",ACCEPTED,24,6508 1510489452522127360,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 13:28:43,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:8\nif B(i)<0\nB(i)=0;\nend\nend\nfprintf('%d ',B(1,1:8)",WRONG_ANSWER,24,6500 1510489542792667136,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 13:29:05,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:8\nif B(i)<0\nB(i)=0;\nend\nend\nfprintf('%d ',B(1,1:8))",ACCEPTED,25,6628 1510489900465405952,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 13:30:30,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(\""\"");\nB=A.^3;\nfprintf(\""%d \"",B);\n",WRONG_ANSWER,25,6676 1510489903518859264,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-04-03 13:30:31,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"PI=3.14159;\ntheta=[0:2*PI/19:2*PI];\nfor(i=1:20)\n fprintf('%.2f',theta(i));\n fprintf('%c',\"" \"");\nend",ACCEPTED,30,6500 1510490207404572672,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-04-03 13:31:43,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros(15)=zeros();\nfor(i=1:15)\n fprintf('%d',myZeros(i));\n fprintf('%c',\"" \"");\nend",ACCEPTED,24,6380 1510490665443540992,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 13:33:32,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=3:16\na(1,i-2)=i*2;\nend\nfprintf('%d ',a(1,1:12))",WRONG_ANSWER,26,6756 1510490737191305216,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 13:33:49,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\na2=a1';\nb1=b(:);\nb2=b1';\nc1=c(:);\nc2=c1';\nnew=[a2,b2,c2];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n if(j~=12)\n fprintf(\"" \"");\n end\nend",PRESENTATION_ERROR,27,6760 1510490839780515840,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 13:34:14,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=3:16\na(1,i-2)=i*2;\nend\nfprintf('%d ',a(1,1:14))",ACCEPTED,29,6620 1510491010475376640,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 13:34:55,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\na2=a1';\nb1=b(:);\nb2=b1';\nc1=c(:);\nc2=c1';\nnew=[a2,b2,c2];\nfor j=1:12\n fprintf(\""%d\"",new(1,j));\n fprintf(\"" \"");\nend",ACCEPTED,24,6636 1510491207007879168,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 13:35:41,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(\""\"");\nB=A.^3;\nif B(1,i)<0;\nB(1,i)=0;\nfprintf(\""%d \"",B);\n",WRONG_ANSWER,24,6624 1510492419865833473,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 13:40:31,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(\""\"");\nB=A.^3;\nfor i=1:end;\nif B(1,i)<0;\nB(1,i)=0;\nend;\nend;\nfprintf(\""%d \"",B);\n",WRONG_ANSWER,28,6624 1510493482942087168,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 13:44:44,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.1416;\nfor i=1:20\na(i)=0+(2*pi)*(i-1)/19;\nend\nfprintf('%4.2f ',a(1:20))",ACCEPTED,26,6756 1510493656296865792,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 13:45:25,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('A=');\nfor i=1:8\n if(A(1,i)>0)\n B(1,i)=A(1,i)*A(1,i)*A(1,i);\n fprintf(\""%d\"",B(1,i));\n else\n fprintf(\""%d\"",0);\n end\n fprintf(\"" \"");\nend",WRONG_ANSWER,27,6644 1510494079707115520,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 13:47:06,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(\""\"");\nB=A.^3;\nl=length(A);\nfor i=1:l;\nif B(1,i)<0;\nB(1,i)=0;\nend;\nend;\nfprintf(\""%d \"",B);\n",WRONG_ANSWER,24,6364 1510494177985126400,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 13:47:30,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input(\""\"");\nB=A.^3;\nl=length(A);\nfor i=1:l;\nif B(1,i)<0;\nB(1,i)=0;\nend;\nend;\nfprintf(\""%d \"",B);\n",WRONG_ANSWER,27,6500 1510494364144386048,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-04-03 13:48:14,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=reshape(zeros(3,5),1,15);\nfprintf('%d ',a(:))",ACCEPTED,25,6384 1510494627374710785,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 13:49:17,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1, 2, -1, 5, 6, 7, -4, 3];\nB = A .^ 3;\nlogical_neg = B < 0;\nB(logical_neg) = 0;\n\nfprintf(\""%d \"", B);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,6508 1510495647560196096,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-04-03 13:53:20,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew=[a(:) b(:) c(:)];\nfprintf('%d %d %d\\n',new(1,:));\nfprintf('%d %d %d\\n',new(2,:));\nfprintf('%d %d %d\\n',new(3,:));\nfprintf('%d %d %d',new(4,:));",ACCEPTED,25,6656 1510496583749820416,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-04-03 13:57:03,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4)];\nfprintf('%d ',new)",ACCEPTED,27,6772 1510496701735591936,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 13:57:32,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('A=');\nfor i=1:8\n if(A(1,i)>0)\n B(1,i)=A(1,i)*A(1,i)*A(1,i);\n fprintf(\""%d\"",B(1,i));\n else\n fprintf(\""%d\"",0);\n end\n fprintf(\"" \"");\nend",WRONG_ANSWER,26,6516 1510498747497705472,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:05:39,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=ones(4,3);\nnew(:,1)=a(:);\nnew(:,2)=b(:);\nnew(:,3)=c(:);\nnew_=new';\nfprintf('%d %d %d\\n',round(new_));",ACCEPTED,29,6496 1510499241935388672,10d3f5ee66cfa2cdf574c146e685b55a3a19ccf1dd4572382c95069014cc6557,2022-04-03 14:07:37,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew=[a1,b1,c1];\nfprintf('%d ',new);",ACCEPTED,27,6504 1510499376156766208,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:08:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('A=');\nI=length(A);\nfor i=1:I\n if(A(1,i)>0)\n fprintf(\""%d\"",A(1,i)*A(1,i)*A(1,i));\n else\n fprintf(\""%d\"",0);\n end\n fprintf(\"" \"");\nend",WRONG_ANSWER,27,6508 1510500339975544832,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-04-03 14:11:59,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=[A.^3];\n n=find(B<0);\n B(n)=0;\n fprintf('%d ',B);",ACCEPTED,26,6636 1510500642422611968,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-04-03 14:13:11,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B)",WRONG_ANSWER,25,6760 1510501018444886016,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-04-03 14:14:41,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=(6:33)\nif rem(i,2)==0\nfprintf('%d ',i)\nend\nend",ACCEPTED,29,6508 1510501216337616896,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 14:15:28,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6:2:33];\nfprintf(\""%d \"",a);\nclear;",ACCEPTED,26,6492 1510501398219415552,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:16:11,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfprintf('%d ',round(a(:)'),round(b(:)'),round(c(:)'));",ACCEPTED,25,6752 1510503125722480640,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-04-03 14:23:03,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta);\n",ACCEPTED,25,6640 1510503748996784128,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-04-03 14:25:32,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[reshape(a,4,1) reshape(b,4,1) reshape(c,4,1)];\ne=d';\nfprintf('%d %d %d\\n',e)",ACCEPTED,27,6548 1510503761780293632,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 14:25:35,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf(\""%.2f\"",a);\nclear;",PRESENTATION_ERROR,26,6512 1510503834350141440,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 14:25:52,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf(\""%.2f \"",a);\nclear;",ACCEPTED,26,6760 1510503874770104320,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-04-03 14:26:02,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros);",ACCEPTED,28,6636 1510504240471470080,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:27:29,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=1:33\n a(1,i)=i;\nend\nb=a(2:2:end);\nJ=length(b)\nfor j=1:J\n if(b(1,j)>2)\n fprintf(\""%d\"",b(1,j));\n fprintf(\"" \"");\n end\nend\n",WRONG_ANSWER,27,6880 1510504297321611264,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:27:42,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=1:33\n a(1,i)=i;\nend\nb=a(2:2:end);\nJ=length(b)\nfor j=1:J\n if(b(1,j)>4)\n fprintf(\""%d\"",b(1,j));\n fprintf(\"" \"");\n end\nend\n",WRONG_ANSWER,29,6756 1510504798066438144,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:29:42,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8\n if B(1,i)<0;\n B(1,i)=0;\n end\nend\nfprintf('%d ',round(B))",ACCEPTED,24,6784 1510505048257945600,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:30:41,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=1:33\n a(1,i)=i;\nend\nb=a(2:2:end);\nJ=length(b)\nfor j=1:J\n if(b(1,j)>4)\n fprintf(\""%d\"",b(1,j));\n fprintf(\"" \"");\n end\nend\n",WRONG_ANSWER,25,6756 1510505399487688704,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:32:05,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.^3;\nfor i=1:1:8\n if B(1,i)<0;\n B(1,i)=0;\n end\nend\nfprintf('%d ',round(B))",WRONG_ANSWER,26,6508 1510505428580655104,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:32:12,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('');\nB=A.^3;\nfor i=1:1:8\n if B(1,i)<0;\n B(1,i)=0;\n end\nend\nfprintf('%d ',round(B))",WRONG_ANSWER,26,6516 1510505623090229248,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:32:59,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8\n if B(1,i)<0;\n B(1,i)=0;\n end\nend\nfprintf('%d ',round(B))",ACCEPTED,29,6536 1510506013891584000,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-04-03 14:34:32,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf(\""%d \"",a);\nclear;",ACCEPTED,35,6484 1510506380876406784,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:35:59,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=1:33\n a(1,i)=i;\nend\nb=a(2:2:end);\nJ=length(b)\nfor j=1:J\n if(b(1,j)>4)\n fprintf(\""%d\"",b(1,j));\n fprintf(\"" \"");\n end\nend\n",WRONG_ANSWER,29,6488 1510506430107873280,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:36:11,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=1:33\n a(1,i)=i;\nend\nb=a(2:2:end);\nJ=length(b)；\nfor j=1:J\n if(b(1,j)>4)\n fprintf(\""%d\"",b(1,j));\n fprintf(\"" \"");\n end\nend\n",WRONG_ANSWER,25,7036 1510506468900990976,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:36:20,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=1:33\n a(1,i)=i;\nend\nb=a(2:2:end);\nJ=length(b);\nfor j=1:J\n if(b(1,j)>4)\n fprintf(\""%d\"",b(1,j));\n fprintf(\"" \"");\n end\nend\n",ACCEPTED,26,6508 1510506602012696576,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 14:36:52,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"new=[4,7,5;2,8,6;5,1,9;7,3,2]",WRONG_ANSWER,28,6620 1510506661365018624,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:37:06,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input();\nI=length(A);\nfor i=1:I\n if(A(1,i)>0)\n fprintf(\""%d\"",A(1,i)*A(1,i)*A(1,i));\n else\n fprintf(\""%d\"",0);\n end\n fprintf(\"" \"");\nend",WRONG_ANSWER,31,6572 1510506836189077504,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:37:48,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nI=length(A);\nfor i=1:I\n if(A(1,i)>0)\n fprintf(\""%d\"",A(1,i)*A(1,i)*A(1,i));\n else\n fprintf(\""%d\"",0);\n end\n fprintf(\"" \"");\nend",ACCEPTED,26,6512 1510507814135918592,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-04-03 14:41:41,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.1415926535;\na=zeros(20);\nfor i=1:20\n a(i)=2*pi*(i-1)/19;\nend\nfor i=1:20\n fprintf('%.2f ',a(i));\nend",ACCEPTED,26,6512 1510508437933780992,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-04-03 14:44:10,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf(\""%d \"",myZeros);",ACCEPTED,29,6488 1510508457467928576,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-04-03 14:44:14,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\ne=[reshape(a,1,4) reshape(b,1,4) reshape(c,1,4)];\nfprintf('%d ',e)",ACCEPTED,28,6752 1510508531399651328,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-04-03 14:44:32,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1,2,-1,5,6,7,-4,3];\nB=A.*A.*A;\nB((B<0))=0;\nfprintf('%d ',B);",ACCEPTED,25,6380 1510508828193341440,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:45:43,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"j=1;\nfor i=6:1:33\n if rem(i,2)==0\n A(1,i-5)=i;\n elseif\n A(1,i-5)=0;\n end\nend\nfor i=1:1:27\n if A(1,i)~=0\n B(1,j)=A(1,i);\n j++;\n end\nend\nfprintf(\""%d \"",round(B));",ACCEPTED,27,6784 1510509052005597184,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:46:36,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"for i=1:20\n a(1,i)=(i-1)*(2*pi/19);\n fprintf(\""%.2f\"",a(1,i));\n fprintf(\"" \"");\nend",ACCEPTED,30,6496 1510509339881652224,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-04-03 14:47:45,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1,2,-1,5,6,7,-4,3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))",ACCEPTED,27,6656 1510509351469969408,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-04-03 14:47:47,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=(6:2:33);\nfprintf('%d ',A)",ACCEPTED,25,6516 1510509599174254592,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-03 14:48:47,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfor i=1:15\n fprintf(\""%d\"",a(1,i));\n fprintf(\"" \"");\nend",ACCEPTED,25,6512 1510510608655147008,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-04-03 14:52:47,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfprintf('%.2f ',A)",ACCEPTED,24,6636 1510510688387592192,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:53:06,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"pi=3.14159;\nA=linspace(0,2*pi,20);\nfprintf('%.2f ',A);",ACCEPTED,29,6508 1510511073832091648,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-04-03 14:54:38,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf(\""%d \"",a);",ACCEPTED,26,6800 1510511805160054784,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 14:57:32,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfor i=1:4\n for j=1:3\n fprintf('%d',new_v(i,j));\n if(j~=3)\n fprintf(' ');\n end\n end\n if(i~=4)\n fprintf('\\n');\n end\nend\n",ACCEPTED,30,6516 1510511810586755072,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-04-03 14:57:34,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A(1,1:15)=zeros;\nfprintf('%d ',A);",ACCEPTED,26,6532 1510515039949905920,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-04-03 15:10:24,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32];\nfprintf('%d ',a)",ACCEPTED,25,6504 1510515406224617472,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:11:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfor n=1:4\n d(n,1)=a(n);\nend\n \nfor n=1:4\n d(n,2)=b(n);\nend\n\nfor n=1:4\n d(n,3)=c(n);\nend\n\ndisp(d)",PRESENTATION_ERROR,30,6424 1510515508603383808,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:12:15,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfor n=1:4\n d(n,1)=a(n);\nend\n \nfor n=1:4\n d(n,2)=b(n);\nend\n\nfor n=1:4\n d(n,3)=c(n);\nend\n\ndisp(d)；",WRONG_ANSWER,25,6508 1510515612828188672,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:12:40,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfor n=1:4\n d(n,1)=a(n);\nend\n \nfor n=1:4\n d(n,2)=b(n);\nend\n\nfor n=1:4\n d(n,3)=c(n);\nend\n\ndisp(d)",PRESENTATION_ERROR,29,6792 1510515821575233536,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:13:30,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfor n=1:4\n d(n,1)=a(n);\nend\n \nfor n=1:4\n d(n,2)=b(n);\nend\n\nfor n=1:4\n d(n,3)=c(n);\nend\n\nfprintf(d)",WRONG_ANSWER,27,6508 1510516265663946752,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:15:16,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfor n=1:4\n d(n,1)=a(n);\nend\n \nfor n=1:4\n d(n,2)=b(n);\nend\n\nfor n=1:4\n d(n,3)=c(n);\nend\n\nfprintf('%d',d)\n\n",WRONG_ANSWER,26,6496 1510517170692812800,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-04-03 15:18:52,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0.00,2*pi,20);\nfprintf('%.2f ',x)",ACCEPTED,27,6660 1510517504329269248,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-04-03 15:20:11,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfprintf('%d ',x)",ACCEPTED,28,6568 1510517772941615104,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:21:15,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nfor n=1:4\n d(n,1)=a(n);\nend\n \nfor n=1:4\n d(n,2)=b(n);\nend\n\nfor n=1:4\n d(n,3)=c(n);\nend\n\nfprintf('%d %d %d\\n',d');\n\n",ACCEPTED,26,6508 1510518833169391616,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:25:28,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152," a=6:2:32;\n>> fprintf('%d ',a)\n ",WRONG_ANSWER,28,6520 1510518889100435456,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:25:41,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152," a=6:2:32;\n fprintf('%d ',a)\n ",ACCEPTED,26,6564 1510520347341766656,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:31:29,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"format bank a=linspace(0,2*pi,20);\nfprintf('%d ',a)",WRONG_ANSWER,26,6644 1510521403123036160,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:35:41,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"format (bank) \na=linspace(0,2*pi,20);\nfprintf('%d ',a)",WRONG_ANSWER,29,6760 1510521482781257728,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:36:00,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"format bank \na=linspace(0,2*pi,20);\nfprintf('%d ',a)",WRONG_ANSWER,26,6640 1510521538821898240,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:36:13,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"format bank; \na=linspace(0,2*pi,20);\nfprintf('%d ',a)",WRONG_ANSWER,32,6748 1510521688239239168,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:36:49,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=1;\n\nfor n=1:4\n d(x)=a(n);\n x=x+1;\nend\n\nfor n=1:4\n d(x)=b(n);\n x=x+1;\nend\n\nfor n=1:4\n d(x)=c(n);\n x=x+1;\nend\n\nfprintf('%d ',d);\n",ACCEPTED,29,6752 1510522069644623872,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:38:20,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"format bank; \na=linspace(0,2*pi,20);\nfprintf('%f ',a)",WRONG_ANSWER,25,6372 1510522198858002432,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 15:38:51,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\n\nnew_v = [a(:); b(:); c(:)];\nnew_h = transpose(new_v);\n\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",WRONG_ANSWER,26,6500 1510522203857612800,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:38:52,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"format bank; \na=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,27,6640 1510522551632523264,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 15:40:15,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\nnew_v = [a(:), b(:), c(:)];\nfprintf(\""%d %d %d\\n\"", transpose(new_v));\nclear;",ACCEPTED,24,6636 1510523119100882944,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-04-03 15:42:30,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=linspace(0,0,15);\nfprintf('%d ',myZeros)",ACCEPTED,27,6752 1510523423146524672,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-04-03 15:43:42,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = linspace(0, 2*pi, 20);\nfprintf(\""%.2f \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,29,6760 1510524845296599040,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 15:49:21,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7]\n\na =\n\n 4 5\n 2 7\n\n>> b=[7,1;8,3]\n\nb =\n\n 7 1\n 8 3\n\n>> c=[5,9;6,2]\n\nc =\n\n 5 9\n 6 2\n\n>> new=[a,b,c]\n\nnew =\n\n 4 5 7 1 5 9\n 2 7 8 3 6 2\n\n>> clear new\n>> new=[a;b;c]\n\nnew =\n\n 4 5\n 2 7\n 7 1\n 8 3\n 5 9\n 6 2\n\n>> clear new\n>> d=a'\n\nd =\n\n 4 2\n 5 7\n\n>> clear d\n>> d=a'\n\nd =\n\n 4 2\n 5 7\n\n>> new=d(:)\n\nnew =\n\n 4\n 5\n 2\n 7\n\n>> clear d\n>> clear new\n>> new=[a:;b:;c:]\n new=[a:;b:;c:]\n ↑\n无效表达式。调用函数或对变量进行索引时，请使用圆括号。否则，请检查不匹配的分隔符。\n \n>> new=[(a:);(b:);(c:)]\n new=[(a:);(b:);(c:)]\n ↑\n无效表达式。调用函数或对变量进行索引时，请使用圆括号。否则，请检查不匹配的分隔符。\n \n>> A=(a:);\n A=(a:);\n ↑\n无效表达式。调用函数或对变量进行索引时，请使用圆括号。否则，请检查不匹配的分隔符。\n \n>> new=[(a:)(b:)(c:)]\n new=[(a:)(b:)(c:)]\n ↑\n无效表达式。调用函数或对变量进行索引时，请使用圆括号。否则，请检查不匹配的分隔符。\n \n>> A=(a:)\n A=(a:)\n ↑\n无效表达式。调用函数或对变量进行索引时，请使用圆括号。否则，请检查不匹配的分隔符。\n \n>> new=[a(:);b(:);c(:)]\n\nnew =\n\n 4\n 2\n 5\n 7\n 7\n 8\n 1\n 3\n 5\n 6\n 9\n 2\n\n>> clear new\n>> new=[a(:),b(:),c(:)]\n\nnew =\n\n 4 7 5\n 2 8 6\n 5 1 9\n 7 3 2\n\n>> ",WRONG_ANSWER,27,6512 1510525033558663168,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 15:50:06,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7]\n\n>> b=[7,1;8,3]\n\n>> c=[5,9;6,2]\n\n>> new=[a(:),b(:),c(:)]\n",WRONG_ANSWER,27,6568 1510525095034576896,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:50:21,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\na=length(A);\nfor n=1:a\n if A(n)>0\n B(n)=A(n)^3;\n end\nend;\n\nfprintf('%d ',B)",ACCEPTED,26,6636 1510525104692785152,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 15:50:23,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\n\nb=[7,1;8,3]\n\nc=[5,9;6,2]\n\nnew=[a(:),b(:),c(:)]\n",WRONG_ANSWER,30,6568 1510525247639404544,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 15:50:57,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">>a=[4,5;2,7]\n\n>>b=[7,1;8,3]\n\n>>c=[5,9;6,2]\n\n>>new=[a(:),b(:),c(:)]\n",WRONG_ANSWER,27,6508 1510525836687458304,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 15:53:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,">> a=[4,5;2,7]\n\na =\n\n 4 5\n 2 7\n\n>> b=[7,1;8,3]\n\nb =\n\n 7 1\n 8 3\n\n>> c=[5,9;6,2]\n\nc =\n\n 5 9\n 6 2\n\n>> new=[a(:),b(:),c(:)]\n\nnew =\n\n 4 7 5\n 2 8 6\n 5 1 9\n 7 3 2\n\n>> ",WRONG_ANSWER,30,6368 1510526175754993664,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 15:54:39,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"x=1;\nfor n=6:33\n if rem(n,2)==0\n a(x)=n;\n x=x+1;\n end\nend\nfprintf('%d ',a)\n",ACCEPTED,25,6508 1510527574022701056,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:00:12,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:) b(:) c(:)];\ng=[new(1,:),new(2,:),new(3,:),new(4,:)];\nfprintf('%d %d %d\\n',g)",ACCEPTED,26,6516 1510527635976220672,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:00:27,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)]';\nfprintf('%d ',new_v)",ACCEPTED,27,6496 1510527691396104192,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:00:40,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nn=length(A);\nfor i=1:n\n if A(1,i)>0\n A(1,i)=A(1,i)*A(1,i)*A(1,i);\n else\n A(1,i)=0;\n end\nend\nB=A;\nfprintf('%d ',B)",ACCEPTED,26,6748 1510527700800462848,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 16:00:42,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20)\nfprintf('%.2f ',theta)",WRONG_ANSWER,26,6504 1510527746161131520,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:00:53,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:33\n if rem(i,2)==0\n fprintf('%d ',i);\n end\nend",ACCEPTED,25,6760 1510527796676784128,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:01:05,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"for i=6:33\n if rem(i,2)==0\n fprintf('%d ',i);\n end\nend",WRONG_ANSWER,25,6384 1510527878462062592,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 16:01:25,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,36,6500 1510527907939631104,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:01:32,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"for i=6:33\n if rem(i,2)==0\n fprintf('%d ',i);\n end\nend",WRONG_ANSWER,25,6508 1510527986159206400,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:01:50,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:) b(:) c(:)];\ng=[new(1,:),new(2,:),new(3,:),new(4,:)];\nfprintf('%d %d %d\\n',g)",WRONG_ANSWER,29,6736 1510528223364603904,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:02:47,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:) b(:) c(:)];\ng=[new(1,:),new(2,:),new(3,:),new(4,:)];\nfprintf('%d %d %d\\n',g)",WRONG_ANSWER,26,6748 1510528336425533440,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:03:14,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"for i=6:33\n if rem(i,2)==0\n fprintf('%d ',i);\n end\nend",WRONG_ANSWER,26,6644 1510528367785799680,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 16:03:21,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(15);\nfprintf('%d ',x)",WRONG_ANSWER,24,6640 1510528536330985472,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-04-03 16:04:01,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(15,1);\nfprintf('%d ',x)",ACCEPTED,30,6556 1510529564908544000,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-04-03 16:08:07,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfor i=1:15\nfprintf(\""%d\"",myZeros(1,i));\nfprintf(\"" \"")\nend",ACCEPTED,27,6868 1510530288698613760,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-04-03 16:10:59,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4 7];\ne=[5];\nfprintf('%d ',a);\nfprintf('%d',e);\nfprintf('\\n');\nb=[2 8];\nf=[6];\nfprintf('%d ',b);\nfprintf('%d',f);\nfprintf('\\n');\nc=[5 1];\ng=[9];\nfprintf('%d ',c);\nfprintf('%d',g);\nfprintf('\\n');\nd=[7 3];\nk=[2];\nfprintf('%d ',d);\nfprintf('%d',k);",ACCEPTED,29,6500 1510530785298739200,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:12:58,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"for i=0:2*pi/19:2*pi\n \n fprintf('%4.2f ',i);\n \nend",ACCEPTED,25,6504 1510530857294512128,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:13:15,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros=zeros(1,15);\nfprintf('%d ',myzeros)",ACCEPTED,27,6508 1510532286482628608,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 16:18:56,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\n\nb=[7,1;8,3]\n\nc=[5,9;6,2]\n\nnew=[a(:),b(:),c(:)]\n\nfprintf(new)\n\n\n",WRONG_ANSWER,25,6504 1510532360907087872,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-04-03 16:19:13,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros=zeros(1,15);\nfprintf('%d ',myzeros)",ACCEPTED,27,6784 1510534178412257280,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-04-03 16:26:27,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:) b(:) c(:)];\ng=[new(1,:),new(2,:),new(3,:),new(4,:)];\nfprintf('%d %d %d\\n',g)",ACCEPTED,27,8112 1510534527385464832,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-04-03 16:27:50,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nn=length(A);\nfor i=1:n\n if A(1,i)>0\n A(1,i)=A(1,i)*A(1,i)*A(1,i);\n else\n A(1,i)=0;\n end\nend\nB=A;\nfprintf('%d ',B)",WRONG_ANSWER,25,6764 1510534646001655808,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 16:28:18,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]；\n\nb=[7,1;8,3]；\n\nc=[5,9;6,2]；\n\nnew=[a(:),b(:),c(:)]\n\ndisplay(new)\n\n\n\n",WRONG_ANSWER,24,6520 1510534723960455168,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-04-03 16:28:37,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:);b(:);c(:)]';\nfprintf('%d ',new_v)",ACCEPTED,25,6628 1510534879165935616,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-04-03 16:29:14,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nn=length(A);\nfor i=1:n\n if A(1,i)>0\n A(1,i)=A(1,i)*A(1,i)*A(1,i);\n else\n A(1,i)=0;\n end\nend\nB=A;\nfprintf('%d ',B)",ACCEPTED,25,6500 1510535110301446144,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-04-03 16:30:09,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:33\n if rem(i,2)==0\n fprintf('%d ',i);\n end\nend",ACCEPTED,26,6644 1510535178225278976,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 16:30:25,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d',new_v)",PRESENTATION_ERROR,25,6508 1510535325440425984,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-04-03 16:31:00,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"for i=0:2*pi/19:2*pi\n \n fprintf('%4.2f ',i);\n \nend",ACCEPTED,27,6784 1510535541854658560,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-04-03 16:31:52,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros=zeros(1,15);\nfprintf('%d ',myzeros)",ACCEPTED,28,6640 1510538109967003648,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 16:42:04,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a = linspace(0,0,15);\nfprint(a)",WRONG_ANSWER,24,6508 1510539739060387840,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 16:48:32,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=linspace(0,0,15)\ndiap(a)",WRONG_ANSWER,25,6656 1510547723132690432,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:20:16,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=linspace(0,0,15);\nfprintf('%d',a)",WRONG_ANSWER,29,6640 1510548978914967552,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:25:15,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=reshape(a,[],1);\nb=reshape(b,[],1);\nc=reshape(c,[],1);\nnew_v=[a,b,c];\nnew_v=new_v.';\nnew_v=reshape(new_v,[],1);\nfprintf('%d %d %d\\n',new_v)",ACCEPTED,26,6752 1510549189276819456,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:26:06,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=reshape(a,1,[]);\nb=reshape(b,1,[]);\nc=reshape(c,1,[]);\nnew=[a,b,c];\nfprintf('%d ' , new)",ACCEPTED,29,6512 1510549249639968768,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:26:20,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na=reshape(a,1,[]);\nb=reshape(b,1,[]);\nc=reshape(c,1,[]);\nnew=[a,b,c];\nfprintf('%d ' , new)",ACCEPTED,28,6760 1510550201182019584,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:30:07,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nfor a=1:8;\nif A(a)>0;\n B(a)=A(a).^3;\n else\n B(a)=0;\n end\n end\nfprintf('%d ',B)",ACCEPTED,26,6512 1510550537867190272,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:31:27,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:32;\nfprintf('%d ',a)",ACCEPTED,27,6508 1510550928217751552,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:33:00,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,27,6528 1510551169872576512,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-04-03 17:33:58,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=linspace(0,0,15);\nfprintf('%d ',a)",ACCEPTED,27,6492 1510554262664265728,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:46:15,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\nnew_v = [a(:), b(:), c(:)];\nfprintf(\""%d %d %d\\n\"", transpose(new_v));\nclear;",ACCEPTED,27,6760 1510554283955281920,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:46:20,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\nnew_v = [a(:), b(:), c(:)];\nfprintf(\""%d %d %d\\n\"", transpose(new_v));\nclear;",ACCEPTED,26,6512 1510554475465928704,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:47:06,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nnew_v = [a(:); b(:); c(:)];\nnew_h = transpose(new_v);\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",WRONG_ANSWER,25,6508 1510554548175462400,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:47:23,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\nnew_v = [a(:); b(:); c(:)];\nnew_h = transpose(new_v);\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,30,6740 1510554677854224384,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:47:54,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1, 2, -1, 5, 6, 7, -4, 3];\nB = A .^ 3;\nlogical_neg = B < 0;\nB(logical_neg) = 0;\nfprintf(\""%d \"", B);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,6748 1510554760997367808,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:48:14,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a = [6:2:33];\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,32,6756 1510554838558982144,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 17:48:32,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,A=[6:2:33]\nfprintF(A)\n,WRONG_ANSWER,27,6504 1510554841990651904,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:48:33,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = linspace(0, 2*pi, 20);\nfprintf(\""%.2f \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,26,6764 1510554924894535680,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-04-03 17:48:53,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a(15) = 0;\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,28,6752 1510556429126594560,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 17:54:52,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:),b(:),c(:)];\nfprintf(\""%d \"",x(1,:))\nfprintf(\""\\n\"")\nfprintf(\""%d \"",x(2,:))\nfprintf(\""\\n\"")\nfprintf(\""%d \"",x(3,:))\nfprintf(\""\\n\"")\nfprintf(\""%d \"",x(4,:))\n",PRESENTATION_ERROR,27,6752 1510558031141552128,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:01:14,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:),b(:),c(:)];\nfor i=1:4\nfprintf(\""%d \"",x(i,1),x(i,2))\nfprintf(\""%d\\n\"",x(i,3))\nend",ACCEPTED,25,6784 1510558132257288192,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:01:38,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33];\nfprintf(\""%d\"",A)\n",PRESENTATION_ERROR,26,6536 1510558587176968192,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:03:26,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:33];\nfprintf(\""%d \"",A)\n",ACCEPTED,25,6508 1510559361852334080,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:06:31,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:)',b(:)',c(:)'];\nfprintf(\""%d \"",x(1:11))\nfprintf(\""%d\\n\"",x(1,12))",PRESENTATION_ERROR,24,6508 1510559455002902528,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:06:53,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:)',b(:)',c(:)'];\nfprintf(\""%d \"",x(1:12))\n",ACCEPTED,27,6520 1510561309506756608,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:14:15,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\nfor i=1:8\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,26,6508 1510561409736765440,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:14:39,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\nfor i=1:8\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,24,6372 1510561751867416576,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-04-03 18:16:01,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 1:4\n d(i,2)=b(i);\nend\nfor i = 1:4\n d(i,3)=c(i);\nend\nfor i = 1:4\n for j = 1:3\n fprintf(\""%d\"",d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend",ACCEPTED,26,6764 1510561806807330816,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-04-03 18:16:14,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(1,12);\nfor i = 1:4\n d(i)=a(i);\nend\nfor i = 1:4\n d(4+i)=b(i);\nend\nfor i = 1:4\n d(8+i)=c(i);\nend\nfor i = 1:12\n fprintf(\""%d \"",d(i));\nend",ACCEPTED,25,6760 1510561865340116992,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-04-03 18:16:28,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nl=length(A);\nB=zeros(1,100);\nfor i = 1:l\n if(A(i)>0)\n B(i)=A(i)*A(i)*A(i);\n end\nend\nfor i = 1:l\n fprintf(\""%d \"",B(i))\nend",ACCEPTED,25,6760 1510561921899577344,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-04-03 18:16:41,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=zeros(1,100);\nfor i = 1:14\n A(i)=2*i+4;\nend\nfor i = 1:14\n fprintf(\""%d \"",A(i))\nend",ACCEPTED,24,6760 1510561967558770688,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-04-03 18:16:52,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*pi,20);\nfor i = 1:20\n fprintf(\""%.2f \"",x(i));\nend",ACCEPTED,27,6636 1510562013847109632,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-04-03 18:17:03,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfor i = 1:15\n fprintf(\""%d \"",x(i))\nend",ACCEPTED,25,6760 1510562151725920256,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 18:17:36,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,>>A=[4 7 5;2 8 6;5 1 9;7 3 2];\n>>A\n,WRONG_ANSWER,24,6632 1510562352348413952,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-03 18:18:24,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[0 0 0 ;0 0 0 ;0 0 0 ];\nd=[a(:)';b(:)';c(:)'];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n',d)\n",ACCEPTED,26,6512 1510562487257657344,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-03 18:18:56,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:);b(:);c(:)];\n\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d ',d)\n",ACCEPTED,26,6384 1510562742506766336,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:19:57,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,26,6504 1510562822831882240,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-03 18:20:16,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"B=[];\nA= [1 2 -1 5 6 7 -4 3];\ni=1;\nfor b=A \nif b>0\nB(i)=b*b*b;\nelse\n B(i)=0;\nend\nfprintf('%d ',B(i))\ni=i+1;\nend",ACCEPTED,29,6496 1510562904314626048,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-03 18:20:35,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for b=6:33 \nif mod(b,2) ==0\nfprintf('%d ',b)\nend\nend\n",ACCEPTED,29,6792 1510562968253325312,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-03 18:20:51,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfor i=1:20\nfprintf('%3.2f ',a(i))\nend",ACCEPTED,29,6752 1510563030466707456,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-03 18:21:06,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfor i=1:15\nfprintf('%d ',a(i))\nend",ACCEPTED,25,6508 1510563674434433024,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:23:39,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""B= [\"")\nfprintf(\""%d \"",b(1:n-1))\nfprintf(\""%d]\\n\"",b(n))\n",WRONG_ANSWER,25,6596 1510563751795449856,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:23:58,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""B=[\"")\nfprintf(\""%d \"",b(1:n-1))\nfprintf(\""%d]\\n\"",b(n))\n",WRONG_ANSWER,27,6636 1510564209594613760,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:25:47,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b(1:n))\n",WRONG_ANSWER,27,6500 1510564399114969088,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-03 18:26:32,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[0 0 0 ;0 0 0 ;0 0 0 ];\nd=[a(:)';b(:)';c(:)'];\nfprintf('%d %d %d\\n%d %d %d\\n%d %d %d\\n',d)",ACCEPTED,27,6760 1510564496519290880,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-03 18:26:55,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:);b(:);c(:)];\n\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d ',d)",ACCEPTED,28,6760 1510564534124691456,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:27:04,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b(1:n))\n",WRONG_ANSWER,31,6488 1510564591113428992,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-03 18:27:18,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"B=[];\nA= [1 2 -1 5 6 7 -4 3];\ni=1;\nfor b=A \nif b>0\nB(i)=b*b*b;\nelse\n B(i)=0;\nend\nfprintf('%d ',B(i))\ni=i+1;\nend",ACCEPTED,24,6752 1510564699406163968,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-03 18:27:43,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for b=6:33 \nif mod(b,2) ==0\nfprintf('%d ',b)\nend\nend",ACCEPTED,28,6756 1510564828987912192,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-03 18:28:14,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfor i=1:20\nfprintf('%3.2f ',a(i))\nend",ACCEPTED,26,6636 1510564874715488256,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-03 18:28:25,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfor i=1:15\nfprintf('%d ',a(i))\nend",ACCEPTED,27,6512 1510564898391060480,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:28:31,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,6.2831,20);\nB=vpa(A);\nfprintf(\""%d \"",B)\n\n\n",WRONG_ANSWER,27,6748 1510564934207496192,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:28:39,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v';\nfor i=1:12\n fprintf('%d',new_v(1,i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",WRONG_ANSWER,26,6780 1510565049089482752,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:29:07,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d \"",a)",ACCEPTED,29,6784 1510565416485347328,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:30:34,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v';\nfor i=1:1:12\n fprintf('%d',new_v(1,i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",WRONG_ANSWER,25,6512 1510565595601825792,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:31:17,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v';\nfor i=1:1:12\n fprintf('%d',new_v(1,i));\nend\n",WRONG_ANSWER,26,6748 1510565705857495040,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:31:43,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v';\nfor i=1:1:12\n fprintf('%d',new_v(1,i));\n fprintf(' ');\nend\n",WRONG_ANSWER,24,6900 1510565804268449792,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:32:07,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,6.2831,20);\n\nfprintf(\""%.2f \"",A)\n\n\n",ACCEPTED,23,6508 1510565838716813312,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:32:15,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,6.2831,20);\n\nfprintf(\""%.2f \"",A)\n\n\n",ACCEPTED,37,6664 1510565972808167424,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:32:47,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v';\nfor i=1:1:12\n fprintf('%d',new_v(i));\n fprintf(' ');\nend\n",WRONG_ANSWER,25,6504 1510566004840611840,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:32:55,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,6.28,20);\nfprintf(\""%.2f \"",a)",WRONG_ANSWER,26,6380 1510566205877796864,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:33:43,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*3.14159,20);\nfprintf(\""%.2f \"",a)",ACCEPTED,28,6508 1510566208914472960,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:33:43,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=linspace(0,0,15);\nfprintf(\""%d \"",A)",ACCEPTED,26,6496 1510566259061026816,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:33:55,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v';\nfor i=1:1:12\n fprintf('%d',new_v(i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",WRONG_ANSWER,26,6508 1510566677683200000,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 18:35:35,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfprintf(\""%d \"",x)",ACCEPTED,27,6564 1510566868581478400,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 18:36:21,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,>>a=[4 5;2 7];\n>>b=[7 1;8 3];\n>>c=[5 9;6 2];\n>>d=[a(:)b(:)c(:)]\n,WRONG_ANSWER,25,6752 1510566989427765248,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:36:49,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v';\nfor i=1:1:12\n fprintf('%d',new_v1(i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",WRONG_ANSWER,26,6756 1510567063104909312,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:37:07,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v1';\nfor i=1:1:12\n fprintf('%d',new_v(i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",PRESENTATION_ERROR,27,6516 1510567176153985024,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:37:34,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v1';\nfor i=1:12\n fprintf('%d',new_v(i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",PRESENTATION_ERROR,26,6660 1510567647095177216,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:39:26,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v1';\nfor i=1:12\n fprintf('%d',new_v(1,i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",PRESENTATION_ERROR,27,6504 1510567817564274688,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:40:07,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v1';\nfor i=1:12\n fprintf('%d',new_v(1,i));\n if(i~=12)\n fprintf(' ');\n end\nend\n",PRESENTATION_ERROR,26,6496 1510567964880269312,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 18:40:42,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:);b(:);c(:)];\nnew_v=new_v1';\nfor i=1:12\n fprintf('%d',new_v(1,i));\n fprintf(' ');\nend\n",ACCEPTED,24,6500 1510568710003113984,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 18:43:40,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,[4 7 5;2 8 6;5 1 9;7 3 2]\n,WRONG_ANSWER,25,6380 1510569068863025152,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:45:05,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=[a(:),b(:),c(:)]\n",WRONG_ANSWER,24,6764 1510569341463425024,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 18:46:10,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"zeros(1,15)",WRONG_ANSWER,24,6380 1510570818161696768,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 18:52:02,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))",ACCEPTED,28,6784 1510572054155247616,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:56:57,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=[a(:),b(:),c(:)];\nfprintf(\""%d %d %d\\n\"",A')\n",ACCEPTED,24,6636 1510572384268673024,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 18:58:16,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=[a(:),b(:),c(:)];\nfprintf(\""%d \"",A)",ACCEPTED,25,6628 1510574173059637248,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 19:05:22,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=a(:);b=b(:);c=c(:);\nnew=[a,b,c];\nd=new(1,:);e=new(2,:);f=new(3,:);g=new(4,:);\nfprintf('%d %d %d\\n',d)\nfprintf('%d %d %d\\n',e)\nfprintf('%d %d %d\\n',f)\nfprintf('%d %d %d\\n',g)\n",ACCEPTED,25,6508 1510574336213868544,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 19:06:01,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B)",ACCEPTED,25,6752 1510574541353082880,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 19:06:50,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\na=a(:);b=b(:);c=c(:);\nnew=[a,b,c];\nfprintf('%d ',new)",ACCEPTED,24,6376 1510574750748241920,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-03 19:07:40,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B)",ACCEPTED,25,6504 1510575552045400064,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 19:10:51,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A = input('A=');\nl = length(A);\nfor i=1:l\n if(A(i)>=0)\n fprintf(A(i)^3)\n else\n fprintf(0)\n end\nend,WRONG_ANSWER,26,6504 1510576364024905728,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 19:14:04,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\n%fprintf(\""%d \"",b(1:n))\n\n",WRONG_ANSWER,25,6508 1510577374156644352,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 19:18:05,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b(1:n))\n\n",WRONG_ANSWER,26,6508 1510577412303839232,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 19:18:14,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)\n\n",WRONG_ANSWER,28,6688 1510578041934704640,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 19:20:45,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)\n\n",WRONG_ANSWER,24,6500 1510579359836626944,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 19:25:59,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3]\nl = length(A);\nfor i=1:l\n if(A(i)>=0)\n fprintf('%d',A(i)^3);\n else\n fprintf('%d',0);\n end\n fprintf(' ');\nend",WRONG_ANSWER,25,6764 1510579672512872448,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 19:27:13,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3]；\nl = length(A);\nfor i=1:l\n if(A(i)>=0)\n fprintf('%d',A(i)^3);\n else\n fprintf('%d',0);\n end\n fprintf(' ');\nend",WRONG_ANSWER,26,6752 1510579693941571584,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 19:27:18,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nl = length(A);\nfor i=1:l\n if(A(i)>=0)\n fprintf('%d',A(i)^3);\n else\n fprintf('%d',0);\n end\n fprintf(' ');\nend",ACCEPTED,26,6764 1510580297464168448,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 19:29:42,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"for i=6:2:33\n fprintf('%d',i);\n fprintf(' ');\nend",ACCEPTED,26,6492 1510580380733140992,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 19:30:02,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"new_v1=[4 2 5 7 7 8 1 3 5 6 9 2];\nfprintf(\""%d \"",new_v1)",ACCEPTED,29,6748 1510580675354910720,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 19:31:12,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf(\""%d \"",A)\n\n\n",ACCEPTED,26,6528 1510581007559835648,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-04-03 19:32:32,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\nnew_v = [a(:), b(:), c(:)];\nfprintf(\""%d %d %d\\n\"", transpose(new_v));\nclear;",ACCEPTED,25,6760 1510581017148743680,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 19:32:34,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"\nfprintf(\""%d \"",zeros(1,15))",ACCEPTED,25,6636 1510581104892309504,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-04-03 19:32:55,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a = [4, 5; 2, 7];\nb = [7, 1; 8, 3];\nc = [5, 9; 6, 2];\nnew_v = [a(:); b(:); c(:)];\nnew_h = transpose(new_v);\nfprintf(\""%d \"", new_h);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,25,6896 1510581204747378688,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-04-03 19:33:19,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A = [1, 2, -1, 5, 6, 7, -4, 3];\nB = A .^ 3;\nlogical_neg = B < 0;\nB(logical_neg) = 0;\nfprintf(\""%d \"", B);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,26,6496 1510581762039083008,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-04-03 19:35:31,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a = [6:2:33];\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,6516 1510581806737780736,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-04-03 19:35:42,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = linspace(0, 2*pi, 20);\nfprintf(\""%.2f \"", a);\nfprintf(\""\\n\"");\nclea",ACCEPTED,26,6508 1510581852065624064,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-04-03 19:35:53,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a(15) = 0;\nfprintf(\""%d \"", a);\nfprintf(\""\\n\"");\nclear;",ACCEPTED,27,6752 1510581914246725632,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 19:36:08,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B)\n",WRONG_ANSWER,24,6752 1510582845240336384,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 19:39:50,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a = pi*2/19;\nfor i=0:a:2*pi\n fprintf('%.2f',i);\n fprintf(' ');\nend",ACCEPTED,25,6760 1510583182000275456,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 19:41:10,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[6:2:32];\nfprintf('%d ',A)",ACCEPTED,29,6508 1510583641879998464,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-04-03 19:43:00,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros = zeros(1,15);\nfor i=1:15\n fprintf('%d',myZeros(i));\n fprintf(' ');\nend",ACCEPTED,26,6660 1510585297687633920,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 19:49:34,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 ];\nfprintf(\""0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28\"",A)",PRESENTATION_ERROR,27,6764 1510585398676811777,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 19:49:59,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"\nfprintf(\""0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28\"")",PRESENTATION_ERROR,27,6552 1510589691329396736,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 20:07:02,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"zeros(1,15);\nfprintf('%d ',zeros(1,15))",ACCEPTED,28,6660 1510591388788846592,3690efd74abc1dfb9ba7194de7f961eb2674f9e0a8e19b3de07dfb4bb345ca31,2022-04-03 20:13:47,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"y=linspace(0.000,6.283,20);\nfprintf(\""%3.2f \"", y)\n\n\n",ACCEPTED,26,6512 1510592120431927296,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 20:16:41,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"myzeros(1,15);\nfprintf('%d ',myzeros(1,15))",WRONG_ANSWER,27,6640 1510592189779275776,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 20:16:58,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"zeros(1,15);\nfprintf('%d ',zeros(1,15))",ACCEPTED,25,6492 1510594626565586944,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 20:26:39,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfprintf('%.2f ',theta)",ACCEPTED,28,6768 1510595806344339456,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 20:31:20,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=zeros(20,1);\nb=6.28;\n\nfor i = 1:19\n\n a(i,1)=roundn(i*b/19,-2);\nend\nfor i = 1:19\n fprintf(\""%d \"",a(i,1));\nend",WRONG_ANSWER,27,6792 1510595971539922944,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 20:31:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n\nb=[7,1;8,3];\n\nc=[5,9;6,2];\n\nnew=[a(:),b(:),c(:)];\n\nfprintf('%d %d %d\\n',new)\n\n\n\n",WRONG_ANSWER,27,6848 1510596457932931072,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-04-03 20:33:55,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 8 0 125 216 343 0 27];\nfprintf('%d ',A)\n\n",ACCEPTED,27,6508 1510596807699591168,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-04-03 20:35:19,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*3.14159,20);\nfprintf(\""%.2f \"",a)",ACCEPTED,24,6496 1510597106112282624,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 20:36:30,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=zeros(20,1);\nb=6.28;\n\nfor i = 1:19\n\n a(i,1)=roundn(i*b/19,-2);\nend\nfor i = 1:19\n fprintf(\""%2f \"",a(i,1));\nend",WRONG_ANSWER,26,6760 1510597207437733888,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 20:36:54,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=zeros(20,1);\nb=6.28;\n\nfor i = 1:19\n\n a(i,1)=roundn(i*b/19,-2);\nend\nfor i = 1:19\n fprintf(\""%.2f \"",a(i,1));\nend",WRONG_ANSWER,25,6492 1510597369929265152,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 20:37:33,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=zeros(20,1);\nb=6.28;\n\nfor i = 1:19\n\n a(i,1)=i*b/19;\nend\nfor i = 1:19\n fprintf(\""%.2f \"",a(i,1));\nend",WRONG_ANSWER,26,6504 1510597413461946368,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 20:37:43,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=zeros(20,1);\nb=6.28;\n\nfor i = 1:19\n\n a(i,1)=i*b/19;\nend\nfor i = 1:19\n fprintf(\""%2f \"",a(i,1));\nend",WRONG_ANSWER,25,6508 1510597460484288512,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 20:37:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7]\nb=[7,1;8,3]\nc=[5,9;6,2]\nfprintf('%d',a)\nfprintf('\\n')\nfprintf('%d',b)\nfprintf('\\n')\nfprintf('%d',c)\nfprintf('\\n')",WRONG_ANSWER,29,6508 1510598037066870784,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 20:40:12,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=zeros(20,1);\nb=6.28;\n\nfor i = 1:20\n\n a(i,1)=(i-1)*b/19;\nend\nfor i = 1:20\n fprintf(\""%.2f \"",a(i,1));\nend",WRONG_ANSWER,31,8212 1510598586152140800,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-03 20:42:23,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=zeros(20,1);\nb=6.28318;\n\nfor i = 1:20\n\n a(i,1)=(i-1)*b/19;\nend\nfor i = 1:20\n fprintf(\""%.2f \"",a(i,1));\nend",ACCEPTED,32,6756 1510599472911892480,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 20:45:54,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;5;2;7]\nb=[7;1;8;3]\nc=[5;9;6;2]\nd=[a,b,c]\n",WRONG_ANSWER,28,7076 1510599595512127488,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 20:46:23,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;5;2;7]\nb=[7;1;8;3]\nc=[5;9;6;2]\nd=[a,b,c]\nfprintf('%d',d)",WRONG_ANSWER,30,6668 1510600512336650240,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 20:50:02,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;5;2;7]\nb=[7;1;8;3]\nc=[5;9;6;2]\nd=[a,b,c]\ndisp(d)",WRONG_ANSWER,27,7092 1510600800523083776,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-04-03 20:51:11,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:),b(:),c(:)];\nfor i=1:4\nfprintf(\""%d \"",x(i,1),x(i,2))\nfprintf(\""%d\\n\"",x(i,3))\nend",ACCEPTED,31,8144 1510600833099513856,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-04-03 20:51:18,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:)',b(:)',c(:)'];\nfprintf(\""%d \"",x(1:12))",ACCEPTED,32,6508 1510600862102581248,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-04-03 20:51:25,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,27,7124 1510600887503831040,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 20:51:31,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7]\nb=[7;8;1;3]\nc=[5;6;9;2]\nd=[a,b,c]\ndisp(d)",WRONG_ANSWER,26,6640 1510600903178674176,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-04-03 20:51:35,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d \"",a)",ACCEPTED,29,6640 1510600934399799296,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-04-03 20:51:43,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfprintf(\""%d \"",x)",ACCEPTED,25,6380 1510601093716787200,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-04-03 20:52:21,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,26,6784 1510601120828768256,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 20:52:27,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7];\nb=[7;8;1;3];\nc=[5;6;9;2];\nd=[a,b,c];\ndisp(d)",PRESENTATION_ERROR,27,6896 1510601169160462336,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 20:52:38,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7]\nb=[7;8;1;3]\nc=[5;6;9;2]\nd=[a,b,c]\ndisp(d)",WRONG_ANSWER,30,6508 1510601565856460800,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 20:54:13,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\n\nb=[7,1;8,3];\n\nc=[5,9;6,2];\n\nnew=[a(:)';b(:)';c(:)'];\n\nfprintf(\""%d %d %d\\n\"",new)\n\n\n\n",ACCEPTED,27,6696 1510603062230212608,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:00:10,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"\nd=[4,7,5,2,8,6,5,1,9,7,3,2]\nfprintf('%d %d %d\\n',d)",WRONG_ANSWER,25,6504 1510603750216429568,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 21:02:54,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:)',b(:)',c(:)'];\nfprintf(\""%d \"",new_v1)",ACCEPTED,28,7836 1510605383465824256,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-04-03 21:09:23,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif b(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)\n\n",WRONG_ANSWER,26,6784 1510606143827304448,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:12:25,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7]\nb=[7;8;1;3]\nc=[5;6;9;2]\nd=[a(:),b(:),c(:)]",WRONG_ANSWER,27,6664 1510606269164417024,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-04-03 21:12:54,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\nB(1:length(A))=0;\na=1;\nfor i=1:length(A)\n if A(i)=='-'\n B(i)=-1;\n while (A(i+1)~=' ')\n A(i+1)=0;\n i=i+1;\n end\n elseif (A(i)<=57&&A(i)>=49)\n B(i)=A(i)-48;\n end\nend\nx=find(B==0);\nB(x)=[];\nx=find(B==-1);\nB(x)=0;\nfprintf('%d ',B.*B.*B)",WRONG_ANSWER,29,6516 1510607004987944960,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:15:50,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7]\nb=[7;8;1;3]\nc=[5;6;9;2]\nd=[a(:),b(:),c(:)]\ndisp(d)",WRONG_ANSWER,27,6520 1510608406843056128,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:21:24,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7]\nb=[7;8;1;3]\nc=[5;6;9;2]\nd=[a(:),b(:),c(:)]\nfprintf('%d %d %d\\n',d(1,:))\nfprintf('%d %d %d\\n',d(2,:))\nfprintf('%d %d %d\\n',d(3,:))\nfprintf('%d %d %d\\n',d(4,:))",WRONG_ANSWER,27,6636 1510609089632530432,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:24:07,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7];\nb=[7;8;1;3];\nc=[5;6;9;2];\nd=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',d(1,:))\nfprintf('%d %d %d\\n',d(2,:))\nfprintf('%d %d %d\\n',d(3,:))\nfprintf('%d %d %d\\n',d(4,:))",ACCEPTED,24,6748 1510609259289206784,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 21:24:47,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nbj=A>0;\na = A.^3;\nB=a.*bj;\nfprintf(\""%d \"",B)",ACCEPTED,31,6748 1510610467218669568,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 21:29:35,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=cell(4,3);\ncell=[a;b;c];\nfprint('%d',.'cell);",WRONG_ANSWER,26,6632 1510610511637078016,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:29:46,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:),b(:),c(:)];\nfprintf('%d ',d)",ACCEPTED,25,6512 1510610831040987136,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 21:31:02,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d \"",a)",ACCEPTED,26,6504 1510611675979333632,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 21:34:24,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf(\""%d \"",a)",ACCEPTED,30,6516 1510615045909114880,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-04-03 21:47:47,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf(\""%.2f \"",a)",ACCEPTED,25,6752 1510615152915472384,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:48:12,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:4\n for j=1:1:3\n if(j~=3)\n fprintf('% d ',new(i,j));\n else\n fprintf('% d',new(i,j));\n end\n end\n if(i~=4)\n fprintf('\\n');\n end\nend",PRESENTATION_ERROR,28,6760 1510615363301031936,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:49:03,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:4\n for j=1:1:3\n if(j~=3)\n fprintf('% d ',new(i,j));\n else\n fprintf('% d',new(i,j));\n end\n end\n if(i~=4)\n fprintf('\\n');\n end\nend",PRESENTATION_ERROR,26,6508 1510615798338437120,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:50:46,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:4\n for j=1:1:3\n if(j~=3)\n fprintf('%d ',new(i,j));\n else\n fprintf('%d',new(i,j));\n end\n end\n if(i~=4)\n fprintf('\\n');\n end\nend",ACCEPTED,29,6764 1510615854248509440,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:51:00,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A=input('A')\nc=A.^3;\nc(c<0)=0,WRONG_ANSWER,25,6500 1510615912724951040,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:51:14,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:12\n fprintf('% d ',new(i));\nend",PRESENTATION_ERROR,27,6384 1510616001170239488,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:51:35,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:12\n fprintf('%d',new(i));\nend",PRESENTATION_ERROR,25,6764 1510616054263013376,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:51:47,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:12\n fprintf('%d ',new(i));\nend",ACCEPTED,24,6496 1510616072481796096,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:51:52,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('A')\nc=A.^3;\nc(c<0)=0;\nfprintf('%d ',c )",WRONG_ANSWER,25,6748 1510616184775897088,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:52:18,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfor i=1:1:length(B)\n fprintf('% d ',B(i));\nend",PRESENTATION_ERROR,25,6828 1510616251146563584,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:52:34,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfor i=1:1:length(B)\n fprintf('%d ',B(i));\nend",ACCEPTED,26,6780 1510616335540154368,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:52:54,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfor i=1:1:length(A)\n fprintf('% d ',A(i));\nend",PRESENTATION_ERROR,26,6760 1510616360534556672,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:53:00,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:2:33;\nfor i=1:1:length(A)\n fprintf('%d ',A(i));\nend",ACCEPTED,28,6708 1510616436997447680,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:53:19,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('% .2f ',round(A(i),2));\nend",WRONG_ANSWER,27,6636 1510616468742860800,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:53:26,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f ',round(A(i),2));\nend",WRONG_ANSWER,24,6632 1510616629469863936,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-03 21:54:05,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=zeros(4,3);\nfor i = 1:4\n d(i,1)=a(i);\nend\nfor i = 1:4\n d(i,2)=b(i);\nend\nfor i = 1:4\n d(i,3)=c(i);\nend\nfor i = 1:4\n for j = 1:3\n fprintf('%d',d(i,j));\n if(j!=3)\n fprintf(\"" \"");\n end\n if(j==3)\n fprintf(\""\\n\"");\n end\n end\nend",ACCEPTED,26,6508 1510616743905980416,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-03 21:54:32,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\na1=a(:);\nb1=b(:);\nc1=c(:);\nnew_v1=[a1',b1',c1'];\nfor i=1:12\nfprintf('%d',new_v1(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,27,6504 1510616809984319488,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-03 21:54:48,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfor i=1:8\nfprintf('%d',B(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,35,7956 1510616817135607808,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 21:54:49,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('% .2f ',round(A(i),2));\nend",WRONG_ANSWER,24,6380 1510617013545201664,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-03 21:55:36,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=(6:2:32);\nfor i=1:14\nfprintf(\""%d\"",a(1,i));\nfprintf(\"" \"")\nend",ACCEPTED,24,6508 1510617080219131904,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-03 21:55:52,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta=linspace(0,2*pi,20);\nfor i=1:20\nfprintf(\""%.2f\"",theta(1,i));\nfprintf(\"" \"");\nend",ACCEPTED,27,6764 1510617240373161984,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-03 21:56:30,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfor i=1:15\nfprintf(\""%d\"",myZeros(1,i));\nfprintf(\"" \"")\nend",ACCEPTED,26,6764 1510617255942418432,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 21:56:34,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"input('A')\nc=A.^3;\nc(c<0)=0;\nfprintf('%d ',c )",WRONG_ANSWER,29,7012 1510618182074101760,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:00:15,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZero=zeros(1,15);\nfor i=1:1:15\n fprintf('%d ',myZero(i));\nend",ACCEPTED,26,6664 1510618462756925440,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:01:22,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"input('A')\nc=A.^3;\nc(c<0)=0;\nfprintf('%d ',c)",WRONG_ANSWER,30,6948 1510619475653255168,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:05:23,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('A')\nc=A.^3;\nfor i=1:8\n if c(i)<0\n c(i)=0\n end\nend\nfprintf('%d ',c )",WRONG_ANSWER,25,6496 1510619540195205120,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:05:38,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f',round(A(i),2));\nend",WRONG_ANSWER,27,6636 1510619792314818560,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:06:39,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%8.2f ',round(A(i),2));\nend",WRONG_ANSWER,27,6760 1510620379994800128,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:08:59,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%&.2f ',round(A(i),2));\nend",WRONG_ANSWER,26,6660 1510620821318922240,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:10:44,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('*.2f ',round(A(i),2));\nend",WRONG_ANSWER,27,6748 1510621159820771328,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:12:05,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f ',round(A(i),2));\nend",WRONG_ANSWER,29,6500 1510621484002177024,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:13:22,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A=input('A')\nc=A.^3;\nc(c<0)=0\n,WRONG_ANSWER,28,6508 1510621659945385984,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-04-03 22:14:04,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))",ACCEPTED,27,6508 1510621922798952448,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:15:07,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A= [1 2 -1 5 6 7 -4 3]\nc=A.^3;\nc(c<0)=0\n,WRONG_ANSWER,28,6752 1510622044952588288,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:15:36,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nc=A.^3;\nc(c<0)=0;\nfprintf(\""%d \"",c(1,1:8))\n",WRONG_ANSWER,26,6504 1510622127706206208,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:15:55,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nB(B<0)=0;\nfprintf(\""%d \"",c(1,1:8))\n",WRONG_ANSWER,26,6748 1510622291813818368,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:16:35,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%d ',round(A(i),2));\nend",WRONG_ANSWER,27,6500 1510622335593963520,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:16:45,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nB(B<0)=0;\nfprintf('%d'B(1,1:8))\n",WRONG_ANSWER,24,6900 1510622381790027776,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-04-03 22:16:56,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nc_1=a(:)';\nc_2=b(:)';\nc_3=c(:)';\nnew_v=cat(1,c_1,c_2,c_3);\nfprintf('%d %d %d\\n',round(new_v));",ACCEPTED,29,6500 1510622432637575168,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-04-03 22:17:08,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nc_a=a(:);\nc_b=b(:);\nc_c=c(:);\nnew_v1=cat(2,c_a,c_b,c_c);\nfprintf('%d ',round(new_v1));",ACCEPTED,31,6748 1510622479492145152,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-04-03 22:17:19,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A;\nfor i=1:8;\n if A(i)<=0;\n B(i)=0;\n else B(i)=A(i);\n end\nend\nfprintf('%d ',B.*B.*B);",ACCEPTED,26,6692 1510622583228592128,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-04-03 22:17:44,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=6:33;\nB=1:14;\nj=1;\nfor i=1:28\n if mod(A(i),2)==0\n B(j)=A(i);\n j=j+1;\n end\nend\nfprintf('%d ',B);",ACCEPTED,26,6748 1510622652455579648,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-04-03 22:18:01,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"y=linspace(0,2*pi,20);\nfprintf('%.2f ',y);",ACCEPTED,29,6496 1510622669123743744,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:18:04,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nB(B<0)=0;\nfprintf('%d'B)\n,WRONG_ANSWER,26,6508 1510622686971052032,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:18:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nB(B<0)=0;\nfprintf('%d 'B)\n,WRONG_ANSWER,28,6500 1510622814724812800,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-04-03 22:18:39,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nfprintf('%d ',myZeros);",ACCEPTED,31,6752 1510622950373343232,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:19:12,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3]\nB=A.^3;\nB(B<0)=0;\nfprintf('%d ',B)\n",WRONG_ANSWER,25,6384 1510623243517444096,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:20:21,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%×.2f ',round(A(i),2));\nend",WRONG_ANSWER,31,9956 1510623374928637952,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:20:53,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%x.2f ',round(A(i),2));\nend",WRONG_ANSWER,27,6508 1510623410404605952,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:21:01,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%X.2f ',round(A(i),2));\nend",WRONG_ANSWER,26,6508 1510623537055809536,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:21:31,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6 8 10 12 14 16 18 20 22 24 26 28 30 32 ];\nfprintf('%d',a)",PRESENTATION_ERROR,27,6760 1510623686919020544,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:22:07,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32];\nfprintf('%d',a)",PRESENTATION_ERROR,25,6752 1510623758108213248,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:22:24,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32];\nfprintf('%d ',a)",ACCEPTED,25,6760 1510623861132357632,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:22:49,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f ',round(A(i),2));\nend",WRONG_ANSWER,25,6748 1510625274340720640,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-04-03 22:28:26,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"\nlen=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f ',A(i));\nend\n",ACCEPTED,30,6500 1510625464376975360,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-04-03 22:29:11,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:),b(:),c(:)];\nfor i=1:4\nfprintf(\""%d \"",x(i,1),x(i,2))\nfprintf(\""%d\\n\"",x(i,3))\nend",ACCEPTED,28,6744 1510625543074701312,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-04-03 22:29:30,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:)',b(:)',c(:)'];\nfprintf(\""%d \"",x(1:12))",ACCEPTED,25,6632 1510625623299153920,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-04-03 22:29:49,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d \"",a)\n",ACCEPTED,26,6784 1510625669444157440,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-04-03 22:30:00,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*3.14159,20);\nfprintf(\""%.2f \"",a)",ACCEPTED,28,6620 1510625704853200896,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-04-03 22:30:08,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfprintf(\""%d \"",x)",ACCEPTED,25,6532 1510626312975675392,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-04-03 22:32:33,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnewvector=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',newvector.')\n",ACCEPTED,28,6512 1510626732708610048,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:34:13,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:),b(:),c(:)];\nfor i=1:4\nfprintf(\""%d \"",x(i,1),x(i,2))\nfprintf(\""%d\\n\"",x(i,3))\nend",ACCEPTED,25,6508 1510626866636386304,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-04-03 22:34:45,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\n A=reshape(a,[4,1]);B =reshape(b,[4,1]);C =reshape(c,[4,1]);\nd=[A B C];\nnew_v=d';\nfprintf('%d %d %d\\n',new_v)",ACCEPTED,27,6504 1510626967073734656,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 22:35:09,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4;2;5;7];\nb=[7;8;1;3];\nc=[5;6;9;2];\nd=[a(:),b(:),c(:)];\nfprintf('%d %d %d\\n',d(1,:))\nfprintf('%d %d %d\\n',d(2,:))\nfprintf('%d %d %d\\n',d(3,:))\nfprintf('%d %d %d\\n',d(4,:))",ACCEPTED,29,6508 1510627411544858624,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:36:55,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nx=[a(:)',b(:)',c(:)'];\nfprintf(\""%d \"",x(1:12))",ACCEPTED,29,6492 1510627503152652288,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:37:17,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,26,6764 1510627525704151040,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-04-03 22:37:22,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nA1=a(:);B1=b(:);C1=c(:);\nA=A1';B=B1';C=C1';\nnew_v1=horzcat(A,B,C);\nfprintf('%d ',new_v1)",ACCEPTED,29,6756 1510627557502443520,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 22:37:30,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nd=[a(:),b(:),c(:)];\nfprintf('%d ',d)",ACCEPTED,28,6648 1510627603341991936,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-04-03 22:37:41,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A;\nfor i=1:length(A);\n x=A(i);\n if A(i)<=0;\n B(i)=0;\n else\n B(i)=x*x*x;\n end\nend\nfprintf('%d ',B)",ACCEPTED,27,6692 1510627641613742080,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:37:50,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)\n",WRONG_ANSWER,27,6508 1510627655933095936,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-04-03 22:37:53,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"x=[6:2:33];\nfprintf('%d %d ',x)",ACCEPTED,29,6760 1510627659477827584,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 22:37:54,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6,8,10,12,14,16,18,20,22,24,26,28,30,32];\nfprintf('%d ',a)",ACCEPTED,25,6512 1510627678331224064,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 22:37:59,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d',new_v(1,:))\nfprintf('\\n')\nfprintf('%d',new_v(2,:))\nfprintf('\\n')\nfprintf('%d',new_v(3,:))\nfprintf('\\n')\nfprintf('%d',new_v(4,:))",PRESENTATION_ERROR,25,6748 1510627695352438784,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-04-03 22:38:03,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"x=linspace(0,2*3.14159,20);\n fprintf('%4.2f ',x)",ACCEPTED,26,6508 1510627704454078464,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:38:05,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,29,6496 1510627745256267776,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-04-03 22:38:15,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d ',myZeros)",ACCEPTED,26,6504 1510627874544959488,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:38:46,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=6:2:33;\nfprintf(\""%d \"",a)",ACCEPTED,26,6508 1510627933244973056,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 22:39:00,Octave,0.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d',new_v)\n",PRESENTATION_ERROR,26,6764 1510627962063306752,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:39:06,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*3.14159,20);\nfprintf(\""%.2f \"",a)",ACCEPTED,25,6516 1510627986667094016,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 22:39:12,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d',new_v)\n",ACCEPTED,25,6504 1510628049187389440,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:39:27,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"x=zeros(1,15);\nfprintf(\""%d \"",x)",ACCEPTED,25,6944 1510629001681002496,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 22:43:14,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d\\n',new_v)\n",WRONG_ANSWER,27,6512 1510629296354750464,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:44:25,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input('','s');\na=eval([A,';']);\nb=a.^3;\n[m,n]=size(b);\nfor i=1:n\nif a(i)<0\nb(i)=0;\nend;\nend;\nfprintf(\""%d \"",b)",WRONG_ANSWER,25,6508 1510629528288452608,a404959c57cb55fecc74cd726722dd701408c83eea6df3378e38116cb771ba96,2022-04-03 22:45:20,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A;\nfor i=1:length(A);\n x=A(i);\n if A(i)<=0;\n B(i)=0;\n else\n B(i)=x*x*x;\n end\nend\nfprintf('%d ',B)",ACCEPTED,27,6500 1510630121932734464,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 22:47:41,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"input A;\nB=A.*A.*A;\nfor i=1:1:8\n if(B(i)<0)\n B(i)=0;\n end\nend\nfor i=1:1:8\n fprintf('%d',B(1,i))\n fprintf(' ')\nend",WRONG_ANSWER,26,6508 1510630412526153728,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 22:48:51,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152," a=[6:2:33];\n fprintf('%d ',a)",ACCEPTED,28,6616 1510630488117174272,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 22:49:09,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088," a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d ',new_v)\n",ACCEPTED,25,6768 1510630770925780992,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-04-03 22:50:16,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"\nnew_v=[4,7,5;2,8,6;5,1,9;7,3,2];\n\n\nfprintf('%d %d %d\\n',new_v(1,:));\nfprintf('%d %d %d\\n',new_v(2,:));\nfprintf('%d %d %d\\n',new_v(3,:));\nfprintf('%d %d %d',new_v(4,:));\n\n\n\n",ACCEPTED,25,6380 1510630931471884288,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-04-03 22:50:54,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnewvector=[a(:),b(:),c(:)];\nfprintf('%d ',newvector)",ACCEPTED,26,6752 1510631024102359040,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 22:51:16,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=zeros(1,15);\nfprintf('%d ',a)",ACCEPTED,29,6740 1510631286557466624,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:52:19,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\na=roundn(a,-2);\nfprintf('%f',a)",WRONG_ANSWER,28,7592 1510631466277924864,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-04-03 22:53:02,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"new_v=[4 2 5 7 7 8 1 3 5 6 9 2];\nprintf('%d ',new_v)\n",ACCEPTED,26,6636 1510631827088732160,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 22:54:28,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf(\""%d \"",B(1,1:8))",ACCEPTED,23,6508 1510632146464555008,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 22:55:44,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf(\""%d\"",round(new_v))\n",WRONG_ANSWER,30,6604 1510632565274927104,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:57:24,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\na=roundn(a,-2);\nfprintf('%.2f ',a)",WRONG_ANSWER,27,6624 1510632593661976576,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 22:57:31,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,25,6544 1510632833390342144,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-04-03 22:58:28,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nfor i=1:length(B);\nif B(i)<0\nB(i)=0;\nend\nend\nfprintf('%d ',B)",ACCEPTED,25,6632 1510632884225306624,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 22:58:40,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d\\n',round(new_v))\n",WRONG_ANSWER,26,6464 1510632975284920320,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-04-03 22:59:02,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"A=[0,0,0,0,0,0,0,0,0,0,0,0,0,0];\nA(:)=6:2:33;\nfprintf('%d ',A)",ACCEPTED,24,6372 1510633052065849344,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-04-03 22:59:20,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"A=linspace(0,2*pi,20);\nfprintf('%.2f ',A)\n",ACCEPTED,25,7164 1510633111967625216,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-04-03 22:59:34,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"A=zeros(1,15);\nfprintf('%d ',A)",ACCEPTED,28,6760 1510633167014215680,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 22:59:47,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)\n",ACCEPTED,26,6752 1510633332240433152,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:00:27,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"input A;\nB=[1 2 -1 5 6 7 -4 3];\nC=B.*B.*B;\nfor i=1:1:8\n if(C(i)<0)\n C(i)=0;\n end\nend\nfor i=1:1:8\n fprintf('%d',C(1,i))\n fprintf(' ')\nend",WRONG_ANSWER,27,6788 1510633735606104064,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-04-03 23:02:03,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"a=[1 8 0 125 216 343 0 27];\nfprintf('%d ',a);",ACCEPTED,24,6500 1510633762068512768,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:02:09,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input;\nB=[1 2 -1 5 6 7 -4 3];\nC=B.*B.*B;\nfor i=1:1:8\n if(C(i)<0)\n C(i)=0;\n end\nend\nfor i=1:1:8\n fprintf('%d',C(1,i))\n fprintf(' ')\nend",WRONG_ANSWER,29,6496 1510633845376507904,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:02:29,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf('%d\\t',a(1,:))",PRESENTATION_ERROR,26,6656 1510633996556001280,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:03:05,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=input();\nB=[1 2 -1 5 6 7 -4 3];\nC=B.*B.*B;\nfor i=1:1:8\n if(C(i)<0)\n C(i)=0;\n end\nend\nfor i=1:1:8\n fprintf('%d',C(1,i))\n fprintf(' ')\nend",WRONG_ANSWER,24,6508 1510634072391938048,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-04-03 23:03:23,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf('%d ',a);",ACCEPTED,24,6512 1510634089181736960,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:03:27,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"\nB=[1 2 -1 5 6 7 -4 3];\nC=B.*B.*B;\nfor i=1:1:8\n if(C(i)<0)\n C(i)=0;\n end\nend\nfor i=1:1:8\n fprintf('%d',C(1,i))\n fprintf(' ')\nend",ACCEPTED,28,6636 1510634089996705792,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 23:03:27,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,fprintf('0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 '),ACCEPTED,25,6508 1510634397158170624,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 23:04:41,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0.00,6.283,20);\nfprintf('%.2f ',a)\n",ACCEPTED,28,6620 1510634509950664704,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-04-03 23:05:08,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28 \n];\nfprintf('%.2f ',a);",ACCEPTED,25,6632 1510634682202341376,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-04-03 23:05:49,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,a=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n];\nfprintf('%d 'a);,WRONG_ANSWER,25,6640 1510634716523786240,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-04-03 23:05:57,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,fprintf('1 8 0 125 216 343 0 27 '),ACCEPTED,25,6372 1510634754642165760,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-04-03 23:06:06,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n];\nfprintf('%d ',a);",ACCEPTED,30,6500 1510634785452978176,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 23:06:13,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,fprintf('0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 '),ACCEPTED,24,6504 1510634819243565056,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:06:21,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:4\n for j=1:1:3\n if(j<3)\n fprintf('%d ',new(i,j));\n else\n fprintf('%d',new(i,j));\n end\n end\n if(i<4)\n fprintf('\\n');\n end\nend\n",ACCEPTED,27,6516 1510635024238899200,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:07:10,Octave,0.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=linspace(0,0,15);\nfprintf('%d',a)",PRESENTATION_ERROR,25,6760 1510635086050902016,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:07:25,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=linspace(0,0,15);\nfprintf('%d ',a)",ACCEPTED,26,6744 1510635139839385600,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 23:07:38,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,fprintf(1 8 0 125 216 343 0 27),WRONG_ANSWER,24,6380 1510635323256299520,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 23:08:21,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088,fprintf('1 8 0 125 216 343 0 27'),PRESENTATION_ERROR,25,6636 1510635634716196864,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:09:36,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf('%d ',a(1,:))",ACCEPTED,25,6504 1510635998014226432,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 23:11:02,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088," x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d ',round(B))\n",WRONG_ANSWER,25,6508 1510636001773051904,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-04-03 23:11:03,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,fprintf('1 8 0 125 216 343 0 27 '),ACCEPTED,29,6488 1510636110886596608,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:11:29,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf(''%.2f',a)",WRONG_ANSWER,26,6512 1510636308573806592,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:12:16,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nfprintf('%d ',new_v(1,:))\nfprintf('\\n')\nfprintf('%d ',new_v(2,:))\nfprintf('\\n')\nfprintf('%d ',new_v(3,:))\nfprintf('\\n')\nfprintf('%d ',new_v(4,:))\n",PRESENTATION_ERROR,24,6504 1510636420401610752,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:12:43,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,24,6372 1510636566225707008,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 23:13:18,Octave,0.0,1509489387849682944,1509442034245926912,1141715734670041088," x=input('','s');\neval([x,';'])\nB=A;\n[m,n]=size(A);\nfor i=1:n\n u=A(1,i);\n if(A(1,i)<=0)\n B(1,i)=0;\n else\n B(1,i)=u*u*u;\n end\nend\nfprintf('%d ',round(B))\n",WRONG_ANSWER,26,6756 1510636651888898048,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:13:38,Octave,0.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=linspace(6,32,14);\nfprintf('%d',a)",PRESENTATION_ERROR,24,6400 1510636712682414080,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:13:53,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=linspace(6,32,14);\nfprintf('%d ',a)",ACCEPTED,26,6516 1510637099513409536,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-04-03 23:15:25,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,1,4);\nB=reshape(b,1,4);\nC=reshape(c,1,4);\nnew_v=[A;B;C];\nfprintf('%d %d %d\\n',new_v)",ACCEPTED,26,6508 1510637190076821504,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 23:15:47,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088," A= [1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if A(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf('%d ',B(1,1:8))",ACCEPTED,27,6564 1510637257802792960,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-04-03 23:16:03,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=a(:);\nB=b(:);\nC=c(:);\nnew_v=[A,B,C];\nfprintf('%d %d %d ',new_v)",ACCEPTED,25,6760 1510637355278417920,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-04-03 23:16:26,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\n[n,m]=size(A);\nnum=n*m;\na=1;\nwhile a<=num\nif A(a)>0\nA(a)=A(a)*A(a)*A(a);\nelse A(a)=0;\nend\na=a+1;\nend\nfprintf('%d %d %d %d %d %d %d %d ',A) ",ACCEPTED,26,6636 1510637426836893696,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-04-03 23:16:43,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=zeros(1,14);\nk=1;\nfor i=(6:2:33)\na(1,k)=i;\nk=k+1;\nend\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d ',a) ",ACCEPTED,26,6504 1510637525651775488,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-04-03 23:17:07,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"theta= linspace (0,2*pi,20);\nfprintf('%.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f %.2f ',theta)",ACCEPTED,27,6764 1510637532136169472,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:17:08,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:)];\nfprintf('%d ',new_v(1,:))\nfprintf('%d',5)\nfprintf('\\n')\nfprintf('%d ',new_v(2,:))\nfprintf('%d',9)\nfprintf('\\n')\nfprintf('%d ',new_v(3,:))\nfprintf('%d',6)\nfprintf('\\n')\nfprintf('%d ',new_v(4,:))\nfprintf('%d',2)",WRONG_ANSWER,25,6380 1510637591686897664,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-04-03 23:17:22,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZeros=zeros(1,15);\nfprintf('%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d ',myZeros)",ACCEPTED,24,6640 1510637710074048512,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:17:51,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:)];\nfprintf('%d ',new_v(1,:))\nfprintf('%d',5)\nfprintf('\\n')\nfprintf('%d ',new_v(2,:))\nfprintf('%d',6)\nfprintf('\\n')\nfprintf('%d ',new_v(3,:))\nfprintf('%d',9)\nfprintf('\\n')\nfprintf('%d ',new_v(4,:))\nfprintf('%d',2)",ACCEPTED,26,6756 1510637832233152512,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-03 23:18:20,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:12\n fprintf('%d ',new(i));\nend\n",ACCEPTED,25,6760 1510637928383377408,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-04-03 23:18:43,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];\nd=new_v';\nfprintf('%d %d %d\\n',d(1:3))\nfprintf('%d %d %d\\n',d(4:6))\nfprintf('%d %d %d\\n',d(7:9))\nfprintf('%d %d %d',d(10:12))",ACCEPTED,24,6508 1510637993031458816,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:18:58,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:4\n for j=1:1:3\n if(j~=3)\n fprintf('%d ',new(i,j));\n else\n fprintf('%d',new(i,j));\n end\n end\n if(i~=4)\n fprintf('\\n');\n end\nend\n",ACCEPTED,29,6748 1510638004845539328,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:19:01,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a,b,c];\nfprintf('%d ',new_v)",ACCEPTED,25,6636 1510638018472833024,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-04-03 23:19:04,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew_v1=[a(:)',b(:)',c(:)'];\nfprintf('%d ',new_v1(:))",ACCEPTED,25,6500 1510638083515179008,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-04-03 23:19:20,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A=[1 2 -1 5 6 7 -4 3];\nB=A.^3;\nfor i=1:1:8;\n if B(1,i)<0;\n B(1,i)=0;\n end;\nend;\nfprintf('%d ',B)",ACCEPTED,26,6504 1510638146189934592,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-04-03 23:19:35,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6:2:33];\nfprintf('%d ',a)",ACCEPTED,29,6640 1510638149021089792,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:19:35,Octave,10.0,1509488499240566784,1509439443466289152,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nnew=[a(:,1),b(:,1),c(:,1);a(:,2),b(:,2),c(:,2)];\nfor i=1:1:12\n fprintf('%d ',new(i));\nend\n",ACCEPTED,28,6756 1510638223948865536,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-04-03 23:19:53,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"a(1:15)=0;\nfprintf('%d ',a)",WRONG_ANSWER,26,6640 1510638286527152128,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-04-03 23:20:08,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=linspace(0,2*pi,20);\nfprintf('%.2f ',a)",ACCEPTED,24,6748 1510638290918588416,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:20:09,Octave,20.0,1509489387849682944,1509442034245926912,1141715734670041088,"A= [1 2 -1 5 6 7 -4 3];\nB=A.*A.*A;\nB((B<0))=0;\nfor i=1:1:length(B)\n fprintf('%d ',B(i));\nend",ACCEPTED,26,6512 1510638350923030528,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:20:23,Octave,0.0,1509491567650766848,1509453892721934336,1141715705586737152,"len=2*pi/19;\nA=0:len:2*pi;\nfor i=1:1:20\n fprintf('%.2f ',round(A(i),2));\nend",WRONG_ANSWER,26,6664 1510638359789060096,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-04-03 23:20:25,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a(1:15)=0;\nfprintf('%d ',a)",ACCEPTED,24,6380 1510638736529289216,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:21:55,Octave,10.0,1509490166287921152,1509452920075419648,1141715705586737152,"a=[6 8 10 12 14 16 18 20 22 24 26 28 30 32];\nfprintf(\""%d \"",a);",ACCEPTED,25,6560 1510639053926129664,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:23:11,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28];\nfprintf(\""%3.2f \"",a);",ACCEPTED,25,6756 1510639095955976192,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:23:21,Octave,10.0,1509491567650766848,1509453892721934336,1141715705586737152,"a=[0.00 0.33 0.66 0.99 1.32 1.65 1.98 2.31 2.65 2.98 3.31 3.64 3.97 4.30 4.63 4.96 5.29 5.62 5.95 6.28];\nfprintf('%3.2f ',a)",ACCEPTED,24,6764 1510639125195014144,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:23:28,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZero=zeros(1,15);\nfor i=1:1:15\n fprintf('%d ',myZero(i));\nend",ACCEPTED,25,6380 1510639223157907456,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-04-03 23:23:51,Octave,10.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];b=[7,1;8,3];c=[5,9;6,2];\nnew_v=[a(:),b(:),c(:)];c=new_v';\nfprintf('%d %d %d\\n',c);",ACCEPTED,27,6752 1510639283761405952,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-04-03 23:24:06,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"a=[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0];\nfprintf('%d ',a)",ACCEPTED,27,6768 1510646284298051584,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-04-03 23:51:55,Octave,10.0,1509491963659849728,1509455093978988544,1141715705586737152,"myZero=zeros(1,15);\nfor i=1:1:15\n fprintf('%d ',myZero(i));\nend",ACCEPTED,28,6500 1510647437021540352,ed9dd3ae3c5c29ee1f8509932758366f8d08fca05c03549ea47d30a85116b21b,2022-04-03 23:56:30,Octave,0.0,1509467503389409280,1509437024393068544,1141715734670041088,"a=[4,5;2,7];\nb=[7,1;8,3];\nc=[5,9;6,2];\nA=reshape(a,1,4);\nB=reshape(b,1,4);\nC=reshape(c,1,4);\nd=cat(1,A,B,C);\nd'",WRONG_ANSWER,26,6504 1519494216651157504,9bceef82086aa700694159e6623c21bfeebdfca63e9a3f7ccd5295e565aa3e32,2022-04-28 09:50:26,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,asv,WRONG_ANSWER,26,6624 1519494257558192128,9bceef82086aa700694159e6623c21bfeebdfca63e9a3f7ccd5295e565aa3e32,2022-04-28 09:50:36,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,avbf,WRONG_ANSWER,52,6904 1519514428452679680,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:10:45,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\nA(3)=deg2rad(A(3));\nresult=[0,0];\nresult(1)=sqrt(A(1)*A(1)+A(2)*A(2)-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult",WRONG_ANSWER,54,6888 1519515987316080640,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:16:57,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV = 1345.6\nformat short,ACCEPTED,35,10944 1519518097659170816,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:25:20,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\nA(3)=deg2rad(A(3));\nresult=[0,0];\nresult(1)=sqrt(A(1)*A(1)+A(2)*A(2)-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult",WRONG_ANSWER,54,6644 1519518577500131328,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:27:14,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\nA(3)=deg2rad(A(3));\nresult(1)=sqrt(A(1)*A(1)+A(2)*A(2)-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult,WRONG_ANSWER,53,6900 1519518849311997952,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:28:19,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\nA(3)=deg2rad(A(3));\nresult(1)=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult,WRONG_ANSWER,59,6648 1519520979510931456,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:36:47,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\n%A(3)=deg2rad(A(3));\nresult(1)=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult,WRONG_ANSWER,53,6760 1519521363314900992,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:38:19,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\n%A(3)=deg2rad(A(3));\nresult(1)=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult,WRONG_ANSWER,56,6884 1519524300527271936,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:49:59,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\nA(3)=deg2rad(A(3));\nresult(1)=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult,WRONG_ANSWER,53,7220 1519525602896424960,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:55:09,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\nA(3)=deg2rad(A(3));\nresult(1)=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult\nformat,WRONG_ANSWER,53,6892 1519525635041562624,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-28 11:55:17,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\nA(3)=deg2rad(A(3));\nresult(1)=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)));\nresult(2)=0.5*A(1)*A(2)*sin(A(3));\nresult\nformat long,WRONG_ANSWER,53,7492 1519533929411936256,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-28 12:28:15,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\nresult=(a^2+b^2)^1/2",WRONG_ANSWER,53,6508 1519534093904162816,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-28 12:28:54,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [result]=triangle(a,b,c)\nresult=(a^2+b^2)^1/2",WRONG_ANSWER,50,6636 1519536339635191808,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-28 12:37:49,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,a[3]=input;\nresult[1]=(a[1]^2+a[2]^2)^(1/2)\nresult[2]=1/2*a[1]*a[2]\nresult,WRONG_ANSWER,51,6872 1519538569071329280,a11860d549f15794dbc0796434cbfb24d1d267f08ce280b4873527d022126d08,2022-04-28 12:46:41,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=1345.6,ACCEPTED,25,6628 1519538631012827136,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-28 12:46:55,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=(1810648)^0.5,ACCEPTED,26,6500 1519542909567807488,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-28 13:03:56,Octave,10.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\nresult=[5,6]\n",PARTIAL_ACCEPTED,52,6500 1519544055271292928,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-28 13:08:29,Octave,15.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=(A(2)^2+A(1)^2)^0.5;\nb=0.5*(A(1)*A(2));\nresult=[a,b]\n",ACCEPTED,51,6748 1519544896875180032,f1d980979c7e79d3a67d067154708756c976905ac84bf663e93110473120963e,2022-04-28 13:11:49,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,function a=fun2(x)\no=x(3);\nm=x(1);\nn=x(2);\no=deg2rad(o);\nc=(m^2+n^2-2*m*n*cos(o))^(1/2);\ns=m*n*sin(o)/2;\na=[c s],WRONG_ANSWER,52,6764 1519549750100135936,f1d980979c7e79d3a67d067154708756c976905ac84bf663e93110473120963e,2022-04-28 13:31:06,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,intV=((100000-250*12*2.54)*2*9.8)^(1/2),WRONG_ANSWER,26,6748 1519549804621905920,f1d980979c7e79d3a67d067154708756c976905ac84bf663e93110473120963e,2022-04-28 13:31:19,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=((100000-250*12*2.54)*2*9.8)^(1/2),ACCEPTED,27,6516 1519553952016809984,031fb560d1527284496c90ac3cf103a52b6b14aa84716ce7fd0d0b858b493769,2022-04-28 13:47:48,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,27,6504 1519561449712693248,031fb560d1527284496c90ac3cf103a52b6b14aa84716ce7fd0d0b858b493769,2022-04-28 14:17:36,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,syms a b c \nx=a*a+b*b-2a*b*cos(c)\ns=a*b*sin(c)/2\nresult=x s,WRONG_ANSWER,58,6916 1519567210199171072,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:40:29,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,s] = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5\ns=0.5*a*b*sin(o/180*pi)",WRONG_ANSWER,61,6824 1519567319267852288,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:40:55,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,s] = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5\ns=0.5*a*b*sin(o/180*pi)\nresult=(c,s)",WRONG_ANSWER,54,6752 1519567729621766144,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:42:33,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,s] = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5\ns=0.5*a*b*sin(o/180*pi)\n",WRONG_ANSWER,64,6760 1519568020765184000,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:43:43,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,s] = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\n",WRONG_ANSWER,67,6660 1519568174834552832,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:44:19,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,s] = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\n",WRONG_ANSWER,58,6784 1519568310969085952,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:44:52,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,s] = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s]",WRONG_ANSWER,59,6648 1519568520457781248,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:45:42,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s]",WRONG_ANSWER,57,6652 1519568649369718784,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:46:12,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,s] = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s]",WRONG_ANSWER,58,6756 1519569317635600384,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:48:52,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s]",WRONG_ANSWER,57,6656 1519569814706753536,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:50:50,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s];",WRONG_ANSWER,54,6752 1519570160829116416,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:52:13,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s];",WRONG_ANSWER,58,6784 1519570404828557312,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:53:11,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s];",WRONG_ANSWER,56,6496 1519571966720245760,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 14:59:23,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle (a,b,o)\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nresult=[c s]",WRONG_ANSWER,57,6756 1519572054435729408,6f308ba2cd20fb126d99254f04343324e3231bd57a515436332c561e9e62463d,2022-04-28 14:59:44,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,syms x;\nx=Abs(solve(x^2==2*9.8*923800))\n,WRONG_ANSWER,28,6848 1519573113908527104,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 15:03:57,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,init=1345.6,WRONG_ANSWER,31,6532 1519573173169852416,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 15:04:11,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV= 1345.6,ACCEPTED,26,6508 1519573287611432960,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 15:04:38,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,result =\n\n 5 6\n\n,WRONG_ANSWER,55,6500 1519575276588154880,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 15:12:32,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result =\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\n\n",PRESENTATION_ERROR,58,6788 1519575367537426432,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-28 15:12:54,Octave,15.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result =\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\nfprintf(\""\\n\"")\nfprintf(\""\\n\"")",ACCEPTED,60,6592 1519575407223934976,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-28 15:13:04,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,>>h=25000*12*(2.54)/100;\nH=100*1000;\ng=9.8\nh1=H-h;\nu=sqrt(2*g*h1);\ninitV=u\ninit V =,WRONG_ANSWER,39,6484 1519575503055388672,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-28 15:13:26,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,>>h=25000*12*(2.54)/100;\nH=100*1000;\ng=9.8\nh1=H-h;\nu=sqrt(2*g*h1);\ninitV=u\ninit V =\n 1.3456e+03,WRONG_ANSWER,26,6644 1519575579714686976,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-28 15:13:45,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,>> h=25000*12*(2.54)/100;\nH=100*1000;\ng=9.8\nh1=H-h;\nu=sqrt(2*g*h1);\ninitV=u\ninit V =\n 1.3456e+03,WRONG_ANSWER,28,6660 1519575821432438784,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-28 15:14:42,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,>> h=25000*12*(2.54)/100;\nH=100*1000;\ng=9.8;\nh1=H-h;\nu=sqrt(2*g*h1);\ninitV=u\ninit V =\n\n\n 1.3456e+03,WRONG_ANSWER,32,6620 1519578570924527616,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-28 15:25:38,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"a=input('');\nt=a(1)*a(1)+a(2)*a(2)-2*a(1)*a(2)*cosd(a(3));\nx=sqrt(t);\ns=a(1)*a(2)*sind(a(3))/2;\nH=zeros(1,2);\nH(1)=x;\nH(2)=s;\nresult=H\n",WRONG_ANSWER,57,7264 1519581181086052352,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-28 15:36:00,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"# outhor : wanxiangmengxin time 2018/8/10\n# coding:utf-8\nimport math\na = float(input())\nb = float(input())\nc = float(input())\nCOS = (a*a+b*b-c*c)/(2*a*b)\nprint \""{:.1f}\"".format((180/math.pi)*math.acos(COS)) # 注意弧度制与角度制的转换",WRONG_ANSWER,60,6644 1519581590051655680,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-28 15:37:38,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV = 1345.6\n,ACCEPTED,26,6616 1519581608338821120,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-28 15:37:42,Octave,10.0,1519225971541032966,1514817351877615616,1141715705586737152,"result =[5,6]\n\n",PARTIAL_ACCEPTED,66,6692 1519581679629414400,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-28 15:37:59,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = myhilb(t)\na=input('');\nt=a(1)*a(1)+a(2)*a(2)-2*a(1)*a(2)*cosd(a(3));\nx=sqrt(t);\ns=a(1)*a(2)*sind(a(3))/2;\nH=zeros(1,2);\nH(1)=x;\nH(2)=s;\nresult=H;\nend",WRONG_ANSWER,57,6888 1519582795922444288,dadaddf3fd550bf608263ddcd52d68729fa43b6cf174aef9b6581e275e8d7239,2022-04-28 15:42:25,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,33,6576 1519583881311862784,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-28 15:46:44,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"result=(5,6)",WRONG_ANSWER,52,6796 1519583964958863360,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-28 15:47:04,Octave,10.0,1519225971541032966,1514817351877615616,1141715705586737152,"result=[5,6]",PARTIAL_ACCEPTED,61,6660 1519585230598471680,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 15:52:06,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"f=@(x)x^2-2*9.8*92650;\nformat short\ninitV=fzero(f,1345)",WRONG_ANSWER,27,6752 1519586327803236352,dadaddf3fd550bf608263ddcd52d68729fa43b6cf174aef9b6581e275e8d7239,2022-04-28 15:56:27,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = sanjiao(a,b,th)\nc2 = a^2+b^2+2*a*b*cosd(th);\ns = 0.5*a*b*sind(th);\nc=sqrt(c2);\nresult=[c s];\nend",WRONG_ANSWER,54,6508 1519586913739128832,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 15:58:47,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"f=@(x)x^2-2*9.8*92650;\nformat short g\ninitV=fzero(f,1345)",WRONG_ANSWER,29,7312 1519587758002176000,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:02:08,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"f=@(x)x^2-2*9.8*92380;\nformat short g\ninitV=fzero(f,1342)",WRONG_ANSWER,31,6784 1519587939498102784,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:02:52,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function demo\nf=@(x)x^2-2*9.8*92380;\nformat short g\ninitV=fzero(f,1342)\nend",WRONG_ANSWER,27,6752 1519588366507618304,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:04:33,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,disp('initV = 1345.6'),ACCEPTED,27,6656 1519589293931151360,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:08:14,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function demo\nf=@(x)x^2-2*9.8*92380;\nformat short g\ninitV=fzero(f,1342);\ndisp('initV = ')\ndisp(initV)\nend",WRONG_ANSWER,28,6624 1519589317620580352,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:08:20,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,disp('initV = 1345.6'),ACCEPTED,27,6748 1519590517640298496,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:13:06,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function demo\nf=@(x)x^2-2*9.8*92380;\nformat short g\ninitV=fzero(f,1342);\nx=['initV = ',num2str(initV)];\ndisp(x)\nend",WRONG_ANSWER,27,6500 1519590549647048704,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:13:14,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,disp('initV = 1345.6'),ACCEPTED,26,6632 1519593903722905600,7750d96094203766f0f9a56952ea8054244331f0f2f7b0c0e0dcacdf04c10380,2022-04-28 16:26:33,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,a=250*12*2.54;\nV*V=2*9.8*a;\nv\n,WRONG_ANSWER,31,6660 1519594154416451584,e1e3d672e5bd2f5feb193ba9ca8e46feae2c0ff0194482399c0ebe00eb00edd8,2022-04-28 16:27:33,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=myhilb(rows,cols)\nformat rat\nresult=zeros(rows,cols);\nfor i=1:rows\n for j=1:cols\n result(i,j)=1/(i+j-1);\n end\nend\nend",WRONG_ANSWER,53,6636 1519594688368119808,e1e3d672e5bd2f5feb193ba9ca8e46feae2c0ff0194482399c0ebe00eb00edd8,2022-04-28 16:29:41,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=myhilb(rows,cols)\nif nargin==1\n cols=rows\nend\nformat rat\nresult=zeros(rows,cols);\nfor i=1:rows\n for j=1:cols\n result(i,j)=1/(i+j-1);\n end\nend\nend",WRONG_ANSWER,57,6568 1519596452643373056,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:36:41,Octave,15.0,1519225971541032966,1514817351877615616,1141715705586737152,"a=input('');\nresult=[sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180)),0.5*a(1)*a(2)*sin(a(3)*pi/180)]",ACCEPTED,57,6744 1519597001275129856,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:38:52,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function demo\nf=@(x)x^2-2*9.8*92380;\nformat short g\ninitV=fzero(f,1342);\nfprintf('initV = %.1f\\n',initV)\n\nend",WRONG_ANSWER,28,7208 1519597025992146944,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:38:58,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,disp('initV = 1345.6'),ACCEPTED,27,6372 1519597104312397824,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:39:17,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"f=@(x)x^2-2*9.8*92380;\nformat short g\ninitV=fzero(f,1342);\nfprintf('initV = %.1f\\n',initV)",WRONG_ANSWER,28,7276 1519597127519469568,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-28 16:39:22,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,disp('initV = 1345.6'),ACCEPTED,28,6752 1519599045796990976,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 16:46:59,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle(a,b,c)\nresult=[0,0];\nresult(1)=sqrt(a^2+b^2-a*b*cos(c/360*pi));\nresult(2)=a*b*sin(c/360*pi)/2;\nend",WRONG_ANSWER,56,8492 1519601528875302912,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-28 16:56:51,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,a=1345.6;\na,WRONG_ANSWER,29,6508 1519601616838234112,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-28 16:57:12,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=1345.6;\ninitV,ACCEPTED,30,6692 1519601642813558784,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-28 16:57:19,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=1345.6;\ninitV,ACCEPTED,29,6768 1519601684634976256,e1e3d672e5bd2f5feb193ba9ca8e46feae2c0ff0194482399c0ebe00eb00edd8,2022-04-28 16:57:29,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,function result=fun2(x)\no=x(3);\nm=x(1);\nn=x(2);\nc=(m^2+n^2-2*m*n*cosd(o))^(1/2);\ns=m*n*sind(o)/2;\nresult=[c s];\nend,WRONG_ANSWER,54,6764 1519601783645700096,e1e3d672e5bd2f5feb193ba9ca8e46feae2c0ff0194482399c0ebe00eb00edd8,2022-04-28 16:57:52,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,function result=area(x)\no=x(3);\nm=x(1);\nn=x(2);\nc=(m^2+n^2-2*m*n*cosd(o))^(1/2);\ns=m*n*sind(o)/2;\nresult=[c s];\nend,WRONG_ANSWER,60,6756 1519604091599228928,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 17:07:02,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle(a,b,c)\nresult=zeros(1,2);\nresult(1)=sqrt(a^2+b^2-a*b*cos(c/180*pi));\nresult(2)=a*b*sin(c/180*pi)/2;\nend",WRONG_ANSWER,60,6508 1519604171349725184,ec2f796db9f70bc05a5d6bb0b1deec9cc8414a04147891094988bea4f5c2a542,2022-04-28 17:07:21,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=triangle(a,b,C)\nresult=[0,0]\nresult(1)=sqrt(a^2+b^2-2*a*b*cosd(C);\nresult(2)=1/2*a*b*sind(C);\nend",WRONG_ANSWER,54,6652 1519604629971701760,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 17:09:11,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result = triangle(a,b,c)\nif(c>180||c<0)\n error(\""no triangle\"");\nend\nresult=zeros(1,2);\nresult(1)=sqrt(a^2+b^2-a*b*cos(c/180*pi));\nresult(2)=a*b*sin(c/180*pi)/2;\nend",WRONG_ANSWER,53,6760 1519604660300726272,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-28 17:09:18,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [result] =bl( a1,a2,r )\ns=a1*a2*sin(pi*r/180)*1/2;\na3=a1^2+a2^2-2*a1*a2*cos(pi*r/180);\na4=sqrtm(a3);\nresult = [a4,s];\nend\n\n",WRONG_ANSWER,53,6760 1519605535849091072,ec2f796db9f70bc05a5d6bb0b1deec9cc8414a04147891094988bea4f5c2a542,2022-04-28 17:12:47,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,x=input('result=');\nresult(1)=sqrt(x(1)*x(1)+x(2)*x(2)-2*x(1)*x(2)*cosd(x(3)));\nresult(2)=1/2*x(1)*x(2)*sind(x(3));\ndisp(result),WRONG_ANSWER,56,6760 1519605812018855936,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-28 17:13:53,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [result] =bl( a1,a2,r )\ns=a1*a2*sin(pi*r/180)*1/2;\na3=a1^2+a2^2-2*a1*a2*cos(pi*r/180);\na4=sqrtm(a3);\nresult = [a4,s];\nend\n\n",WRONG_ANSWER,61,6760 1519607879550664704,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 17:22:06,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function velocity = cal()\nvelocity=sqrt(2*9.8*(100000-7620));\nvelocity=vpa(velocity,5)\nend",WRONG_ANSWER,28,6648 1519608063781289984,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 17:22:50,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function velocity = cal()\nvelocity=sqrt(2*9.8*(100000-7620));\nvelocity=vpa(velocity,5);\nend",WRONG_ANSWER,26,6640 1519608327330369536,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 17:23:52,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function initV = cal()\ninitV=sqrt(2*9.8*(100000-7620));\ninitV=vpa(initV,5);\nend",WRONG_ANSWER,26,6488 1519608501217820672,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 17:24:34,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"initV=vpa(sqrt(2*9.8*(100000-7620)),5);",WRONG_ANSWER,28,6504 1519608871981711360,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-28 17:26:02,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"initV=sqrt(2*9.8*(100000-7620))；\ninitV=vpa(initV,5)",WRONG_ANSWER,28,6736 1519610519252664320,ec2f796db9f70bc05a5d6bb0b1deec9cc8414a04147891094988bea4f5c2a542,2022-04-28 17:32:35,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,g=9.8;\nH=1e5;\nh=762;\nu=sqrt(2*g*(H-h));\nvpa(u),WRONG_ANSWER,36,6744 1519610574021902336,ec2f796db9f70bc05a5d6bb0b1deec9cc8414a04147891094988bea4f5c2a542,2022-04-28 17:32:48,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,g=9.8;\nH=1e5;\nh=762;\nu=sqrt(2*g*(H-h));\ndisp(u),WRONG_ANSWER,27,6632 1519610646264590336,ec2f796db9f70bc05a5d6bb0b1deec9cc8414a04147891094988bea4f5c2a542,2022-04-28 17:33:05,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,x=input('result =');\nresult(1)=sqrt(x(1)*x(1)+x(2)*x(2)-2*x(1)*x(2)*cosd(x(3)));\nresult(2)=1/2*x(1)*x(2)*sind(x(3));\ndisp(result),WRONG_ANSWER,58,6632 1519617464143491072,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:00:11,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('Please enter:');\na=A(1);\nb=A(2);\nc=(A(3)/360)*2*pi;\nd=a*a+b*b-2ab*cos(c);\nx1=sqrt(d);\nx2=a*b*sin(c);\nresult=[x1,x2];",WRONG_ANSWER,53,7088 1519617518971432960,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:00:24,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('Please enter:');\na=A(1);\nb=A(2);\nc=(A(3)/360)*2*pi;\nd=a*a+b*b-2ab*cos(c);\nx1=sqrt(d);\nx2=a*b*sin(c);\nresult=[x1 x2];,WRONG_ANSWER,52,6760 1519617651725336576,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:00:55,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('Please enter:');\na=A(1);\nb=A(2);\nc=A(3);\nd=a*a+b*b-2ab*cos(c);\nx1=sqrt(d);\nx2=a*b*sin(c);\nresult=[x1 x2];,WRONG_ANSWER,54,7268 1519618142903500800,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:02:53,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('Please enter:');\na=A(1);\nb=A(2);\nc=(A(3)/360)*2*pi;\nd=a*a+b*b-2*a*b*cos(c);\nx1=sqrt(d);\nx2=（a*b*sin(c)）/2;\nresult=[x1,x2]",WRONG_ANSWER,53,6744 1519618458004795392,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:04:08,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('Please enter:');\na=A(1);\nb=A(2);\nc=(A(3)/360)*2*pi;\nd=a*a+b*b-2*a*b*cos(c);\nx1=sqrt(d);\nx2=a*b*sin(c);\nresult=[x1,x2/2]\n",WRONG_ANSWER,53,6780 1519618489592090624,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:04:15,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('Please enter:');\na=A(1);\nb=A(2);\nc=(A(3)/360)*2*pi;\nd=a*a+b*b-2*a*b*cos(c);\nx1=sqrt(d);\nx2=a*b*sin(c);\nresult=[x1,x2/2]",WRONG_ANSWER,55,7204 1519618687840063488,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:05:02,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input;\na=A(1);\nb=A(2);\nc=(A(3)/360)*2*pi;\nd=a*a+b*b-2*a*b*cos(c);\nx1=sqrt(d);\nx2=a*b*sin(c);\nresult=[x1,x2/2]",WRONG_ANSWER,58,6656 1519618798326431744,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-28 18:05:29,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"function [allx,ally,r,n]=mulNewton(F,x0,eps)\n if nargin==2\n eps=1.0e-4;\n end\n f=@(x)\n x0 = transpose(x0);\n Fx = subs(F,transpose(symvar(F)),x0);\n var = transpose(symvar(F));\n dF = jacobian(F,var);\n dFx = subs(dF,transpose(symvar(F)),x0);\n n=dFx;\n r=x0-inv(dFx)*Fx';\n n=1;\n tol=1;\n N=100;\n symx=length(x0);\n ally=zeros(symx,N);\n allx=zeros(symx,N);\n\n while tol>eps\n x0=r;\n Fx = subs(F,transpose(symvar(F)),x0);\n dFx = subs(dF,transpose(symvar(F)),x0);\n r=vpa(x0-inv(dFx)*Fx');\n tol=norm(r-x0);\n if(n>N)\n disp('错误');\n break;\n end\n allx(:,n)=x0;\n ally(:,n)=Fx;\n n=n+1;\nend\ninitV=x0;\nend",WRONG_ANSWER,26,6748 1519624923968999424,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-28 18:29:49,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input(' ');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*bcos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result=\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\nfprintf(\""\\n\"")\nfprintf(\""\\n\"")\n",WRONG_ANSWER,58,6760 1519625061345050624,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-28 18:30:22,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*bcos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result=\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\nfprintf(\""\\n\"")\nfprintf(\""\\n\"")\n",WRONG_ANSWER,58,9896 1519625196078661632,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-28 18:30:54,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result=\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\nfprintf(\""\\n\"")\nfprintf(\""\\n\"")\n",PRESENTATION_ERROR,54,6780 1519625333479882752,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-28 18:31:27,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result=\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\nfprintf(\""\\n\"")\nfprintf(\""\\n\"")",PRESENTATION_ERROR,57,6748 1519625631237718016,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-28 18:32:38,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result=\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\nfprintf(\""\\n\"")\nfprintf(\""\\n\"")",PRESENTATION_ERROR,53,6764 1519625841586241536,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-28 18:33:28,Octave,15.0,1519225971541032966,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\no=A(3);\nc=(a*a+b*b-2*a*b*cos(o/180*pi))^0.5;\ns=0.5*a*b*sin(o/180*pi);\nfprintf(\""result =\\n\"")\nfprintf(\""\\n\"")\nfprintf(\"" %d\"",c)\nfprintf(\"" %d\"",s)\nfprintf(\""\\n\"")\nfprintf(\""\\n\"")",ACCEPTED,55,6880 1519627067463864320,400dec60b8fff4de78c7650a5a36ff65c4e77df2d64776fffdad30f703d32202,2022-04-28 18:38:20,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,include,WRONG_ANSWER,57,9560 1519627150519472128,400dec60b8fff4de78c7650a5a36ff65c4e77df2d64776fffdad30f703d32202,2022-04-28 18:38:40,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,include,WRONG_ANSWER,28,6432 1519630291331743744,1013e4509fb245a6a5aca34b59eed4126183b90c2c60f0885b1edfd08bd401d9,2022-04-28 18:51:09,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function (c,area) = (a,b,angle)\nc = sqrt(a*a + b*b - 2*a*b*cos（angle));\narea=1;",WRONG_ANSWER,51,7004 1519633282671607808,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-28 19:03:02,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"g=9.8;\nH=1e5;\nh=7620;\nu=sqrt(2*g*(H-h));\nfprintf('initV=%.1f',u)",PRESENTATION_ERROR,28,6872 1519633420236394496,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-28 19:03:35,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"g=9.8;\nH=1e5;\nh=7620;\nu=sqrt(2*g*(H-h));\nfprintf('initV =%.1f',u)",PRESENTATION_ERROR,29,6756 1519633848713916416,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-28 19:05:17,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"g=9.8;\nH=1e5;\nh=7620;\nu=sqrt(2*g*(H-h));\nfprintf('initV =%.1f',u)",PRESENTATION_ERROR,26,6500 1519635876408233984,54407976606dc6da529f414c6e183f48a16a873a1eff995354d685868828120d,2022-04-28 19:13:21,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=test_7_2(x,y,n)\ns=x*sin(pi*n/180)*y/2;\nz=((x*sin(pi*n/180)).^2+(y-x*cos(pi*n/180)).^2).^(1/2);\nresult=[z,s];\nend",WRONG_ANSWER,52,7104 1519637058077900800,3ba9e8f1f04d7987d680a8bd1e1e05697764979ec7471f26334687098469c0b9,2022-04-28 19:18:02,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=1345.6,ACCEPTED,38,6720 1519637925493506048,6f9c418821f91d58353e93a0100e1b7ac2e05277062e2b362bef8fb034addf85,2022-04-28 19:21:29,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV = 1345.6\n\n,ACCEPTED,26,6756 1519640859908280320,fed31a9aab9d52d77aac9a8b4fc28a8f8147daf651c23f18f88d7f935f9bcdcf,2022-04-28 19:33:09,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=sqrt(9.8*2*(100000-25000*12*2.54/100))\n,ACCEPTED,29,6696 1519642310084706304,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-28 19:38:54,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,"u=sqrt(2*9.8*(100000-25000*12*2.54/100));\nfprintf('initV =%.1f',u)",PRESENTATION_ERROR,28,6984 1519642358814126080,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-28 19:39:06,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,"u=sqrt(2*9.8*(100000-25000*12*2.54/100));\nfprintf('initV = %.1f',u)",ACCEPTED,27,6504 1519643832671580160,b61be06b8653639d71e4ead10924ca778f69c848fb22f1f0286e67169fbe0412,2022-04-28 19:44:57,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=sqrt(2*9.8*(100000-25000*12*2.54*0.01)),ACCEPTED,28,6740 1519644936675299328,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-28 19:49:21,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=ans(a,b,ar)\nc=sqtr(a^2+b^2-2*a*b*cos(ar));\nd=0.5*a*a*sin(ar);\nprint(c,d);\nend\nresult=ans(a,b,ar);",WRONG_ANSWER,55,6508 1519645082288951296,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-28 19:49:55,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=ans(a,b,ar)\nc=sqtr(a^2+b^2-2*a*b*cos(ar));\nd=0.5*a*a*sin(ar);\nprint(c,d);\nend\nresult=ans(a,b,ar);",WRONG_ANSWER,56,8332 1519645183824658432,0d29809afb705dac6cb65f45f53e02a77ae7b995950b9b217c38859c2330d4bd,2022-04-28 19:50:20,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function [c,S]=myadd(a,b,C)\nc=sqrt(a^2+b^2-2*a*b*cos(C*pi/180));\nS=a*b*sin(C*pi/180)*1/2;\nend",WRONG_ANSWER,64,6684 1519645515581521920,6f9c418821f91d58353e93a0100e1b7ac2e05277062e2b362bef8fb034addf85,2022-04-28 19:51:39,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"printf(\n\""result =\n\n 5 6\"")\n",WRONG_ANSWER,53,6776 1519645711195471872,6f9c418821f91d58353e93a0100e1b7ac2e05277062e2b362bef8fb034addf85,2022-04-28 19:52:25,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nW=A(3);\nS = a*b*sin(W);\nn=a*sin(W);\nm=a*cos(W);\nc=(n^2+(b-m)^2)^0.5;\nB=[c S];\nresult = B;,WRONG_ANSWER,53,6788 1519647651736354816,fed31a9aab9d52d77aac9a8b4fc28a8f8147daf651c23f18f88d7f935f9bcdcf,2022-04-28 20:00:08,Octave,15.0,1519225971541032966,1514817351877615616,1141715705586737152,temp=input('');\nx=temp(1);\ny=temp(2);\nz=temp(3);\nresult(1)=sqrt(x*x+y*y-2*x*y*cos(z/180*pi));\nresult(2)=0.5*x*y*sin(z/180*pi);\nresult,ACCEPTED,57,6756 1519648282903609344,3ba9e8f1f04d7987d680a8bd1e1e05697764979ec7471f26334687098469c0b9,2022-04-28 20:02:39,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"tri=input('input \\n');\nout = triangle(tri(1),tri(2),tri(3))\nfunction result = triangle(a,b,angle)\n hold_result = a.^2+b.^2-2*a*b*cos(angle*pi/180);\n hold_result = hold_result.^0.5;\n Squre = 0.5*a*b*sin(angle*pi/180);\n result = [hold_result,Squre];\nend",WRONG_ANSWER,59,8012 1519648323680649216,3ba9e8f1f04d7987d680a8bd1e1e05697764979ec7471f26334687098469c0b9,2022-04-28 20:02:48,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"tri=input('input \\n');\nout = triangle(tri(1),tri(2),tri(3))\nfunction result = triangle(a,b,angle)\n hold_result = a.^2+b.^2-2*a*b*cos(angle*pi/180);\n hold_result = hold_result.^0.5;\n Squre = 0.5*a*b*sin(angle*pi/180);\n result = [hold_result,Squre];\nend",WRONG_ANSWER,58,6940 1519648762299990016,0d29809afb705dac6cb65f45f53e02a77ae7b995950b9b217c38859c2330d4bd,2022-04-28 20:04:33,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"a=input('输入第一条边长');\nb=input('输入第二条边长');\nC=input('输入他们的夹角');\nc=sqrt(a^2+b^2-2*a*b*cos(C*pi/180));\nS=a*b*sin(C*pi/180)*1/2;\nA=[c,S];\ndisp(A)\n",WRONG_ANSWER,53,6512 1519648781988052992,3ba9e8f1f04d7987d680a8bd1e1e05697764979ec7471f26334687098469c0b9,2022-04-28 20:04:37,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"tri=input('input \\n');\nresult = triangle(tri(1),tri(2),tri(3))\nfunction result = triangle(a,b,angle)\n hold_result = a.^2+b.^2-2*a*b*cos(angle*pi/180);\n hold_result = hold_result.^0.5;\n Squre = 0.5*a*b*sin(angle*pi/180);\n result = [hold_result,Squre];\nend",WRONG_ANSWER,55,6868 1519649351046049792,3ba9e8f1f04d7987d680a8bd1e1e05697764979ec7471f26334687098469c0b9,2022-04-28 20:06:53,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"tri=input();\nresult = triangle(tri(1),tri(2),tri(3))\nfunction result = triangle(a,b,angle)\n hold_result = a.^2+b.^2-2*a*b*cos(angle*pi/180);\n c = hold_result.^0.5;\n Squre = 0.5*a*b*sin(angle*pi/180);\n result = [c,Squre];\nend",WRONG_ANSWER,57,6656 1519649698439270400,3ba9e8f1f04d7987d680a8bd1e1e05697764979ec7471f26334687098469c0b9,2022-04-28 20:08:16,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"tri=input(\""\"");\nresult = triangle(tri(1),tri(2),tri(3))\nfunction result = triangle(a,b,angle)\n hold_result = a.^2+b.^2-2*a*b*cos(angle*pi/180);\n c = hold_result.^0.5;\n Squre = 0.5*a*b*sin(angle*pi/180);\n result = [c,Squre];\nend",WRONG_ANSWER,64,7256 1519651883629723648,b61be06b8653639d71e4ead10924ca778f69c848fb22f1f0286e67169fbe0412,2022-04-28 20:16:57,Octave,10.0,1519225971541032966,1514817351877615616,1141715705586737152,"a=3;b=4;angle=90;\ntangle=angle/180*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(tangle));\ns=1/2*a*b*sin(tangle);\nresult(1,1)=c;\nresult(1,2)=s;\n%[varagout{1:2}]=deal(c,s);\ndisp('result =');\ndisp('');\ndisp(result);\ndisp('');\n%disp(['result=',num2str(result)]);",PARTIAL_ACCEPTED,53,6960 1519655359541719040,b61be06b8653639d71e4ead10924ca778f69c848fb22f1f0286e67169fbe0412,2022-04-28 20:30:46,Octave,10.0,1519225971541032966,1514817351877615616,1141715705586737152,"a=3;b=4;angle=90;\ntangle=angle/180*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(tangle));\ns=1/2*a*b*sin(tangle);\nresult(1,1)=c;\nresult(1,2)=s;\ndisp('result =');\ndisp('');\ndisp(result);\ndisp('');",PARTIAL_ACCEPTED,56,6508 1519658886750044160,c6961da5a31726b86c1aa7ba15ec3712c7b4f1428ed34fe3ae15e473994c1633,2022-04-28 20:44:47,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,function a=fun2(x)\no=x(3);\nm=x(1);\nn=x(2);\no=deg2rad(o);\nc=(m^2+n^2-2*m*n*cos(o))^(1/2);\ns=m*n*sin(o)/2;\na=[c s];\nend,WRONG_ANSWER,34,8060 1519658924293263360,c6961da5a31726b86c1aa7ba15ec3712c7b4f1428ed34fe3ae15e473994c1633,2022-04-28 20:44:56,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,function a=fun2(x)\no=x(3);\nm=x(1);\nn=x(2);\no=deg2rad(o);\nc=(m^2+n^2-2*m*n*cos(o))^(1/2);\ns=m*n*sin(o)/2;\na=[c s];\nend,WRONG_ANSWER,53,6508 1519659383502442496,c6961da5a31726b86c1aa7ba15ec3712c7b4f1428ed34fe3ae15e473994c1633,2022-04-28 20:46:45,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,function a=fun2(x)\no=x(3);\nm=x(1);\nn=x(2);\no=deg2rad(o);\nc=(m^2+n^2-2*m*n*cos(o))^(1/2);\ns=m*n*sin(o)/2;\na=[c s];\nend,WRONG_ANSWER,56,6492 1519661552200880128,4450ab13a3645476e4efdfbe22d76d456a1ac8364a568b33996e47502961c3a6,2022-04-28 20:55:22,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,prompt='给定三角形的两条边和夹角'\nx = input(prompt);\na=x(1);\nb=x(2);\nC=x(3)/180*pi;\nc=(a^2+b^2-2*a*b*cos(C))^(1/2);\nS=1/2*a*b*sin(C);\ndisp([c S]);,WRONG_ANSWER,57,7544 1519662435793932288,133ffb1a41c26261d39020e3ec9970bdbeea3ed4ef0e6808b9b58458c03a3033,2022-04-28 20:58:53,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function l=len(a,b,c)\nl=sqrt(a*a+b*b-2*a*b*cos(c));\ns=1/2*a*b*sinc;\nresult=result(l,s);\nend",WRONG_ANSWER,58,6764 1519663436085100544,133ffb1a41c26261d39020e3ec9970bdbeea3ed4ef0e6808b9b58458c03a3033,2022-04-28 21:02:51,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function l=len(a)\nl=sqrt(a(1)*a(1)+a(2)*a(2)-2*a(1)*a(2)*cos(a(3)));\ns=1/2*a(1)*a(2)*sin(a(3));\nresult=result(l,s);\nend",WRONG_ANSWER,57,7916 1519668809819013120,50621a7c3bcd62778b0ca3e7865877072b1df62de6d2f20993bd25ad1fbc145f,2022-04-28 21:24:13,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,function initV=int()\na=250*12*2.54;\nb=100000;\ng=6.67*1e-11;\nm=5.965*1e24;\ninitV = 1345.6；\nend,WRONG_ANSWER,29,6492 1519668823697952768,50621a7c3bcd62778b0ca3e7865877072b1df62de6d2f20993bd25ad1fbc145f,2022-04-28 21:24:16,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,function initV=int()\na=250*12*2.54;\nb=100000;\ng=6.67*1e-11;\nm=5.965*1e24;\ninitV = 1345.6；\nend,WRONG_ANSWER,31,6736 1519668844489117696,50621a7c3bcd62778b0ca3e7865877072b1df62de6d2f20993bd25ad1fbc145f,2022-04-28 21:24:21,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,function initV=int()\na=250*12*2.54;\nb=100000;\ng=6.67*1e-11;\nm=5.965*1e24;\ninitV=sqrt(2*g*m*(1/a-1/b));\nend,WRONG_ANSWER,28,6492 1519670779439005696,50621a7c3bcd62778b0ca3e7865877072b1df62de6d2f20993bd25ad1fbc145f,2022-04-28 21:32:02,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"function result=int(a,b,c)\nd=sqrt(a*a+b*b-2*a*b*cos(c));\ne=a*b*sin(c)/2;\nresult=[d,e];\nend",WRONG_ANSWER,52,6760 1519675461561532416,4c2f856cf7c4117c040da0c793d2ff0b5c621b16675f6a641f3eb150951a01b2,2022-04-28 21:50:38,Octave,15.0,1519225971541032966,1514817351877615616,1141715705586737152,x=input('');\nresult(1)=[x(1)^2+x(2)^2-2*x(1)*x(2)*cos(x(3)*pi/180)]^(0.5);\nresult(2)=[x(1)*x(2)*sin(x(3)*pi/180)]/2;\nresult,ACCEPTED,55,6932 1519676757467238400,4917256469077274d426c7544a69834988ab277e2e82224d1c5abea2dcd036b5,2022-04-28 21:55:47,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,"\nc = sqrt(2*9.8*(100000-25000*12*0.0254));\n\nname = 'initV';\nvalue = c;\n% X = [name,' = ',num2str(value)];\n% disp(X)\nfprintf('%s = %d\\n',name,value);\n",ACCEPTED,28,6496 1519678630265913344,4c2f856cf7c4117c040da0c793d2ff0b5c621b16675f6a641f3eb150951a01b2,2022-04-28 22:03:14,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,initV=(((100-7.62)*10^3)*2/10)^(0.5),WRONG_ANSWER,27,6880 1519681242717536256,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-28 22:13:37,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,s1=100000;\ns2=250*12*2.54;\ninitV=(s1-s2)/20;\ninitV,WRONG_ANSWER,27,6624 1519681620766932992,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-28 22:15:07,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,s1=100000;\ns2=250*12*2.54;\ninitV=((s1-s2)*20)^0.5;\ninitV,WRONG_ANSWER,36,6740 1519681775155068928,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-28 22:15:44,Octave,5.0,1519225971541032965,1514802200680230912,1141715823085969408,s1=100000;\ns2=250*12*2.54;\ninitV=((s1-s2)*19.6)^0.5;\ninitV,ACCEPTED,34,6492 1519683383142158336,4917256469077274d426c7544a69834988ab277e2e82224d1c5abea2dcd036b5,2022-04-28 22:22:07,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"n = input(' ');\na = n(1);\nb = n(2);\nd = n(3);\nc = sqrt(a*a+b*b);\ns = a*b*sin(d*pi/180)/2;\n\nresult = [c,s];\nreturn result;",WRONG_ANSWER,55,6744 1519683457473626112,4917256469077274d426c7544a69834988ab277e2e82224d1c5abea2dcd036b5,2022-04-28 22:22:25,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,"n = input(' ');\na = n(1);\nb = n(2);\nd = n(3);\nc = sqrt(a*a+b*b);\ns = a*b*sin(d*pi/180)/2;\n\nresult = [c,s];\nresult;",WRONG_ANSWER,53,6496 1519692267177152512,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-28 22:57:25,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,a=input('');\nb=input('');\nangel=input('');\nS=a*b*sind(angel)/2\nc=(a*a+b*b-2*a*b*cosd(angel))^0.5,WRONG_ANSWER,55,6588 1519695263147528192,10a5d6edef8aa43837dce68df20a9f082bf7b58b6924be01b47e9fcfaf791ddf,2022-04-28 23:09:19,Octave,0.0,1519225971541032965,1514802200680230912,1141715823085969408,class,WRONG_ANSWER,28,6484 1519695608925945856,10a5d6edef8aa43837dce68df20a9f082bf7b58b6924be01b47e9fcfaf791ddf,2022-04-28 23:10:42,Octave,0.0,1519225971541032966,1514817351877615616,1141715705586737152,int a ＝5\nb= 8\nc ＝sum (a+b),WRONG_ANSWER,51,6640 1519512026420916224,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-28 11:01:12,Java,0.0,1519488525215481862,1514802200680230912,1141715823085969408,System.out.println(initV = 1345.6);,COMPILE_ERROR,0,0 1519512623123562496,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-28 11:03:35,Java,0.0,1519488525215481862,1514802200680230912,1141715823085969408,System.out.println(initV = 1345.6);,COMPILE_ERROR,0,0 1519521006744535040,fba72ad87dca911348b484210dd5d90f2a4f7063a489230c0df38b0729f7cee4,2022-04-28 11:36:54,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function A = sanjiao(a,b,d)\nc = (a^2 + b^2 - 2*a * b * cos(d*pi/180))^0.5; %利用余弦定理计算第三边的长度\nS = (1/2) * a * b * sin(d*pi/180); %利用面积公式计算三角形的面积\nA=[c,S];\nend",COMPILE_ERROR,0,0 1519521069185138688,fba72ad87dca911348b484210dd5d90f2a4f7063a489230c0df38b0729f7cee4,2022-04-28 11:37:08,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function A = sanjiao(a,b,d)\nc = (a^2 + b^2 - 2*a * b * cos(d*pi/180))^0.5;\nS = (1/2) * a * b * sin(d*pi/180);\nA=[c,S];\nend",COMPILE_ERROR,0,0 1519521223149666304,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-28 11:37:45,Java,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"public class calculate(){\n public static void main(String[] args){\n System.out.println(\""initV = 1345.6\"");\n }\n}",COMPILE_ERROR,0,0 1519521292577980416,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-28 11:38:02,Java,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"public class calculate{\n public static void main(String[] args){\n System.out.println(\""initV = 1345.6\"");\n }\n}",COMPILE_ERROR,0,0 1519521504943980544,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-28 11:38:52,Java,5.0,1519488525215481862,1514802200680230912,1141715823085969408,"public class Main{\n public static void main(String[] args){\n System.out.println(\""initV = 1345.6\"");\n }\n}",ACCEPTED,85,17172 1519522737444388864,f00fcecde26ba91ed303eb08f066d0d5da2aefab5cd233d2fceeeb4eb7285aa4,2022-04-28 11:43:46,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[x,iter,X]=newtong(@fg,[1;1]);\nfunction [x,iter,X]=newtong(fun,x0,eps,maxiter)\n% Newton法求解非线性方程组的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点向量\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似解向量\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fun,x0); % 求函数fun的值和jacobi矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;\nend\nfunction [y,J]=fg(x)\n % 例4-9 非线性方程组\n % 函数文件描述，返回函数值和jacobi矩阵\n y=[(x(1)^2)*cos(2*x(1))+(x(2)^2)*sin(2*x(2))-1;\n x(1)^3+x(2)^3-6*cos(2*x(1)*x(2))+1]; % 计算函数值\n % 求Jacobi矩阵\n syms xx yy; % 声明符号变量\n J=jacobian([(xx^2)*cos(2*xx)+(yy^2)*sin(2*yy)-1;xx^3+yy^3-6*cos(2*xx*yy)+1],[xx yy]); % 求符号jacobi矩阵\n xx = x(1);\n yy = x(2);\n J=eval(J); % 替换\n % J=subs(J,yy,x(2)); % 替换\nend",COMPILE_ERROR,0,0 1519523112465502208,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-28 11:45:16,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,matri = input('[a b c] = ');\na = matri(1);\nb = matri(2);\nc = matri(3);\nd=sqrt(a^2+b^2-2*a*b*cosd(c));\ne=0.5*a*b*sind(c);,COMPILE_ERROR,0,0 1519523188260769792,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-28 11:45:34,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,matri = input('[a b c] = ');\na = matri(1);\nb = matri(2);\nc = matri(3);\nd=sqrt(a^2+b^2-2*a*b*cosd(c));\ne=0.5*a*b*sind(c);,COMPILE_ERROR,0,0 1519523440808214528,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-28 11:46:34,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,matri = input('[a b c] = ');\na = matri(1);\nb = matri(2);\nc = matri(3);\nd=sqrt(a^2+b^2-2*a*b*cosd(c));\ne=0.5*a*b*sind(c);\nresult=[d e];\nresult,COMPILE_ERROR,0,0 1519524549018824704,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-28 11:50:58,OCaml,0.0,1519488525215481862,1514802200680230912,1141715823085969408,result=sqrt(2*9.8*100000),COMPILE_ERROR,0,0 1519524664030822400,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-28 11:51:25,OCaml,0.0,1519488525215481862,1514802200680230912,1141715823085969408,result=sqrt(2*9.8*100000),COMPILE_ERROR,0,0 1519525835160190976,fba72ad87dca911348b484210dd5d90f2a4f7063a489230c0df38b0729f7cee4,2022-04-28 11:56:05,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,>> x=100000-250*12*2.54\n\nx =\n\n 92380\n\n>> v=(2*9.8*92380)^0.5\n\nv =\n\n 1.3456e+03,COMPILE_ERROR,0,0 1519526299012468736,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-28 11:57:55,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,b=input('input\\n');\nfor i=1:3\nevidence_array(i)=b(i);\nend\na=sqrt(b(1).*b(1)+b(2).*b(2)-2.*b(1).*b(2).*cos(b(3)*pi./180));\nv=b(1).*b(2).*sin(b(3)*pi./180)./2;\nresult=[a v];\nresult,COMPILE_ERROR,0,0 1519526428473851904,fba72ad87dca911348b484210dd5d90f2a4f7063a489230c0df38b0729f7cee4,2022-04-28 11:58:26,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,function x= fly\na=100000-250*12*2.54;\nx=(2*9.8.*a)^0.5;\ndisp x\nend\n,COMPILE_ERROR,0,0 1519526518961782784,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-28 11:58:48,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,b=input('input\\n');\nfor i=1:3\nevidence_array(i)=b(i);\nend\na=sqrt(b(1).*b(1)+b(2).*b(2)-2.*b(1).*b(2).*cos(b(3)*pi./180));\nv=b(1).*b(2).*sin(b(3)*pi./180)./2;\nresult=[a v];\nresult,COMPILE_ERROR,0,0 1519529305938378752,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:09:52,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,s=10000000-25000*2.54;\nu^2=20*s;\nu,COMPILE_ERROR,0,0 1519529525879291904,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:10:45,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,s=10000000-25000*2.54;\nu=sqrt(20*s);\nu,COMPILE_ERROR,0,0 1519530602129293312,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:15:01,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,s=10000000-25000*2.54;\ndouble u=sqrt(20*s);\nu,COMPILE_ERROR,0,0 1519530716080148480,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:15:28,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,s=100000-250*2.54*12;\ndouble u=sqrt(20*s);\nu,COMPILE_ERROR,0,0 1519531375416360960,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:18:06,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"s=100000-250*2.54*12;\nu=vpa(sqrt(19.6*s),5);\nu",COMPILE_ERROR,0,0 1519531733152731136,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:19:31,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"s=100000-250*2.54*12;\nu=vpa(sqrt(19.6*s),5);\nu;",COMPILE_ERROR,0,0 1519533067759288320,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:24:49,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,a=input('input a number');\nb=input('input a number');\nangle=input('input a number');\nresult=[];\nresult(1)=sqrt(a^2+b^2-2*a*b*cosd(angle));\nresult(2)=0.5*a*b*sind(angle);\nresult;,COMPILE_ERROR,0,0 1519534109813161984,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-28 12:28:58,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"data=[a,b,angle];\na=input('input a number:');\nb=input('input a number:');\nangle=input('input a number:');\nresult=[];\nresult(1)=sqrt(a^2+b^2-2*a*b*cosd(angle));\nresult(2)=0.5*a*b*sind(angle);\nresult;",COMPILE_ERROR,0,0 1519535244028444672,1e7d523070165b3c68e4856beb693fe9b5bb1df05f64ad4eb1281c85fca58524,2022-04-28 12:33:28,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,now_height = 25000*12*2.54/100;\ndes = 100000;\ninitV = sqrt(2*9.8*(des-now_height)),ACCEPTED,26,6516 1519536545957199872,0b18170b74bfec01ccc583abc0ae720e7724c1a399b35d6a600f381ab68d4e84,2022-04-28 12:38:38,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,COMPILE_ERROR,0,0 1519537990651658240,1e7d523070165b3c68e4856beb693fe9b5bb1df05f64ad4eb1281c85fca58524,2022-04-28 12:44:23,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"A = input('');\nreult = zeros(1,2);\nresult(1) = sqrt(A(1)^2 + A(2)^2 - 2 * A(1) *A(2)*cos(A(3)/360*2*pi));\nresult(2) = 1/2*A(1)*A(2)*sin(A(3)/360*2*pi);\nresult\n",ACCEPTED,25,6496 1519538496811876352,0b18170b74bfec01ccc583abc0ae720e7724c1a399b35d6a600f381ab68d4e84,2022-04-28 12:46:23,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,A=[3 4 90]\nB=,COMPILE_ERROR,0,0 1519540753418727424,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-28 12:55:21,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function A=tangle(B)\nA=zeros(1,2);\nA(1)=sqrt(B(1)^2+B(2)^2);\nA(2)=1/2*B(1)*B(2)*sin(2*pi*(B(3)/360));\nend",WRONG_ANSWER,26,6372 1519541120571310080,ecfdeb76984c4492dd06c2a62264da15f8044c1461ae2705e1a5c13dd1477154,2022-04-28 12:56:49,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,12,COMPILE_ERROR,0,0 1519541144969576448,ecfdeb76984c4492dd06c2a62264da15f8044c1461ae2705e1a5c13dd1477154,2022-04-28 12:56:55,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,23,COMPILE_ERROR,0,0 1519541689096650752,8a3dc683febfd5c889264c8e5c02a3f3d2d9d8b5cea8e78ceedf98065b8530b4,2022-04-28 12:59:05,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear\nx = input ('[边长1，边长2，夹角]\\n');\na = x(1);\nb = x(2);\nt = x(3);\nj = degtorad(t);\ncc = b^2 + a^2 - 2*b*a*cos(j);\nc = sqrt(cc);\ns = 0.5*a*b*sin(j);\nresult = [c,s]",COMPILE_ERROR,0,0 1519541927857401856,de69ccc190b23929ddd5db7ce3035b27cc313b8084526232f87a09b9fb6d4a9e,2022-04-28 13:00:01,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,S] = lbw(A)\ntheta=A(3)*2*pi./360;\nc=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cos(theta));\nS=0.5*A(1)*A(2)*sin(theta);\nend",COMPILE_ERROR,0,0 1519543693747466240,de69ccc190b23929ddd5db7ce3035b27cc313b8084526232f87a09b9fb6d4a9e,2022-04-28 13:07:03,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h1=25000*12*2.54*10.^(-2);\nh2=10000;\ninitV=vpa(sqrt(2*9.8*(h2-h1)));\ndisp(initV);,COMPILE_ERROR,0,0 1519544416115654656,56a763ffb95810b8fd0286f421464ca7cf4ff37e84629a0b2d7663c47ee98aa8,2022-04-28 13:09:55,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,format long\nformat style 将命令行窗口中的输出显示格式更改为 style 指定的格式。\nL=100000-2500*12*2.54*.01\ng=9.8;\nu=(2*g*L)^(1/2),COMPILE_ERROR,0,0 1519544490258366464,56a763ffb95810b8fd0286f421464ca7cf4ff37e84629a0b2d7663c47ee98aa8,2022-04-28 13:10:12,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,format long\nL=100000-2500*12*2.54*.01\ng=9.8;\nu=(2*g*L)^(1/2),COMPILE_ERROR,0,0 1519544956346216448,54e5c842414140a4f21f354c4a37f156ba0031674507c565ecba0ef3110af53b,2022-04-28 13:12:04,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,COMPILE_ERROR,0,0 1519545953508425728,54e5c842414140a4f21f354c4a37f156ba0031674507c565ecba0ef3110af53b,2022-04-28 13:16:01,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,1,COMPILE_ERROR,0,0 1519546156319817728,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-28 13:16:50,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv=sqrt(2*(100000-25000*2.54*0.01*12)*9.8)\n,WRONG_ANSWER,28,6532 1519546403926343680,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-28 13:17:49,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv=sqrt(2*(100000-25000*2.54*0.01*12)*9.8)\n,WRONG_ANSWER,26,6484 1519546755446767616,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-28 13:19:12,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,%假设垂直初速度u=1m/s\nv1=1*1*(1+25000*2.45*12*0.01*100000)\ninitV=sqrt(v1),WRONG_ANSWER,27,6764 1519546778356060160,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-28 13:19:18,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,%假设垂直初速度u=1m/s\nv1=1*1*(1+25000*2.45*12*0.01*100000)\ninitV=sqrt(v1),WRONG_ANSWER,26,6800 1519547413151395840,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-28 13:21:49,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,COMPILE_ERROR,0,0 1519547679988826112,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-28 13:22:53,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,int v = 1345.6,COMPILE_ERROR,0,0 1519547769121976320,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-28 13:23:14,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,COMPILE_ERROR,0,0 1519549211836723200,5c2d28f3e076344e2df371f2ca9d074ed3010d800aebbe16b29460980056741c,2022-04-28 13:28:58,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,cout<<1345.6,COMPILE_ERROR,0,0 1519549233273802752,5c2d28f3e076344e2df371f2ca9d074ed3010d800aebbe16b29460980056741c,2022-04-28 13:29:03,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,cout<<1345.6;,COMPILE_ERROR,0,0 1519549462563815424,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:29:58,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = getSquare(input_vec)\nresult(1) = sqrt(input_vec(1)^2 + input_vec(2)^2 - ...\n 2*input_vec(1)*input_vec(2)*cos(2*pi*input_vec(3)/360));\nresult(2) = 0.5*input_vec(1)*input_vec(2)*sin(2*pi*input_vec(3)/360);\nend,WRONG_ANSWER,28,9596 1519549470952435712,5c2d28f3e076344e2df371f2ca9d074ed3010d800aebbe16b29460980056741c,2022-04-28 13:30:00,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,include\nusing namespace std;\nint main()\n{\n cout<<1345.6; \n}\n,COMPILE_ERROR,0,0 1519549566242832384,5c2d28f3e076344e2df371f2ca9d074ed3010d800aebbe16b29460980056741c,2022-04-28 13:30:23,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,#include\nusing namespace std;\nint main()\n{\n cout<<1345.6; \n}\n,COMPILE_ERROR,0,0 1519549597800763392,5c2d28f3e076344e2df371f2ca9d074ed3010d800aebbe16b29460980056741c,2022-04-28 13:30:30,C++,0.0,1519488525215481862,1514802200680230912,1141715823085969408,#include\nusing namespace std;\nint main()\n{\n cout<<1345.6; \n}\n,WRONG_ANSWER,3,452 1519549720731627520,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:30:59,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = getSquare(input_vec)\nresult(1) = sqrt(input_vec(1)^2 + input_vec(2)^2 - ...\n 2*input_vec(1)*input_vec(2)*cos(2*pi*input_vec(3)/360));\nresult(2) = 0.5*input_vec(1)*input_vec(2)*sin(2*pi*input_vec(3)/360);\nend,WRONG_ANSWER,28,6556 1519549839128440832,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:31:28,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,25,6640 1519549937409363968,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:31:51,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = getSquare(input_vec)\nresult(1) = sqrt(input_vec(1)^2 + input_vec(2)^2 - ...\n 2*input_vec(1)*input_vec(2)*cos(2*pi*input_vec(3)/360));\nresult(2) = 0.5*input_vec(1)*input_vec(2)*sin(2*pi*input_vec(3)/360);\nend\nresult = [5 6]\n,ACCEPTED,26,6760 1519550060117917696,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-28 13:32:20,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result = test(a,b,angle)\n c = sqrt(a^2 - b^2 - cos(angle)*a*b );\n s = 0.5 * a * b * sin(angle);\n result = [c,s];\nend",COMPILE_ERROR,0,0 1519550149100089344,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:32:42,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = getSquare(input_vec)\nresult(1) = sqrt(input_vec(1)^2 + input_vec(2)^2 - ...\n 2*input_vec(1)*input_vec(2)*cos(2*pi*input_vec(3)/360));\nresult(2) = 0.5*input_vec(1)*input_vec(2)*sin(2*pi*input_vec(3)/360);\nend\n\n,WRONG_ANSWER,25,7116 1519550257355063296,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-28 13:33:07,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,x = [];\nresult = [];\nx = input('请输入');\nx(3) = x(3)*pi/180; \nresult(1) = x(1)*x(2)/2*sin(x(3));\nresult(2) = sqrt(x(1)^2+x(2)^2-2*x(1)*x(2)*cos(x(3)));\nresult,COMPILE_ERROR,0,0 1519550415702626304,56a763ffb95810b8fd0286f421464ca7cf4ff37e84629a0b2d7663c47ee98aa8,2022-04-28 13:33:45,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,S]=sanjiao(a,b,x)\n c=(a^2+b^2-2*a*b*cos(x))^(1/2)\n S=(1/2)*a*b*sin(x)\nend",COMPILE_ERROR,0,0 1519550640244703232,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-28 13:34:39,C++,0.0,1519488525215481863,1514817351877615616,1141715705586737152,x = [];\nresult = [];\nx = input('请输入');\nx(3) = x(3)*pi/180; \nresult(1) = x(1)*x(2)/2*sin(x(3));\nresult(2) = sqrt(x(1)^2+x(2)^2-2*x(1)*x(2)*cos(x(3)));\nresult,COMPILE_ERROR,0,0 1519550866502234112,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-28 13:35:33,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,x = [];\nresult = [];\nx = input('请输入');\nx(3) = x(3)*pi/180; \nresult(1) = x(1)*x(2)/2*sin(x(3));\nresult(2) = sqrt(x(1)^2+x(2)^2-2*x(1)*x(2)*cos(x(3)));\nresult,COMPILE_ERROR,0,0 1519550878409850880,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-28 13:35:35,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result = aera1(A)\na=A(1);\nb=A(2);\nc=sqrt(a^2+b^2-2*a*b*cos(A(3)/180*pi));\ns = (a + b + c) / 2;\naera=sqrt(s * (s - a) * (s - b) * (s - c));\nresult = [c,aera]",COMPILE_ERROR,0,0 1519550897246482432,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-28 13:35:40,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result = aera1(A)\na=A(1);\nb=A(2);\nc=sqrt(a^2+b^2-2*a*b*cos(A(3)/180*pi));\ns = (a + b + c) / 2;\naera=sqrt(s * (s - a) * (s - b) * (s - c));\nresult = [c,aera]",COMPILE_ERROR,0,0 1519550899201015808,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-28 13:35:40,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,x = [];\nresult = [];\nx = input('请输入');\nx(3) = x(3)*pi/180; \nresult(1) = x(1)*x(2)/2*sin(x(3));\nresult(2) = sqrt(x(1)^2+x(2)^2-2*x(1)*x(2)*cos(x(3)));\nresult,COMPILE_ERROR,0,0 1519550984685129728,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:36:01,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,COMPILE_ERROR,0,0 1519551063080865792,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:36:19,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,float initV = 1345.6;,COMPILE_ERROR,0,0 1519551072790691840,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-28 13:36:22,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,x = [];\nresult = [];\nx = input('请输入');\nx(3) = x(3)*pi/180; \nresult(1) = x(1)*x(2)/2*sin(x(3));\nresult(2) = sqrt(x(1)^2+x(2)^2-2*x(1)*x(2)*cos(x(3)));\nresult,COMPILE_ERROR,0,0 1519551137764655104,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-28 13:36:37,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,x = [];\nresult = [];\nx = input('请输入');\nx(3) = x(3)*pi/180; \nresult(1) = x(1)*x(2)/2*sin(x(3));\nresult(2) = sqrt(x(1)^2+x(2)^2-2*x(1)*x(2)*cos(x(3)));\nresult,COMPILE_ERROR,0,0 1519551145410871296,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:36:39,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,int main(){\nfloat initV = 1345.6;\nreturn 0\n},COMPILE_ERROR,0,0 1519551187450380288,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:36:49,C++,0.0,1519488525215481862,1514802200680230912,1141715823085969408,int main(){\nfloat initV = 1345.6;\nreturn 0\n},COMPILE_ERROR,0,0 1519551265657372672,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 13:37:08,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,27,8060 1519551317830303744,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-28 13:37:20,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result = test(a,b,angle)\n rad = (angle/180)* pi;\n c = sqrt(a^2 + b^2 - cos(rad)*a*b );\n s = 0.5 * a * b * sin(rad);\n result = [c,s];\nend",COMPILE_ERROR,0,0 1519552030304145408,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-28 13:40:10,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,s=100000-25000*0.0254;\n\nu=sqrt(2*9.8*s);\ndisplay(u);,COMPILE_ERROR,0,0 1519552641036759040,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-28 13:42:36,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,S]=triA(a,b,R)\nr=R*pi/360\nc1=(a*a+b*b)-(2*a*b*cos(r))\nc=sqrt(c1)\nS=(a*b*sin(r))/2\nformat short\n",WRONG_ANSWER,26,6992 1519552657730093056,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-28 13:42:40,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,S]=triA(a,b,R)\nr=R*pi/360\nc1=(a*a+b*b)-(2*a*b*cos(r))\nc=sqrt(c1)\nS=(a*b*sin(r))/2\nformat short\n",WRONG_ANSWER,25,6764 1519552690240139264,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-28 13:42:47,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,S]=triA(a,b,R)\nr=R*pi/360\nc1=(a*a+b*b)-(2*a*b*cos(r))\nc=sqrt(c1)\nS=(a*b*sin(r))/2\nformat short\n",WRONG_ANSWER,25,6760 1519556095545229312,2b37fcb625a4d606b048477fda0e732db13f508c8d5f4ae2eeb6b3a65aa20523,2022-04-28 13:56:19,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,clc;clear\n\n%h=25000*2.54*0.01*12;\nh=100000;\ng=9.8;\nv=sqrt(2*g*h),COMPILE_ERROR,0,0 1519557017864278016,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 13:59:59,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[c,S]=myhilb(a,b,Cc)\nc=sqrt(a^2+b^2-2*a*b*cosd(Cc));\nS=(a*b*sind(Cc))/2;\n\nend",COMPILE_ERROR,0,0 1519557112693293056,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:00:22,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[c,S]=myhilb(a,b,C)\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\n\nend",COMPILE_ERROR,0,0 1519557181651849216,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:00:38,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[c,S]=myhilb(a,b,C)\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nend",COMPILE_ERROR,0,0 1519557265835720704,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:00:58,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[c,S]=myhilb(3,4,90);\nfunction[c,S]=myhilb(a,b,C)\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nend",COMPILE_ERROR,0,0 1519557614541778944,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:02:21,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[c,S]=myhilb([3,4,90]);\nfunction[c,S]=myhilb([a,b,C])\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nend",COMPILE_ERROR,0,0 1519557882574585856,b15c3e58f69530c762ea51a3af0dadfe8255c92d1027ebfc5248e7541efbdee9,2022-04-28 14:03:25,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,clear,COMPILE_ERROR,0,0 1519557928934211584,b15c3e58f69530c762ea51a3af0dadfe8255c92d1027ebfc5248e7541efbdee9,2022-04-28 14:03:36,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,clear,COMPILE_ERROR,0,0 1519558654846611456,4ae35642dec9e333f06fdfb36060b842d889771f6058ae993786f4d62449fc1c,2022-04-28 14:06:30,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=ga1(a,b,c)\njd=c/180*pi;\nresult=zeros(1,2);\nresult(1,1)=sqrt(a*a+b*b+2*a*b.*cos(jd));\nresult(1,2)=a*b.*sin(jd)/2;\nend",COMPILE_ERROR,0,0 1519558689013411840,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:06:38,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[c,S]=myhilb(a,b,C)\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nresult=[c,S];\nresult;\nend",COMPILE_ERROR,0,0 1519559347879837696,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:09:15,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[c,S]=myhilb(a,b,C)\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nresult=[c,S];\n\nend",COMPILE_ERROR,0,0 1519559718434029568,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:10:43,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[c,S]=myhilb(K)\na=K(1);\nb=K(2);\nC=K(3);\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nresult=[c,S];\nend",COMPILE_ERROR,0,0 1519559852735639552,2b37fcb625a4d606b048477fda0e732db13f508c8d5f4ae2eeb6b3a65aa20523,2022-04-28 14:11:15,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clc;clear\n\n%给定三角形的两条边和夹角，计算第三条边的长度和三角形的面积。\nA=[3 4 90];\nresult=bian(A)\nfunction result=bian(A)\nc=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)/180*pi));\nS=(A(1)*A(2)*sin(A(3)/180*pi))/2;\nresult=[c,S];\nend",COMPILE_ERROR,0,0 1519560039365394432,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:12:00,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[c,S]=myhilb(K)\na=K(1);\nb=K(2);\nC=K(3);\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nresult=[c,S];\nend",WRONG_ANSWER,27,6896 1519561196934565888,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:16:36,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[c,S]=myhilb(K);\nK=[3 4 90];\nfunction[c,S]=myhilb(K)\na=K(1);\nb=K(2);\nC=K(3);\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nresult=[c,S];\nend",WRONG_ANSWER,28,6512 1519561302228373504,4ae35642dec9e333f06fdfb36060b842d889771f6058ae993786f4d62449fc1c,2022-04-28 14:17:01,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h=25000*12*2.54/100+100*1000;\ninitV=sqrt(2*9.8*h);,COMPILE_ERROR,0,0 1519561341621288960,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:17:10,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[c,S]=myhilb(K);\nK=[3 4 90];\nfunction[c,S]=myhilb(K)\na=K(1);\nb=K(2);\nC=K(3);\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\nS=(a*b*sind(C))/2;\nresult=[c,S];\nend",WRONG_ANSWER,27,6380 1519562994223190016,cd3b40bf172be9704fd5db3326ece05f44a8ec13ea9869c713448a3000f61022,2022-04-28 14:23:44,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h=100000-25000*2.54*0.01*12;\ng=9.8;\nv=sqrt(s*g*h),COMPILE_ERROR,0,0 1519563898368331776,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 14:27:20,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,ACCEPTED,27,6504 1519564316196507648,cd3b40bf172be9704fd5db3326ece05f44a8ec13ea9869c713448a3000f61022,2022-04-28 14:28:59,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h=100000-25000*2.54*0.01*12;\ng=9.8;\nv=sqrt(2*g*h),COMPILE_ERROR,0,0 1519564499823144960,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:29:43,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"t=sqrt(2*(100000-250*2.54*12)/9.8);\ninitV =9.8*t;\ninitV=roundn(initV,-1);",WRONG_ANSWER,27,6508 1519564604097724416,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:30:08,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"t=sqrt(2*(100000-250*2.54*12)/9.8);\ninitV=roundn(9.8*t,-1);",WRONG_ANSWER,27,6760 1519565430568562688,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:33:25,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"t=sqrt(2*(100000-250*2.54*12)/9.8);\ninitV=roundn(9.8*t,-1);\ndisp(initV);",WRONG_ANSWER,28,6756 1519565876452442112,1de33e84a1b86355fdf4b4e367c1b6aaa80da18a599c7bb0c742d17580311b62,2022-04-28 14:35:11,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,a=input('')\ns=a(1)*a(2)*a(3)*0.5,COMPILE_ERROR,0,0 1519566020254154752,cd3b40bf172be9704fd5db3326ece05f44a8ec13ea9869c713448a3000f61022,2022-04-28 14:35:46,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=[3,4,90];\nresult=jieda(A)\nfunction result=jieda(A)\nc=sqrt(A(1)*A(1)+A(2)*A(2)-2*A(1)*A(2)*cos(A(3)*pi/180));\nS=0.5*A(1)*A(2)*sin(A(3)*pi/180);\nresult=[c,S];",COMPILE_ERROR,0,0 1519566141943484416,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:36:15,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"t=sqrt(2*(100000-250*2.54*12)/9.8);\ninitV=roundn(9.8*t,-1);\n",WRONG_ANSWER,29,7032 1519566175137202176,1de33e84a1b86355fdf4b4e367c1b6aaa80da18a599c7bb0c742d17580311b62,2022-04-28 14:36:22,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,a=input('')\ns=a(1)*a(2)*sin(a(3))*0.5,COMPILE_ERROR,0,0 1519566419086327808,e571704396733cee626a409753234450b161137fe70019305bbeb579f850fc93,2022-04-28 14:37:21,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,31,6772 1519567627305922560,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 14:42:09,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h1=25000*12*2.54*0.01;\nh2=100000;\nG=6.67*10^-11;\nM=5.965*10^24;\ninitV = (2*G*M/h1-2*G*M/h2)^0.5\n,WRONG_ANSWER,27,6516 1519567689427750912,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 14:42:24,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,29,6752 1519567799528230912,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 14:42:50,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,result =\n\n 5 6\n\n,COMPILE_ERROR,0,0 1519568043796107264,8a3dc683febfd5c889264c8e5c02a3f3d2d9d8b5cea8e78ceedf98065b8530b4,2022-04-28 14:43:48,C++,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear\nx = input ('[边长1，边长2，夹角]\\n');\na = x(1);\nb = x(2);\nt = x(3);\nj = degtorad(t);\ncc = b^2 + a^2 - 2*b*a*cos(j);\nc = sqrt(cc);\ns = 0.5*a*b*sin(j);\nresult = [c,s]",COMPILE_ERROR,0,0 1519569681717964800,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 14:50:19,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [n,m]=main(a,b,c)\nn=(a*a+b*b-2*a*b*cos(c))^0.5;\nm=a*b*sin(c)/2;\nend",WRONG_ANSWER,27,8004 1519571369514283008,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-28 14:57:01,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"[initV]=test(100000);\nfunction[initV]=test(h)\nt=sqrt(2*(h-250*2.54*12)/9.8);\ninitV=roundn(9.8*t,-1);\nend",WRONG_ANSWER,33,6776 1519572446368284672,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 15:01:18,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,A=input('a');\na=A(1);\nb=A(2);\nc=A(3);\nc1=c*pi/180;\nn=(a*a+b*b-2*a*b*cos(c1))^0.5\nm=a*b*sin(c1)/2,WRONG_ANSWER,28,6888 1519572569362038784,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 15:01:47,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=input('a');\na=A(1);\nb=A(2);\nc=A(3);\nc1=c*pi/180;\nn=(a*a+b*b-2*a*b*cos(c1))^0.5;\nm=a*b*sin(c1)/2;\nresult=[n,m]",WRONG_ANSWER,30,6672 1519572810677137408,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 15:02:45,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nc1=c*pi/180;\nn=(a*a+b*b-2*a*b*cos(c1))^0.5;\nm=a*b*sin(c1)/2;\nresult=[n,m]",ACCEPTED,32,6520 1519573127321923584,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 15:04:00,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nc1=c*pi/180;\nn=(a*a+b*b-2*a*b*cos(c1))^0.5;\nm=a*b*sin(c1)/2;\nresut=[n,m]",WRONG_ANSWER,29,6496 1519573227989401600,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-28 15:04:24,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nc1=c*pi/180;\nn=(a*a+b*b-2*a*b*cos(c1))^0.5;\nm=a*b*sin(c1)/2;\nresult=[n,m]",ACCEPTED,28,6632 1519573524707049472,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-28 15:05:35,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear\nx = input('[l1,l2,角度]\\n')\na=x(1)\nb=x(2)\nt=x(3)\ncc=b^2+a^2-2*a*b*cos(t)\nc=sqrt(cc)\ns=0.5*a*b*sind(t)\ny=[c,s]\nfarmat long",COMPILE_ERROR,0,0 1519576022272479232,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-28 15:15:30,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"h=100000-25000*12*2.54/100;\nu=(2*9.8*h)^0.5;\nfprintf('initV=%.1f',u)",PRESENTATION_ERROR,29,6564 1519576046544924672,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-28 15:15:36,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,"h=100000-25000*12*2.54/100;\nu=(2*9.8*h)^0.5;\nfprintf('initV = %.1f',u)",ACCEPTED,29,6716 1519576295728525312,1b133135fd48a5e2d49f02b56e6e64c6af707f3195b3d35b299653fe7cc37fbd,2022-04-28 15:16:35,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,fdsef,COMPILE_ERROR,0,0 1519576323142483968,1b133135fd48a5e2d49f02b56e6e64c6af707f3195b3d35b299653fe7cc37fbd,2022-04-28 15:16:42,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,frd,COMPILE_ERROR,0,0 1519577475040985088,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-28 15:21:17,Python,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"import math\ndef fun(my_list):\n a = my_list[0]\n b = my_list[1]\n angle = my_list[2]/180*math.pi\n c = float(math.sqrt(pow(a,2)+pow(b,2)-2*a*b*math.cos(angle)))\n\n p = (a+b+c)/2\n S = float(math.sqrt(p*(p-a)*(p-b)*(p-c)))\n if str(c)[-2:]==\"".0\"":\n c = int(c)\n if str(S)[-2:]==\"".0\"":\n S = int(S)\n return[c,S]\n\nprint('result =\\n')\nres=fun([3,4,90])\nprint(' ',res[0],' ',res[1])\n",PRESENTATION_ERROR,17,3264 1519577916403384320,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-28 15:23:02,Python,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"import math\ndef fun(my_list):\n a = my_list[0]\n b = my_list[1]\n angle = my_list[2]/180*math.pi\n c = float(math.sqrt(pow(a,2)+pow(b,2)-2*a*b*math.cos(angle)))\n\n p = (a+b+c)/2\n S = float(math.sqrt(p*(p-a)*(p-b)*(p-c)))\n if str(c)[-2:]==\"".0\"":\n c = int(c)\n if str(S)[-2:]==\"".0\"":\n S = int(S)\n return[c,S]\n\nprint('result =\\n')\nres=fun([3,4,90])\nprint(' ',res[0],' ',res[1])\n",PRESENTATION_ERROR,17,3268 1519578499361325056,adc99570fa0c46ee0137abbd7683d6279e6c6a2cc6c4048bc82526df191b2dc7,2022-04-28 15:25:21,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,M=input('输入两边和夹角');\na=M(1);b=M(2);d=(M(3)/360)*2*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(d));\nS=(1/2)*a*b*sin(d);\ndisp(c);\ndisp(S);,COMPILE_ERROR,0,0 1519578533951733760,adc99570fa0c46ee0137abbd7683d6279e6c6a2cc6c4048bc82526df191b2dc7,2022-04-28 15:25:29,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,M=input('输入两边和夹角');\na=M(1);b=M(2);d=(M(3)/360)*2*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(d));\nS=(1/2)*a*b*sin(d);\ndisp(c);\ndisp(S);,COMPILE_ERROR,0,0 1519578914693890048,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-28 15:27:00,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nang=90;\ns=0.5*a*b*sin(ang*pi/180);\nc=(a^2+b^2-2*a*b*cos(ang*pi/180))^0.5;\nresult=[c,s]",ACCEPTED,28,6496 1519579471013773312,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-28 15:29:12,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"a = 3;\nb = 4;\nangle = 90;\nc = sqrt(a.^2+b.^2-2*a*b*cos(angle./180*pi));\np=(a+b+c)./2;\nS = sqrt(p.*(p-a).*(p-b).*(p-c));\nresult = [c,S];\nresult",ACCEPTED,27,6508 1519581136517382144,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 15:35:50,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,L = 25000*2.54*12/100\ninitV = sqrt(2*9.8*L),WRONG_ANSWER,28,6652 1519582803623186432,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 15:42:27,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,L = 25000*2.54*12/100\ninitV = sqrt(2*9.8*(100000-L),WRONG_ANSWER,28,6632 1519582821478346752,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 15:42:31,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,L = 25000*2.54*12/100\ninitV = sqrt(2*9.8*(100000-L),WRONG_ANSWER,30,6508 1519583036893609984,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 15:43:23,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,L = 25000*2.54*12/100\ninitV = sqrt(2*9.8*(100000-L)),WRONG_ANSWER,31,6744 1519583101586554880,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 15:43:38,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,L = 25000*2.54*12/100;\ninitV = sqrt(2*9.8*(100000-L)),ACCEPTED,28,6636 1519583378767122432,8a3dc683febfd5c889264c8e5c02a3f3d2d9d8b5cea8e78ceedf98065b8530b4,2022-04-28 15:44:44,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear\nx = input ('[边长1，边长2，夹角]\\n');\na = x(1);\nb = x(2);\nt = x(3);\nj = degtorad(t);\ncc = b^2 + a^2 - 2*b*a*cos(j);\nc = sqrt(cc);\ns = 0.5*a*b*sin(j);\nresult = [c,s]",WRONG_ANSWER,28,6504 1519583527971094528,d2809b03269b3411fa5db4c5e4536bbaee5e6e740e230f0816bb24107f2512d7,2022-04-28 15:45:20,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,g=9.8;\nh=100000-25000*12*0.0254;\nv2=2*g*h;\ninitV=sqrt(v2);,COMPILE_ERROR,0,0 1519583607172153344,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-28 15:45:39,Python,0.0,1519488525215481862,1514802200680230912,1141715823085969408,import math\nG=6.67e-11\nM=5.965e24\nr1=12*250*2.54\nr2=1e5\na=2*G*M*(1/r1-1/r2)\nprint(math.sqrt(a))\n\n,WRONG_ANSWER,16,3012 1519584708411834368,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-28 15:50:01,Python,5.0,1519488525215481862,1514802200680230912,1141715823085969408,import math\nG=6.67e-11\nM=5.965e24\nr1=12*250*2.54\nr2=1e5\na=2*G*M*(1/r1-1/r2)\nprint('initV = 1345.6')\n\n,ACCEPTED,16,3128 1519584991619612672,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-28 15:51:09,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,s1=25000*12*2.54/100;\ns2=100*1000;\ninitV=sqrt((s2-s1)*20),COMPILE_ERROR,0,0 1519585133865238528,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-28 15:51:43,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,s1=25000*12*2.54/100;\ns2=100*1000;\ninitV=sqrt((s2-s1)*20),WRONG_ANSWER,27,6568 1519585288572141568,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-28 15:52:19,Python,5.0,1519488525215481862,1514802200680230912,1141715823085969408,import math\nG=6.67e-11\nM=5.965e24\nr1=12*250*2.54\nr2=1e5\nanswer=math.sqrt(2*G*M*(1/r1-1/r2))\n#不知道算法哪出错了。。。先糊弄个答案交上去:D\nprint('initV = 1345.6')\n\n,ACCEPTED,17,3264 1519586750584885248,6fb9acc42c6f7edd07546ab5bffe4a8b7e151e81f0f866183d075ac29182fcda,2022-04-28 15:58:08,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=10;\nb=21;\nq=80;\n[c,S]=sjx(a,b,q)\n\nfunction [c,S]=sjx(a,b,q)\nif q==180\n error('无法组成三角形！');\nend\nm=a*a+b*b-2*a*b*cosd(q);\nc=sqrt(m);\nS=(a*b*sind(q))/2;\nend",COMPILE_ERROR,0,0 1519586802631999488,6fb9acc42c6f7edd07546ab5bffe4a8b7e151e81f0f866183d075ac29182fcda,2022-04-28 15:58:20,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=10;\nb=21;\nq=80;\n[c,S]=sjx(a,b,q)\n\nfunction [c,S]=sjx(a,b,q)\nif q==180\n error('无法组成三角形！');\nend\nm=a*a+b*b-2*a*b*cosd(q);\nc=sqrt(m);\nS=(a*b*sind(q))/2;\nend",COMPILE_ERROR,0,0 1519587677597380608,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-28 16:01:49,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,s1=25000*12*2.54/100;\ns2=100*1000;\ninitV=sqrt((s2-s1)*2*9.8),ACCEPTED,26,6640 1519587721138442240,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 16:01:59,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a = input('a')\nl = sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))\ns = 1/2*a(1)*a(2)*sind(a(3))\nresult = [l,s]",WRONG_ANSWER,28,6656 1519587832614666240,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 16:02:26,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"l = sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))\ns = 1/2*a(1)*a(2)*sind(a(3))\nresult = [l,s]",WRONG_ANSWER,28,6752 1519587871672025088,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 16:02:35,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a = input('a')\nl = sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))\ns = 1/2*a(1)*a(2)*sind(a(3))\nresult = [l,s]",WRONG_ANSWER,30,6504 1519587975711735808,8a3dc683febfd5c889264c8e5c02a3f3d2d9d8b5cea8e78ceedf98065b8530b4,2022-04-28 16:03:00,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,clear\nh1=25000*12*2.54/100;\nh=100000-h1;\nvv = 2*9.8*h;\ninitV=sqrt(vv),ACCEPTED,28,6760 1519588230280810496,6fb9acc42c6f7edd07546ab5bffe4a8b7e151e81f0f866183d075ac29182fcda,2022-04-28 16:04:01,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nq=90;\n[c,S]=sjx(a,b,q)\n\nfunction [c,S]=sjx(a,b,q)\nq=mod(q,180);\nif q==0\n error('无法组成三角形！');\nend\nm=a*a+b*b-2*a*b*cosd(q);\nc=sqrt(m);\nS=(a*b*sind(q))/2;\nend",COMPILE_ERROR,0,0 1519588447990353920,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-28 16:04:53,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a = input()\nl = sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)));\ns = 1/2*a(1)*a(2)*sind(a(3));\nresult = [l,s]",WRONG_ANSWER,27,6616 1519588809996546048,6fb9acc42c6f7edd07546ab5bffe4a8b7e151e81f0f866183d075ac29182fcda,2022-04-28 16:06:19,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nq=90;\nresult=sjx(a,b,q)\n\nfunction result=sjx(a,b,q)\nq=mod(q,180);\nif q==0\n error('无法组成三角形！');\nend\nm=a*a+b*b-2*a*b*cosd(q);\nc=sqrt(m);\nS=(a*b*sind(q))/2;\nresult=[c,S];\nend",COMPILE_ERROR,0,0 1519589435283378176,d2809b03269b3411fa5db4c5e4536bbaee5e6e740e230f0816bb24107f2512d7,2022-04-28 16:08:48,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%main\nresult=triangle(input('输入参数'));\n%结果在工作区查看\n\n%function\nfunction result=triangle(A)\n[m,n]=size(A);\nif m~=1 ||n~=3 ,error('输入的参数不正确'),end\na=A(1);b=A(2);d=A(3)*pi/180;%角度转弧度\nc=sqrt(a^2+b^2-2*a*b*cos(d));\ns=a*b*sin(d)/2;\nresult=[c,s];\n%c为第三边边长，s为三角形面积",COMPILE_ERROR,0,0 1519590145085456384,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-28 16:11:37,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,in=input('');\na=in(1);\nb=in(2);\nC=in(3)/360*2*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(C));\ns=0.5*a*b*sin(C);\nout=[c s],WRONG_ANSWER,32,6512 1519590192745320448,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-28 16:11:49,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,in=input('');\na=in(1);\nb=in(2);\nC=in(3)/360*2*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(C));\ns=0.5*a*b*sin(C);\nresult=[c s],ACCEPTED,28,6500 1519590373217828864,091f0392b331a8b8c3534214661464554a7eaf4a639a470339b492ab9107d2c6,2022-04-28 16:12:32,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=tri(a,b,c)\nc=c/180*pi;\nlength=sqrt(a^2+b^2-2*a*b*cos(c));\narea=a*b*sin(c)/2;\nresult=[length,area]\nend\n",COMPILE_ERROR,0,0 1519591670948085760,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 16:17:41,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,M = 5.965*(10^24);\nG = 6.754e-11;\nR_start = 25000*2.54*12/100+6371*1000;\nR_end = (100+6371)*(10^3);\nenergy_gravity = G*M/(R_start) - G*M/(R_end);\nv_needed = sqrt(energy_gravity*2);\n,WRONG_ANSWER,29,6692 1519591716137512960,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-28 16:17:52,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = getSquare(input_vec)\nresult(1) = sqrt(input_vec(1)^2 + input_vec(2)^2 - ...\n 2*input_vec(1)*input_vec(2)*cos(2*pi*input_vec(3)/360));\nresult(2) = 0.5*input_vec(1)*input_vec(2)*sin(2*pi*input_vec(3)/360);\nend\n\n,WRONG_ANSWER,28,6624 1519592097378766848,11701404cf944e1930b182a891d9bf118942498f81455082ceba643c8deccd0f,2022-04-28 16:19:23,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,format short g\nh=25000*12*2.54/100;\ng=9.8;\ninitV=sqrt(2*g*(100000-h)),COMPILE_ERROR,0,0 1519592187124297728,11701404cf944e1930b182a891d9bf118942498f81455082ceba643c8deccd0f,2022-04-28 16:19:44,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,format short g\nh=25000*12*2.54/100;\ng=9.8;\ninitV=sqrt(2*g*(100000-h)),PRESENTATION_ERROR,27,6508 1519592309916729344,6fb9acc42c6f7edd07546ab5bffe4a8b7e151e81f0f866183d075ac29182fcda,2022-04-28 16:20:14,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,format long \nV=initV()\n\nfunction V=initV()\ns=25000*12*2.54*0.01; %单位转化为m\nS=100000-s;\ng=9.80; %重力加速度\nV=sqrt(2*g*S);\nend,COMPILE_ERROR,0,0 1519592457111638016,11701404cf944e1930b182a891d9bf118942498f81455082ceba643c8deccd0f,2022-04-28 16:20:49,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,format short g\nh=25000*12*2.54/100;\ng=9.8;\ninitV=sqrt(2*g*(100000-h)),COMPILE_ERROR,0,0 1519593042674237440,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 16:23:08,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[a,b,angle]=input(\""inputanumber\"");\nlength=(b.^2+a.^2-2.*a.*b.*cos(angle))^0.5;\ns=0.5*a*b*sin(angle);\ndisp(length s);",WRONG_ANSWER,36,6616 1519593545558691840,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 16:25:08,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[a,b,angle]=input(\""inputanumber\"");\nlength=(b.^2+a.^2-2.*a.*b.*cos(angle))^0.5;\ns=0.5*a*b*sin(angle);\nfprintf('length s',length,s);",WRONG_ANSWER,30,6840 1519595717922947072,2c046af34b643efdbaebf8af21572382b05f9b147ccaf241a9d0c33262bab49b,2022-04-28 16:33:46,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,h1=25000*12*2.54/100;\nh2=100*1000;\nh=h2-h1;\ng=9.8;\ninitV=(2*g*h)^0.5,ACCEPTED,29,6736 1519595734528212992,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 16:33:50,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"initv1=(2*10*(100000-250*12*2.54))^0.5;\ninitv=round(initv1,1);",WRONG_ANSWER,26,6756 1519595779512111104,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 16:34:01,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"initv1=(2*10*(100000-250*12*2.54))^0.5;\ninitv=round(initv1,1);",WRONG_ANSWER,30,6664 1519595846474186752,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 16:34:17,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"initv1=(2*10*(100000-250*12*2.54))^0.5;\ninitV=round(initv1,1);",WRONG_ANSWER,27,6640 1519595990041001984,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 16:34:51,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,"%initv1=(2*10*(100000-250*12*2.54))^0.5;\n%initV=round(initv1,1);\ninitV = 1345.6",ACCEPTED,30,6568 1519597624276074496,ca3275a0b0d6b3ab4ecc02d88aabefd444fe759801d237c8943ade7da0ffa4d5,2022-04-28 16:41:21,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,c²=a²+b²-2abcosC,COMPILE_ERROR,0,0 1519597765502480384,ca3275a0b0d6b3ab4ecc02d88aabefd444fe759801d237c8943ade7da0ffa4d5,2022-04-28 16:41:54,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,COMPILE_ERROR,0,0 1519598162237493248,13f73143a6f9b2dd397bf286e32e1ce8988a674b8c272afa9cfe84647408f115,2022-04-28 16:43:29,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result = mycalctri(a,b,c)\nc=c*pi/180;\nlength=sqrt(a.^2+b.^2-2*a*b*cos(c));\nS=1/2*a*b*sin(c);\nresult=[length,S];",WRONG_ANSWER,28,6744 1519599757427773440,11701404cf944e1930b182a891d9bf118942498f81455082ceba643c8deccd0f,2022-04-28 16:49:49,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"c=sqrt(a^2+b^2-2*a*b*cos(C/180*pi));\nS=a*b*sin(C/180*pi);\nresult=[c,S]",COMPILE_ERROR,0,0 1519600023325671424,2c046af34b643efdbaebf8af21572382b05f9b147ccaf241a9d0c33262bab49b,2022-04-28 16:50:53,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,function result= getsquare(A)\nc=(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)/180*pi))^0.5;\nS=0.5*A(1)*A(2)*sin(A(3)/180*pi);\nresult=[c S]\nend\n\nA=[3 4 90];\ngetsquare(A);,ACCEPTED,28,6572 1519600276061847552,11701404cf944e1930b182a891d9bf118942498f81455082ceba643c8deccd0f,2022-04-28 16:51:53,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"c=sqrt(a^2+b^2-2*a*b*cos(C/180*pi));\nS=a*b*sin(C/180*pi)/2;\nresult=[c,S]",COMPILE_ERROR,0,0 1519600995913465856,13f73143a6f9b2dd397bf286e32e1ce8988a674b8c272afa9cfe84647408f115,2022-04-28 16:54:44,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408, g=9.8;\n initv=sqrt(2*g*(h-y));\n h=100000;\n y=25000*12*2.54/100;\n g=9.8;\n initv=sqrt(2*g*(h-y)),WRONG_ANSWER,38,6484 1519601125819465728,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 16:55:15,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1519601176914464768,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 16:55:28,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,27,6768 1519601662057025536,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 16:57:23,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = vpa(x,5)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,27,6624 1519601818240335872,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 16:58:00,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = vpa(x,5)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,29,7656 1519602262110945280,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 16:59:46,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = vpa(x,5);\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,31,6508 1519602275520122880,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 16:59:49,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = vpa(x,5);\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,27,6512 1519602387336081408,1b13ce79ef89e9811275d393e89dcb8b00f927580f2a67ca9251aa3592ff5e41,2022-04-28 17:00:16,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,m=25000*2.54*12/100\nn=100*1000\nx=n-m\nu=sqrt(x*2*9.8),COMPILE_ERROR,0,0 1519602434945617920,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:00:27,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,30,6788 1519602508564037632,322adba04b5755cec39a5e4fb87aaf97aeb114e229be20470b5490c944d307c4,2022-04-28 17:00:45,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,area] = triangle(a,b,angle)\n%UNTITLED5 此处显示有关此函数的摘要\n% 此处显示详细说明\nc=(a*a+b*b-2*a*b*cos(angle*pi/180))^0.5;\narea=1/2*a*b*sin(angle*pi/180);\nend\n\n",COMPILE_ERROR,0,0 1519602520622661632,1b13ce79ef89e9811275d393e89dcb8b00f927580f2a67ca9251aa3592ff5e41,2022-04-28 17:00:48,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,m=25000*2.54*12/100\nn=100*1000\nx=n-m\nu=sqrt(x*2*9.8),WRONG_ANSWER,28,6748 1519603319511760896,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-28 17:03:58,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"a=25000*12*2.54/100;%将高度转化为以m为单位\nb=100*1000-a;%计算实际运动距离\nv=2*9.8*b;%利用公式V^2=2as计算速度的平方\ninitV=v^(1/2);\nfprintf('initV=%f\\n',initV)",COMPILE_ERROR,0,0 1519603321118179328,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-28 17:03:59,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"a=25000*12*2.54/100;%将高度转化为以m为单位\nb=100*1000-a;%计算实际运动距离\nv=2*9.8*b;%利用公式V^2=2as计算速度的平方\ninitV=v^(1/2);\nfprintf('initV=%f\\n',initV)",COMPILE_ERROR,0,0 1519603474801655808,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:04:35,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\n\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,29,6508 1519603499313184768,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:04:41,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,28,6544 1519605360472666112,1b13ce79ef89e9811275d393e89dcb8b00f927580f2a67ca9251aa3592ff5e41,2022-04-28 17:12:05,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"prompt='value'\nx=input(prompt)\nlength=sqrt(x(1)*x(1)+x(2)*x(2)-2*x(1)*x(2)*cos(x(3)*pi/180))\narea=x(1)*x(2)*sin(x(3)*pi/180)*1/2\nresult=[length,area]",WRONG_ANSWER,29,6652 1519605574243745792,1b13ce79ef89e9811275d393e89dcb8b00f927580f2a67ca9251aa3592ff5e41,2022-04-28 17:12:56,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"prompt='value'\nx=input(prompt)\nlength=sqrt(x(1)*x(1)+x(2)*x(2)-2*x(1)*x(2)*cos(x(3)*pi/180));\narea=x(1)*x(2)*sin(x(3)*pi/180)*1/2;\nresult=[length,area]",WRONG_ANSWER,28,6908 1519605697505964032,322adba04b5755cec39a5e4fb87aaf97aeb114e229be20470b5490c944d307c4,2022-04-28 17:13:25,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,GM = 3.98*10^14;\nr1=25000*12*2.54/100;\nr2=100000;\n%GM*(1/r1-1/r2)=1/2*u^2;\nu=(2*GM*(1/r1-1/r2))^0.5,COMPILE_ERROR,0,0 1519605792326582272,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:13:48,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear;clc;\nA = input('给定三角形的两条边和夹角[边长1，边长2，夹角]:');\na = A(1);\nb = A(2);\ncita = A(3)*pi/180;\nc = (a^2 + b^2 - 2*a*b*cos(cita))^0.5;\np = (a+b+c)/2;\nS = (p*(p-a)*(p-b)*(p-c))^0.5;\nresult = [c, S]",WRONG_ANSWER,28,6788 1519605805513490432,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:13:51,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear;clc;\nA = input('给定三角形的两条边和夹角[边长1，边长2，夹角]:');\na = A(1);\nb = A(2);\ncita = A(3)*pi/180;\nc = (a^2 + b^2 - 2*a*b*cos(cita))^0.5;\np = (a+b+c)/2;\nS = (p*(p-a)*(p-b)*(p-c))^0.5;\nresult = [c, S]",WRONG_ANSWER,26,6756 1519605836958183424,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:13:59,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear;clc;\nA = input('给定三角形的两条边和夹角[边长1，边长2，夹角]:');\na = A(1);\nb = A(2);\ncita = A(3)*pi/180;\nc = (a^2 + b^2 - 2*a*b*cos(cita))^0.5;\np = (a+b+c)/2;\nS = (p*(p-a)*(p-b)*(p-c))^0.5;\nresult = [c, S]",WRONG_ANSWER,30,6508 1519606192865841152,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:15:23,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,29,6972 1519606348701007872,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:16:01,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear;clc;\nA = [3 4 90];\na = A(1);\nb = A(2);\ncita = A(3)*pi/180;\nc = (a^2 + b^2 - 2*a*b*cos(cita))^0.5;\np = (a+b+c)/2;\nS = (p*(p-a)*(p-b)*(p-c))^0.5;\nresult = [c, S]",ACCEPTED,29,6524 1519606488304226304,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:16:34,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,30,6652 1519606554599395328,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:16:50,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',initV)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,32,6628 1519606558839844864,452dbaba1affa4b0f0b99917503430deee206bb1dda12544fcedafba6aa0e554,2022-04-28 17:16:51,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,d=100*1000-25000*12*2.54/100 \nu=sqrt(9.8*d/0.5),COMPILE_ERROR,0,0 1519606638774878208,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:17:10,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = vpa(x,5)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,30,6752 1519606696383647744,85dcfb6626fd857b77c4a9f679daf103d03bccfbe0d0219365e3c0aecf0d2b77,2022-04-28 17:17:24,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"prompt='What is the original value? ';\nn=input(prompt);\nresult=[sqrt(n(1).^2+n(2).^2-2*n(1)*n(2)*cos(n(3)/180*pi)),1/2.*n(1)*n(2)*sin(n(3)/180*pi)]",COMPILE_ERROR,0,0 1519606741908619264,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:17:34,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,27,6752 1519606782547243008,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:17:44,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,WRONG_ANSWER,41,6480 1519606797550268416,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:17:48,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,27,6768 1519606867205062656,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:18:04,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,result=1345.6,WRONG_ANSWER,28,6500 1519607547848327168,7500e633b35e1ab9e95beb98d004707d78164eea0806bb87229a19fae1fc0b43,2022-04-28 17:20:47,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"\nclear\n\nx=[3,4,90];\ns=(1/2)*x(1)*x(2)*sin(x(3)*pi/180)\na=sqrt(x(1).^2+x(2).^2-2*x(1)*x(2)*cos(x(3)*pi/180))\n",COMPILE_ERROR,0,0 1519607559097454592,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:20:49,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f\\n',x)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,28,6632 1519607572015923200,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:20:52,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f\\n',x)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,28,6752 1519607658322104320,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:21:13,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"clear;clc;\nA = [3 4 90];\na = A(1);\nb = A(2);\ncita = A(3)*pi/180;\nc = (a^2 + b^2 - 2*a*b*cos(cita))^0.5;\np = (a+b+c)/2;\nS = (p*(p-a)*(p-b)*(p-c))^0.5;\nresult = [c, S]",ACCEPTED,26,6884 1519608596864745472,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:24:57,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1345.6,WRONG_ANSWER,27,6508 1519608981222371328,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:26:28,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = vpa(x,5);\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,27,6756 1519609142120067072,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:27:07,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[initV,iter,X] = steffenson(f1,1500);\ninitV\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,29,6984 1519609168191860736,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:27:13,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,WRONG_ANSWER,28,7100 1519609181273886720,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:27:16,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,WRONG_ANSWER,25,6628 1519609272755859456,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:27:38,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[initV,iter,X] = steffenson(f1,1500);\ninitV = vpa(initV,5)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,29,7304 1519609357484994560,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:27:58,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[initV,iter,X] = steffenson(f1,1400);\ninitV = vpa(initV,5)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,30,6628 1519609360660070400,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:27:59,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,386.5,WRONG_ANSWER,27,6752 1519609840039673856,83fad0ed61eaed5292929ed5e4b2101264b4b8681cdd6dec4e0b8f69e3e08600,2022-04-28 17:29:53,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = sanjiao(A)\na=A(1);\nb=A(2);\nc=A(3);\nresult = sqrt(a*a+b*b-2*a*b*cos(c/180*pi));\nend,WRONG_ANSWER,27,6756 1519609904401268736,83fad0ed61eaed5292929ed5e4b2101264b4b8681cdd6dec4e0b8f69e3e08600,2022-04-28 17:30:08,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = triangle(A)\na=A(1);\nb=A(2);\nc=A(3);\nresult = sqrt(a*a+b*b-2*a*b*cos(c/180*pi));\nend,WRONG_ANSWER,29,6760 1519610250934648832,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:31:31,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f\\n',x)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,29,6520 1519610379427168256,7500e633b35e1ab9e95beb98d004707d78164eea0806bb87229a19fae1fc0b43,2022-04-28 17:32:02,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,clear\n\nx=100*1000-25000*12*2.54*0.01;\na=9.80665;\ninitv=sqrt(2*a*x),COMPILE_ERROR,0,0 1519610484125368320,83fad0ed61eaed5292929ed5e4b2101264b4b8681cdd6dec4e0b8f69e3e08600,2022-04-28 17:32:27,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%triangle.m函数\nfunction result = triangle(A)\na=A(1);\nb=A(2);\nc=A(3);\nresult = sqrt(a*a+b*b-2*a*b*cos(c/180*pi));\nend\n%命令行调用函数\ntriangle([3,4,90])",WRONG_ANSWER,29,8036 1519610638660321280,83fad0ed61eaed5292929ed5e4b2101264b4b8681cdd6dec4e0b8f69e3e08600,2022-04-28 17:33:03,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=1345.6;,WRONG_ANSWER,26,6616 1519610964008288256,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:34:21,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,A=386.5,WRONG_ANSWER,27,6632 1519610998577725440,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:34:29,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,A=386.4609,WRONG_ANSWER,30,7312 1519611031486251008,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:34:37,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=386.4609,WRONG_ANSWER,27,6504 1519611107151482880,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:34:55,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=386.4,WRONG_ANSWER,29,6748 1519611122481659904,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-28 17:34:59,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=386.5,WRONG_ANSWER,28,6364 1519611278648193024,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:35:36,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%k7_1.m\n%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f\\n',x)\n%steffenson.m\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,29,6752 1519611840814956544,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:37:50,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = newton_secant(f1,1300,1500);\ninitV = x;\nfprintf('initV = %.1f\\n',x)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,29,6624 1519611956628062208,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:38:18,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = newton_secant(f1,1300,1500);\ninitV = x\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,27,6872 1519612080515231744,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:38:47,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = newton_secant(f1,1300,1500);\ninitV = vpa(x,5)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,28,6492 1519612197305626624,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:39:15,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"%一艘装载着宇宙飞船1号的母舰起飞并登陆在常规的跑道，\n%将航天器发射到25000英尺的高空，再进入外太空（100千米的高空），\n%假设航天器消耗所有的能源，以垂直初速度u到达25000英尺，\n%要使航天器到达外太空，初速度的值是？\n%注意：1英寸 = 2.54cm； 1英尺=12英寸；\n%输出：单位： m/s\nclc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',x)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,32,6760 1519612296626733056,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-28 17:39:39,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"clc;clear;\nf1 = @(x) x^2 - 2*9.8*92.38*1000;\n[x,iter,X] = steffenson(f1,1500);\ninitV = x;\nfprintf('initV = %.1f',x)\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,27,6908 1519612930721615872,85141451193ef05a80dc6518bfd13060cd94b8f146b04ea2714af27b74c96b45,2022-04-28 17:42:10,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%s为面积 \na = 3;\nb = 4;\nx = 90;\nS = 0.5*a*b*sin(x*pi/180);\n\n\nc = sqrt(a^2 + b^2 - 2*a*b*cos(x*pi/180));\nc\n\nresult = [c,S];\nresult",COMPILE_ERROR,0,0 1519613084149268480,85141451193ef05a80dc6518bfd13060cd94b8f146b04ea2714af27b74c96b45,2022-04-28 17:42:46,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%这是.m文件\n%s为面积 \na = 3;\nb = 4;\nx = 90;\nS = 0.5*a*b*sin(x*pi/180);\n\n\nc = sqrt(a^2 + b^2 - 2*a*b*cos(x*pi/180));\nc\n\nresult = [c,S];\nresult",COMPILE_ERROR,0,0 1519613105296945152,85141451193ef05a80dc6518bfd13060cd94b8f146b04ea2714af27b74c96b45,2022-04-28 17:42:52,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%这是.m文件\n%s为面积 \na = 3;\nb = 4;\nx = 90;\nS = 0.5*a*b*sin(x*pi/180);\n\n\nc = sqrt(a^2 + b^2 - 2*a*b*cos(x*pi/180));\nc\n\nresult = [c,S];\nresult",COMPILE_ERROR,0,0 1519614822075908096,91e6e1c10a7caa31f3fbe574a20264bfbb620f4e4b717406084af918bb87d3e2,2022-04-28 17:49:41,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,matlab\nmatlab\nmatlab\nmatlab\nmatlab,COMPILE_ERROR,0,0 1519614867315671040,91e6e1c10a7caa31f3fbe574a20264bfbb620f4e4b717406084af918bb87d3e2,2022-04-28 17:49:52,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,matlab\nmatlab\nmatlab\nmatlab\nmatlab,COMPILE_ERROR,0,0 1519615033158434816,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 17:50:31,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,clear\nh1=25000*12*2.54/100;\nh=100000-h1;\nvv = 2*9.8*h;\ninitV=sqrt(vv),COMPILE_ERROR,0,0 1519615131640696832,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 17:50:55,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[l1,l2,angle]=input(\""Please\"");\nl3=(l1^2+l2^2-2*l1*l2*cos(angle))^1/2;\ns=1/2*l1*l2*sin(angle);\nresult=zeros(1,2);\nresult(1)=l3;\nresult(2)=s;\nresult",WRONG_ANSWER,30,7392 1519615639050829824,aa06baf985457dd9153f13920f5af6fde5790398a212287e2719a6f90617f4d3,2022-04-28 17:52:56,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,COMPILE_ERROR,0,0 1519615710081355776,aa06baf985457dd9153f13920f5af6fde5790398a212287e2719a6f90617f4d3,2022-04-28 17:53:13,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,q,COMPILE_ERROR,0,0 1519615846870204416,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 17:53:45,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,clear\nh1=25000*12*2.54/100;\nh=100000-h1;\nv = 2*9.8*h;\ninitV=sqrt(v),COMPILE_ERROR,0,0 1519616182150279168,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 17:55:05,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,clear\nh1=25000*12*2.54/100;\nh=100000-h1;\nv = 2*9.8*h;\ninitV=sqrt(v),ACCEPTED,29,8116 1519617828376842240,8ff11f778ceb4230ea851a7022dfa0b6aa7534bf62d13bb34576ddeb217e24dc,2022-04-28 18:01:38,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,s]=tric(a,b,x0)\n x=x0*(pi)/180;\n s=(0.5)*a*b*sin(x);\n c0=(a*a+b*b-2*a*b*cos(x))^(1/2);\n c=a+b+c0;\n format rat\n [cc,ss]=tric(3,4,90);\n[cc,ss]\n ",COMPILE_ERROR,0,0 1519619410485088256,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-28 18:07:55,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=input('请输入长宽高');\nx=A(1);\ny=A(2);\nz=A(3);\nm=z/180*pi;\na=cos(m);\nb=x^2+y^2-2*x*y*a;\nc=b^(1/2);\nS=1/2*x*y*sin(m);\nfprintf('result=%f ',c)\nfprintf('%f\\n',S)\n%[3 4 90]此为命令行窗口的输入",COMPILE_ERROR,0,0 1519619645563252736,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 18:08:51,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta;\n float c, s, d;\n printf(\""请分别输入三角形两边边长以及夹角，数据之间用空格键隔开。其中夹角请按角度制输入\\n\"");\n scanf(\""%d%d%d\"", &a, &b, &theta);\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""三角形面积为%f\\n\"", s);\n printf(\""三角形第三边长为%f\\n\"", c); \n return 0;\n}\n",WRONG_ANSWER,3,312 1519629377392906240,7958ae64deaf208b0a1c5d3212d6d36d506ec7facf9777ddc971117361c16110,2022-04-28 18:47:31,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%triangle.m\nfunction A=triangle(l1,l2,x)\nl3=(l1*l1+l2*l2-2*l1*l2*cos(x*pi/180))^(1/2)\nS=(1/2)*l1*l2*sin(x*pi/180)\nA=[l3,S]\n\n%triangle.mlx\nl1=3,l2=4,x=90\ntriangle(l1,l2,x)\n",COMPILE_ERROR,0,0 1519630981353472000,7958ae64deaf208b0a1c5d3212d6d36d506ec7facf9777ddc971117361c16110,2022-04-28 18:53:53,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,%getInitV.m\nfunction initV=getInitV(h)\nh0=h*12*0.0254\ninitV=(2*9.8*h0)^0.5\n \n%getInitV.mlx\ngetInitV(25000),COMPILE_ERROR,0,0 1519631051096375296,7958ae64deaf208b0a1c5d3212d6d36d506ec7facf9777ddc971117361c16110,2022-04-28 18:54:10,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%triangle.m\nfunction A=triangle(l1,l2,x)\nl3=(l1*l1+l2*l2-2*l1*l2*cos(x*pi/180))^(1/2)\nS=(1/2)*l1*l2*sin(x*pi/180)\nA=[l3,S]\n\n%triangle.mlx\nl1=3,l2=4,x=90\ntriangle(l1,l2,x)\n",COMPILE_ERROR,0,0 1519632985459044352,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-28 19:01:51,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,COMPILE_ERROR,0,0 1519633040865787904,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-28 19:02:05,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6;\ninitV,COMPILE_ERROR,0,0 1519633098109665280,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-28 19:02:18,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6;\n,COMPILE_ERROR,0,0 1519633116971438080,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-28 19:02:23,Java,0.0,1519488525215481863,1514817351877615616,1141715705586737152,import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n while (in.hasNextInt()) {\n int a = in.nextInt();\n int b = in.nextInt();\n int c = in.nextInt();\n \n System.out.println(a + b);\n }\n }\n},WRONG_ANSWER,129,17940 1519633217613770752,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-28 19:02:47,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"printf(\""initV = 1345.6\"");",COMPILE_ERROR,0,0 1519633295858511872,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-28 19:03:05,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,"printf(\""initV = 1345.6\"");",ACCEPTED,26,6636 1519633897359446016,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-28 19:05:29,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,COMPILE_ERROR,0,0 1519633931215880192,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-28 19:05:37,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,1,COMPILE_ERROR,0,0 1519634188167319552,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-28 19:06:38,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,1,COMPILE_ERROR,0,0 1519634985059926016,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-28 19:09:48,Octave,10.0,1519488525215481863,1514817351877615616,1141715705586737152,"D=input(\""\"");\na=D(1);\nb=D(2);\nC=D(3)*pi/180;\nc=(a^2+b^2-2*a*b*cos(C))^0.5;\nS=(a*b*sin(C))/2;\nresult=[c,S];\nresult",ACCEPTED,29,6492 1519636375043883008,af0f641a3b33f48193be4909219f3bab0a63e2d8305eecb084d0597d276b1e33,2022-04-28 19:15:19,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,COMPILE_ERROR,0,0 1519636469814177792,af0f641a3b33f48193be4909219f3bab0a63e2d8305eecb084d0597d276b1e33,2022-04-28 19:15:42,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,1,COMPILE_ERROR,0,0 1519637364241117184,19102154b0713249495963febdd4c15cb48bcb30b150e53dc8bb4895741d81ff,2022-04-28 19:19:15,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function u = feifei()\nd = 100*1000 - 25000*12*2.54*0.001;\nu = 0;\ng = 9.8;\nu = sqrt(2*d*g);\nX = sprintf('initv = %d',u);\ndisp(X)\n\n \nu = feifei();",COMPILE_ERROR,0,0 1519637434843836416,19102154b0713249495963febdd4c15cb48bcb30b150e53dc8bb4895741d81ff,2022-04-28 19:19:32,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function u = feifei()\nd = 100*1000 - 25000*12*2.54*0.001;\nu = 0;\ng = 9.8;\nu = sqrt(2*d*g);\nX = sprintf('initv = %d',u);\ndisp(X)\n\n \nu = feifei();",WRONG_ANSWER,30,7648 1519637445300224000,5c20800b70f8b8010874a3143d20fbab8c841bce6b288a52a15ce7d1384e015b,2022-04-28 19:19:35,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h=100*1000-250*12*2.54;\ng=9.8;\n%2*g*h=-u^2;\nu=sqrt(2*g*h)\n\n\n\n ,COMPILE_ERROR,0,0 1519640250756935680,5c20800b70f8b8010874a3143d20fbab8c841bce6b288a52a15ce7d1384e015b,2022-04-28 19:30:43,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=[3 4 90];\nresult=add(A)\nfunction result=add(A)\nc=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cos(A(3)/180*pi));\ns=1/2*A(1)*A(2)*sin(A(3)/180*pi);\nresult=[c,s];\nend\n",COMPILE_ERROR,0,0 1519643772093247488,5c20800b70f8b8010874a3143d20fbab8c841bce6b288a52a15ce7d1384e015b,2022-04-28 19:44:43,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=[3 4 90];\nresult=add(A)\nfunction result=add(A)\nc=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cos(A(3)/180*pi));\ns=1/2*A(1)*A(2)*sin(A(3)/180*pi);\nresult=[c,s];\nend\n",COMPILE_ERROR,0,0 1519644350110281728,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-28 19:47:01,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,g=9.8\nH=100000\nl=250*12*2.54\ninitV=sqrt(2*g*H-2*g*l)\ninitV,COMPILE_ERROR,0,0 1519644407760994304,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-28 19:47:15,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,g=9.8\nH=100000\nl=250*12*2.54\ninitV=sqrt(2*g*H-2*g*l)\ninitV,COMPILE_ERROR,0,0 1519644551545929728,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-28 19:47:49,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = triangleCalucate (A)\na=A(1);\nb=A(2);\ndegree = A(3)*pi/180;\nx = a^2+b^2+0.5*a*b*cos(degree);\nresult1 =sqrt(x) ;\nresult2 = 0.5*a*b*sin(degree);\nresult = [result1 result2];\nend,COMPILE_ERROR,0,0 1519644732551114752,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-28 19:48:32,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = triangleCalucate (A)\na=A(1);\nb=A(2);\ndegree = A(3)*pi/180;\nx = a^2+b^2+0.5*a*b*cos(degree);\nresult1 =sqrt(x) ;\nresult2 = 0.5*a*b*sin(degree);\nresult = [result1 result2];\nend,COMPILE_ERROR,0,0 1519644890886078464,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-28 19:49:10,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,A=[3 4 90]\nfunction result = triangleCalucate (A)\na=A(1);\nb=A(2);\ndegree = A(3)*pi/180;\nx = a^2+b^2+0.5*a*b*cos(degree);\nresult1 =sqrt(x) ;\nresult2 = 0.5*a*b*sin(degree);\nresult = [result1 result2];\nend,COMPILE_ERROR,0,0 1519644995265527808,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-28 19:49:35,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,A=[3 4 90]\nfunction result = triangleCalucate (A)\na=A(1);\nb=A(2);\ndegree = A(3)*pi/180;\nx = a^2+b^2+0.5*a*b*cos(degree);\nresult1 =sqrt(x) ;\nresult2 = 0.5*a*b*sin(degree);\nresult = [result1 result2];\nend,COMPILE_ERROR,0,0 1519645103948337152,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-28 19:50:01,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,A=[3 4 90];\nfunction result = triangleCalucate (A)\na=A(1);\nb=A(2);\ndegree = A(3)*pi/180;\nx = a^2+b^2+0.5*a*b*cos(degree);\nresult1 =sqrt(x) ;\nresult2 = 0.5*a*b*sin(degree);\nresult = [result1 result2];\nend,COMPILE_ERROR,0,0 1519645177206050816,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-28 19:50:18,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,function result = triangleCalucate (A)\na=A(1);\nb=A(2);\ndegree = A(3)*pi/180;\nx = a^2+b^2+0.5*a*b*cos(degree);\nresult1 =sqrt(x) ;\nresult2 = 0.5*a*b*sin(degree);\nresult = [result1 result2];\nend,COMPILE_ERROR,0,0 1519646319294054400,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 19:54:50,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[l1,l2,angle]=input(\""Please\"");\nl3=(l1^2+l2^2-2*l1*l2*cos(angle))^1/2;\ns=1/2*l1*l2*sin(angle);\nresult=zeros(1,2);\nresult(1)=l3;\nresult(2)=s;\nresult",WRONG_ANSWER,28,6504 1519647401940385792,195b4f4d5f1a329e5a5407e21e31834042c96b10f523e3596d4093526cd40156,2022-04-28 19:59:08,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,test,WRONG_ANSWER,31,7068 1519647435784237056,195b4f4d5f1a329e5a5407e21e31834042c96b10f523e3596d4093526cd40156,2022-04-28 19:59:17,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,test,WRONG_ANSWER,28,6500 1519647931819409408,19102154b0713249495963febdd4c15cb48bcb30b150e53dc8bb4895741d81ff,2022-04-28 20:01:15,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [l,s] = triangle(A)\na=A(1);\nb=A(2);\npi = 3.141592658;\nC=(pi*A(3))/180;\nc=sqrt(a*a+b*b-2*a*b*cos(C));\nif a+b>c\n l=c;\nelse\n disp('无解');\nend\ns=(1/2)*a*b*sin(C);\n\n",WRONG_ANSWER,27,6760 1519649911799332864,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-28 20:09:07,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h = 25000 %英尺\nh = 2500*12*2.54/100 %m\n ,COMPILE_ERROR,0,0 1519650030640730112,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 20:09:35,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"[l1,l2,angle]=input(\""Please\"");\nl3=(l1^2+l2^2-2*l1*l2*cos(angle))^1/2;\ns=1/2*l1*l2*sin(angle);\nresult=[l3,s];\nresult",WRONG_ANSWER,26,6756 1519651380350980096,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-28 20:14:57,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function[X]=add(a,b,o)\ns=0.5*a*b*sin(o);\nc=sqrt(a*a+b*b-2*a*b*cos(o));\nX=[c,s];\nend",COMPILE_ERROR,0,0 1519651968337887232,0dfb6210e617a64d8e1a1fb3fb971048d2db68ec06ef27651c0745b957b9e815,2022-04-28 20:17:17,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=1345.6\n,ACCEPTED,27,6512 1519653694881181696,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:24:09,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [a,s]=test(x,y,z)\na=sqrt(x*x+y*y-2*x*y*cosd(z));\ns=0.5*x*y*sind(z);\nend",WRONG_ANSWER,30,6992 1519654936042831872,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:29:05,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=test(x,y,z)\nresult=zeros(1,2);\na=sqrt(x*x+y*y-2*x*y*cosd(z));\ns=0.5*x*y*sind(z);\nresult(1)=a;result(2)=s;\nend",WRONG_ANSWER,28,6784 1519655593286074368,4def03706adecd0d476796d4a0d60384c5b04d1f4d01bc878728afae67acee34,2022-04-28 20:31:41,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c , S] = triangle(a,b,thedu)\n%给定三角形的两条边和夹角，计算第三条边的长度和三角形的面积。\n% 输入值a,b为边长，thedu为角度； 输出值 c为第三边，S为面积\nS = 0.5*a*b*sin(thedu*3.14159265/180);\nd=cos(thedu*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nc;\nS;\nend\n\n",WRONG_ANSWER,26,6504 1519655734994845696,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 20:32:15,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta;\n float c, s, d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""%f\"", s);\n printf(\""%f\"", c); \n return 0;\n}\n",WRONG_ANSWER,4,320 1519655799587115008,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:32:31,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=test(x,y,z)\nresult=zeros(2,1);\na=sqrt(x*x+y*y-2*x*y*cosd(z));\ns=0.5*x*y*sind(z);\nresult(1)=a;result(2)=s;\nend",WRONG_ANSWER,26,6496 1519655978360934400,2d882744229d7e27284ee7c076e14dbe33af3edd012f82d587b74c8ed0ea9694,2022-04-28 20:33:13,Python,0.0,1519488525215481862,1514802200680230912,1141715823085969408, v=sqrt(2*9.8*(100000-250000*12*2.54*0.01)),NON_ZERO_EXIT_CODE,61,29816 1519656148175720448,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-28 20:33:54,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,ACCEPTED,28,6756 1519656321207549952,4def03706adecd0d476796d4a0d60384c5b04d1f4d01bc878728afae67acee34,2022-04-28 20:34:35,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,>> x = 100000 - 25000*12*2.54*0.01\n\nx =\n\n 92380 \n\n>> c=sqrt(2*9.8*x);\n>> c\n\nc =\n\n 84773/63 ,WRONG_ANSWER,26,6664 1519656361816801280,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-28 20:34:45,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,[3 4 90]\n,WRONG_ANSWER,27,6756 1519656454863241216,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-28 20:35:07,OCaml,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,COMPILE_ERROR,0,0 1519656499591286784,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-28 20:35:18,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,[3 4 90]\nresult =\n\n 5 6\n\n,WRONG_ANSWER,30,6636 1519656795977596928,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-28 20:36:28,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,result =\n\n 5 6\n,WRONG_ANSWER,27,6636 1519656873152774144,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-28 20:36:47,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result = Sabc(a,b,arc);\n result = 1/2*a*b*sin(arc);\nend",COMPILE_ERROR,0,0 1519656951980535808,dcdf317ffe0b171cf03967df730cc59eec4fc0406f647482f6fbd870fb4ef0b1,2022-04-28 20:37:05,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,S] = triangle(a,b, C)\nC=pi*C/180;\nc=sqrt(a*a+b*b-2*a*b*cos(C));\ns=(a+b+c)/2;\nS=sqrt(s*(s-a)*(s-b)*(s-c));\nend",COMPILE_ERROR,0,0 1519657094213566464,dcdf317ffe0b171cf03967df730cc59eec4fc0406f647482f6fbd870fb4ef0b1,2022-04-28 20:37:39,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [c,S] = triangle(a,b, C)\nC=pi*C/180;\nc=sqrt(a*a+b*b-2*a*b*cos(C));\ns=(a+b+c)/2;\nS=sqrt(s*(s-a)*(s-b)*(s-c));\nend",WRONG_ANSWER,26,6532 1519657488125820928,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:39:13,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=test(x,y,z)\nresult=zeros(1,2);\na=sqrt(x*x+y*y-2*x*y*cosd(z));\ns=0.5*x*y*sind(z);\nresult=[a,s];\nend",WRONG_ANSWER,27,6616 1519657599648186368,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:39:40,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=test(x,y,z)\nresult=zeros(1,2);\na=sqrt(x*x+y*y-2*x*y*cosd(z));\ns=0.5*x*y*sind(z);\nresult=[a,s]\nend",WRONG_ANSWER,28,6632 1519657871543930880,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:40:45,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,26,6752 1519658154655268864,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:41:52,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=test(x,y,z)\nresult=zeros(1,2);\na=sqrt(x*x+y*y-2*x*y*cosd(z));\ns=0.5*x*y*sind(z);\nresult=[a,s];\nend",WRONG_ANSWER,27,6624 1519658280207548416,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:42:22,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"result=[5,6]]",WRONG_ANSWER,26,6516 1519658305826373632,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:42:28,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"result=[5,6];",WRONG_ANSWER,29,6760 1519658435870752768,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 20:42:59,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""%d %d\"",c,s);\n return 0;\n}\n",WRONG_ANSWER,4,192 1519658492997189632,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-28 20:43:13,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [L,S]= mytri(a,b,s)\n\nL=sqrt(a^2+b^2-2*a*b*cosd(s));\nS=0.5*a*b*sind(s);\n\n\n\nend",COMPILE_ERROR,0,0 1519658540808044544,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-28 20:43:24,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [L,S]= mytri(a,b,s)\n\nL=sqrt(a^2+b^2-2*a*b*cosd(s));\nS=0.5*a*b*sind(s);\n\n\n\nend",COMPILE_ERROR,0,0 1519658864448929792,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-28 20:44:41,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function result=test(x,y,z)\nresult=zeros(1,2);\na=sqrt(x.*x+y.*y-2.*x.*y.*cosd(z));\ns=0.5.*x.*y.*sind(z);\nresult=[a,s];\nend",WRONG_ANSWER,27,6624 1519658951904378880,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-28 20:45:02,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [L,S]= mytri(a,b,s)\nL=sqrt(a^2+b^2-2*a*b*cosd(s));\nS=0.5*a*b*sind(s);\nend\n%命令行窗口输入：mytri(3,4,90)",COMPILE_ERROR,0,0 1519659072008273920,2fced53e4658af35e52be542acc8d7e91d212645defda6f1f098a6a40deeae4e,2022-04-28 20:45:31,Python,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"print(\""initV = 1345.6\"")",PRESENTATION_ERROR,16,3256 1519659224710299648,2fced53e4658af35e52be542acc8d7e91d212645defda6f1f098a6a40deeae4e,2022-04-28 20:46:07,Python,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\nprint(initV),WRONG_ANSWER,17,3012 1519660287530143744,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-28 20:50:21,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=input('边长1 边长2 夹角');\nb=a(1);\nc=a(2);\nr=a(3);\nd=sqrt(b^2+c^2-2*b*c*cosd(r));\ns=0.5*b*c*sind(r);\nresult=[d,s]",COMPILE_ERROR,0,0 1519660387660771328,2fced53e4658af35e52be542acc8d7e91d212645defda6f1f098a6a40deeae4e,2022-04-28 20:50:45,Python,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"def san(a,b,angle):\n c=sqt(a*a+b*b-2*a*b*cos(angle))\n s=0.5*a*b*sin(angle)\n return c,s",WRONG_ANSWER,16,3256 1519660436247580672,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-28 20:50:56,C++,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=input('边长1 边长2 夹角');\nb=a(1);\nc=a(2);\nr=a(3);\nd=sqrt(b^2+c^2-2*b*c*cosd(r));\ns=0.5*b*c*sind(r);\nresult=[d,s]",COMPILE_ERROR,0,0 1519660468384350208,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-28 20:51:04,C++,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=input('边长1 边长2 夹角');\nb=a(1);\nc=a(2);\nr=a(3);\nd=sqrt(b^2+c^2-2*b*c*cosd(r));\ns=0.5*b*c*sind(r);\nresult=[d,s]",COMPILE_ERROR,0,0 1519660558540914688,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-28 20:51:25,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"a=input('边长1 边长2 夹角');\nb=a(1);\nc=a(2);\nr=a(3);\nd=sqrt(b^2+c^2-2*b*c*cosd(r));\ns=0.5*b*c*sind(r);\nresult=[d,s]",COMPILE_ERROR,0,0 1519660715332370432,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 20:52:03,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n return 0;\n}\n",WRONG_ANSWER,3,320 1519660791849070592,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 20:52:21,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n return 0;\n}\n",WRONG_ANSWER,4,324 1519661772276019200,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 20:56:15,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6,COMPILE_ERROR,0,0 1519661865918038016,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 20:56:37,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1345.6m/s,COMPILE_ERROR,0,0 1519662034877190144,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 20:57:17,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,result=1345.6,COMPILE_ERROR,0,0 1519662248090451968,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 20:58:08,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function result=fly(a,b)\nresult=1345.6;\nend",COMPILE_ERROR,0,0 1519662713104543744,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 20:59:59,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h= 100*1000-(25000*12*2.54/100);\nu = (2 * 9.8 * h )^ 0.5;\nu;,COMPILE_ERROR,0,0 1519662901474918400,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 21:00:44,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n if(scanf(\""%d%d%d\"", &a, &b, &theta))\n {\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n return 0;\n }\n}\n",WRONG_ANSWER,4,316 1519663012586237952,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:01:10,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"int h ,u;\nh= 100*1000-(25000*12*2.54/100);\nu = (2 * 9.8 * h )^ 0.5;\nu;",COMPILE_ERROR,0,0 1519663326953508864,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:02:25,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h= 100*1000-(25000*12*2.54/100);\nu = (2 * 9.8 * h )^ 0.5;,COMPILE_ERROR,0,0 1519663434390605824,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:02:51,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,double h= 100*1000-(25000*12*2.54/100);\ndouble u = (2 * 9.8 * h )^ 0.5;,COMPILE_ERROR,0,0 1519663509472854016,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:03:09,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,double h= 100*1000-(25000*12*2.54/100);\ndouble u = (2 * 9.8 * h ).^ 0.5;,COMPILE_ERROR,0,0 1519663545275428864,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:03:17,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,double h= 100*1000-(25000*12*2.54/100);\ndouble u = (2 * 9.8 * h ) ^ 0.5;,COMPILE_ERROR,0,0 1519663717795528704,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:03:58,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h = 0;\nu = 0;\nh= 100*1000-(25000*12*2.54/100);\nu = (2 * 9.8 * h )^ 0.5;,COMPILE_ERROR,0,0 1519664032531910656,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:05:14,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h = 0;\ninitV = 0;\nh= 100*1000-(25000*12*2.54/100);\ninitV = (2 * 9.8 * h )^ 0.5;,COMPILE_ERROR,0,0 1519664179500318720,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 21:05:49,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n if(scanf(\""%d%d%d\"", &a, &b, &theta)==1)\n {\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);}\n else\n {s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n }\n return 0;\n \n}\n",WRONG_ANSWER,4,196 1519664256860073984,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:06:07,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,double h= 100*1000-(25000*12*2.54/100);\ndouble initV = (2 * 9.8 * h )^ 0.5;,COMPILE_ERROR,0,0 1519664409855700992,e9885256a18390955319ba083026ffda993f9c97e56a7f090816123123b687fc,2022-04-28 21:06:43,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=sqrt((100*1000-25000*12*0.0254)*2*10),WRONG_ANSWER,27,6496 1519664477941837824,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:07:00,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h= 100*1000-(25000*12*2.54/100);\ninitV = (2 * 9.8 * h )^ 0.5;,WRONG_ANSWER,27,7352 1519664887792451584,e9885256a18390955319ba083026ffda993f9c97e56a7f090816123123b687fc,2022-04-28 21:08:37,Python,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=sqrt((100*1000-25000*12*0.0254)*2*10),NON_ZERO_EXIT_CODE,17,3008 1519665580922146816,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:11:23,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,digits(2);\nh= 100*1000-(25000*12*2.54/100);\ninitV = vpa((2 * 9.8 * h )^ 0.5);,WRONG_ANSWER,28,6496 1519665612656250880,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:11:30,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,digits(1);\nh= 100*1000-(25000*12*2.54/100);\ninitV = vpa((2 * 9.8 * h )^ 0.5);,WRONG_ANSWER,29,7052 1519666458458636288,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 21:14:52,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n \n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n \n return 0;\n \n}\n",WRONG_ANSWER,3,344 1519666481359519744,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 21:14:57,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n \n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n \n return 0;\n \n}\n",WRONG_ANSWER,3,200 1519666574359834624,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:15:20,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h= 100*1000-(25000*12*2.54/100);\ninitV = (2 * 9.8 * h )^ 0.5;,WRONG_ANSWER,30,6688 1519666748721250304,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 21:16:01,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta,c,s;\n float d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n \n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n \n return 0;\n \n}\n",WRONG_ANSWER,3,200 1519666955190046720,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:16:50,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,h= 100*1000-(25000*12*2.54/100);\ninitV = (2 * 9.8 * h )^ 0.5;,WRONG_ANSWER,27,6644 1519667472851054592,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:18:54,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,"%initv1=(2*10*(100000-250*12*2.54))^0.5;\n%initV=round(initv1,1);\ninitV = 1345.6",ACCEPTED,40,6948 1519667598155874304,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:19:24,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [A]=tri(a,b,beita)\nA=[1,1];\nA(1,1)=(a^2+b^2-2*a*b*cos(beita*pi/180))^0.5;\nA(1,2)=(a*b*sin(beita*pi/180))/2;\nresult=A;\nend",COMPILE_ERROR,0,0 1519667649586446336,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:19:36,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv1=(2*10*(100000-250*12*2.54))^0.5;\ninitv1,WRONG_ANSWER,30,7572 1519667672537661440,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:19:41,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [A]=(a,b,beita)\nA=[1,1];\nA(1,1)=(a^2+b^2-2*a*b*cos(beita*pi/180))^0.5;\nA(1,2)=(a*b*sin(beita*pi/180))/2;\nresult=A;\nend",COMPILE_ERROR,0,0 1519667683719675904,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:19:44,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv1=(2*10*(100000-250*12*2.54))^0.5;,WRONG_ANSWER,27,6636 1519667754511151104,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:20:01,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv1=(2*10*(100000-250*12*2.54))^0.5;\ninitv1=1345.6;,WRONG_ANSWER,26,6500 1519667773406478336,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:20:05,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv1=(2*10*(100000-250*12*2.54))^0.5;\ninitv1=1345.6,WRONG_ANSWER,27,6984 1519667809041301504,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:20:14,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initv1=(2*10*(100000-250*12*2.54))^0.5;\ninitV=1345.6,ACCEPTED,38,6744 1519667841375186944,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:20:22,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=(2*10*(100000-250*12*2.54))^0.5;\ninitV=1345.6,ACCEPTED,27,6496 1519667869867094016,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:20:28,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=(2*10*(100000-250*12*2.54))^0.5;,WRONG_ANSWER,30,6760 1519667907456446464,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:20:37,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV=(2*10*(100000-250*12*2.54))^0.5;\ninitV=1345.6,ACCEPTED,26,7116 1519668082409242624,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 21:21:19,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta;\n float c,s,d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n \n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n \n return 0;\n \n}\n",WRONG_ANSWER,3,308 1519668893952544768,ee92695979e578a3ac2235607cc1806101ba3c445aa7c3cb063b012dbc312bd3,2022-04-28 21:24:33,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,distance = 100 * 1000 - 25000 * 12 * 2.54 / 100;\nu = sqrt(2 * 9.8 * distance)\n,COMPILE_ERROR,0,0 1519669159938527232,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:25:36,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function c=fly(a,b)\nc=1345.6;\nresult=c;\nend",COMPILE_ERROR,0,0 1519669226778963968,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:25:52,OCaml,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function c=fly(a,b)\nc=1345.6;\nresult=c;\nend",COMPILE_ERROR,0,0 1519669271892901888,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:26:03,OCaml,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function c=fly(a,b)\nc=1345.6;\nresult=c;\nend",COMPILE_ERROR,0,0 1519669343653236736,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:26:20,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [A]=(a,b,beita)\nA=[1,1];\nA(1,1)=(a^2+b^2-2*a*b*cos(beita*pi/180))^0.5;\nA(1,2)=(a*b*sin(beita*pi/180))/2;\nresult=A;\nend",COMPILE_ERROR,0,0 1519670514619035648,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-28 21:30:59,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"#include\n#include\nint main()\n{\n int a, b, theta;\n float c,s,d;\n scanf(\""%d%d%d\"", &a, &b, &theta);\n \n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""result =\\n\"");\n printf(\""%d %d\"",c,s);\n \n return 0;\n \n}\n",WRONG_ANSWER,4,348 1519670534504235008,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:31:04,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [A]=(B)\na=B(1,1);b=B(1,2);beita=B(1,3);\nA=[1,1];\nA(1,1)=(a^2+b^2-2*a*b*cos(beita*pi/180))^0.5;\nA(1,2)=(a*b*sin(beita*pi/180))/2;\nresult=A;\nend",COMPILE_ERROR,0,0 1519670730822823936,27a0c76f1bdd2ffbb82d8d4d7338a18289dbf1efc2cda0f892a1a3d257dcbc4e,2022-04-28 21:31:51,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,COMPILE_ERROR,0,0 1519670806722949120,0dfb6210e617a64d8e1a1fb3fb971048d2db68ec06ef27651c0745b957b9e815,2022-04-28 21:32:09,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"%函数\nfunction [third,square] = tri(side1,side2,degree)\nthird=(side1^2+side2^2-2*side1*side2*cosd(degree))^(1/2);\nsquare=(((side1+side2+third)/2)*(((side1+side2+third)/2)-side1)*(((side1+side2+third)/2)-side2)*(((side1+side2+third)/2)-third))^(1/2);\n%调用函数\n[third,square] = tri(3,4,90)；\nresult=[third,square]\n",WRONG_ANSWER,28,6604 1519670861777371136,27a0c76f1bdd2ffbb82d8d4d7338a18289dbf1efc2cda0f892a1a3d257dcbc4e,2022-04-28 21:32:22,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,1,COMPILE_ERROR,0,0 1519671003729412096,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:32:56,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"s=input(\""input\"");\nl1=s(1);\nl2=s(2);\nangle=s(3)*pi/180;\nl3=(l1^2+l2^2-2*l1*l2*cos(angle))^0.5;\ns=1/2*l1*l2*sin(angle);\nl3,s",WRONG_ANSWER,31,6916 1519671127809507328,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:33:25,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"s=input(\""input\"");\nl1=s(1);\nl2=s(2);\nangle=s(3)*pi/180;\nl3=(l1^2+l2^2-2*l1*l2*cos(angle))^0.5;\ns=1/2*l1*l2*sin(angle);\nresult=[l3 s];\nresult",WRONG_ANSWER,28,6756 1519671153847742464,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:33:31,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"s=input(\""input\"");\nl1=s(1);\nl2=s(2);\nangle=s(3)*pi/180;\nl3=(l1^2+l2^2-2*l1*l2*cos(angle))^0.5;\ns=1/2*l1*l2*sin(angle);\nresult=[l3 s];",WRONG_ANSWER,27,6496 1519671591057784832,6a6c6132b2d18a83bae76af4b8a406c257763badf8219b2a0a07284c11040c9d,2022-04-28 21:35:16,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,1,COMPILE_ERROR,0,0 1519671736319119360,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:35:50,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"h= 100*1000-(25000*12*2.54/100);\ny = @(x) 2 * 9.8 * h - x.^2;\nx0 = 4e-3;\nk=0;err=1;eps=1e-6;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(y,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(y,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\ninitV = x1*1000;",WRONG_ANSWER,70,7956 1519671783727349760,6a6c6132b2d18a83bae76af4b8a406c257763badf8219b2a0a07284c11040c9d,2022-04-28 21:36:02,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,1,COMPILE_ERROR,0,0 1519672241804054528,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-28 21:37:51,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"s=input(\""input\"");\nl1=s(1);\nl2=s(2);\nangle=s(3)*pi/180;\nl3=(l1^2+l2^2-2*l1*l2*cos(angle))^0.5;\ns=1/2*l1*l2*sin(angle);\nresult=[l3 s];",WRONG_ANSWER,26,6756 1519672282866286592,ee92695979e578a3ac2235607cc1806101ba3c445aa7c3cb063b012dbc312bd3,2022-04-28 21:38:01,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"A=[3 4 90];\n\nc=sqrt(A(1)^2+A(2)^2-2*A(1)*A(2)*cosd(A(3)));\nS=0.5*A(1)*A(2)*sind(A(3));\n\nresult = [c,S]",COMPILE_ERROR,0,0 1519672834253701120,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:40:12,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"\nh= 100*1000-(25000*12*2.54/100);\ny = @(x) 2 * 9.8 * h - x.^2;\nx0 = 4e-3;\nk=0;err=1;eps=1e-6;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(y,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(y,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nformat short;\ninitV = x1;\ninitV;",WRONG_ANSWER,68,6780 1519673224781148160,1de33e84a1b86355fdf4b4e367c1b6aaa80da18a599c7bb0c742d17580311b62,2022-04-28 21:41:45,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,a=input('')\ns=a(1)*a(2)*sin(a(3))*0.5,COMPILE_ERROR,0,0 1519673338329350144,adc727b2c701827198e3ea857dca9c7d2d2f08527d80139614f73a28547e6f4d,2022-04-28 21:42:12,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,ACCEPTED,30,8096 1519673384584118272,adc727b2c701827198e3ea857dca9c7d2d2f08527d80139614f73a28547e6f4d,2022-04-28 21:42:23,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,ACCEPTED,27,6496 1519673432667631616,0dfb6210e617a64d8e1a1fb3fb971048d2db68ec06ef27651c0745b957b9e815,2022-04-28 21:42:35,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,format short\nh1=25000*12*2.54*0.01;\nh2=1000*100;\n initV = (2*9.8*(h2-h1))^(1/2),ACCEPTED,27,6760 1519673584669212672,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:43:11,OCaml,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function c=fly(a,b)\nc=1345.6;\nresult=c;\nend",COMPILE_ERROR,0,0 1519673719969054720,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:43:43,OCaml,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [A]=(B)\na=B(1,1);b=B(1,2);beita=B(1,3);\nA=[1,1];\nA(1,1)=(a^2+b^2-2*a*b*cos(beita*pi/180))^0.5;\nA(1,2)=(a*b*sin(beita*pi/180))/2;\nresult=A;\nend",COMPILE_ERROR,0,0 1519674270295310336,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:45:54,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function c=fly(a,b)\nc=1345.6;\nresult=c;\nend",WRONG_ANSWER,27,6612 1519674312099938304,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:46:04,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [A]=(B)\na=B(1,1);b=B(1,2);beita=B(1,3);\nA=[1,1];\nA(1,1)=(a^2+b^2-2*a*b*cos(beita*pi/180))^0.5;\nA(1,2)=(a*b*sin(beita*pi/180))/2;\nresult=A;\nend",WRONG_ANSWER,29,6620 1519674608607866880,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:47:15,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function c=fly(a,b)\nc=1345.6;\nresult=c;\nend",WRONG_ANSWER,26,6624 1519674751105155072,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:47:49,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,[3 4 90]\na = ans(1);\nb = ans(2);\nangle = ans(3);\nc = (a.^2+b.^2-2*a*b*cosd(angle)).^0.5;\nS = 0.5 * a * b * sind(angle);\nans = [c S];,WRONG_ANSWER,30,6784 1519674774853300224,adc727b2c701827198e3ea857dca9c7d2d2f08527d80139614f73a28547e6f4d,2022-04-28 21:47:55,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,ACCEPTED,32,6488 1519674835012206592,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:48:09,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,"function [A]=(B)\na=B(1,1);b=B(1,2);beita=B(1,3);\nA=[1,1];\nA(1,1)=(a^2+b^2-2*a*b*cos(beita*pi/180))^0.5;\nA(1,2)=(a*b*sin(beita*pi/180))/2;\nresult=A;\nend",WRONG_ANSWER,27,6636 1519674907745632256,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:48:26,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,[3 4 90]\na = ans(1);\nb = ans(2);\nangle = ans(3);\nc = (a.^2+b.^2-2*a*b*cosd(angle)).^0.5;\nS = 0.5 * a * b * sind(angle);\nresult = [c S];,WRONG_ANSWER,26,6504 1519674929925111808,53c94d5127e552e422f80f5c2dda27f30f35cb4cc2d6f044664450457a922970,2022-04-28 21:48:32,C,0.0,1519488525215481862,1514802200680230912,1141715823085969408,123,COMPILE_ERROR,0,0 1519675021256065024,53c94d5127e552e422f80f5c2dda27f30f35cb4cc2d6f044664450457a922970,2022-04-28 21:48:53,C,0.0,1519488525215481863,1514817351877615616,1141715705586737152,123,COMPILE_ERROR,0,0 1519675049785724928,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:49:00,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"function initv=fly(a,b)\ninitv=1345.6;\nresult=initv;\nend",WRONG_ANSWER,27,6380 1519675100440330240,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:49:12,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv=1345.6;,WRONG_ANSWER,26,6776 1519675136947556352,b9e7e6f36d21bafd4e3538c473f04d1852a8d2368f444458c90c160f58ca46ab,2022-04-28 21:49:21,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,h=25000*12*2.54/100;\nH=100000-h;\ng=9.8;\nv=(2*g*H)^(1/2);\ninitV=v,ACCEPTED,26,6512 1519675743443927040,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:51:46,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,stdin=input();\na = ans(1);\nb = ans(2);\nangle = ans(3);\nc = (a.^2+b.^2-2*a*b*cosd(angle)).^0.5;\nS = 0.5 * a * b * sind(angle);\nresult = [c S];,WRONG_ANSWER,29,6752 1519676365434040320,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:54:14,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv=1345.6;,WRONG_ANSWER,27,6492 1519676436615577600,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:54:31,Octave,5.0,1519488525215481862,1514802200680230912,1141715823085969408,initV = 1345.6\n,ACCEPTED,28,6492 1519676484774572032,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-28 21:54:42,Octave,0.0,1519488525215481863,1514817351877615616,1141715705586737152,result =\n\n 5 6,WRONG_ANSWER,29,6492 1519677356007014400,1981fc8cccca4fc93007a753032e2da555e43269e0a6574b1ae545fc2d2bc2d8,2022-04-28 21:58:10,C++,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"#include \n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=power(2*g*(h1-h0),1/2);\n}\n\n\n",COMPILE_ERROR,0,0 1519677459279155200,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-28 21:58:35,Octave,0.0,1519488525215481862,1514802200680230912,1141715823085969408,initv=1345.6;,WRONG_ANSWER,28,8192 1519677504711864320,1981fc8cccca4fc93007a753032e2da555e43269e0a6574b1ae545fc2d2bc2d8,2022-04-28 21:58:46,C++,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"#include \n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=sqar(2*g*(h1-h0),1/2);\n}\n\n\n",COMPILE_ERROR,0,0 1519677553692946432,1981fc8cccca4fc93007a753032e2da555e43269e0a6574b1ae545fc2d2bc2d8,2022-04-28 21:58:57,C++,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"#include \n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=power(2*g*(h1-h0),1/2);\n}\n\n\n",COMPILE_ERROR,0,0 1519677826805043200,1981fc8cccca4fc93007a753032e2da555e43269e0a6574b1ae545fc2d2bc2d8,2022-04-28 22:00:02,C++,0.0,1519488525215481862,1514802200680230912,1141715823085969408,"#include \n#include \n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=power(2*g*(h1-h0),1/2);\n \n cout<\n#include \n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=2*g*(h1-h0);\n \n cout<\n#include \n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=sqrt(2*g*(h1-h0));\n \n cout<\n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=sqrt(2*g*(h1-h0));\n \n cout<\n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*12*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=sqrt(2*g*(h1-h0));\n \n cout<\n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*12*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=sqrt(2*g*(h1-h0));\n \n cout<<\""initV = \""<\n#include \nusing namespace std;\n\nint main()\n{\n double h0=25000*12*0.0254;\n double h1=100*1000;\n double g=9.8;\n\n double v0=sqrt(2*g*(h1-h0));\n \n cout<<\""initV = \""<eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,53,6508 1519943074451603456,6f03ca149aaaa3e63703cc0660d113ff26f0095cf2c8fda1a6f6166c473643b2,2022-04-29 15:34:02,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"x = input(\""\"");\ny = (0.6*60-x)/5;\nprint(\""rate = disp(y)\"");\n",WRONG_ANSWER,58,6508 1519944137305014272,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 15:38:16,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,rate = 0.051212,PARTIAL_ACCEPTED,54,6644 1519944179017363456,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 15:38:26,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,rate = 0.051212,PARTIAL_ACCEPTED,51,6500 1519944338233131008,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 15:39:04,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,rate = 0.051212,PARTIAL_ACCEPTED,57,6520 1519944338828726272,db7d0adcfe482c34fafd58754a925cf2afbec3ceb0d7db0ec2026795b23c9834,2022-04-29 15:39:04,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6512 1519944617275981824,db7d0adcfe482c34fafd58754a925cf2afbec3ceb0d7db0ec2026795b23c9834,2022-04-29 15:40:10,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"y=input(\""还款月份\"")\nfun=@(x)180*(x*(1+x)^y)/((1+x)^240-1)-1.2;\n[rate]=newton_secant(fun,0.06,0.05)\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,57,6632 1519944644278923264,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:40:17,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nx=x1;\nend\nx=input\""\"";\n fun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,53,6512 1519944682375786496,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:40:26,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nx=x1;\nend\nx=input\""\"";\n fun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,57,6732 1519945227014549504,494d8c03d5ae4d727e4acfe59308ce2a6e7083d017b0e0bce3df6a53f74c1c52,2022-04-29 15:42:35,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction rate=daikuan(P)\nP=240;\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ndaikuan=x*12\nend",WRONG_ANSWER,53,6952 1519945257796534272,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:42:43,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nend\nx=240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[rate]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,56,6516 1519945358388543488,929cc5f50af9feb390c17c81138514d33805e6981975f99f404e59200b3bb0a8,2022-04-29 15:43:07,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"#include\nint main()\n{\n int men,women,kids;\n //men+women+kids=30\n for(men=0;men<30;men++)\n {\n for(women=0;women<30;women++)\n kid=30-men-women;\n if(30*men+20*women+kids=500)\n {\n printf(\""%dmen\\t%dwomen\\t%dkids\\n\"",men,women,kids);\n }\n }\n }\n}",WRONG_ANSWER,26,6504 1519945457793544192,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:43:31,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nend\nx=input\""\"";\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[rate]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,54,6912 1519945476764368896,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:43:35,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nend\nx=input\""\"";\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[rate]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,57,6908 1519945644045795328,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:44:15,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nend\nx=input(\""\"");\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[rate]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,59,6880 1519945703990792192,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:44:29,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nendfunction\nx=input(\""\"");\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[rate]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,58,6632 1519945931947032576,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-29 15:45:24,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,function y=m(x)\nk=60;\nA0=N;\nm0=6000;\ny=x^(k+1)-(1+m0/A0)*x^k+m0/A0,WRONG_ANSWER,57,6744 1519946071483121664,1dc27dfc19d6677cefaf0a4942b14b3802f04dc894347eab6f919e66e5fd75a6,2022-04-29 15:45:57,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"input=N;\nrate=purchase(10000*N,0,6000,60);\nresult=12*rate",WRONG_ANSWER,54,6640 1519946152345108480,b12496bda123eb86567a75be56f63c17640f172c11214e8df197b39fe0b27e1f,2022-04-29 15:46:16,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=newton(fun,x0,eps,maxiter)\n\nif nargin<2,\n error('输入参数至少需要2个！'),\nend\nif nargin<3|isempty(eps),eps=1e-6;\nend\nif nargin<4|isempty(maxiter),maxiter=1e4;\nend\nk=0;\nerr=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0]=feval(fun,x0);\n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\n if k>=maxitererror('迭代次数超限，迭代失败！')\nend\nx=x1;\niter=k;\nX=X';\nend\nend",WRONG_ANSWER,55,6936 1519946467710648320,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-29 15:47:31,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,function y=m(x)\nN=input('汽车总价=')\nk=60;\nA0=N;\nm0=6000;\ny=x^(k+1)-(1+m0/A0)*x^k+m0/A0,WRONG_ANSWER,53,6760 1519946491282620416,48feefd8172730ab86ba1ddaba4af191e5bacc2c9e42ef32e63ef51440532b60,2022-04-29 15:47:37,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newtong(fg,x0,eps,maxiter)\n\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fg,x0); % 求函数 fun 的值和 jacobi 矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k; \n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter) \n% 割线法求解非线性方程的根 \n% 输入参数： \n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4 \n% 输出参数： \n% ---x：非线性方程的近似根 \n% ---iter：迭代次数 % ---X：每一步迭代的结果 \nif nargin<3,error('输入参数至少需要 3 个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end \nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps: \n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend\nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; \n x0=x1;x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2 \n if k==maxiter error('迭代次数超限，迭代失败！') \n end \nend \nx=x2;iter=k;X=X';",WRONG_ANSWER,52,6764 1519946519250251776,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-29 15:47:44,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,function y=m(x)\nN=input('汽车总价=')\nk=60;\nA0=N;\nm0=6000;\ny=x^(k+1)-(1+m0/A0)*x^k+m0/A0,WRONG_ANSWER,52,6632 1519946582617788416,48feefd8172730ab86ba1ddaba4af191e5bacc2c9e42ef32e63ef51440532b60,2022-04-29 15:47:59,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newtong(fg,x0,eps,maxiter)\n\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fg,x0); % 求函数 fun 的值和 jacobi 矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k; \n\n",WRONG_ANSWER,55,6760 1519946612946812928,48feefd8172730ab86ba1ddaba4af191e5bacc2c9e42ef32e63ef51440532b60,2022-04-29 15:48:06,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newtong(fg,x0,eps,maxiter)\n\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fg,x0); % 求函数 fun 的值和 jacobi 矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k; \n\n",WRONG_ANSWER,57,6620 1519946641438707712,494d8c03d5ae4d727e4acfe59308ce2a6e7083d017b0e0bce3df6a53f74c1c52,2022-04-29 15:48:13,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction rate=daikuan(P)\nP=240;\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ndaikuan=x*12\nend",WRONG_ANSWER,54,6672 1519946653526704128,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:48:16,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nendfunction\nx=input(\""\"");\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,57,6760 1519946669876084736,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:48:20,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nendfunction\nx=input(\""\"");\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,54,6660 1519946730563485696,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:48:34,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nendfunction\nx=240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,56,6916 1519946741925838848,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:48:37,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nendfunction\nx=240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,55,6620 1519946788788801536,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:48:48,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nend\nx=240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,54,6760 1519946945534144512,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 15:49:25,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda \n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \n end \n tol=fx1/dfx1; % Q: 为什么 tol 是这样？ \n k=k+1; x0 = x1; X(k)=x1;\n if k==maxiter error('迭代次数超限，迭代失败！') \n end \nend \nx=x1;iter=k;X=X'; \nend\nfun=@(x)-1.2+180.*x.*(1+x).^240/((1+x).^240-1);",WRONG_ANSWER,55,6568 1519946983672954880,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:49:34,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nend\nx=240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,1.5,1e-8)",WRONG_ANSWER,55,6780 1519947244533497856,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:50:37,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;\nend\nx=0:1:240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,1.5,1e-8)",WRONG_ANSWER,54,6620 1519947806750572544,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 15:52:51,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,~)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-10;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算在x0处的值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 替换x0的数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend\n",WRONG_ANSWER,52,6708 1519947821736820736,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:52:54,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nx=x1*12;iter=k;X=X';\nend\nx=0:1:240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,56,6768 1519947854683095040,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 15:53:02,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,~)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-10;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算在x0处的值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 替换x0的数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend\nx=0:0.0001:0.01;\nfun=@(x)180.*(x.*(x+1).^240)./((x+1).^240-1)-1.2;%定义函数表达式\n[xx,fx,iter,X]=bisect(fun,0.003,0.005,1e-10);%二分法求解非线性方程\nxx,fx,iter,X\nplot(x,fun(x),[0,0.01],[0,0],'k:',xx,fx,'k*')%绘制图形",WRONG_ANSWER,56,6760 1519947972299751424,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 15:53:30,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a = 180\nb = input(\""\"")\nmmoney = b/a\nmrate = 1.2/mmoney\nrate = mrate*12",WRONG_ANSWER,53,6756 1519948028222418944,6f03ca149aaaa3e63703cc0660d113ff26f0095cf2c8fda1a6f6166c473643b2,2022-04-29 15:53:43,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,1,WRONG_ANSWER,29,6560 1519948113425510400,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:54:04,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nx=x1*12;iter=k;X=X';\nend\nx=0:1:240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,61,6628 1519948355550097408,ebdb0db1b2298cde962bdf4898ebaa75a2e776bc6c064d94ac759cc4d4193787,2022-04-29 15:55:01,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""输入汽车总价。\"");\nx=0.004:0.004:1;\nfun=@(x)(N/72000).*x.*(1+x).^60-(1+x).^60+1;\n[xx,iter,X]=secant(fun,0.004,1,1e-8)\nrate=12*X;\n",WRONG_ANSWER,55,6508 1519948410617118720,ebdb0db1b2298cde962bdf4898ebaa75a2e776bc6c064d94ac759cc4d4193787,2022-04-29 15:55:15,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""输入汽车总价。\"");\nx=0.004:0.004:1;\nfun=@(x)(N/72000).*x.*(1+x).^60-(1+x).^60+1;\n[xx,iter,X]=secant(fun,0.004,1,1e-8)\nrate=12*X;\n",WRONG_ANSWER,56,6756 1519948410642268160,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 15:55:15,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate,iter,X] = steffenson(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;iter=k;X=X';\nend\nx=0:1:240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,53,6884 1519948467751915520,ebdb0db1b2298cde962bdf4898ebaa75a2e776bc6c064d94ac759cc4d4193787,2022-04-29 15:55:28,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""输入汽车总价。\"");\nx=0.004:0.004:1;\nfun=@(x)(N/72000).*x.*(1+x).^60-(1+x).^60+1;\n[xx,iter,X]=secant(fun,0.004,1,1e-8)\nrate=12*X;\n",WRONG_ANSWER,55,6628 1519948659796512768,b12496bda123eb86567a75be56f63c17640f172c11214e8df197b39fe0b27e1f,2022-04-29 15:56:14,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=newton(fun,x0,eps,maxiter)\n\nif nargin<2,\n error('输入参数至少需要2个！'),\nend\nif nargin<3|isempty(eps),eps=1e-6;\nend\nif nargin<4|isempty(maxiter),maxiter=1e4;\nend\nk=0;\nerr=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0]=feval(fun,x0);\n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\n if k>=maxitererror('迭代次数超限，迭代失败！')\nend\nx=x1;\niter=k;\nX=X';\nend\nend\n\nN=@(r)6000*12*(1+r)^5",WRONG_ANSWER,53,6756 1519948680986132480,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-29 15:56:19,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368," fun=@(x)30*(x*(1+x)^5)/((1+x)^5-1)-0.06*12\nfunction[x,fx,iter,X,FX]=bisect(fun,a,b,eps,maxiter,varargin)\n%二分法求解非线性方程的根H1hlep\n%输入参数：\n% ---fun：待求根方程的函数描述\n% ---a,b：初始区间的端点\n% ---eps：精度要求，默认值为1e-6\n% ---p1,p2,...：求根函数附加参数\n%输出参数：\n% ---x：非线性方程的近似根\n% ---fx：根x处的函数值\n% ---iter：迭代次数\n% ---X：每一步迭代的x结果\n% ---FX：每一步迭代的f(x)结果\nif nargin<3\n error('输入参数至少需要3个！')\nend %fun,a,b\nif nargin<4 || isempty(eps)\n eps=1e-6;\nend\nif nargin<5 || isempty(maxiter)\n maxiter=1e4; % 限制最大迭代次数\nend\nfa=feval(fun,a,varargin{:});\nfb=feval(fun,b,varargin{:});\nk=1;%迭代计数器下标从1开始\nif fa*fb>0%不满足二分法使用条件\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;\n fx=fa;\nelseif fb==0%区间右端点为根\n x=b;\n fx=fb;\nelse\n while abs(b-a)>eps && k < maxiter%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%左侧同号，不过零点，下次迭代为右侧\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%右侧同号，不过零点，下次迭代为左侧\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;\n FX(k)=fx;\n k=k+1;\n break % 终止循环\n end\n X(k)=x;FX(k)=fx;k=k+1;\n end\nend\niter=k-1; % 迭代下标-1\n",WRONG_ANSWER,57,6788 1519948745301590016,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-29 15:56:34,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"\nfunction[x,fx,iter,X,FX]=bisect(fun,a,b,eps,maxiter,varargin)\n%二分法求解非线性方程的根H1hlep\n%输入参数：\n% ---fun：待求根方程的函数描述\n% ---a,b：初始区间的端点\n% ---eps：精度要求，默认值为1e-6\n% ---p1,p2,...：求根函数附加参数\n%输出参数：\n% ---x：非线性方程的近似根\n% ---fx：根x处的函数值\n% ---iter：迭代次数\n% ---X：每一步迭代的x结果\n% ---FX：每一步迭代的f(x)结果\nif nargin<3\n error('输入参数至少需要3个！')\nend %fun,a,b\nif nargin<4 || isempty(eps)\n eps=1e-6;\nend\nif nargin<5 || isempty(maxiter)\n maxiter=1e4; % 限制最大迭代次数\nend\nfa=feval(fun,a,varargin{:});\nfb=feval(fun,b,varargin{:});\nk=1;%迭代计数器下标从1开始\nif fa*fb>0%不满足二分法使用条件\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;\n fx=fa;\nelseif fb==0%区间右端点为根\n x=b;\n fx=fb;\nelse\n while abs(b-a)>eps && k < maxiter%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%左侧同号，不过零点，下次迭代为右侧\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%右侧同号，不过零点，下次迭代为左侧\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;\n FX(k)=fx;\n k=k+1;\n break % 终止循环\n end\n X(k)=x;FX(k)=fx;k=k+1;\n end\nend\niter=k-1; % 迭代下标-1\n fun=@(x)30*(x*(1+x)^5)/((1+x)^5-1)-0.06*12",WRONG_ANSWER,53,6624 1519949419724713984,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-29 15:59:15,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算 x0 处的函数值\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nk=0;\nif abs(f1)-abs(f0) < eps\nerror('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.')\nend\nwhile abs(x1-x0)>eps\nk=k+1;\nx2=x1-f1*(x1-x0)/(f1-f0);\nf0=f1;\nx0=x1;x1=x2;\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nX(k)=x2\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x2;iter=k;X=X';\n\nfun=@(x)180*(x.*(1+x)^240)/((1+x)^240-1)-1.2;\n[x]= secant (fun,0,1,1e-8)",WRONG_ANSWER,52,6764 1519949422513926144,494d8c03d5ae4d727e4acfe59308ce2a6e7083d017b0e0bce3df6a53f74c1c52,2022-04-29 15:59:16,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,function result=luxing(n)\nn=20\ntotal=500;\nleft=0;\na=1:10;\nb=0;\nfor i=1:10\n for j=1:n-i\n left=total-30*i;\n left=left-20*j;\n d=n-i-j;\n kids=10*d;\n if(kids==left)\n b=b+1;\n disp('There are 4 possible groups' )\n disp('Group 1 : 11 men 8 women 1 kids' )\n disp('Group 2 : 12 men 6 women 2 kids' )\n disp('Group 3 : 13 men 4 women 3 kids' )\n disp('Group 4 : 14 men 2 women 4 kids' )\n\n end\n end\n \n \nend,WRONG_ANSWER,55,6544 1519949435897937920,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-29 15:59:19,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,a=30;\nb=20;\nc=10;,WRONG_ANSWER,55,6664 1519949577996767232,e3d19301f631a4ad50b097993e53fda924d075419a087f69715b0885aa4006fa,2022-04-29 15:59:53,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,function y=m(x);\n,WRONG_ANSWER,54,6628 1519949705356820480,c03fbebb81eeae161b37cabdf04ef832df4831d6162e9f0e20493160d83c10ad,2022-04-29 16:00:23,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"clear all;clc;\n%rate 贷款月利率\nmoney=N;%贷款额\nmonth=60; %总月数\nfun=@(rate)(money*(rate*(1+rate)^month)/((1+rate)^month-1)-1.2); %构造函数\n[rate_1,iter_1,X_1]=newton_secant(fun,0.007,0.006)\n[rate_2,iter_2,X_2]=steffenson(fun,0.007)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<2,error('输入参数至少需要仨'),\nend\nif nargin<3|isempty(eps),eps=1e-6;\nend\nif nargin<4|isrmpty(maxiter),maxiter=1e4;\nend\nk=0;err=1;\nwhile abs(err)>eps\n k = k+1;\n f0=feval(fun,f0);\n z=feval(fun,f0);\n x1=x0-(f0-x0)^2/(z-2*f0+x0);\n err=abs(x1-x0);\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;iter=k;X=X';",WRONG_ANSWER,55,6788 1519950327250468864,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:02:51,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\n%fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=1;%迭代计数器\nif fa*fb>0 %不满足二分法使用条件\nwarning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;fx=fa;\nelseif fb==0%区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nclear\nclc %清除之前的数据\nx=0:0.0001:0.01;\nfun=@(x)180.*(x.*(x+1).^240)./((x+1).^240-1)-1.2;%定义函数表达式\n[xx,fx,iter,X]=bisect(fun,0.003,0.005,1e-10);%二分法求解非线性方程\nxx,fx,iter,X\nplot(x,fun(x),[0,0.01],[0,0],'k:',xx,fx,'k*')%绘制图形",WRONG_ANSWER,64,6760 1519950373568167936,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:03:03,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\n%fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=1;%迭代计数器\nif fa*fb>0 %不满足二分法使用条件\nwarning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;fx=fa;\nelseif fb==0%区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nx=0:0.0001:0.01;\nfun=@(x)180.*(x.*(x+1).^240)./((x+1).^240-1)-1.2;%定义函数表达式\n[xx,fx,iter,X]=bisect(fun,0.003,0.005,1e-10);%二分法求解非线性方程\nxx,fx,iter,X\nplot(x,fun(x),[0,0.01],[0,0],'k:',xx,fx,'k*')%绘制图形",WRONG_ANSWER,54,6760 1519950392408981504,478f58b50f34539647fa38ed0beab1563fde1b911e481fee9b136ca044a610f5,2022-04-29 16:03:07,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function y=f(fun,num)\nx=num;\ny=eval(fun);%定义函数 fun表示为函数\n\nfunction[x,k]=newton(x0,fun1,fun2,error)%fun1原函数 fun2导函数，error误差，X0是迭代初始\nx=x0;\ny=f(fun1,x);\nk=1; %标记迭代次数\nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs((fun1,x2))>abs(f(fun1,x)\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend",WRONG_ANSWER,61,6620 1519950459681406976,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:03:23,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\n%fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=1;%迭代计数器\nif fa*fb>0 %不满足二分法使用条件\nwarning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;fx=fa;\nelseif fb==0%区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\n\nx=0:0.0001:0.01;\nfun=@(x)180.*(x.*(x+1).^240)./((x+1).^240-1)-1.2;%定义函数表达式\n[xx,fx,iter,X]=bisect(fun,0.003,0.005,1e-10);%二分法求解非线性方程\nxx,fx,iter,X\nplot(x,fun(x),[0,0.01],[0,0],'k:',xx,fx,'k*')%绘制图形",WRONG_ANSWER,52,6768 1519950473489055744,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:03:26,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps \n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend\nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; x0=x1;x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2 \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda \n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \n end \n tol=fx1/dfx1; % Q: 为什么 tol 是这样？ \n k=k+1; x0 = x1; X(k)=x1;\n if k==maxiter error('迭代次数超限，迭代失败！') \n end \nend \nx=x1;iter=k;X=X'; \nend\n",WRONG_ANSWER,69,6608 1519950512571584512,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:03:36,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\n%fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=1;%迭代计数器\nif fa*fb>0 %不满足二分法使用条件\nwarning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;fx=fa;\nelseif fb==0%区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\n\nx=0:0.0001:0.01;\nfun=@(x)180.*(x.*(x+1).^240)./((x+1).^240-1)-1.2;%定义函数表达式\n[xx,fx,iter,X]=bisect(fun,0.003,0.005,1e-10);%二分法求解非线性方程\nxx,fx,iter,X\nplot(x,fun(x),[0,0.01],[0,0],'k:',xx,fx,'k*')%绘制图形",WRONG_ANSWER,53,6628 1519950658587885568,b12496bda123eb86567a75be56f63c17640f172c11214e8df197b39fe0b27e1f,2022-04-29 16:04:10,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=newton(fun,x0,eps,maxiter)\n\nif nargin<2,\n error('输入参数至少需要2个！'),\nend\nif nargin<3|isempty(eps),eps=1e-6;\nend\nif nargin<4|isempty(maxiter),maxiter=1e4;\nend\nk=0;\nerr=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0]=feval(fun,x0);\n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\n if k>=maxitererror('迭代次数超限，迭代失败！')\nend\nx=x1;\niter=k;\nX=X';\nend\nend\n\nN=@(r)6000.*12.*(1+r)^5\n[x,iter,X]=newton(N,0.001)",WRONG_ANSWER,55,6632 1519950776540106752,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:04:39,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps \n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend\nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; x0=x1;x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2 \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda \n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \n end \n tol=fx1/dfx1; % Q: 为什么 tol 是这样？ \n k=k+1; x0 = x1; X(k)=x1;\n if k==maxiter error('迭代次数超限，迭代失败！') \n end \nend \nx=x1;iter=k;X=X'; \nend\n\nfun=@(x)-1.2+180.*x.*(1+x).^240/((1+x).^240-1);\n[x,iter,X]=steffenson(fun,0.005,0.004)",WRONG_ANSWER,53,6632 1519950807573770241,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:04:46,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\n%fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=1;%迭代计数器\nif fa*fb>0 %不满足二分法使用条件\nwarning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;fx=fa;\nelseif fb==0%区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\n\nx=0:0.0001:0.01;\nfun=@(x)180.*(x.*(x+1).^240)./((x+1).^240-1)-1.2;%定义函数表达式\n[xx,fx,iter,X]=bisect(fun,0.003,0.005,1e-10);%二分法求解非线性方程\nxx,fx,iter,X\nplot(x,fun(x),[0,0.01],[0,0],'k:',xx,fx,'k*')%绘制图形",WRONG_ANSWER,65,6792 1519950812699197440,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:04:47,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"fun=@(x)-1.2+180.*x.*(1+x).^240/((1+x).^240-1);\n[x,iter,X]=steffenson(fun,0.005,0.004)",WRONG_ANSWER,64,6776 1519950916952829952,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 16:05:12,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate,iter,X] = newton(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); \n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;iter=k;X=X';\nend\nx=0:1:240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=newton(fun,0.007,0.006)",WRONG_ANSWER,55,6660 1519950919410692096,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:05:13,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nformat long % 为了便于观察，提高精度，采用15字长定点数\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\n%fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=1;%迭代计数器\nif fa*fb>0 %不满足二分法使用条件\nwarning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0%区间左端点为根\n x=a;fx=fa;\nelseif fb==0%区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps%控制二分法结束条件\n x=(a+b)/2;%二分区间端点\n fx=feval(fun,x,varargin{:});%计算中点的函数值\n if fa*fx>0;%条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0;%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else %fx=0\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\n\nx=0:0.0001:0.01;\nfun=@(x)180.*(x.*(x+1).^240)./((x+1).^240-1)-1.2;%定义函数表达式\n[xx,fx,iter,X]=bisect(fun,0.003,0.005,1e-10);%二分法求解非线性方程\nxx,fx,iter,X\nplot(x,fun(x),[0,0.01],[0,0],'k:',xx,fx,'k*')%绘制图形",WRONG_ANSWER,61,6760 1519950994010587136,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-29 16:05:30,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.008);\ndisp x;",WRONG_ANSWER,59,6752 1519951111031664640,48feefd8172730ab86ba1ddaba4af191e5bacc2c9e42ef32e63ef51440532b60,2022-04-29 16:05:58,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"n=input(\""\"")\n\nfor man = 1:n\n for woman = 1:n\n for kid = 1:n\n if(man*30+woman*20+kid*10==500)...\n &(man+woman+kid==30)\n \n \n end\n group= [x,y,z]\n end\n end\nend",WRONG_ANSWER,55,6760 1519951151116627968,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-29 16:06:08,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,">> fprintf(\""There are 3 possible groups.\\nGroup 1 : 1 men, 18 women, 11 kids.\\nGroup 2 : 2 men, 16 women, 12 kids.\\n……\"")",WRONG_ANSWER,29,6508 1519951178937450496,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:06:15,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_downsecant(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps \n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend\nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; x0=x1;x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2 \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda \n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \n end \n tol=fx1/dfx1; % Q: 为什么 tol 是这样？ \n k=k+1; x0 = x1; X(k)=x1;\n if k==maxiter error('迭代次数超限，迭代失败！') \n end \nend \nx=x1;iter=k;X=X'; \nend\n\nfun=@(x)-1.2+180.*x.*(1+x).^240/((1+x).^240-1);\n[x,iter,X]=newton_downsecant(fun,0.005,0.004)",WRONG_ANSWER,70,22440 1519951245287141376,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:06:30,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_downsecant(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps \n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend\nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; x0=x1;x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2 \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda \n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \n end \n tol=fx1/dfx1; % Q: 为什么 tol 是这样？ \n k=k+1; x0 = x1; X(k)=x1;\n if k==maxiter error('迭代次数超限，迭代失败！') \n end \nend \nx=x1;iter=k;X=X'; \nend\n\nfun=@(x)-1.2+180.*x.*(1+x).^240/((1+x).^240-1);\n[x,iter,X]=newton_downsecant(fun,0.005,0.004)",WRONG_ANSWER,68,23132 1519951458907238400,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:07:21,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin < 2, error('输入参数至少需要2个！'),end\nif nargin <3|isempty(eps),eps=1e-6;end\nif nargin <4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhileabs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;%更新lambda\n x1=x0-lambda*fx0/dfx0;%牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);%x0=x1;%书上代码错误，修正\n end\n tol=fx1/dfx1;%Q:为什么tol是这样？\n k=k+1;\n x0=x1;\n X(k)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\n\nend",WRONG_ANSWER,67,18332 1519951535793016832,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 16:07:40,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"")\nX + Y + Z = N\n30X + 20Y +10Z = 500\ncoder.cstructname",WRONG_ANSWER,55,6664 1519951624582234112,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-29 16:08:01,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"int m,w,c;\n\n30 = m+w+c;\n500 = 20*w+30*m+10*c;\n\nGroup(1).men = m;\nGroup(2).wemen = w;\nGroup(3).kids = c;\n\ndisp(['There are' n 'possible groups.']);\ndisp(Group(k)': 'm 'men, 'w 'women, 'c 'kids.');",WRONG_ANSWER,38,6492 1519951834767196160,c03fbebb81eeae161b37cabdf04ef832df4831d6162e9f0e20493160d83c10ad,2022-04-29 16:08:51,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"for man=1:N\n for woman=1:N\n for children=1:N\n if (man*30+woman*20+children*10==500)...\n &(man+woman+children==N)\n fprintf('man:%d\\n',man)\n fprintf('woman:%d\\n',woman)\n fprintf('children:%d\\n',children)\n end\n end\n end\nend\n",WRONG_ANSWER,56,8796 1519951925150269440,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-29 16:09:12,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) \nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda \n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1); \n % x0=x1; % 书上代码错误，修正 \n end\n tol=fx1/dfx1; % Q: 为什么 tol 是这样？\n k=k+1; \n x0 = x1;\n X(k)=x1;\n if k==maxiter \n error('迭代次数超限，迭代失败！') \n end\n end\n x=x1;iter=k;X=X'; \nend\n\nx=0:0.01:2;\n[xx,iter,X]=newton_down(@fun,1,[],100)\nN = input(\""\"");\nfun = @(x)((N*(x*(1+x)^60))/((1+x)^60-1))-0.6;\nplot(x,fun)\n\nrate = 12*x",WRONG_ANSWER,56,6508 1519951945882697728,e3d19301f631a4ad50b097993e53fda924d075419a087f69715b0885aa4006fa,2022-04-29 16:09:17,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"#include\nmain()\n{\nint x,y,z\nprintf(\""Man\\t Woman\\t Children\\t\"");\nfor(x=0;x,=16;x++)\n{\nfor(z=0;z<=50;z++)\n{\ny=30-x-z;\nif(3*x+2*y+z==50 &&y>0)\n{\nprintf(\""%3d\\t %6d\\t %9d\\n\"",x,y,z);\n}\n}\n}\nreturn 0;\n}",WRONG_ANSWER,53,6628 1519952057711235072,e3d19301f631a4ad50b097993e53fda924d075419a087f69715b0885aa4006fa,2022-04-29 16:09:44,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"#include\nmain()\n{\nint x,y,z;\nprintf(\""Man\\t Woman\\t Children\\t\"");\nfor(x=0;x,=16;x++)\n{\nfor(z=0;z<=50;z++)\n{\ny=30-x-z;\nif(3*x+2*y+z==50 &&y>0)\n{\nprintf(\""%3d\\t %6d\\t %9d\\n\"",x,y,z);\n}\n}\n}\nreturn 0;\n}",WRONG_ANSWER,55,6792 1519952072676524032,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-29 16:09:48,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,rate=0.074201;\nresult=[rate];\nrate,PARTIAL_ACCEPTED,52,6512 1519952115458412544,94a906449762e754add90d001ff8f84f29f672edf9bdcdeec5144ffdc1c0fdcf,2022-04-29 16:09:58,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps lambda=1; [fx0,dfx0]=feval(fun,x0); \nx1=x0-lambda*fx0/dfx0; [fx1,dfx1]=feval(fun,x1);\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; % 更新 lambda \nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n[fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \nend \ntol=fx1/dfx1; \nk=k+1; x0 = x1; X(k)=x1;\nif k==maxiter error('迭代次数超限，迭代失败！') end end x=x1;iter=k;X=X'; end\n",WRONG_ANSWER,53,6508 1519952256739348480,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:10:32,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"int a,b,c %分别代表男人，女人和儿童\na + b + c = 30\n30a+20b+10c = 500\na = Group(1).men;\nb = ",WRONG_ANSWER,27,6500 1519952326872305664,fb1068847ed3182409930ec1edcd112aca30722b6e4abfba77caa3ec05d2ae95,2022-04-29 16:10:48,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368," clc; \nclear all;\n N=input('30');\nglobal fnq dfnq\nfnq = @(x) 0.6*(1+x)^60-N; %原方程\ndfnq = @(x) 0.6*60*(1+x)^59; %导函数\n \ntol = (1/2)*10^-4; %精度要求\nx0 = 3.5; %求解起始点=区间中点\ngmax = 1e3; %求解最大迭代次数\nx01 = 0; \nx02 = 1;\n[k,xk,yk,piancha]=newtongexianqx(x0,tol,gmax); \nfprintf('\\n rate = %.5f\\n', 12*xk);\nfunction [k,xk,yk,piancha]=newtongexianqx(x0,tol,gmax)\nglobal fnq dfnq\nx(1)=x0;\nfor i=1:gmax\n x(i+1)=x(i)-fnq(x(i))/(dfnq(x(i)+eps)); \n piancha = abs(x(i+1)-x(i)); \n i=i+1;\n xk=x(i); \n yk=fnq(x(i));\n \n if( pianchagmax \n disp('超过最大迭代次数')\n k=i-1;\n xk=x(i);\n yk=fnq(x(i));\n return;\nend\nend\n",WRONG_ANSWER,55,6760 1519952362632949760,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-29 16:10:57,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\n\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nendfunction\ny = @(x) n*x.*(1+x).^60./((1+x).^60-1)-0.6; \n[x,iter,X]=newton_down(y,4.7e-3,4.6e-3)\nrate=X",WRONG_ANSWER,54,6936 1519952375358472192,7ee74e0bb4bdbeaa1ca1578b3fe31f6eec93daa0721d865d4ffa23db21344a23,2022-04-29 16:11:00,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,fx,iter,X,FX] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin < 2\n error('输入参数至少需要2个！')\nend\nif nargin < 3 || isempty(eps)\n eps = 1e-6;\nend\nif nargin < 4 || isempty(maxiter)\n maxiter = 1e4;\nend\nk = 1;\nfeps = 1;\nwhile abs(feps) > eps;\n k = k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1 = x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n feps = x1-x0; % x误差\n x0 = x1; % 更新x0数值\n if k == 1\n continue\n end\n X(k-1) = x0; % 更新上一个x的值和函数值\n FX(k-1) = f0;\nend\nx = x1;\nfx = feval(fun,x1);\nX(k) = x1;\nFX(k) = fx; % 更新最终迭代的x值和函数值\niter = k;\nend\n\nm = input('');\ntotal = m*10000;\n\nP = @(x)total*x*((1+x)^60)/((1+x)^60-1)-6000;\nrate = steffenson(P,0.0011)*12",PARTIAL_ACCEPTED,56,6932 1519952381796712448,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:11:01,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"int a,b,c %分别代表男人，女人和儿童\na + b + c = 30\n30a+20b+10c = 500\na = Group(1).men;\nb = Group(2).wemen;\nc = Group(3).kids;",WRONG_ANSWER,34,6744 1519952423538429952,473e3da84aef2692b62dc000ece3cdcfa21f284467888086604893bf8f1b3212,2022-04-29 16:11:11,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"day = input(\""\"");\nfun=@(x)180*(x*(1+x)^day)/((1+x)^day-1)-1.2;\nx0 = 0.007;\nx1 = 0.006;\nf0 = feval(fun, x0);\nf1 = feval(fun, x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun, x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun, x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nrate = x2",WRONG_ANSWER,53,6504 1519952465733124096,478f58b50f34539647fa38ed0beab1563fde1b911e481fee9b136ca044a610f5,2022-04-29 16:11:21,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function y=f(fun,num)\nx=input(\""\"")；%输入整数\nx=num;\ny=eval(fun);%定义函数 fun表示为函数\nfun = @(x)(())\n\nfunction[x,k]=newton(x0,fun1,fun2,error)%fun1原函数 fun2导函数，error误差，X0是迭代初始\nx=x0;\ny=f(fun1,x);\nk=1; %标记迭代次数\nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs((fun1,x2))>abs(f(fun1,x)\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend",WRONG_ANSWER,58,6500 1519952675255390208,c4bb0d97a710aa9cdc40ce74b99932fb88b9b47af905e837267cd96ac91963eb,2022-04-29 16:12:11,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); \nf2=feval(fun,x2);\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nendfunction\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2\n[x,iter,X]=newton_down(fun,0.007,0.006)",WRONG_ANSWER,56,6764 1519952690799476736,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-29 16:12:15,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n\nfunction y=m(x)\nN=input('汽车总价=')\nk=60;\nA0=N;\nm0=6000;\ny=x^(k+1)-(1+m0/A0)*x^k+m0/A0",WRONG_ANSWER,56,6752 1519952768096309248,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-29 16:12:33,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"int a,b,c %分别代表男人，女人和儿童\na + b + c = 30\n30a+20b+10c = 500\na = Group(1).men;\nb = Group(2).wemen;\nc = Group(3).kids;\nfprint(“There are XXX possible groups.”)",WRONG_ANSWER,28,6508 1519952846752100352,33bd6439027ef03589368498098225719097362407e6f0ea4014f4c7bb89fb7a,2022-04-29 16:12:52,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"clc;\nclear all;\nN=input('请输入汽车总价(万元)');\nglobal fnq dfnq\nfnq=@(x)0.6*(1+x)^60-N;%yuan\ndfnq=@(x)0.6*60*(1+x)^59;%dao\ntol=(1/2)*10^-4;\nx0=3.5;\ngmax=le3;\nx01=0;\nx02=1;\n[k,xk,yk,piancha]=newtongexianqx(x0,to1,gmax);\nfprintf(\\n 年利率=12*月利率：%.5f\\n',12*xk);\nfonction[k,xk,yk,piancha]=newtongexianqx(x0,to1,gmax)\ngolbal dnq dfnq\nx(1)=x0;\nfor i=1:gmax\n x(i+1)=x(i)-fnq(x(i))/(dfnq(x(i)+eps));\n piancha=abs(x(i+1)-x(i));\n i=i+1;\n xk=x(i);\n yk=fnq(x(i));\n \n if(pianchagmax\n disp('超过最大迭代次数')\n k=i-1;\n xk=x(i);\n yk=fnq(x(i));\n return;\nend\nend\n",WRONG_ANSWER,57,6756 1519952970857361408,bf2f6d6c3ec29fb5ac5f1fb2721a7f46c8062964132d29bdd41b34d8ea083d41,2022-04-29 16:13:22,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function\n[X,ITER,X] = newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('至少输入3个变量');end\nif nargin<4|isempty(eps),eps = le-6;end\nif nargin<5|isempty(maxiter),maxiter = le4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk = 0 ; err = 1;\nwhile abs(err)>eps\n lambda = 1;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nwhile abs (f2)>=abs (f1)\n lambda = lambda/2;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=fi-f0;\nk=k+1;\nX(k)=x2;\nend",WRONG_ANSWER,53,6748 1519953029015580672,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-29 16:13:36,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,fx,iter,X]=bit(fun,a,b,eps,varargin) \nif nargin<3,error('输入参数至少需要 3 个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end\nfa=feval(fun,a,varargin{:});\nfb=feval(fun,b,varargin{:}); \nk=1; \nrate = 0.074201\nif fa*fb==0 \n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']); \nelseif fa==0 \n x=a;fx=fa; \nelseif fb==0 \n x=b;fx=fb; \nelse\n x=b-((b-a)/(fb-fa))*fb; \n fx = feval(fun,x,varargin{:}); \n while abs(b-a)>eps\n x=b-(b-a)/(fb-fa)*fb;\n fx = feval(fun,x,varargin{:});\nif fa*fx>0 \n a = x; \n fa = fx; \nelseif fb*fx>0 \n b = x; \n fb = fx; \nelse\n X(k)=x;k=k+1; \n break \nend\nX(k)=x;k=k+1; \n end\nend\niter=k;\n",WRONG_ANSWER,54,6768 1519953133139181568,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-29 16:14:00,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,fx,iter,X]=bit(fun,a,b,eps,varargin) \nif nargin<3,error('输入参数至少需要 3 个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end\nfa=feval(fun,a,varargin{:});\nfb=feval(fun,b,varargin{:}); \nk=1; \nrate = 0.074201\nif fa*fb==0 \n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']); \nelseif fa==0 \n x=a;fx=fa; \nelseif fb==0 \n x=b;fx=fb; \nelse\n x=b-((b-a)/(fb-fa))*fb; \n fx = feval(fun,x,varargin{:}); \n while abs(b-a)>eps\n x=b-(b-a)/(fb-fa)*fb;\n fx = feval(fun,x,varargin{:});\nif fa*fx>0 \n a = x; \n fa = fx; \nelseif fb*fx>0 \n b = x; \n fb = fx; \nelse\n X(k)=x;k=k+1; \n break \nend\nX(k)=x;k=k+1; \n end\nend\niter=k;\nend function",WRONG_ANSWER,53,6768 1519953453684658176,33bd6439027ef03589368498098225719097362407e6f0ea4014f4c7bb89fb7a,2022-04-29 16:15:17,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"\nclc;\nclear all;\nN=input('请输入汽车总价(万元)');\nglobal fnq dfnq\nfnq=@(x)0.6*(1+x)^60-N;\ndfnq=@(x)0.6*60*(1+x)^59;\n\ntol=(1/2)*10^-4;\nx0=3.5;\ngmax=le3;\nx01=0;\nx02=1;\n[k,xk,yk,piancha]=newtongexianqx(x0,to1,gmax);\nfprintf('\\n 年利率=12*月利率：%.5f\\n',12*xk);\nfunction [k,xk,yk,piancha]=newtongexianqx(x0,to1,gmax)\ngolbal dnq dfnq\nx(1)=x0;\nfor i=1:gmax\n x(i+1)=x(i)-fnq(x(i))/(dfnq(x(i)+eps));\n piancha=abs(x(i+1)-x(i));\n i=i+1;\n xk=x(i);\n yk=fnq(x(i));\n \n if(pianchagmax\n disp('超过最大迭代次数')\n k=i-1;\n xk=x(i);\n yk=fnq(x(i));\n return;\nend\nend",WRONG_ANSWER,58,6752 1519953459179196416,478f58b50f34539647fa38ed0beab1563fde1b911e481fee9b136ca044a610f5,2022-04-29 16:15:18,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function y=f(fun,num)\nx=input(\""\"")；%输入整数\nx=num;\ny=eval(fun);%定义函数 fun表示为函数\nfun = @(x)((180*(x*(1+x)^240))/((1+x^240-1)-1.2；\n\nfunction[x,k]=newton(x0,fun1,fun2,error)%fun1原函数 fun2导函数，error误差，X0是迭代初始\nx=x0;\ny=f(fun1,x);\nk=1; %标记迭代次数\nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs((fun1,x2))>abs(f(fun1,x)\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend",WRONG_ANSWER,52,6528 1519953460173246464,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-29 16:15:18,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) \nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n end\n tol=fx1/dfx1;\n k=k+1; \n x0 = x1; \n X(k)=x1;\nif k==maxiter \n error('迭代次数超限，迭代失败！') \nend\nend\nx=x1;iter=k;X=X'; \nend\nx=0:0.01:2; \nfun=@(x)-0.6+30.*x.*(1+x).^60/((1+x).^60-1); ",WRONG_ANSWER,54,6900 1519953487390093312,33bd6439027ef03589368498098225719097362407e6f0ea4014f4c7bb89fb7a,2022-04-29 16:15:25,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"\nclc;\nclear all;\nN=input('请输入汽车总价(万元)');\nglobal fnq dfnq\nfnq=@(x)0.6*(1+x)^60-N;\ndfnq=@(x)0.6*60*(1+x)^59;\n\ntol=(1/2)*10^-4;\nx0=3.5;\ngmax=le3;\nx01=0;\nx02=1;\n[k,xk,yk,piancha]=newtongexianqx(x0,to1,gmax);\nfprintf('\\n 年利率=12*月利率：%.5f\\n',12*xk);\nfunction [k,xk,yk,piancha]=newtongexianqx(x0,to1,gmax)\ngolbal dnq dfnq\nx(1)=x0;\nfor i=1:gmax\n x(i+1)=x(i)-fnq(x(i))/(dfnq(x(i)+eps));\n piancha=abs(x(i+1)-x(i));\n i=i+1;\n xk=x(i);\n yk=fnq(x(i));\n \n if(pianchagmax\n disp('超过最大迭代次数')\n k=i-1;\n xk=x(i);\n yk=fnq(x(i));\n return;\nend\nend",WRONG_ANSWER,72,6764 1519953919600525312,473e3da84aef2692b62dc000ece3cdcfa21f284467888086604893bf8f1b3212,2022-04-29 16:17:08,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"a='There are 3 possible groups.';\nb='Group 1 : 1 men, 18 women, 11 kids.';\nc='Group 2 : 2 men, 16 women, 12 kids.';\nd='……';\ndisp(a);\ndisp(b);\ndisp(c);\ndisp(d)",WRONG_ANSWER,27,6792 1519953947366821888,bf2f6d6c3ec29fb5ac5f1fb2721a7f46c8062964132d29bdd41b34d8ea083d41,2022-04-29 16:17:15,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function\n[X,ITER,X] = newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('至少输入3个变量');end\nif nargin<4|isempty(eps),eps = le-6;end\nif nargin<5|isempty(maxiter),maxiter = le4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk = 0 ; err = 1;\nwhile abs(err)>eps\n lambda = 1;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nwhile abs (f2)>=abs (f1)\n lambda = lambda/2;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=fi-f0;\nk=k+1;\nX(k)=x2;\nend\nfunction rate=daikuan(P)\nP = 240;\nfun = @(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[X,ITER,X] = newton_secant(fun,0.007,0.006);\ndaikuan = x*12\nend",WRONG_ANSWER,57,6760 1519953950848090112,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-29 16:17:15,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function[i,j,k]=test()\nfor i=1:17\n for j=1:25\n for k=1:50\n if\n 30*x(i)+20*y(j)+10*z(k)=500\n disp(i,j,k)\n end\n end\nend\nendfunction\n[i,j,k]=test()",WRONG_ANSWER,29,6752 1519953993508356096,473e3da84aef2692b62dc000ece3cdcfa21f284467888086604893bf8f1b3212,2022-04-29 16:17:26,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"a='There are 3 possible groups.';\nb='Group 1 : 1 men, 18 women, 11 kids.';\nc='Group 2 : 2 men, 16 women, 12 kids.';\nd='……';\ndisp(a);\ndisp(b);\ndisp(c);\ndisp(d)",WRONG_ANSWER,28,6632 1519954069450440704,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-29 16:17:44,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算 x0 处的函数值\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nk=0; if abs(f1)-abs(f0) < eps:\nerror('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.')\nend\nwhile abs(x1-x0)>eps\nk=k+1;\nx2=x1-f1*(x1-x0)/(f1-f0);\nf0=f1;\nx0=x1;x1=x2;\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nX(k)=x2;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x2;iter=k;X=X';\n\nN=input('');\nf=@(x) 6000*(1+x)^60-N*10000;\n[xx,iter,X]=secant(f,0,1,1e-8);\ny=12*xx;\ndisp(y);",WRONG_ANSWER,54,6752 1519954115793289216,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-29 16:17:55,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input('');\nfun=@(x)180.*(x.*(1+x).^a)/((1+x).^a-1)-1.2;\nx=0:0.01:2;\n[xx,iter,X]=secant(fun,0,2,1e-8)\n\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\nlambda=1;\n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0;\n[fx1,dfx1]=feval(fun,x1);\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; % 更新 lambda\nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n[fx1,dfx1]=feval(fun,x1);\n% x0=x1; % 书上代码错误，修正\nend\ntol=fx1/dfx1;\nk=k+1;\nx0 = x1;\nX(k)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,60,6768 1519954278339350528,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-29 16:18:33,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"clc;clear\nN = 20;\nK = 1;\nfor i = 1:fix(500/30)\n for j = 1:fix((500-30*i)/20)\n if (30*i + 20*j + 10*(N - i - j)) == 500\n Group(K).men = i;\n Group(K).women = j;\n Group(K).kids = N - i - j;\n K = K + 1;\n end\n end\nend\n\nfprintf('There are &d possible groups\\n', K-1)\n\nfor m = 1: K- 1\n fprintf('Group %d: %d men, %d women, %d kids\\n', m, Group1(m).men, Group(m).women, Group(m).kids)\nend\n\nfunction result = inner_product(X, Y)\n len = max([length(X), length(Y)]);\n X = [X, zeros(1, len - length(X))];\n Y = [Y, zeros(1, len - length(Y))];\n result = sum(X. *Y);",WRONG_ANSWER,56,6572 1519954297771556864,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:18:38,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"n=printf(\"" \"");",WRONG_ANSWER,54,6668 1519954322358583296,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:18:44,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"n=printf(\"" \"");",WRONG_ANSWER,57,6632 1519954323725910016,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-29 16:18:44,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input('');\nfun=@(x)180.*(x.*(1+x).^a)/((1+x).^a-1)-1.2;\nx=0:0.01:2;\n[xx,iter,X]=secant(fun,0,2,1e-8)\n\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\nlambda=1;\n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0;\n[fx1,dfx1]=feval(fun,x1);\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; \nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1);\n\nend\ntol=fx1/dfx1;\nk=k+1;\nx0 = x1;\nX(k)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,52,6768 1519954440759574528,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-29 16:19:12,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"clc;clear\nN = 20;\nK = 1;\nfor i = 1:fix(500/30)\n for j = 1:fix((500-30*i)/20)\n if (30*i + 20*j + 10*(N - i - j)) == 500\n Group(K).men = i;\n Group(K).women = j;\n Group(K).kids = N - i - j;\n K = K + 1;\n end\n end\nend\n\nfprintf('There are &d possible groups\\n', K-1)\n\nfor m = 1: K- 1\n fprintf('Group %d: %d men, %d women, %d kids\\n', m, Group1(m).men, Group(m).women, Group(m).kids)\nend\n",WRONG_ANSWER,59,6892 1519954452826603520,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-29 16:19:15,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [L,U,x]=LU_decompose(A,b) \n\nn=length(b); U=zeros(n,n); \nL=eye(n,n); \nU(1,:)=A(1,:); \nL(2:n,1)=A(2:n,1)/U(1,1); \n \nfor k=2:n \n U(k,k:n)=A(k,k:n)-L(k,1:k-1)*U(1:k-1,k:n); \n L(k+1:n,k)=A(k+1:n,k)-L(k+1:n,1:k-1)*U(1:k-1,k); \n L(k+1:n,k)=L(k+1:n,k)/U(k,k); \nend \ny=zeros(n,1); \ny(1)=b(1); \nfor k=2:n \n y(k)=b(k)-L(k,1:k-1)*y(1:k-1); \nend\nx=zeros(n,1); x(n)=y(n)/U(n,n); \nfor k=n-1:-1:1 \n x(k)=(y(k)-U(k,k+1:n)*x(k+1:n))/U(k,k); \nend",WRONG_ANSWER,27,6688 1519954557063434240,c4bb0d97a710aa9cdc40ce74b99932fb88b9b47af905e837267cd96ac91963eb,2022-04-29 16:19:40,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function people(x, y)\nman=1: 28;\nwomen=1: 28;\nkids=1: 28;\n[man, women, kids]=meshgrid(man, woman, kids);\nz1=man+women+kids;\nz2=30man+20women+10kids;\nk=find(z1==x&z2==y);\nX=[man(k) women(k) kids(k)]\nendfunction",WRONG_ANSWER,30,7484 1519954639536046080,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:20:00,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"n=printf(\"" \"");\nif n==20\nprintf(\""There are 4 possible groups.\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.\"")\n",WRONG_ANSWER,65,6592 1519954700676403200,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 16:20:14,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"x=input(\""\"")\nmanPermeal=30;\nwomanPermeal=20;\nchildPermeal=10;\ntotal=500;\nsyms mans woman child\nmans+woman+child=x;\neqn=manPermeal*mans+womanPermeal*woman+childPermeal*child==500;\n[mans,woman,child]=solve(eqn,mans,woman,child);",WRONG_ANSWER,54,6632 1519954703989911552,478f58b50f34539647fa38ed0beab1563fde1b911e481fee9b136ca044a610f5,2022-04-29 16:20:15,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\n",WRONG_ANSWER,56,6636 1519954743890313216,eada660d8db8a7db6c37dc162c0b5a0ea9900d77f45195d3385ba5763d22c437,2022-04-29 16:20:24,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"fprintf('There are 9 possible groups.\\n');\nfor x = 1:30\n for y = 1:30\n for Z = 1:30\n if(30*x+20*y+10*z) == 500 & (x+y+z) == 30\n fprintf('Group 1 : %d men, %d women, %d kids.\\n',i,x,y,z);\n end\n end\n end\nend",WRONG_ANSWER,27,6892 1519954796684029952,494d8c03d5ae4d727e4acfe59308ce2a6e7083d017b0e0bce3df6a53f74c1c52,2022-04-29 16:20:37,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction rate=daikuan(P)\nP=240;\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ndaikuan=x*12\nend",WRONG_ANSWER,54,6760 1519954801889165312,bf2f6d6c3ec29fb5ac5f1fb2721a7f46c8062964132d29bdd41b34d8ea083d41,2022-04-29 16:20:38,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function\n[X,ITER,X] = newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('至少输入3个变量');end\nif nargin<4|isempty(eps),eps = le-6;end\nif nargin<5|isempty(maxiter),maxiter = le4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk = 0 ; err = 1;\nwhile abs(err)>eps\n lambda = 1;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nwhile abs (f2)>=abs (f1)\n lambda = lambda/2;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nfunction rate=daikuan(P)\nP = 240;\nfun = @(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[X,ITER,X] = newton_secant(fun,0.007,0.006);\ndaikuan = x*12\nend",WRONG_ANSWER,58,6632 1519954888086294528,4b4ae46f3071a954a8d23e1c3e37379ef1c3d873bf3396548f9a47f10570a8bc,2022-04-29 16:20:59,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [rate]=secant(fun,x0,x1,eps,maxiter) \n% 割线法求解非线性方程的根 \n% 输入参数： \n% ---fun：迭代函数\n% ---x0,x1：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4 \n% 输出参数： \n% ---x：非线性方程的近似根 \n% ---iter：迭代次数 \n% ---X：每一步迭代的结果 \nif nargin<3\n error('输入参数至少需要 3 个！')\nend\nif nargin<4||isempty(eps)\n eps=1e-6;\nend\nif nargin<5||isempty(maxiter)\n maxiter=1e4;\nend\nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps\n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend\nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; \n x0=x1;\n x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2;\n if k==maxiter \n error('迭代次数超限，迭代失败！') \n end\nend\nrate = 12*x2;\nend",WRONG_ANSWER,54,6756 1519954893618589696,478f58b50f34539647fa38ed0beab1563fde1b911e481fee9b136ca044a610f5,2022-04-29 16:21:00,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function y=f(fun,num)\nx=input(\""\"")；%输入整数\nx=num;\ny=eval(fun);%定义函数 fun表示为函数\nfun = @(x)((180*(x*(1+x)^240))/((1+x^240-1)-1.2;\n\nfunction[x,k]=newton(x0,fun1,fun2,error)%fun1原函数 fun2导函数，error误差，X0是迭代初始\nx=x0;\ny=f(fun1,x);\nk=1; %标记迭代次数\nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs((fun1,x2))>abs(f(fun1,x)\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend",WRONG_ANSWER,53,6788 1519955007766564864,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-29 16:21:27,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [L,U,x]=LU_decompose(A,b) \n\nn=length(b); U=zeros(n,n); \nL=eye(n,n); \nU(1,:)=A(1,:); \nL(2:n,1)=A(2:n,1)/U(1,1); \n \nfor k=2:n \n U(k,k:n)=A(k,k:n)-L(k,1:k-1)*U(1:k-1,k:n); \n L(k+1:n,k)=A(k+1:n,k)-L(k+1:n,1:k-1)*U(1:k-1,k); \n L(k+1:n,k)=L(k+1:n,k)/U(k,k); \nend \ny=zeros(n,1); \ny(1)=b(1); \nfor k=2:n \n y(k)=b(k)-L(k,1:k-1)*y(1:k-1); \nend\nx=zeros(n,1); x(n)=y(n)/U(n,n); \nfor k=n-1:-1:1 \n x(k)=(y(k)-U(k,k+1:n)*x(k+1:n))/U(k,k); \nend",WRONG_ANSWER,27,6516 1519955037697114112,d28ccb1ff7c260a01e9b120b595ca5bbb432a3793f7be1346ba2f3e06edcefff,2022-04-29 16:21:35,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"fun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(funx0,eps,maxiter)",WRONG_ANSWER,54,6748 1519955088775360512,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-29 16:21:47,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,rate = 0.074201,PARTIAL_ACCEPTED,53,6508 1519955089052176384,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:21:47,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod(money,month,x0,EPS) \n%UNTITLED3 此处显示有关此函数的摘要\n% 此处显示详细说明\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0)) %迭代过程一定具有单调性|f(k+1)|r=r/2;调整下山因子保证其单调性\n x2=x0-r*f(x0)/df(x0);\n x1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\n x='Iterative divergence'; %迭代公式发散\nelse\n x=x1; %切记要给x赋值\nrate=x;\nend\nend",WRONG_ANSWER,53,6648 1519955095515607040,c489977a59191a4506e7baf0954b85ae042a5eba49fb8f310b4d3aded9052383,2022-04-29 16:21:48,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate\n=Newtondownhillmethod(money\n,month,x0,EPS)\nM=1,2;\nfun=@(x)money*(x*(1+x)\n^month)/((1+x^month-1)-M;\nf=fcnchk(fun);\n\ndf=fcnchk(dfun);\n\nx1=x0-f(x0)/df(x0);\n\nd=norm(x1-x0);\n\nk=1;\n\nr=1;\n\nwhile d>=EPS\n\nwhile abs(f(x1))>abs(f(x0))\n\n",WRONG_ANSWER,55,6496 1519955119116955648,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-29 16:21:54,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) \nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n end\n tol=fx1/dfx1;\n k=k+1; \n x0 = x1; \n X(k)=x1;\nif k==maxiter \n error('迭代次数超限，迭代失败！') \nend\nend\nx=x1;iter=k;X=X'; \nend\nx=0:0.01:2; \nfun=@(x)-0.6+30.*x.*(1+x).^60/((1+x).^60-1); ",WRONG_ANSWER,55,6656 1519955154269409280,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 16:22:02,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a = 180\nb = input(\""\"")\nmmoney = a/b\nmrate = 1.2/mmoney - 1\nrate = mrate*12",WRONG_ANSWER,54,6760 1519955170069352448,d28ccb1ff7c260a01e9b120b595ca5bbb432a3793f7be1346ba2f3e06edcefff,2022-04-29 16:22:06,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"fun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(funx0,eps,maxiter)",WRONG_ANSWER,55,6692 1519955184770383872,d28ccb1ff7c260a01e9b120b595ca5bbb432a3793f7be1346ba2f3e06edcefff,2022-04-29 16:22:10,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"fun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(funx0,eps,maxiter)",WRONG_ANSWER,67,6492 1519955210938646528,d28ccb1ff7c260a01e9b120b595ca5bbb432a3793f7be1346ba2f3e06edcefff,2022-04-29 16:22:16,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"fun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(funx0,eps,maxiter)",WRONG_ANSWER,57,6628 1519955320586153984,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-29 16:22:42,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,a=30;\nb=20;\nc=10;\n500=ax+by+cz\nfor s=1:50\nr=\n,WRONG_ANSWER,53,6748 1519955345038950400,d28ccb1ff7c260a01e9b120b595ca5bbb432a3793f7be1346ba2f3e06edcefff,2022-04-29 16:22:48,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"fun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(fun,x0,eps,maxiter)",WRONG_ANSWER,57,6748 1519955462802423808,929cc5f50af9feb390c17c81138514d33805e6981975f99f404e59200b3bb0a8,2022-04-29 16:23:16,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"#include\nint main()\n{\n int men,women,kids;\n //men+women+kids=30\n for(men=0;men<30;men++)\n {\n for(women=0;women<30;women++)\n kid=30-men-women;\n if(30*men+20*women+kids=500)\n {\n printf(\""%dmen\\t%dwomen\\t%dkids\\n\"",men,women,kids);\n }\n }\n }\n}",WRONG_ANSWER,26,6760 1519955471644000256,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 16:23:18,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a = 180\nb = input(\""\"")\nmmoney = a/b\nmrate = 1.2/mmoney - 1\nrate = mrate/12",WRONG_ANSWER,53,6628 1519955517257068544,c489977a59191a4506e7baf0954b85ae042a5eba49fb8f310b4d3aded9052383,2022-04-29 16:23:29,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate\n=Newtondownhillmethod(money\n,month,x0,EPS)\nM=1,2;\nfun=@(x)money*(x*(1+x)\n^month)/((1+x^month-1)-M;\nf=fcnchk(fun);\n\ndf=fcnchk(dfun);\n\nx1=x0-f(x0)/df(x0);\n\nd=norm(x1-x0);\n\nk=1;\n\nr=1;\n\nwhile d>=EPS\n\nwhile abs(f(x1))>abs(f(x0))\n\n|f(k+1)|\nr=r/2;\n\nx2=x0-r*f(x0)/df(x0);\n\nx1=x2;\n\nend\n\nx0=x1;",WRONG_ANSWER,54,6756 1519955538039836672,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-29 16:23:34,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"i=0;\nfor m = 1:30\n for w = 1:30\n for c = 1:30\n i = i+1;\n if (30*m+20*w+10*c) == 500 && (w+m+c)==30\n fprint('%dman，%dwom，%dcji \\n',m,w,c);\n end\n end\n end\n fprint('There are %d possible groups.\\n',i);\n fprint('%m men, %w women, %c kids\\n',m,w,c);",WRONG_ANSWER,28,6752 1519955577491468288,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-29 16:23:43,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[30 20 10;1 1 1;0 0 0];\nb=[500;30;0];\n[U,x] = Gauss(A,b);\nx\n\nfunction [U,x]=Gauss(A,b)\nn=length(b);\nfor k=1:n-1\nm=A(k+1:n,k)/A(k,k);\nA(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\nb(k+1:n)=b(k+1:n)-m*b(k);\nA(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor k=n-1:-1:1\nx(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k);\nend",WRONG_ANSWER,26,6756 1519955616930496512,37cb722dbdde513f4cc2dae8ad8acd783194c043aabde376d1a5267eae3187c2,2022-04-29 16:23:53,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate = Newtondownhillmethod\n(money,month,x0,EPS)\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\n\ndf=fcnchk(dfun);\n\nx1=x0-f(x0)/df(x0);\n\nd=norm(x1-x0);\n\nk=1;\n\nr=1;\n\nwhile d>=EPS\n\nwhile abs(f(x1))>abs(f(x0))\nr=r/2;\nx2=x0-r*f(x0)/df(x0);\n\nx1=x2;\n\nend\n\nx0=x1;\n\nr=1;\n\nx1=x0-f(x0)/df(x0);\n\ndisp(x1);\n\ndisp(f(x1));\n\nd=norm(x1-x0);\n\nk=k+1;\n\nend\n\nif k==1000\n\nx='Iterative divergence';\n\nelse\n\nx=x1;\nrate=x;\nend\n\nend",WRONG_ANSWER,54,6644 1519955629232402432,33bd6439027ef03589368498098225719097362407e6f0ea4014f4c7bb89fb7a,2022-04-29 16:23:56,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,function result=luxing(n)\ntotal=500;\nleft=0;\na=1:10;\nb=0;\nfor i=1:10\n for j=1:n-1\n left=total-30*i;\n left=left-20*j;\n d=n-i-j;\n kids=10*d;\n if(kids==left)\n b=b+1;\n disp('There are possible groups')\n disp('Group1:11men 8women 1kids')\n disp('Group2:12men 6women 2kids')\n disp('Group3:13men 4women 3kids')\n disp('Group4:14men 2women 4kids')\n end\n end\n \nend,WRONG_ANSWER,58,6516 1519955650979872768,d28ccb1ff7c260a01e9b120b595ca5bbb432a3793f7be1346ba2f3e06edcefff,2022-04-29 16:24:01,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"fun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(fun,x0,eps,maxiter)",WRONG_ANSWER,57,6764 1519955668054884352,37cb722dbdde513f4cc2dae8ad8acd783194c043aabde376d1a5267eae3187c2,2022-04-29 16:24:05,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate = Newtondownhillmethod(money,month,x0,EPS)\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\n\ndf=fcnchk(dfun);\n\nx1=x0-f(x0)/df(x0);\n\nd=norm(x1-x0);\n\nk=1;\n\nr=1;\n\nwhile d>=EPS\n\nwhile abs(f(x1))>abs(f(x0))\nr=r/2;\nx2=x0-r*f(x0)/df(x0);\n\nx1=x2;\n\nend\n\nx0=x1;\n\nr=1;\n\nx1=x0-f(x0)/df(x0);\n\ndisp(x1);\n\ndisp(f(x1));\n\nd=norm(x1-x0);\n\nk=k+1;\n\nend\n\nif k==1000\n\nx='Iterative divergence';\n\nelse\n\nx=x1;\nrate=x;\nend\n\nend",WRONG_ANSWER,54,6888 1519955686132334592,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-29 16:24:09,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\n if k>=maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x) (0.6*60-N/5*N)-x;% 定义函数表达式\n[x,iter,X]=newton_secant(fun,5,1e-8);%求解\nrate=x;\nrate",WRONG_ANSWER,72,22584 1519955699755417600,f44253256a5f0359be9af07e2a0ed81d093d88b8c34f62f98e04789cc6d49b7c,2022-04-29 16:24:12,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = Newtondownhill(money,month,x0,EPS)\nM = 1.2;\nfun = @(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf = fcnchk(fun);\nx1 = x0-f(x0)/df(x0);\nd = norm(x1-x0);\nk = 1;\nr = 1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0));\nr = r/2;\nx2 = x0-r*f(x0)/df(x0);\nx1 = x2;\nend\nx0 = x1;\nr = 1;\nx1 = x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd = norm(x1-x0);\nk = k+1;\nend\nif k == 1000\nx = 'iterative divergence';\nelse\nx = x1;\nrate = x;\nend \nend\n\n",WRONG_ANSWER,55,6680 1519955713034600448,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-29 16:24:16,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算 x0 处的函数值\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nk=0;\nif abs(f1)-abs(f0) < eps\nerror('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.')\nend\nwhile abs(x1-x0)>eps\nk=k+1;\nx2=x1-f1*(x1-x0)/(f1-f0);\nf0=f1;\nx0=x1;x1=x2;\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nX(k)=x2\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x2;iter=k;X=X';\n\nfun=@(x)180*(x.*(1+x)^240)/((1+x)^240-1)-1.2;\n[x]= secant (fun,0,1,1e-8)",WRONG_ANSWER,60,8704 1519955732244496384,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 16:24:20,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"x=input(\""\"")\nmanPermeal=30;\nwomanPermeal=20;\nchildPermeal=10;\ntotal=500;\nsyms mans woman child\nmans+woman+child=x;\neqn=manPermeal*mans+womanPermeal*woman+childPermeal*child==500;\n[mans,woman,child]=solve(eqn,mans,woman,child);\nfprintf('%d',mans);",WRONG_ANSWER,53,6508 1519955743803998208,ebdb0db1b2298cde962bdf4898ebaa75a2e776bc6c064d94ac759cc4d4193787,2022-04-29 16:24:23,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"a=input(\""\"");\nman=30;\nwomanm=20;\nchild=10;\n",WRONG_ANSWER,34,7696 1519955746089893888,eada660d8db8a7db6c37dc162c0b5a0ea9900d77f45195d3385ba5763d22c437,2022-04-29 16:24:23,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"fprintf('There are 9 possible groups.\\n');\nfor x = 1:30\n for y = 1:30\n for z = 1:30\n if (30*x+20*y+10*z) == 500 & (x+y+z) == 30\n fprintf('Group 1 : %d men, %d women, %d kids.\\n',x,y,z);\n end\n end\n end\nend",WRONG_ANSWER,366,10428 1519955746769375232,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-29 16:24:24,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [rate,iter,X] = newton(fun,x0,eps,maxiter)\nformat long\nk=0;err=1;eps=1e-8;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); \n err=x1-x0;\n x0 = x1; % 更新x0\n X(k)=x1;\nend\nrate=x1*12;iter=k;X=X';\nend\nx=0:1:240;\nfun=@(x)180.*(x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[x,iter,X]=newton(fun,0.007,0.006)",WRONG_ANSWER,58,6764 1519955756571475968,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-29 16:24:26,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"% \n% 1、贷款问题：\n% \n% 你想买一套300万元的房子，首付40%，贷款20年，等额本息，已知月还款额为1.2万元，求贷款月利率为多少？\n% \n% (1) 分别编写二分法和试位法函数代码对题目进行求解；\n% \n% （2）编写代码实现简单迭代法的steffenson加速法进行求解。 \n% \n% 二分法、试位法、迭代法\n\n%300*0.6*x*12*20+300*0.6 =1.2 *20*12贷款计算方程\n%f(x) = 300*0.6*(x*12*20+1)-1.2*12*20=0;\n%x = (1.2*20*12/300/0.6-1)/12/20\nfunction week3()\n\nloan(10^-5) %精度设置为10^-5\n\n\nend\n\nfunction loan(eps)\na = 0;\nb = 1;\n%确定范围，预估月利率在区间[0,1]\n\n'二分法输出结果'\ndich(eps,a,b)\n'试位法输出结果'\nposition(eps,a,b)\n'steffenson加速法进行求解'\nN = 10^10;\niterate(eps,a,N)\nend\n\n\n\n\nfunction dich(eps,a,b) %二分法，esp为可接受误差\na = a;\nb = b ;\nx = 0 ;\neps = eps;\nif f(a)*f(b)>=0\n if f(a) == 0\n a\n elseif f(b) == 0\n b\n else \n '可能无解'\n end\nelse\n while 1\n x = (a+b)/2;\n if f(x) == 0\n x\n break\n else\n if f(a)*f(x)<0\n b = x;\n else\n a = x;\n end\n if (b-a)=0\n if f(a) == 0\n a\n else\n if f(b) == 0\n b\n else\n '可能无解'\n end\n end\nelse\n while 1 %进入循环，满足条件后用break跳出\n x = (a+b)/2;\n if f(x)==0\n x\n break\n else\n if f(a)*f(x)<0\n b = x;\n else \n a = x;\n end\n if (b-a)error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs((fun1,x2))>abs(f(fun1,x)\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2; % 更新 lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);",WRONG_ANSWER,73,8020 1519955784610385920,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 16:24:33,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a = 180\nb = input(\""\"")\nmmoney = a/b\nmrate = 1.2/mmoney - 1\nrate = mrate/12",WRONG_ANSWER,58,6640 1519955806945054720,33bd6439027ef03589368498098225719097362407e6f0ea4014f4c7bb89fb7a,2022-04-29 16:24:38,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,function result=luxing(n)\ntotal=500;\nleft=0;\na=1:10;\nb=0;\nfor i=1:10\n for j=1:n-1\n left=total-30*i;\n left=left-20*j;\n d=n-i-j;\n kids=10*d;\n if(kids==left)\n b=b+1;\n disp('There are possible groups')\n disp('Group1:11men 8women 1kids')\n disp('Group2:12men 6women 2kids')\n disp('Group3:13men 4women 3kids')\n disp('Group4:14men 2women 4kids')\n end\n end\n \nend,WRONG_ANSWER,54,6512 1519955811911106560,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-29 16:24:39,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"f1 = 30*x*(1+i)^60/((1+i)^60-1)-0.6;\n[xx,iter,X] = newton_down(@f1,0,[], 100)\n[xx,iter,X] = secant(@f1,0,2,1e-8)\n",WRONG_ANSWER,72,15472 1519955819288899584,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-29 16:24:41,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [U,x]=Gauss(A,b)\n% 顺序 Gauss 消去法求解线性方程组\n% 输入参数：\n% ---A：线性方程组的系数矩阵\n% ---b：线性方程组的右端项\n% 输出参数：\n% ---U：消元后的上三角方程组的增广矩阵\n% ---x：线性方程组的解\nn=length(b);\n% 消元过程\nfor k=1:n-1 % 消元成上三角矩阵\nm=A(k+1:n,k)/A(k,k);\nA(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\nb(k+1:n)=b(k+1:n)-m*b(k);\nA(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\n% 回代过程\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); % 求 x_n\nfor k=n-1:-1:1 % 回代\nx(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); % 求 x_k，k=n-1,n-2,…,1\nend\n\nA=[30 20 10;\n 1 1 1\n];\nB=[500;30];\n[U,x]=Gauss(A,B);\nlength(x)\n",WRONG_ANSWER,32,11244 1519955828889653248,bf2f6d6c3ec29fb5ac5f1fb2721a7f46c8062964132d29bdd41b34d8ea083d41,2022-04-29 16:24:43,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function\n[X,ITER,X] = newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('至少输入3个变量');end\nif nargin<4|isempty(eps),eps = le-6;end\nif nargin<5|isempty(maxiter),maxiter = le4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk = 0 ; err = 1;\nwhile abs(err)>eps\n lambda = 1;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nwhile abs (f2)>=abs (f1)\n lambda = lambda/2;\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nfunction rate=daikuan(P)\nP = 240;\nfun = @(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[X,ITER,X] = newton_secant(fun,0.007,0.006);\ndaikuan = x*12\nend",WRONG_ANSWER,67,19808 1519955840998617088,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-29 16:24:46,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) \nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n end\n tol=fx1/dfx1; \n k=k+1; \n x0 = x1;\n X(k)=x1;\n if k==maxiter \n error('迭代次数超限，迭代失败！') \n end\n end\n x=x1;iter=k;X=X'; \nend\n\nx=0:0.01:2;\n[xx,iter,X]=newton_down(@fun,1,[],100)\nN = input(\""\"");\nfun = @(x)((N*(x*(1+x)^60))/((1+x)^60-1))-0.6;\n\nx= roots)(fun)\nrate = 12*x",WRONG_ANSWER,59,7456 1519955867435319296,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-29 16:24:52,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,a=30;\nb=20;\nc=10;\n500=ax+by+cz\nfor s=1:50\nr=\n,WRONG_ANSWER,53,6748 1519955886926237696,ebdb0db1b2298cde962bdf4898ebaa75a2e776bc6c064d94ac759cc4d4193787,2022-04-29 16:24:57,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""输入汽车总价。\"");\nx=0.004:0.004:1;\nfun=@(x)(N/72000).*x.*(1+x).^60-(1+x).^60+1;\n[xx,iter,X]=secant(fun,0.004,1,1e-8)\nrate=12*X;\n",WRONG_ANSWER,69,6884 1519955888297787392,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 16:24:57,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a = 180\nb = input(\""\"")\nmmoney = a/b\nmrate = 1.2/mmoney - 1\nrate = mrate/12",WRONG_ANSWER,54,6760 1519955891489652736,6294258c0db2bed3729bbfcf94cb080810cd81cd787128a63c378aa9e70fef3e,2022-04-29 16:24:58,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod\n(money, month, x0, EPS)\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0))\nr=r/2;\nx2=x0-r*f(x0)/df(x0);\nx1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\nx='Iterative divergence';\nelse\nx=x1;\nrate=x;\nend\nend\n",WRONG_ANSWER,68,6744 1519955903258865664,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-29 16:25:01,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"")\nX + Y + Z = N\n30X + 20Y +10Z = 500\ncoder.cstructname",WRONG_ANSWER,60,6744 1519955910049447936,ebdb0db1b2298cde962bdf4898ebaa75a2e776bc6c064d94ac759cc4d4193787,2022-04-29 16:25:03,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"a=input(\""\"");\nman=30;\nwomanm=20;\nchild=10;\n",WRONG_ANSWER,26,6756 1519955918454820864,960cd28fe0d1fba2a61f47e83a3be53b27271db93e30b351256e0ebb277fc91f,2022-04-29 16:25:05,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = Newtondownhillmethod(money,month,x0,EPS)\nM = 1.2;\nfun = @(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf = fcnchk(fun);\ndf = fcnchk(fun);\nx1 = x0-f(x0)/df(x0);\nd = norm(x1-xo);\nk = 1;\nr = 1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0))\nr=r/2\nx2 = x0-r*f(x0)/df(x0);\nx1=x2;\nend\nx0 = x1;\nr = 1\nx1 = x0-f(x0)/DF(X0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k ==1000\nx='lterative divergence;\nelse\nx=x1\nrate=x;\nend\nend",WRONG_ANSWER,52,6760 1519955919813783552,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-29 16:25:05,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"clc;clear\nN = 20;\nK = 1;\nfor i = 1:fix(500/30)\n for j = 1:fix((500-30*i)/20)\n if (30*i + 20*j + 10*(N - i - j)) == 500\n Group(K).men = i;\n Group(K).women = j;\n Group(K).kids = N - i - j;\n K = K + 1;\n end\n end\nend\n\nfprintf('There are &d possible groups\\n', K-1)\n\nfor m = 1: K- 1\n fprintf('Group %d: %d men, %d women, %d kids\\n', m, Group1(m).men, Group(m).women, Group(m).kids)\nend\n",WRONG_ANSWER,67,6768 1519955945361289216,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-29 16:25:11,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"f1 = 30*x*(1+i)^60/((1+i)^60-1)-0.6;\n[xx,iter,X] = newton_down(@f1,0,[], 100)\n[xx,iter,X] = secant(@f1,0,2,1e-8)\n",WRONG_ANSWER,57,6648 1519955972032856064,c489977a59191a4506e7baf0954b85ae042a5eba49fb8f310b4d3aded9052383,2022-04-29 16:25:17,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate\n=Newtondownhillmethod(money\n,month,x0,EPS)\nM=1,2;\nfun=@(x)money*(x*(1+x)\n^month)/((1+x^month-1)-M;\nf=fcnchk(fun);\n\ndf=fcnchk(dfun);\n\nx1=x0-f(x0)/df(x0);\n\nd=norm(x1-x0);\n\nk=1;\n\nr=1;\n\nwhile d>=EPS\n\nwhile abs(f(x1))>abs(f(x0))\n\n|f(k+1)|\nr=r/2;\n\nx2=x0-r*f(x0)/df(x0);\n\nx1=x2;\n\nend\n\nx0=x1;\n\nr=1;\nx1=x0-f(x0)/df(x0);\n\ndisp(x1);\n\nd=",WRONG_ANSWER,67,6772 1519955977581920256,6294258c0db2bed3729bbfcf94cb080810cd81cd787128a63c378aa9e70fef3e,2022-04-29 16:25:19,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod\n(money, month, x0, EPS)\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0))\nr=r/2;\nx2=x0-r*f(x0)/df(x0);\nx1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\nx='Iterative divergence';\nelse\nx=x1;\nrate=x;\nend\nend\n",WRONG_ANSWER,59,6504 1519955978915721216,48feefd8172730ab86ba1ddaba4af191e5bacc2c9e42ef32e63ef51440532b60,2022-04-29 16:25:19,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newtong(fg,x0,eps,maxiter)\n\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fg,x0); % 求函数 fun 的值和 jacobi 矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k; \n\n",WRONG_ANSWER,54,6500 1519955995520962560,48feefd8172730ab86ba1ddaba4af191e5bacc2c9e42ef32e63ef51440532b60,2022-04-29 16:25:23,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"n=input(\""\"")\n\nfor man = 1:n\n for woman = 1:n\n for kid = 1:n\n if(man*30+woman*20+kid*10==500)...\n &(man+woman+kid==30)\n \n \n end\n group= [x,y,z]\n end\n end\nend",WRONG_ANSWER,59,7036 1519956056585830400,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:25:37,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_downsecant(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps \n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend\nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; x0=x1;x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2 \nwhile abs(tol)>eps \n lambda=1; \n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda \n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \n end \n tol=fx1/dfx1; % Q: 为什么 tol 是这样？ \n k=k+1; x0 = x1; X(k)=x1;\n if k==maxiter error('迭代次数超限，迭代失败！') \n end \nend \nx=x1;iter=k;X=X'; \nend\n\nfun=@(x)-1.2+180.*x.*(1+x).^240/((1+x).^240-1);\n[x,iter,X]=newton_downsecant(fun,0.005,0.004)",WRONG_ANSWER,51,6764 1519956069357498368,94a906449762e754add90d001ff8f84f29f672edf9bdcdeec5144ffdc1c0fdcf,2022-04-29 16:25:41,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n[m,n]=size(A); r1=rank(A); r2=rank([A b]);\nif r1==r2 if r1==n disp('方程组是恰定的，有唯一解！') x=A\\b; e=norm(A*x-b);\nelse\ndisp('方程组是欠定的，有无穷解！') z=null(sym(A)); %解出规范化的化零空间\nx0=sym(A)\\sym(b); %求出一个特解\ncolnum = size(z,2); k =[]; for i = 1:colnum k = [k sym(['k' num2str(i)])]; end\nx = z*k' + x0; e=norm(A*x-b); %检验解的准确性\nend \nelse\ndisp('方程组是超定的，只有最小二乘意义下的解！') x=A\\b;\ne=norm(A*x-b); \nend",WRONG_ANSWER,53,6764 1519956079759376384,085e04c666958f2db65f1fae470d1a2a27ca2cc56437967f037e118ba2d3851b,2022-04-29 16:25:43,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"n=printf(\"" \"");\nif n==20\nprintf(\""There are 4 possible groups.\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.\"")\n",WRONG_ANSWER,53,6508 1519956094699487232,6294258c0db2bed3729bbfcf94cb080810cd81cd787128a63c378aa9e70fef3e,2022-04-29 16:25:47,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod\n(money, month, x0, EPS)\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0))\nr=r/2;\nx2=x0-r*f(x0)/df(x0);\nx1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\nx='Iterative divergence';\nelse\nx=x1;\nrate=x;\nend\nend\n",WRONG_ANSWER,52,6636 1519956107886366720,7ee74e0bb4bdbeaa1ca1578b3fe31f6eec93daa0721d865d4ffa23db21344a23,2022-04-29 16:25:50,Octave,10.0,1519489154327527425,1517141269389144064,1141715823085969408,"total = input('');\ngroup = 1;\nT = [];\nfor men=1:total\n remain = total - men;\n for women = 1:remain\n child = remain - women;\n if child == 0\n continue\n end\n if men*30+women*20+child*10 == 500\n T(group).men = men;\n T(group).women = women;\n T(group).child = child;\n group = group + 1;\n end\n end\nend\nfprintf('There are %d possible groups.\\n',group-1)\nfor i = 1:group-1\n fprintf('Group %d :%d men, %d women, %d kids.\\n',i,T(i).men,T(i).women,T(i).child)\nend",PARTIAL_ACCEPTED,56,6772 1519956191176867840,6294258c0db2bed3729bbfcf94cb080810cd81cd787128a63c378aa9e70fef3e,2022-04-29 16:26:10,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod\n(money, month, x0, EPS)\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0))\nr=r/2;\nx2=x0-r*f(x0)/df(x0);\nx1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\nx='Iterative divergence';\nelse\nx=x1;\nrate=x;\nend\nend\nclear ",WRONG_ANSWER,56,6636 1519956285267685376,929cc5f50af9feb390c17c81138514d33805e6981975f99f404e59200b3bb0a8,2022-04-29 16:26:32,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"#include\nint main()\n{\n int men,women,kids;\n //men+women+kids=30\n for(men=0;men<30;men++)\n {\n for(women=0;women<30;women++)\n kid=30-men-women;\n if(30*men+20*women+kids=500)\n {\n printf(\""%dmen\\t%dwomen\\t%dkids\\n\"",men,women,kids);\n }\n }\n }\n}",WRONG_ANSWER,30,6784 1519956289868824576,f44253256a5f0359be9af07e2a0ed81d093d88b8c34f62f98e04789cc6d49b7c,2022-04-29 16:26:33,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = Newtondownhill(money,month,x0,EPS)\nM = 1.2;\nfun = @(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf = fcnchk(fun);\ndf = fchchk(dfun);\nx1 = x0-f(x0)/df(x0);\nd = norm(x1-x0);\nk = 1;\nr = 1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0));\nr = r/2;\nx2 = x0-r*f(x0)/df(x0);\nx1 = x2;\nend\nx0 = x1;\nr = 1;\nx1 = x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd = norm(x1-x0);\nk = k+1;\nend\nif k == 1000\nx = 'iterative divergence';\nelse\nx = x1;\nrate = x;\nend \nend\n\n",WRONG_ANSWER,56,6772 1519956300165844992,c9e9a75800595440a67d35968c73f996c2630046ac1fd9ff929edc6e39b6bd27,2022-04-29 16:26:36,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate=Newtondownhillmethod(money,month,x0.EPS)\nM=1,2;\nfun=@(x)money*(x*(1+x)^month)/(1+x)",WRONG_ANSWER,55,6756 1519956340494086144,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-29 16:26:45,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\n if k>=maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x) (0.6*60-N/5*N)-x;% 定义函数表达式\n[x,iter,X]=newton_secant(fun,0.007,1e-8);%求解\nrate=x;\nrate",WRONG_ANSWER,56,7040 1519956418633957376,c9e9a75800595440a67d35968c73f996c2630046ac1fd9ff929edc6e39b6bd27,2022-04-29 16:27:04,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate=Newtondownhillmethod(money,month,x0.EPS)\nM=1,2;\nfun=@(x)money*(x*(1+x)^month)/(1+x)^month-1)-M",WRONG_ANSWER,53,6668 1519956455585792000,7ee74e0bb4bdbeaa1ca1578b3fe31f6eec93daa0721d865d4ffa23db21344a23,2022-04-29 16:27:13,Octave,10.0,1519489154327527425,1517141269389144064,1141715823085969408,"total = input('');\ngroup = 1;\nT = [];\nfor men=1:total\n remain = total - men;\n for women = 1:remain\n child = remain - women;\n if child == 0\n continue\n end\n if men*30+women*20+child*10 == 500\n T(group).men = men;\n T(group).women = women;\n T(group).child = child;\n group = group + 1;\n end\n end\nend\nfprintf('There are %d possible groups.\\n',group-1)\nfor i = 1:group-1\n fprintf('Group %d :%d men, %d women, %d kids.',i,T(i).men,T(i).women,T(i).child)\n if i ~= group-1\n fprintf('\\n')\n end\nend",PARTIAL_ACCEPTED,57,6784 1519956889029349376,f44253256a5f0359be9af07e2a0ed81d093d88b8c34f62f98e04789cc6d49b7c,2022-04-29 16:28:56,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,clear all\nckc\nclose all\nsys x1 x2 x3\nGroup = struct('kid'),WRONG_ANSWER,27,6512 1519957025025470464,f44253256a5f0359be9af07e2a0ed81d093d88b8c34f62f98e04789cc6d49b7c,2022-04-29 16:29:28,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"clear all\nckc\nclose all\nsys x1 x2 x3\nGroup = struct('kid'{'men','women',})",WRONG_ANSWER,28,6528 1519957424449028096,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:31:04,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"clear all\nclc\nclose all\nsym x1 x2 x3\nGroup=struct('kid',{'men','women','kids'},'num',{x1,x2,x3});\n\n[Group.mem,Group.women,Group.kids] = solve(30*x1+20*x2+10*x3=500,x1,x2,x3);",WRONG_ANSWER,55,6752 1519957494330331136,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:31:20,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"sym x1 x2 x3\nGroup=struct('kid',{'men','women','kids'},'num',{x1,x2,x3});\n\n[Group.mem,Group.women,Group.kids] = solve(30*x1+20*x2+10*x3=500,x1,x2,x3);",WRONG_ANSWER,62,6588 1519957576840679424,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:31:40,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"sym x1 x2 x3\nGroup=struct('kid',{'men','women','kids'},'num',{x1,x2,x3});\n\n[Group.mem,Group.women,Group.kids] = solve(30.*x1+20.*x2+10.*x3=500,x1,x2,x3);",WRONG_ANSWER,54,6628 1519957640673787904,4b4ae46f3071a954a8d23e1c3e37379ef1c3d873bf3396548f9a47f10570a8bc,2022-04-29 16:31:55,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,N =a+b+c\n500 = 30*a +,WRONG_ANSWER,55,6748 1519957731144937472,4b4ae46f3071a954a8d23e1c3e37379ef1c3d873bf3396548f9a47f10570a8bc,2022-04-29 16:32:17,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,N =a+b+c\n500 = 30*a +20*b+10*c\n,WRONG_ANSWER,55,6756 1519957833951526912,e3d19301f631a4ad50b097993e53fda924d075419a087f69715b0885aa4006fa,2022-04-29 16:32:41,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"#include\nmain()\n{\nint x,y,z;\nprintf(\""Man\\t Woman\\t Children\\t\"");\nfor(x=0;x,=16;x++)\n{\nfor(z=0;z<=50;z++)\n{\ny=30-x-z;\nif(3*x+2*y+z==50 &&y>0)\n{\nprintf(\""%3d\\t %6d\\t %9d\\n\"",x,y,z);\n}\n}\n}\nreturn 0;\n}",WRONG_ANSWER,55,6632 1519957861801693184,b54a1080a5bb025883285ae181647fd4ebba920d25160ab04da83052e8812bac,2022-04-29 16:32:48,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function[x,e]=Linear_equation(A,b)\n%线性方程组的求解%输入参数：\n%---A：方程组的系数矩阵\n%---b：方程组的右端向量%输出参数：\n%---x：方程组的解\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A));%解出规范化的化零空间\n x0=sym(A)\\sym(b);%求出一个特解 \n colnum=size(z,2);\n k=[];\n for i = 1:colnum \n k = [k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);%检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[1 1 1;30 20 10 ];%系数向量%\nb=[N 0]';\n[x,e] = Linear_equation(A,b)\n\n",WRONG_ANSWER,56,6912 1519957889094037504,b54a1080a5bb025883285ae181647fd4ebba920d25160ab04da83052e8812bac,2022-04-29 16:32:54,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = steffensonfixpt(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); \n x1=x0-f0^2/(feval(fun,x0+f0)-f0);\n err=x1-x0;\n x0 = x1;\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\n",WRONG_ANSWER,58,6628 1519958032279175168,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:33:29,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"clear all\nclc\nclose all\nsym x1 x2 x3\nGroup=struct('kid',{'men','women','kids'},'num',{x1,x2,x3});\n\n[Group.mem,Group.women,Group.kids] = solve(30*x1+20*x2+10*x3=500,x1,x2,x3);",WRONG_ANSWER,54,6772 1519958067796553728,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:33:37,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"clear all\nclc\nclose all\nsym x1 x2 x3\nGroup=struct('kid',{'men','women','kids'},'num',{x1,x2,x3});\n[Group.mem,Group.women,Group.kids] = solve(30*x1+20*x2+10*x3=500,x1,x2,x3);",WRONG_ANSWER,51,6752 1519958513835618304,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:35:23,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod(money,month,x0,EPS) \n%UNTITLED3 此处显示有关此函数的摘要\n% 此处显示详细说明\nM=1.2;\nfun=@(x)money*(x*(1+x)^month)/((1+x)^month-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0)) %迭代过程一定具有单调性|f(k+1)|r=r/2;调整下山因子保证其单调性\n x2=x0-r*f(x0)/df(x0);\n x1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\n x='Iterative divergence'; %迭代公式发散\nelse\n x=x1; %切记要给x赋值\nrate=x;\nend\nend",WRONG_ANSWER,54,6908 1519959156021313536,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:37:56,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod(money,month,x0,EPS) \n%UNTITLED3 此处显示有关此函数的摘要\n% 此处显示详细说明\nM=1.2;\nfun=@(x)money*(x*(1+x)^60)/((1+x)^60-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0)) %迭代过程一定具有单调性|f(k+1)|r=r/2;调整下山因子保证其单调性\n x2=x0-r*f(x0)/df(x0);\n x1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\n x='Iterative divergence'; %迭代公式发散\nelse\n x=x1; %切记要给x赋值\nrate=x;\nend\nend",WRONG_ANSWER,53,6512 1519959220399673344,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:38:12,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod(money,month,x0,EPS) \n%UNTITLED3 此处显示有关此函数的摘要\n% 此处显示详细说明\nM=1.2;\nfun=@(x)6000*(x*(1+x)^60)/((1+x)^60-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0)) %迭代过程一定具有单调性|f(k+1)|r=r/2;调整下山因子保证其单调性\n x2=x0-r*f(x0)/df(x0);\n x1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\n x='Iterative divergence'; %迭代公式发散\nelse\n x=x1; %切记要给x赋值\nrate=x;\nend\nend",WRONG_ANSWER,55,6792 1519959345842913280,341b2eb63f81a7ace2a381b8ebdf1508640c8a8d949399aabcbf2fa734884d3e,2022-04-29 16:38:42,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate =Newtondownhillmethod(money,month,x0,EPS) \n%UNTITLED3 此处显示有关此函数的摘要\n% 此处显示详细说明\nM=1.2;\nfun=@(x)360000*(x*(1+x)^60)/((1+x)^60-1)-M;\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\nwhile abs(f(x1))>abs(f(x0)) %迭代过程一定具有单调性|f(k+1)|r=r/2;调整下山因子保证其单调性\n x2=x0-r*f(x0)/df(x0);\n x1=x2;\nend\nx0=x1;\nr=1;\nx1=x0-f(x0)/df(x0);\ndisp(x1);\ndisp(f(x1));\nd=norm(x1-x0);\nk=k+1;\nend\nif k==1000\n x='Iterative divergence'; %迭代公式发散\nelse\n x=x1; %切记要给x赋值\nrate=x;\nend\nend",WRONG_ANSWER,54,6760 1519960224381841408,644a8c597b4f6e8c0a1f80cf528056247bdebed2a8de935fbf3e991f3f2cbe40,2022-04-29 16:42:11,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\nif r1==n\n x=A\\b;\n e=norm(A*x-b);\nelse \n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end \n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\nend\nelse \n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA = [1 1 1; 30 20 10];\nb = [30; 500];\n[x e] = Linear_equation(A,b);\ni=1;\nfor z=11:19\n Group(i).men=z-10;\n Group(i).women=40-2*z;\n Group(i).kids=z;\n i=i+1;\nend\nk=i-1;\nM=['There are ',num2str(k) ,' possible groups.'];\ndisp(M);\nfor s=1:k\n X=['Group ',num2str(s),' : ',num2str(Group(s).men),' men ',num2str(Group(s).women),' women ',num2str(Group(s).kids),' kids ',];\n disp(X);\nend",WRONG_ANSWER,26,6760 1519960758765535232,644a8c597b4f6e8c0a1f80cf528056247bdebed2a8de935fbf3e991f3f2cbe40,2022-04-29 16:44:19,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton 下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\n\nk=1;tol=1;\n\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2; % 更新 lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n [fx1,dfx1]=feval(fun,x1);% x0=x1; % 书上代码错误，修正\n end \n tol=fx1/dfx1; % Q: 为什么 tol 是这样？\n k=k+1;\n x0 = x1;\n X(k)=x1;\n\n if k==maxiter \n error('迭代次数超限，迭代失败！')\n end \nend\nx=x1;iter=k;X=X';\nend\nfunction [y,dy]=f1(x)\nsyms t\ny=180.*(t.*(1+t)^20)./((1+t)^20-1)-1.2; %建模\ndy=diff(y);\nt=x;\ndy=eval(dy);\ny=eval(y);\nend\n[xx,iter,X]=newton_down(@f1,0.5,[],100); % 牛顿下山法求根 \nrate=xx;\nfprintf(rate);",WRONG_ANSWER,61,6888 1519962513305796608,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 16:51:17,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"\n\nfunction x = Steffenson_iteration(fun,x0)\n\neps = 1e-6; % 确定精度\n\nerr = 1; % 初始误差精度为1\n\nwhile err > eps % 终止条件\n y0 = feval(fun,x0); % Steffenson迭代公式\n z0 = feval(fun,y0);\n x = x0 - (y0-x0)^2 / (z0-2*y0+x0);\n\n err = abs(x - x0); % 更新误差精度\n\n x0 = x; % 更新迭代点\n\nend\n\nend\n\n\nfun_ = @(x)180 * x * (1+x)^240 / ((1+x)^240-1) - 1.2 + x; % 贷款迭代算式\n\nrate = Steffenson_iteration(fun_,0.01) % Steffenson迭代法求值\n",WRONG_ANSWER,61,6764 1519967173882187776,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 17:09:48,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = secant(year)\n\nfun = @(x)180 * x * (1+x)^year / ((1+x)^year - 1) - 1.2;\n\nx0 = -3;\nx1 = 2;\n\neps = 1e-6;\n\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\n\nwhile abs(x1-x0) > eps\n x2 = x1-f1*(x1-x0)/(f1-f0);\n f0 = f1;\n x0 = x1;\n x1 = x2;\n f1 = feval(fun,x1);\nend\n\nrate = x2;\n\nend\n\nrate = secant(year)",WRONG_ANSWER,57,6616 1519967213837127680,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 17:09:58,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = secant(year)\n\nfun = @(x)180 * x * (1+x)^year / ((1+x)^year - 1) - 1.2;\n\nx0 = -3;\nx1 = 2;\n\neps = 1e-6;\n\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\n\nwhile abs(x1-x0) > eps\n x2 = x1-f1*(x1-x0)/(f1-f0);\n f0 = f1;\n x0 = x1;\n x1 = x2;\n f1 = feval(fun,x1);\nend\n\nrate = x2;\n\nend\n\nrate = secant(240)",WRONG_ANSWER,54,6760 1519967355684306944,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-29 17:10:31,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"\nfunction [x,iter,X]=steffenson(fun,x0,eps,maxiter)\n if nargin<2,error('输入参数至少需要 2 个！'),end\n if nargin<3|isempty(eps),eps=1e-6;end\n if nargin<4|isempty(maxiter),maxiter=1e4;end \n k=0;\n err = 1;\n while abs(err)>eps&&keps&&keps&&keps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\n\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\n\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_down_secant(y,4.7e-3,4.6e-3)\n\n[x,iter,X]=steffenson(y,4e-3)",WRONG_ANSWER,54,6760 1519968449302937600,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:14:52,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"%总利息N万，贷款60月，每月还款额为0.6万\nN=input(\""总价\"");\nM=60,R=0.6;\n%由计算利息的公式180*x*（1+x）^240/((1+x)^240-1)=1.2可得求x就是求函数180x（1+x）^240-1.2((1+x)^240-1)的零点\nx=(0:0.00001:0.01);\n%定义函数表达式fx\nfun1=@(x)N*x.*(1+x).^60./((1+x).^60-1)-0.6;\nfun1(0.007)\nfun1(0.006)\n%定义函数表达式gx=fx+x\nfun2=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2+x;\n%二分法求解\n[x_1,fx1,X1]=f1(fun1,0.004,0.006,1e-6);\nrate = 12*x_1\n\n\nfunction [x,iter,X]=f1(fun,a,b,eps,maxiter)\n% 牛顿割线法求解非线性方程的根 H1 hlep \n% 输入参数： ---fun：待求根方程的函数描述 \n% ---a,b：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数： ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \nif (abs(fa)-abs(fb))eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,53,6764 1519968696968200192,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:15:51,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"%总利息N万，贷款60月，每月还款额为0.6万\nN=input(\""总价\"");\nM=60,R=0.6;\nx=(0:0.00001:0.01);\n%定义函数表达式fx\nfun1=@(x)N*x.*(1+x).^60./((1+x).^60-1)-0.6;\nfun1(0.007)\nfun1(0.006)\n%牛顿法求解\n[x_1,fx1,X1]=f1(fun1,0.004,0.006,1e-6);\nrate = 12*x_1\n\n\nfunction [x,iter,X]=f1(fun,a,b,eps,maxiter)\n% 牛顿割线法求解非线性方程的根 H1 hlep \n% 输入参数： ---fun：待求根方程的函数描述 \n% ---a,b：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数： ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \nif (abs(fa)-abs(fb))eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,53,6504 1519968795026833408,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-29 17:16:15,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input('');\nfun=@(x)180*(x*(1+x)^240)/((1+x)^a-1)-1.2;\n[rate]=steffenson(fun,0.005)\nfunction [x] = steffenson(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); \n x1=x0-f0^2/(feval(fun,x0+f0)-f0); \n err=x1-x0;\n x0 = x1; \n X(k)=x1;\nend\nx=x1;iter=k;\nend",WRONG_ANSWER,56,6748 1519968887095996416,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:16:36,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"%总利息N万，贷款60月，每月还款额为0.6万\nN=input(\""总价\"");\nM=60,R=0.6;\nx=(0:0.00001:0.01);\n%定义函数表达式fx\nfun1=@(x)N*x.*(1+x).^60./((1+x).^60-1)-0.6;\nfun1(0.007)；\nfun1(0.006)；\n%牛顿法求解\n[x_1,fx1,X1]=f1(fun1,0.004,0.006,1e-6);\nrate = 12*x_1\n\n\nfunction [x,iter,X]=f1(fun,a,b,eps,maxiter)\n% 牛顿割线法求解非线性方程的根 H1 hlep \n% 输入参数： ---fun：待求根方程的函数描述 \n% ---a,b：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数： ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \nif (abs(fa)-abs(fb))eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,51,6756 1519969087155900416,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-29 17:17:24,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input('');\nfun=@(x)180*(x*(1+x)^240)/((1+x)^a-1)-1.2;\n[rate] = steffenson(fun,0.005)\nfunction [x] = steffenson(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); \n x1=x0-f0^2/(feval(fun,x0+f0)-f0); \n err=x1-x0;\n x0 = x1; \n X(k)=x1;\nend\nx=x1;iter=k;\nend",WRONG_ANSWER,55,6568 1519969107959656448,fc622031909fd01e20e29d9a630a8e53e363d4c3210424fe4cb2be9f3759c759,2022-04-29 17:17:29,Octave,20.0,1519489154327527425,1517141269389144064,1141715823085969408,"N= input('');\nans=1;\nfor i=1:17\n for j=1:25\n for k=1:50\n if(i+j+k==N)\n if(i*30+j*20+k*10==500)\n Group(ans).men=i;\n Group(ans).women=j;\n Group(ans).kids=k;\n ans=ans+1;\n end\n end\n end\n end\nend\nans=ans-1;\nfprintf('There are %d possible groups.\\n',ans);\nfor i=1:ans\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\nend",ACCEPTED,153,6564 1519969232048144384,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-29 17:17:59,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input('');\nfun=@(x)180*(x*(1+x)^240)/((1+x)^a-1)-1.2;\nrate = steffenson(fun,0.005)\nfunction [x] = steffenson(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); \n x1=x0-f0^2/(feval(fun,x0+f0)-f0); \n err=x1-x0;\n x0 = x1; \n X(k)=x1;\nend\nx=x1;iter=k;\nend",WRONG_ANSWER,67,6756 1519969240394805248,1166c2e06bd782ea7811e3ede4e1e8f6437e3dcd49b7bba8f8a6f488bfc31593,2022-04-29 17:18:01,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=func(fun,x0,x1,eps,maxiter)\n if nargin<3,error('输入参数至少需要 3 个！'),end\n if nargin<4||isempty(eps)\n eps=1e-6;\n end \n if nargin<5||isempty(maxiter)\n maxiter=1e4;\n end \n f0 = feval(fun,x0); % 计算 x0 处的函数值 \n f1 = feval(fun,x1); % 计算 x1 处的函数值\n k=0; \n if abs(f1-f0) < eps\n error('f(x0) = f(x1)，初始迭代条件不符合要求，需重新选择初始点.')\n end\n while abs(x1-x0)>eps \n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1;\n x0=x1;\n x1=x2;\n f1 = feval(fun,x1); % 计算 x1 处的函数值\n X(k)=x2;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\n end\n x=x2;\n iter=k;\n X=X';\nend\n\nfun=@(x) 150.*x.*(1+x).^240 ./ ((1+x).^240-1) - 1;\nx = func(fun, 1e-3, 1e-2, 1e-8);\nrate = x.*12",PARTIAL_ACCEPTED,56,6656 1519969270715416576,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-29 17:18:08,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input('');\nfun=@(x)180*(x*(1+x)^240)/((1+x)^a-1)-1.2;\nrate = steffenson(fun,0.005)\nfunction [x] = steffenson(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); \n x1=x0-f0^2/(feval(fun,x0+f0)-f0); \n err=x1-x0;\n x0 = x1; \n X(k)=x1;\nend\nx=x1;iter=k;\nend",WRONG_ANSWER,63,6776 1519969777735483392,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:20:09,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"x=0:0.01:1;\nfun=@(x)(180.*x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[xx,fx,iter,X]=bisect(fun,0.001,1,1e-8);\nrate=xx*12\n\nfunction[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=0;\nif fa*fb>0 %不满足二分法\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0 %区间左端点为根\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(fa)>eps\n x=b-(b-a)*fb/(fb-fa);\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fx*fb>0\n b=x;\n fb=fx;\n else\n k=k+1;X(k)=x;\n break\n end\n k=k+1;X(k)=x;\n end\nend\niter=k;\nend",WRONG_ANSWER,56,6500 1519969841912512512,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-29 17:20:24,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=steffenson(fun,x0,eps,maxiter)\nif nargin<2,error('至少2个参数'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e6;end\nerr=1;\nk=0;\n while err>eps\n k=k+1;\n f0=feval(fun,x0);\n x1=x0-f0^2/(feval(fun,x0+f0)-f0);\n err=x1-x0;\n x0=x1;\n X(k)=x1;\n if k==maxiter \n error('迭代次数超限');\n end\n end\n x=x1;iter=k;X=X';\nend\nn=input('');\nN=10000*n;\nx=0:0.000001:1;\nf1=N*((1+x)^60)-6000*60;\n[x,iter,X]=steffenson(@f1,0,1e-8);\nrate=12*x;\nfprintf('rate = %.6f',rate);",WRONG_ANSWER,71,14556 1519970714373894144,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:23:52,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"p=input('');\nx=0:0.01:1;\nfun=@(x)(180.*x.*(1+x).^p)./((1+x).^p-1)-1.2;\n[xx,fx,iter,X]=bisect(fun,0.001,1,1e-8);\nrate=xx*12\n\nfunction[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=0;\nif fa*fb>0 %不满足二分法\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0 %区间左端点为根\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(fa)>eps\n x=b-(b-a)*fb/(fb-fa);\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fx*fb>0\n b=x;\n fb=fx;\n else\n k=k+1;X(k)=x;\n break\n end\n k=k+1;X(k)=x;\n end\nend\niter=k;\nend\n\n",WRONG_ANSWER,53,6748 1519970890643718144,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-29 17:24:34,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_g(fun,x0,J,eps,maxiter)\n% Newton 法求解非线性方程组的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点向量\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似解向量\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n fx0=feval(fun,x0); % 求函数 fun 的值\n x1=(x0'-J(x0)\\fx0')'; % 牛顿法迭代公式 和 jacobi 矩阵\n err=norm(x1-x0);\n X(k,:)=x1;\n x0 = x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;\nend\n\nN = input(\""\"");\nsyms R;\nF=[0.6-N*(R+R/((1+R).^60-1))];\nfun = @(r)double(subs(F,[R],r));\nx0 = [1]; % 迭代初值\nJ = jacobian(F,[R]);\nJ = @(r)double(subs(J,[R],r));\n[x,iter,X] = newton_g(fun,x0,J);\ndisp(x(1)*12);",WRONG_ANSWER,56,6656 1519970929755586560,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:24:44,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"%总利息N万，贷款60月，每月还款额为0.6万\nN=input(\""总价\"");\nM=60;\nR=0.6;\nx=(0:0.00001:0.01);\n%定义函数表达式fx\nfun1=@(x)N*x.*(1+x).^60./((1+x).^60-1)-0.6;\na=0;\nb=0;\nfor i=0:0.001:0.01\n if fun1(i)>0\n a=i;\n break\n end\nend\nfor i=0:0.001:0.01\n temp = a-0.001;\n if fun1(temp)<0\n b=temp;\n break\n end\nend\n%牛顿法求解\n[x_1,fx1,X1]=f1(fun1,b,a,1e-6);\nrate = 12*x_1\n\n\nfunction [x,iter,X]=f1(fun,a,b,eps,maxiter)\n% 牛顿割线法求解非线性方程的根 H1 hlep \n% 输入参数： ---fun：待求根方程的函数描述 \n% ---a,b：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数： ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \n\nwhile abs(a-b)>eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,54,6748 1519970981341331456,e9451d76c8d1144f1dd64cf04632cc0b98447b13bd776709e813d5e8074fca08,2022-04-29 17:24:56,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\n\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nr = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2;\nplot(r,y)% 给出房贷利率计算方程，画曲线\n% 牛顿下山法\n[x,iter,X]=newton_down(@y,5-3)\n% 牛顿下山割线法\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_down_secant(y,4.7e-3,4.6e-3)",WRONG_ANSWER,53,6500 1519971017592717312,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:25:04,Octave,20.0,1519489096727154688,1517166904926183424,1141715925804474368,"\nfunction[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要3个！'),end %fun,a,b\nif nargin<4|isempty(eps),eps=1e-6;end %eps\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=0;\nif fa*fb>0 %不满足二分法\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0 %区间左端点为根\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(fa)>eps\n x=b-(b-a)*fb/(fb-fa);\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fx*fb>0\n b=x;\n fb=fx;\n else\n k=k+1;X(k)=x;\n break\n end\n k=k+1;X(k)=x;\n end\nend\niter=k;\nend\np=input('');\nx=0:0.01:1;\nfun=@(x)(180.*x.*(1+x).^p)./((1+x).^p-1)-1.2;\n[xx,fx,iter,X]=bisect(fun,0.001,1,1e-8);\nrate=xx*12\n",ACCEPTED,58,6760 1519971033145196544,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:25:08,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"%总利息N万，贷款60月，每月还款额为0.6万\nN=input(\""总价\"");\nM=60;\nR=0.6;\nx=(0:0.00001:0.01);\n%定义函数表达式fx\nfun1=@(x)N*x.*(1+x).^60./((1+x).^60-1)-0.6;\na=0;\nb=0;\nfor i=0:0.001:0.01\n if fun1(i)>0\n a=i;\n break\n end\nend\nfor i=0:0.001:0.01\n temp = a-0.001;\n if fun1(temp)<0\n b=temp;\n break\n end\nend\n%牛顿法求解\n[x_1,fx1,X1]=f1(fun1,b,a,1e-6);\nrate = 12*x_1\n\n\nfunction [x,iter,X]=f1(fun,a,b,eps,maxiter)\n% 牛顿割线法求解非线性方程的根 H1 hlep \n% 输入参数： ---fun：待求根方程的函数描述 \n% ---a,b：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数： ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \n\nwhile abs(a-b)>eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,54,6764 1519971222627069952,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:25:53,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"format long\n%总利息N万，贷款60月，每月还款额为0.6万\nN=input(\""总价\"");\nM=60;\nR=0.6;\nx=(0:0.00001:0.01);\n%定义函数表达式fx\nfun1=@(x)N*x.*(1+x).^60./((1+x).^60-1)-0.6;\na=0;\nb=0;\nfor i=0:0.001:0.01\n if fun1(i)>0\n a=i;\n break\n end\nend\nfor i=0:0.001:0.01\n temp = a-0.001;\n if fun1(temp)<0\n b=temp;\n break\n end\nend\n%牛顿法求解\n[x_1,fx1,X1]=f1(fun1,b,a,1e-6);\nrate = 12*x_1\n\n\nfunction [x,iter,X]=f1(fun,a,b,eps,maxiter)\n% 牛顿割线法求解非线性方程的根 H1 hlep \n% 输入参数： ---fun：待求根方程的函数描述 \n% ---a,b：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数： ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \n\nwhile abs(a-b)>eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,56,6756 1519971350016458752,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-29 17:26:24,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368," function [x]=four_fun1(fun,a,b,eps,maxiter)\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \nif (abs(fa)-abs(fb))eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;\nend\nN=180,M=240,R=1.2;\nx=(0:0.00001:0.01);\nfun1=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\nfun1(0.004)\nfun2(0.006)\nx=four_fun1(fun1,fun2,0.004,0.006,1e-6);",WRONG_ANSWER,54,6752 1519971376927125504,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:26:30,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"format long\n%总利息N万，贷款60月，每月还款额为0.6万\nN=input(\""总价\"");\nM=60;\nR=0.6;\nx=(0:0.00001:0.01);\n%定义函数表达式fx\nfun1=@(x)N*x.*(1+x).^60./((1+x).^60-1)-0.6;\na=0;\nb=0;\nfor i=0:0.001:0.01\n if fun1(i)>0\n a=i;\n break\n end\nend\nfor i=0:0.001:0.01\n temp = a-0.001;\n if fun1(temp)<0\n b=temp;\n break\n end\nend\n%牛顿法求解\n[x_1,fx1,X1]=f1(fun1,b,a,1e-6);\nrate = 12*x_1\n\n\nfunction [x,iter,X]=f1(fun,a,b,eps,maxiter)\n% 牛顿割线法求解非线性方程的根 H1 hlep \n% 输入参数： ---fun：待求根方程的函数描述 \n% ---a,b：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数： ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \n\nwhile abs(a-b)>eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,54,6640 1519971656792064000,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:27:37,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[1 1 1;30 20 10];\nB=[30 500];\nn=length(b);\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=z*k'+x0; %原方程的通解\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are 11 possible groups\\n');\nfor i = 10:20;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i-9,i-10,40-i,i-10);\nend",WRONG_ANSWER,27,6752 1519971698827378688,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:27:47,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are 11 possible groups\\n');\nfor i = 10:20;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i-9,i-10,40-i,i-10);\nend",WRONG_ANSWER,27,6656 1519971822290907136,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-29 17:28:16,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\n\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\n\n[x1,iter,X]=newton_down(@f,4.7e-3,4.6e-3)\n[x2,iter,X]=steffenson(@y,4e-3)\nrate1=x1*12;\nrate2=x2*12;\n\n% 函数描述文件\nfunction [y,dy] = f(x)\ny = 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\nff = sym('180*x.*(1+x).^240./((1+x).^240-1)-1.2'); % 定义符号函数\ndy = diff(ff); % 求1阶导数\ndy = subs(dy,x); % 替换\nend\n",WRONG_ANSWER,61,6508 1519971839265255424,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-29 17:28:20,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368," function [x]=four_fun1(fun,a,b,eps,maxiter)\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \nif (abs(fa)-abs(fb))eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;\nend\nN=180,M=240,R=1.2;\nx=(0:0.00001:0.01);\nfun1=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\nfun1(0.004)\nfun1(0.006)\nfun2=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2+x;\nx=four_fun1(fun1,0.05,0.004,0.006,1e-6);",WRONG_ANSWER,65,6776 1519971873188777984,e9451d76c8d1144f1dd64cf04632cc0b98447b13bd776709e813d5e8074fca08,2022-04-29 17:28:28,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\n\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nr = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2;\nplot(r,y)% 给出房贷利率计算方程，画曲线\nfun = @(x)180*r.*(1+r).^240./((1+r).^240-1)-1.2;\n% 牛顿下山法\n[x,iter,X]=newton_down(@f,5-3)\n% 牛顿下山割线法\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_down_secant(y,4.7e-3,4.6e-3)",WRONG_ANSWER,56,6908 1519972004466298880,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-29 17:29:00,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4||isempty(eps),eps=1e-6;end\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning('区间[',num2str(a),',',num2str(b),']内可能没有根')\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nend\n\nx=0:0.00001:0.01;\n\nfun=@(x)(180.*x.*(x+1).^240)./((x+1).^240-1)-1.2;\n[xx,fx,iter,X]=bisect(fun,0,1,1e-8);\nxx",WRONG_ANSWER,54,6760 1519972118282944512,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:29:27,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are 10 possible groups\\n');\nfor i = 11:20;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i-10,i-10,40-i,i-10);\nend",WRONG_ANSWER,30,6564 1519972368674500608,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-29 17:30:27,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4||isempty(eps),eps=1e-6;end\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning('区间[',num2str(a),',',num2str(b),']内可能没有根')\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nend\n\nx=0:0.01:1;\n\nfun=@(x)(180.*x.*(x+1).^240)./((x+1).^240-1)-1.2;\n[xx,fx,iter,X]=bisect(fun,0,1,1e-8);\nxx",WRONG_ANSWER,54,6632 1519972753485119488,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-29 17:31:58,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n%---fun：迭代函数\n%---x0,x1：初始迭代点\n%---eps：精度要求，默认值为 1e-6\n%---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n%---x：非线性方程的近似根\n%---iter：迭代次数\n%---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = fun(x0); % 计算 x0 处的函数值\nf1 = fun(x1); % 计算 x1 处的函数值\nk=0;\nif abs(f1)-abs(f0) < eps\nerror('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.')\nend\nwhile abs(x1-x0)>eps\nk=k+1;\nx2=x1-f1*(x1-x0)/(f1-f0);\nf0=f1;\nx0=x1;x1=x2;\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nX(k)=x2;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x2;iter=k;X=X';\nend\n\nN = input(\""\"");\nfun=@(R)0.6-N*(R+R/((1+R).^60-1));\n[xx,iter,X]=secant(fun,0.9,1,1e-4,100);\nrate = xx*12\n",WRONG_ANSWER,54,6784 1519972832006672384,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-29 17:32:17,Octave,20.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n%---fun：迭代函数\n%---x0,x1：初始迭代点\n%---eps：精度要求，默认值为 1e-6\n%---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n%---x：非线性方程的近似根\n%---iter：迭代次数\n%---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = fun(x0); % 计算 x0 处的函数值\nf1 = fun(x1); % 计算 x1 处的函数值\nk=0;\nif abs(f1)-abs(f0) < eps\nerror('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.')\nend\nwhile abs(x1-x0)>eps\nk=k+1;\nx2=x1-f1*(x1-x0)/(f1-f0);\nf0=f1;\nx0=x1;x1=x2;\nf1 = feval(fun,x1); % 计算 x1 处的函数值\nX(k)=x2;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x2;iter=k;X=X';\nend\n\nN = input(\""\"");\nfun=@(R)0.6-N*(R+R/((1+R).^60-1));\n[xx,iter,X]=secant(fun,0.9,1,1e-5,100);\nrate = xx*12\n",ACCEPTED,57,6788 1519972957873537024,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 17:32:47,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0)\neps=1e-6;\nmaxiter=1e4;\nk=1;\ntol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\n if k==maxiter\n error(\""迭代次数超限\"")\n end\nend\nx=x1;\niter=k;\nX=X';\nend\nx=0:0.0001:0.01;\nfun=@(x)(180.*x.*(1+x).^240)./((1+x).^240-1)-1.2;\n[xx,iter,X]=newton_down(fun,0.1);",WRONG_ANSWER,53,6508 1519973231027585024,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 17:33:52,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = secant(year)\n\nfun = @(x)180 * x * (1+x)^year / ((1+x)^year - 1) - 1.2;\n\nx0 = -3;\nx1 = 2;\n\neps = 1e-6;\n\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\n\nwhile abs(x1-x0) > eps\n x2 = x1-f1*(x1-x0)/(f1-f0);\n f0 = f1;\n x0 = x1;\n x1 = x2;\n f1 = feval(fun,x1);\nend\n\nrate = x2;\n\nend\n\nrate = secant(240)",WRONG_ANSWER,53,6748 1519973405611294720,64c5b938b1c1f69feb1f7f9b5e01b9b8bca6e218447cc6486b442e0c99030608,2022-04-29 17:34:34,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function x=newton_secant(fun,x0,x1,eps,maxiter) \n\nif nargin<3,error('输入参数至少需要 3 个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end \nif nargin<5|isempty(maxiter),maxiter=1e4;end\n\nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps\n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \nend \nwhile abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; \n x0=x1;x1=x2; \n f1 = feval(fun,x1); % 计算 x1 处的函数值 \n X(k)=x2;\n if k==maxiter \n error('迭代次数超限，迭代失败！') \n end \nend \ny=x2;\niter=k;\nX=X';\nx=12*x2;\nend\n\nx=0:0.01:2;\nfun=@(x)180*(x*(1+x).^240)./((1+x).^240-1)-1.2;\nrate=newton_secant(fun,0.002,0.008,1e-8)",PARTIAL_ACCEPTED,54,6796 1519973661145071616,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-29 17:35:35,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate=newton_down(N,eps,maxiter)\n% Newton 下山法求解非线性方程的根\n% 输入参数：\n% ---N：总价\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<1,error('输入参数至少需要 1 个！'),end\nif nargin<2|isempty(eps),eps=1e-6;end\nif nargin<3|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nsyms x;\nfun = (N/60)*(1+x)-0.6;\nwhile abs(tol)>eps\nlambda=1;\n[fx0,dfx0]=feval(fun,0.1);\nx1=x0-lambda*fx0/dfx0;\n[fx1,dfx1]=feval(fun,x1);\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; % 更新 lambda\nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n[fx1,dfx1]=feval(fun,x1);\nend\ntol=fx1/dfx1;\nk=k+1;\nx0 = x1;\nX(k)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\n\nx = x * 12;\nend",WRONG_ANSWER,69,22860 1519973693952933888,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-29 17:35:43,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate=newton_down(N,eps,maxiter)\n% Newton 下山法求解非线性方程的根\n% 输入参数：\n% ---N：总价\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<1,error('输入参数至少需要 1 个！'),end\nif nargin<2|isempty(eps),eps=1e-6;end\nif nargin<3|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nsyms x;\nfun = (N/60)*(1+x)-0.6;\nwhile abs(tol)>eps\nlambda=1;\n[fx0,dfx0]=feval(fun,0.1);\nx1=x0-lambda*fx0/dfx0;\n[fx1,dfx1]=feval(fun,x1);\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; % 更新 lambda\nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n[fx1,dfx1]=feval(fun,x1);\nend\ntol=fx1/dfx1;\nk=k+1;\nx0 = x1;\nX(k)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\n\nx = x * 12;\nend",WRONG_ANSWER,60,6760 1519973728765640704,0b130966d4704d1cbef51201371fe5b8c724e2879383e79dcd2826c7a70d12d4,2022-04-29 17:35:51,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction rate=daikuan(P)\nP=240;%在这里改变输入的值\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ndaikuan=x*12\nend\n\n",WRONG_ANSWER,61,6748 1519974254228045824,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 17:37:56,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"R = 0.002 : .001:.005;\ny = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;%y:方程函数\n \n%a=0.004;b=0.005;%根区间\n%x0=1;\ne=10^(-6);%根的容许误差\n%fun=myfunction(R);\n[x,iter,X]=newton_down(@f,0.002,eps,1e4);%二分法\n\np0=0.0045;%初始值\nN=20;%迭代次数\n \n%求解方程\nfunction [y,dy]=f(R)\ny = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;\nff=sym('180*R.*(1+R).^240./((1+R).^240-1)-1.2');\ndy= diff(ff);\ndy= subs(dy,R);\nend\n \nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% -maxiter∶最大迭代次数，默认值为1e4\n%fun=myfunction(a);\nif nargin<2,error('输入参数至少需要2个!') ,end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=le4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval( fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败!')\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,55,7400 1519974481030856704,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-29 17:38:50,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,fx,iter,X] = steffensenfixpt(f,x0,eps,maxiter)\n%steffensen加速迭代法求非线性方程的根\n%输入参数：\n% f,迭代函数\n% x0,初始迭代点\n% eps,精度要求\n% maxiter，最大迭代次数\n%输出参数：\n% x,非线性方程的近似根\n% iter,迭代次数\n% X，每步迭代的结果\nif nargin<2,errror('至少输入2个参数！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nerr=1;k=0; %err——误差，随着迭代，误差越来越小\n\nwhile err>eps\n k=k+1;\n y=f(x0);\n z=f(y);\n x1=x0-(y-x0).^2/(z-2*y+x0);\n err=abs(x1-x0);\n x0=x1; %更新x0\n X(k)=x1;\nend \nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;fx=f(x);iter=k;\nend\n\nmonth=input(\""\"");\nfun=@(r)(180*r.*(1+r).^month)./((1+r).^month-1)-1.2;\n[r,f,iter,X3]=steffensenfixpt(fun,0.005);\nrate=r*12",WRONG_ANSWER,74,16508 1519974513964527616,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-29 17:38:58,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function X=Linear_equation(A,b)\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n X=z*k'+x0;\nend \nx=Group.men;\ny=Group.wemen;\nz=Group.kids;\nA=[1,1,1;\n30,20,10];\nb=[30;500];\nX=Linear_equation(A,b);\nx=X(1);\ny=X(2);\nz=X(3);\nB={'There are 11 possible groups.';\n'Group 1 : 0 men, 20 women, 10 kids.';\n'Group 2 : 1 men, 18 women, 11 kids.';\n'Group 3 : 2 men, 16 women, 12 kids.';\n'Group 4 : 3 men, 14 women, 13 kids.';\n'Group 5 : 4 men, 12 women, 14 kids.';\n'Group 6 : 5 men, 10 women, 15 kids.';\n'Group 7 : 6 men, 8 women, 16 kids.';\n'Group 8 : 7 men, 6 women, 17 kids.';\n'Group 9 : 8 men, 4 women, 18 kids.';\n'Group 10 : 9 men, 2 women, 19 kids.';\n'Group 11 : 10 men, 0 women, 20 kids.'};\nfor i=1:11\n B{i}\nend\n\n",WRONG_ANSWER,26,6504 1519974967238770688,5a91ce958a3237765d3acb8b37892d1df7070bb9ca19da23d47210e62296b9c7,2022-04-29 17:40:46,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"a=zeros(16,3);\nb=0;\nfor i=1:16\n for j=1:30-i\n for k=30-i-j\n if 30*i+20*j+10*k==500\n b=b+1;\n a(b,1)=i;\n a(b,2)=j;\n a(b,3)=k;\n end\n end\n end\nend\noutput(\""There are \""'b'\"" possible groups.\"")\nfor i=1:b\n output(\""Group \""'b '\"": \""' a(b,1)'\"" men,\""'a(b,2)'\"" women,\""'a(b,3)'\"" kids.\"")\nend",WRONG_ANSWER,28,6692 1519975000029827072,b9d7198a35e8e67b3a2eb09f9a1b459a1b3a97295a825f0ce8266411e4a88bfe,2022-04-29 17:40:54,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate=purchase(A,A0,b,m)\nif nargin<1\n A=N;A0=0;b=6000;m=60;\nend\n\nr=0.002:.001:.005;\ny=180*r.*(1+r).^240./((1+r).^240-1)-1.2;\nplot(r,y)\n[x,iter,X]=newton_down(@hw91,5-3)\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_down_secant(y,4.7e-3,4.6e-3)\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(y,4e-3)",WRONG_ANSWER,52,6764 1519975031956865024,b9d7198a35e8e67b3a2eb09f9a1b459a1b3a97295a825f0ce8266411e4a88bfe,2022-04-29 17:41:02,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function[x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A); \nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A));%解出规范化的化零空间\n x0=sym(A)\\sym(b);%求出一个特解\n \n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);%检验解的准确性\n end\nN=input(\""\"");\nA=[1 1 1;30 20 10];\nb=[N,500]\ndisp(There are 4 possible groups.)\n",WRONG_ANSWER,52,6508 1519975066056572928,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:41:10,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[1 1 1;30 20 10];\nb=[30;500];\nx=0;\ny=0;\nz=0;\ni=0;\nfor x=0:30\n for y=0:30\n for z=0:30\n if (x+y+z)==30\n if(30*x+20*y+10*z)==500\n i=i+1;\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n end\n end\n end\n end\nend\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are %d possible groups\\n',i);\nfor k = 1:i;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,Group(k).men,Group(k).wemen,Group(k).kids);\nend\n",WRONG_ANSWER,82,6748 1519975119601053696,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 17:41:22,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0)\neps=1e-6;\nmaxiter=1e4;\nk=1;\ntol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\n if k==maxiter\n error(\""迭代次数超限\"")\n end\nend\nx=x1;\niter=k;\nX=X';\nend\nfunction [y,dy]=f1(x)\nsyms t\ny = (180.*t.*(1+t).^240)./((1+t).^240-1)-1.2\ndy=diff(y);\nt = x;\ndy=eval(dy);\ny=eval(y);\nend\n\nx=0:0.0001:0.01;\n[xx,iter,X]=newton_down(@f1,0.1);\nrate=xx",WRONG_ANSWER,54,6876 1519975168879919104,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 17:41:34,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0)\neps=1e-6;\nmaxiter=1e4;\nk=1;\ntol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\n if k==maxiter\n error(\""迭代次数超限\"")\n end\nend\nx=x1;\niter=k;\nX=X';\nend\nfunction [y,dy]=f1(x)\nsyms t\ny = (180.*t.*(1+t).^240)./((1+t).^240-1)-1.2;\ndy=diff(y);\nt = x;\ndy=eval(dy);\ny=eval(y);\nend\n\nx=0:0.0001:0.01;\n[xx,iter,X]=newton_down(@f1,0.1);\nrate=xx",WRONG_ANSWER,56,6760 1519975214056771584,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:41:45,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[1 1 1;30 20 10];\nb=[30;500];\nx=1;\ny=1;\nz=1;\ni=0;\nfor x=0:30\n for y=0:30\n for z=0:30\n if (x+y+z)==30\n if(30*x+20*y+10*z)==500\n i=i+1;\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n end\n end\n end\n end\nend\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are %d possible groups\\n',i);\nfor k = 1:i;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,Group(k).men,Group(k).wemen,Group(k).kids);\nend\n",WRONG_ANSWER,81,6744 1519975518668095488,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:42:58,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[1 1 1;30 20 10];\nb=[30;500];\ni=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if (x+y+z)==30\n if(30*x+20*y+10*z)==500\n i=i+1;\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n end\n end\n end\n end\nend\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are %d possible groups\\n',i);\nfor k = 1:i;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,Group(k).men,Group(k).wemen,Group(k).kids);\nend\n",WRONG_ANSWER,75,6488 1519975634045026304,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:43:25,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[1 1 1;30 20 10];\nb=[30;500];\ni=0;\nfor x=0:30\n for y=0:30\n for z=0:30\n if (x+y+z)==30\n if(30*x+20*y+10*z)==500\n i=i+1;\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n end\n end\n end\n end\nend\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are %d possible groups\\n',i);\nfor k = 1:i;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,Group(k).men,Group(k).wemen,Group(k).kids);\nend\n",WRONG_ANSWER,82,6756 1519975678966005760,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-29 17:43:36,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newtong_down(fun,x0,eps,maxiter,N)\nk=1;tol=1;\nwhile abs(tol)>eps\n la=1;\n [fx0,dfx0]=fun(x0,N);%求函数fun的值和jacobi矩阵\n x1=x0-la*fx0/dfx0; %牛顿法迭代公式\n [fx1,dfx1]=fun(x1,N);\n while abs(fx1)>=abs(fx0)\n la=la*0.5;\n x1=x0-la*fx0/dfx0;\n [fx1,dfx1]=fun(x1,N);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\nend\n\nfunction [y,dy]=f1(x,N)\nsyms t;\ny=5*N*t.*(1+t).^60-3*(1+t).^60+3;\ndy=diff(y);\nt=x;\ndy=eval(dy);\ny=eval(y);\nend\n\nN=input('');\n[x0,fx0,n]=newtong_down(@f1,0.005,1e-8,1000,N);\nresult=x0*12\n",WRONG_ANSWER,54,6908 1519975795299221504,4656dae84891deb3913056727d32336a0a77612f09609dee133334eeaec738f4,2022-04-29 17:44:04,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,function rate = daikuan(months)\nx = 0.000000001;\na = 0;\nb = 1;\nfunc = @(x) 180 * x * (1 + x)^months - 1.2 * ((1 + x)^months - 1);\ncounter = -1;\nwhile ( (func(a)*func(b)<= 0) && (abs(a - b) > x))\n c = (a+b)/2;\n if(func(c)*func(b)< 0)\n counter = counter + 1;\n a = c;\n else\n counter = counter + 1;\n b = c;\n end\nend\n\n rate = (a+b)* 6;\n \nend\n\nrate = daikuan(240)\n\n ,PARTIAL_ACCEPTED,55,6760 1519975865675464704,4656dae84891deb3913056727d32336a0a77612f09609dee133334eeaec738f4,2022-04-29 17:44:20,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,function rate = daikuan(months)\nx = 0.000000001;\na = 0;\nb = 1;\nfunc = @(x) 180 * x * (1 + x)^months - 1.2 * ((1 + x)^months - 1);\ncounter = -1;\nwhile ( (func(a)*func(b)<= 0) && (abs(a - b) > x))\n c = (a+b)/2;\n if(func(c)*func(b)< 0)\n counter = counter + 1;\n a = c;\n else\n counter = counter + 1;\n b = c;\n end\nend\n\n rate = (a+b)* 6\n \nend\n\nrate = daikuan(240)\n\n ,WRONG_ANSWER,57,6768 1519975911036846080,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-29 17:44:31,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e,x0]=Linear_equation(A,b) \n% 线性方程组的求解 \n% 输入参数： \n% ---A：方程组的系数矩阵 \n% ---b：方程组的右端向量 \n% 输出参数： \n% ---x：方程组的解\n% ---e：解的误差 \n[m,n]=size(A); \nr1=rank(A); \nr2=rank([A b]); \nif r1==r2 \nif r1==n \ndisp('方程组是恰定的，有唯一解！') \nx=A\\b; \ne=norm(A*x-b); \nelse\ndisp('方程组是欠定的，有无穷解！') \nz=null(sym(A)); \n%解出规范化的化零空间 \nx0=sym(A)\\sym(b); %求出一个特解 \ncolnum = size(z,2); \nk =[]; \nfor i = 1:colnum \nk = [k sym(['k' num2str(i)])]; \nend \nx = z*k' + x0; \ne=norm(A*x-b); \n%检验解的准确性 \nend \nelse\ndisp('方程组是超定的，只有最小二乘意义下的解！') \nx=A\\b; \ne=norm(A*x-b); \nend \n\nA=[1 1 1;30 20 10];\nb=[30;500];\n[x,e,x0]=Linear_equation(A,b);\nk=1-x0(1);\n\nfor i=1:10\n Group(i).men=x0(1)+k+i-1;\n Group(i).wemen=x0(2)-2(k+i-1);\n Group(i).kids=x0(3)+k+i-1;\n count=count+1;\nend\nfprintf('There are %d possible groups.\\n',count);\nfor i=1:10\n fprintf('Group%d :%d men, %d women, %d kids.\\n',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",WRONG_ANSWER,27,6504 1519975913100447744,4656dae84891deb3913056727d32336a0a77612f09609dee133334eeaec738f4,2022-04-29 17:44:32,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,function rate = daikuan(months)\nx = 0.000000001;\na = 0;\nb = 1;\nfunc = @(x) 180 * x * (1 + x)^months - 1.2 * ((1 + x)^months - 1);\ncounter = -1;\nwhile ( (func(a)*func(b)<= 0) && (abs(a - b) > x))\n c = (a+b)/2;\n if(func(c)*func(b)< 0)\n counter = counter + 1;\n a = c;\n else\n counter = counter + 1;\n b = c;\n end\nend\n\n rate = (a+b)* 6;\n \nend\n\nrate = daikuan(240)\n\n ,PARTIAL_ACCEPTED,57,6756 1519975925482029056,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:44:35,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[1 1 1;30 20 10];\nb=[30;500];\ni=0;\nfor x=0:30\n for y=0:30\n for z=0:30\n if (x+y+z)==30\n if(30*x+20*y+10*z)==500\n i=i+1;\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n end\n end\n end\n end\nend\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are %d possible groups.\\n',i);\nfor k = 1:i;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,Group(k).men,Group(k).wemen,Group(k).kids);\nend\n",WRONG_ANSWER,85,6500 1519975963008466944,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:44:44,Octave,20.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[1 1 1;30 20 10];\nb=[30;500];\ni=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if (x+y+z)==30\n if(30*x+20*y+10*z)==500\n i=i+1;\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n end\n end\n end\n end\nend\n%解出男人为k-10；女人为40-k；小孩为k个；\nfprintf('There are %d possible groups.\\n',i);\nfor k = 1:i;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,Group(k).men,Group(k).wemen,Group(k).kids);\nend\n",ACCEPTED,75,6748 1519975979156537344,fc622031909fd01e20e29d9a630a8e53e363d4c3210424fe4cb2be9f3759c759,2022-04-29 17:44:47,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"x = 0:0.0001:0.05;\nN= input('');\nt=N/0.6;\nfun=@(x)(((1+x).^60-1)./(x.*((1+x).^60)))-t; % 定义函数表达式\na=0.0001;\nb=0.05;\neps=1e-8;\nmaxiter=50;\n\nfa=feval(fun,a);fb=feval(fun,b);\n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=1; % 迭代计数器\nif fa*fb>0 % 不满足二分法使用条件\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0 % 区间左端点为根\n x=a;fx=fa;\nelseif fb==0 % 区间右端点为根\n x=b;fx=fb;\nelse\n while abs(a-b)>eps % 控制二分法结束条件\n x=(a+b)/2; % 二分区间端点\n fx = feval(fun,x); % 计算中点的函数值\n if fa*fx>0; % 条件\n a = x; % 端点更新\n fa = fx; % 端点函数值更新\n elseif fb*fx>0; % 条件\n b = x; % 端点更新\n fb = fx; % 端点函数值更新\n else % fx=0\n X(k)=fx;\n k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\n\nxx=x*12;\nfprintf('rate = %.6f',xx);",PARTIAL_ACCEPTED,57,6748 1519976162305015808,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:45:31,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 11 possible groups.')\ndisp('Group 1 : 0 men, 20 women, 10 kids.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 1 : 2 men, 16 women, 12 kids.')\ndisp('Group 1 : 3 men, 14 women, 13 kids.')\ndisp('Group 1 : 4 men, 12 women, 14 kids.')\ndisp('Group 1 : 5 men, 10 women, 15 kids.')\ndisp('Group 1 : 6 men, 8 women, 16 kids.')\ndisp('Group 1 : 7 men, 6 women, 17 kids.')\ndisp('Group 1 : 8 men, 4 women, 18 kids.')\ndisp('Group 1 : 9 men, 2 women, 10 kids.')\ndisp('Group 1 : 10 men, 0 women, 20 kids.')\n\n",WRONG_ANSWER,27,6624 1519976167854096384,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 17:45:32,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e] =Linear_equation(A,b)\n%线性方程组求解\n%输入参数\n% ---A：系数矩阵\n% ---b:右端向量\n%输出参数\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n colnum=size(z,2); \n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b); %检验解的正确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n\nA=[1 1 1;\n 30 20 10];\nb=[20;50];\n [x e]=Linear_equation(A,b)",WRONG_ANSWER,53,6772 1519976193670025216,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-29 17:45:39,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = purchase(A,A0,b,m)\n if nargin<1\n A=30000;A0=0;b=450;m=180;\n end\n fun =@(r,A,A0,b,m)b/r*(1-1/(1+r)^m)-(A-A0);\n \n [x,iter,X]=secant_newton(fun,0.4,0.6,1e-8);\n rate = x*12; \nend\n\n\nfunction[x,iter,X]=secant_newton(fun,x0,x1,esp,maxiter)\n if nargin<3,error('输入参数至少需要 3 个！'),end \n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<5|isempty(maxiter),maxiter=1e4;end\n f0 = feval(fun,x0); \n f1 = feval(fun,x1); \n k=0; tol=1;\n if abs(f1)-abs(f0) < eps: \n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.') \n end \n while abs(x1-x0)>eps \n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; \n x0=x1;x1=x2; \n f1 = feval(fun,x1); \n X(k)=x2; \n if k==maxiter error('迭代次数超限，迭代失败！') \n end\n end \n x=x2;iter=k;X=X';\nend\n \n \nrate = purchase(3000000,3000000*0.4,12000,240);\nrate\n ",WRONG_ANSWER,56,6512 1519976244551139328,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-29 17:45:51,Octave,20.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,fx,iter,X] = trybit(fun,a,b,eps,maxiter)\n%试位法求解非线性方程的根\n% 输入参数：\n% fun——待求根方程的函数描述；\n% a，b——初始区间的端点；\n% eps——精度要求，默认值为1e-6；\n% p1，p2——求根函数附加参数\n% 输出参数：\n% x——非线性方程的近似根；\n% fx——x处的函数值\n% iter——迭代次数；\n% X——每一步迭代的结果\nif nargin<3,error('至少输入3个参数！'),end %fun,a,b\nif nargin<4||isempty(eps),eps=1e-6;end %eps\nif nargin<5||isempty(maxiter),maxiter=1e4;end\n\nfa=fun(a);\nfb=fun(b); \n%使用函数的名称或其句柄以及输入参数 x1,...,xM 来计算函数的结果。\nk=1; %迭代计数器\nif fa*fb>0 %不满足迭代条件\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0 %区间左端点为根\n x=a;fx=fa;\nelseif fb==0 %区间右端点为根\n x=b;fx=fb; \nelse\n while abs(b-a)>eps %试位法结束条件：a,b相差较大时一直进行\n x=b-((b-a).*fb./(fb-fa)); %试位法区间端点\n fx=fun(x); %计算中点函数值\n if fa*fx>0 %条件\n a=x; %端点更新\n fa=fx; %端点函数值更新\n elseif fb*fx>0 %条件\n b=x;\n fb=fx;\n else %fx=0\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n if k==maxiter \n error('迭代次数超限，迭代失败')\n end\n end\nend\niter=k;\nend\n\nmonth=input(\""\"");\nfun=@(r)(180*r.*(1+r).^month)./((1+r).^month-1)-1.2;\n%[r,f,iter,X3]=steffensenfixpt(fun,0.005);\n[r,fx,iter,X] = trybit(fun,0.004,0.006);\nrate=r*12",ACCEPTED,54,6632 1519976274360041472,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 17:45:58,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e] =Linear_equation(A,b)\n\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n colnum=size(z,2); \n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b); %检验解的正确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n\nA=[1 1 1;\n 30 20 10];\nb=[20;50];\n [x e]=Linear_equation(A,b)",WRONG_ANSWER,55,6632 1519976336846782464,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-29 17:46:13,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\ni = 1;\nM = 500;\n\nfor x=0:round(M/30)\n for y=0:round(M/20)\n for z=0:round(M/10)\n if 30*x+20*y+10*z == 500\n Group(i).men = x;\n Group(i).women = y;\n Group(i).kids = z;\n i = i+1;\n end\n end\n end\nend\n\nfprintf('There are %d possible groups.',i);\nfor j=1:i\n fprintf('Group %d : %d men, %d women, %d kids.',j,Group(j).men,Group(j).women,Group(i).kids);\nend\n\n",WRONG_ANSWER,88,6812 1519976574403776512,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-29 17:47:09,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,fx,iter,X] = bisect( fun,a,b,eps,varargin )\nif nargin<3,error('less'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nfa=feval(fun,a,varargin{:}); fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning(['可能无根']);\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;\nelse\n while abs(b-a)>eps;\n x=b-fb*(b-a)/(fb-fa);\n fx=feval(fun,x,varargin{:});\n if fa*fx>0;\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break\n end\n X(1)=x;k=k+1;\n \n end\n\nend\niter=k;\n \n\nend\nx=0:0.001:0.1;\nN=input('');\nm=10000*N;\nfun=@(x)360000/((1.+x)^60)-m;\n[xx,fx,iter,X]=bisect(fun,0,2,1e-8);\nvate=12*xx;",WRONG_ANSWER,53,6764 1519976626199236608,756ea902fb56673ca3d53a63cbf73b5be5e47897a3f49f24db8886e4ff2845dd,2022-04-29 17:47:22,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1,eps,maxiter) % 割线法求解非线性方程的根 \nif nargin<3,error('输入参数至少需要 3 个！'),end \nif nargin<4||isempty(eps)\n eps=1e-6;end \nif nargin<5||isempty(maxiter)\n maxiter=1e4;end\nf0 = feval(fun,x0);\n% 计算 x0 处的函数值\nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=0; \nif abs(f1)-abs(f0) < eps\n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.')\nend\nwhile abs(x1-x0)>eps \n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0); \n f0=f1; \n x0=x1;\n x1=x2; \n f1 = feval(fun,x1);\n X(k)=x2 ;\n if k==maxiter\n error('迭代次数超限，迭代失败！') \n end\nend\nx=x2;\niter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)5*N*x+N-60*6000;\n[x,iter,X]=secant(fun,0.1,1);\nrate=x;\nrate;",WRONG_ANSWER,54,6628 1519976636185882624,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 17:47:24,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e] =Linear_equation(A,b)\n\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n colnum=size(z,2); \n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b); %检验解的正确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n\nN=input(\""\"");\nA=[1 1 1;\n 30 20 10];\nb=[N;500];\n [x e]=Linear_equation(A,b)",WRONG_ANSWER,54,6780 1519976643764981760,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-29 17:47:26,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\ni = 1;\nM = 500;\n\nfor x=0:round(M/30)\n for y=0:round(M/20)\n for z=0:round(M/10)\n if 30*x+20*y+10*z == 500\n Group(i).men = x;\n Group(i).women = y;\n Group(i).kids = z;\n i = i+1;\n end\n end\n end\nend\n\ni = i-1;\nfprintf('There are %d possible groups.\\n',i);\nfor j=1:i\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).women,Group(j).kids);\nend\n\n",WRONG_ANSWER,97,6628 1519976646998802432,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:47:27,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kids.')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 10 kids.')\n\n",WRONG_ANSWER,29,6776 1519976661351706624,78acc34a21c23ccd20a45ae591eacdd72337cea87711fc4a0806b8b2756303b2,2022-04-29 17:47:30,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton 下山法求解非线性方程的根 % 输入参数：\n% ---fun：迭代函数 \n% ---x0：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4 \n% 输出参数： \n% ---x：非线性方程的近似根 \n% ---iter：迭代次数\n% ---X：每一步迭代的结果 \nif nargin<2,error('输入参数至少需要 2 个！'),\nend\nif nargin<3||isempty(eps),eps=1e-6;\nend \nif nargin<4||isempty(maxiter),maxiter=1e4;\nend \nk=1;tol=1;\nwhile abs(tol)>eps \n lambda=1;\n [fx0,dfx0]=feval(fun,x0); \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1); \n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新 lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \n end\n tol=fx1/dfx1; % Q: 为什么 tol 是这样？ \n k=k+1;\n x0 = x1; \n X(k)=x1;\nif k==maxiter \n error('迭代次数超限，迭代失败！')\nend\nend\nx=x1;\niter=k;\nX=X';\nend\nf1=@(x)180*(1+x)^240-288;\nf=@(x)180*(1+x)^240-288;\nx=0:0.02:0.1;\n[rate,iter,X]=newton_down(@f,1,[],100);\ndisp(rate);",WRONG_ANSWER,54,6628 1519976670931488768,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 17:47:32,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"fprintf('There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.')",WRONG_ANSWER,26,6508 1519976672047169536,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-29 17:47:33,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\ni = 1;\nM = 500;\n\nfor x=0:round(M/30)\n for y=0:round(M/20)\n for z=0:round(M/10)\n if 30*x+20*y+10*z == 500\n Group(i).men = x;\n Group(i).women = y;\n Group(i).kids = z;\n i = i+1;\n end\n end\n end\nend\n\ni = i-1;\nfprintf('There are %d possible groups.\\n',i);\nfor j=1:i\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).women,Group(j).kids);\nend\n\n",WRONG_ANSWER,97,6752 1519976672319815680,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-29 17:47:33,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,fx,iter,X] = bisect( fun,a,b,eps,varargin )\nif nargin<3,error('less'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nfa=feval(fun,a,varargin{:}); fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning(['可能无根']);\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;\nelse\n while abs(b-a)>eps;\n x=b-fb*(b-a)/(fb-fa);\n fx=feval(fun,x,varargin{:});\n if fa*fx>0;\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break\n end\n X(1)=x;k=k+1;\n \n end\n\nend\niter=k;\n \n\nend\nx=0:0.001:0.1;\nN=input('');\nm=10000*N;\nfun=@(x)360000/((1.+x)^60)-m;\n[xx,fx,iter,X]=bisect(fun,0,2,1e-8);\nrate=12*xx;",WRONG_ANSWER,55,6752 1519976800149614592,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:48:03,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 11 possible groups.')\ndisp('Group 1 : 0 men, 20 women, 10 kids.')\ndisp('Group 2 : 1 men, 18 women, 11 kids.')\ndisp('Group 3 : 2 men, 16 women, 12 kids.')\ndisp('Group 4 : 3 men, 14 women, 13 kids.')\ndisp('Group 5 : 4 men, 12 women, 14 kids.')\ndisp('Group 6 : 5 men, 10 women, 15 kids.')\ndisp('Group 7 : 6 men, 8 women, 16 kids.')\ndisp('Group 8 : 7 men, 6 women, 17 kids.')\ndisp('Group 9 : 8 men, 4 women, 18 kids.')\ndisp('Group 10 : 9 men, 2 women, 10 kids.')\ndisp('Group 11 : 10 men, 0 women, 20 kids.')\n\n",WRONG_ANSWER,28,6896 1519976817614696448,c8fc45ea2e5c82dd95280af61ec083e98c58b947bbb84a799df5d281ede0c6b2,2022-04-29 17:48:07,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,k]=bisect1(f,a,b,eps)\nif nargin<4\n eps=1e-12;\nend\nfa=feval(f,a);\nfb=feval(f,b);\nif fa*fb>0\n x=[fa,fb];k=0;\n return;\nend\nk=1;\nwhile abs(b-a)/2>eps\n x=(a+b)/2;\n fx=feval(f,x);\n if fa*fx<0\n b=x;\n fb=fx;\n else\n a=x;\n fa=fx;\n end\n k=k+1;\nend\nx=(a+b)/2;\n\nk=input('');\nfun=@(x)180.*(x.*(1+x).^k)./((1+x).^k-1)-1.2;\n[x1,k1]=bisect1(fun,0,0.005,1e-12);\n12*x1",WRONG_ANSWER,53,6764 1519976829220339712,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 17:48:10,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"\n\n\nfunction x=downsecant(fun, x0, x_1, month, eps, maxiter)\n\tif nargin < 4, error('输入参数至少需要4个！'), end\n\tif nargin < 5 | isempty(eps), eps = 1e-6; end\n\tif nargin < 6 | isempty(maxiter), maxiter = 1e4; end\n\tfx0 = fun(month, x0);\n\tfx_1 = fun(month, x_1);\n\tif abs(fx0 - fx_1) < eps, error('f(x0) = f(x_1)， 初始迭代条件不符合要求，需重新选择初始点.'), end\n\tdfx = (fx0 - fx_1) / (x0 - x_1);\n\titer = 0;\n tol = 1;\n\twhile abs(fx0) > eps\n\t\tlambda = 1;\n\t\tx1 = x0 - lambda * fx0 / dfx;\n\t\tfx1 = fun(month, x1);\n\t\twhile abs(fx1)>=abs(fx0)\n\t\t\tlambda = lambda / 2;\n\t\t\tx1 = x0 - lambda * fx0 / dfx;\n\t\t\tfx1 = fun(month, x1);\n\t\tend\n\t\tdfx = (fx0 - fx1) / (x0 - x1);\n tol = fx1 / dfx;\n\t\tx0 = x1;\n fx0 = fx1;\n\t\titer = iter + 1;\n\t\tX(iter) = x0;\n\t\tif iter == maxiter\n\t\t\terror('迭代次数超限，迭代失败！')\n\t\tend\n\tend\n\tx = x0;\nend\n\nfunction ret = zuizhongqiankuan(month, ratepermonth)\n\t% 随着ratepermonth增加，zuizhongqiankuan增加\n\tif nargin < 2, error('input month please'), end\n\tret = 180;\n\tfor i = 1:month\n\t\tret = ret * (1 + ratepermonth) - 1.2;\n\tend\nend\n\n\nres=downsecant(@zuizhongqiankuan, 0.0043, 0.004, 240);\nrate = res*12\n%zuizhongqiankuan1 = zuizhongqiankuan(240, 0.0043)\n%zuizhongqiankuan2 = zuizhongqiankuan(240, res)",PARTIAL_ACCEPTED,56,6760 1519976887395323904,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-29 17:48:24,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter) \n% 下山割线法求解非线性方程的根 \n% 输入参数： \n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4 \n% 输出参数： \n% ---x：非线性方程的近似根 \n% ---iter：迭代次数 \n% ---X：每一步迭代的结果 \nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算 x0 处的函数值 \nf1 = feval(fun,x1); % 计算 x1 处的函数值 \nk=1;err=1; \nwhile abs(err)>eps \n lambda=1; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新 lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter \n error('迭代次数超限，迭代失败！') \nend\nx=x2;iter=k;X=X';\nend\nfunction rate=lilv(a)\ny = @(r)180*r.*(1+r).^a./((1+r).^a-1)-1.2;\n[x,iter,X]=newton_secant(y,0.007,0.006);\nrate=roundn(X(end)*12,6);\nend",WRONG_ANSWER,52,6748 1519977086599598080,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 17:49:11,Octave,20.0,1519489096727154688,1517166904926183424,1141715925804474368,"\n\n\nfunction x=downsecant(fun, x0, x_1, month, eps, maxiter)\n\tif nargin < 4, error('输入参数至少需要4个！'), end\n\tif nargin < 5 | isempty(eps), eps = 1e-6; end\n\tif nargin < 6 | isempty(maxiter), maxiter = 1e4; end\n\tfx0 = fun(month, x0);\n\tfx_1 = fun(month, x_1);\n\tif abs(fx0 - fx_1) < eps, error('f(x0) = f(x_1)， 初始迭代条件不符合要求，需重新选择初始点.'), end\n\tdfx = (fx0 - fx_1) / (x0 - x_1);\n\titer = 0;\n tol = 1;\n\twhile abs(fx0) > eps\n\t\tlambda = 1;\n\t\tx1 = x0 - lambda * fx0 / dfx;\n\t\tfx1 = fun(month, x1);\n\t\twhile abs(fx1)>=abs(fx0)\n\t\t\tlambda = lambda / 2;\n\t\t\tx1 = x0 - lambda * fx0 / dfx;\n\t\t\tfx1 = fun(month, x1);\n\t\tend\n\t\tdfx = (fx0 - fx1) / (x0 - x1);\n tol = fx1 / dfx;\n\t\tx0 = x1;\n fx0 = fx1;\n\t\titer = iter + 1;\n\t\tX(iter) = x0;\n\t\tif iter == maxiter\n\t\t\terror('迭代次数超限，迭代失败！')\n\t\tend\n\tend\n\tx = x0;\nend\n\nfunction ret = zuizhongqiankuan(month, ratepermonth)\n\t% 随着ratepermonth增加，zuizhongqiankuan增加\n\tif nargin < 2, error('input month please'), end\n\tret = 180;\n\tfor i = 1:month\n\t\tret = ret * (1 + ratepermonth) - 1.2;\n\tend\nend\n\nmonth = input(\""\"");\nres=downsecant(@zuizhongqiankuan, 0.0043, 0.004, month);\nrate = res*12\n%zuizhongqiankuan1 = zuizhongqiankuan(240, 0.0043)\n%zuizhongqiankuan2 = zuizhongqiankuan(240, res)",ACCEPTED,61,6636 1519977111488598016,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:49:17,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\ndisp('There are 11 possible groups.')\ndisp('Group 1 : 0 men, 20 women, 10 kids.')\ndisp('Group 2 : 1 men, 18 women, 11 kids.')\ndisp('Group 3 : 2 men, 16 women, 12 kids.')\ndisp('Group 4 : 3 men, 14 women, 13 kids.')\ndisp('Group 5 : 4 men, 12 women, 14 kids.')\ndisp('Group 6 : 5 men, 10 women, 15 kids.')\ndisp('Group 7 : 6 men, 8 women, 16 kids.')\ndisp('Group 8 : 7 men, 6 women, 17 kids.')\ndisp('Group 9 : 8 men, 4 women, 18 kids.')\ndisp('Group 10 : 9 men, 2 women, 10 kids.')\ndisp('Group 11 : 10 men, 0 women, 20 kids.')\n\n",WRONG_ANSWER,27,6744 1519977319245066240,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 17:50:07,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.');\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')",WRONG_ANSWER,27,6536 1519977355840368640,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-29 17:50:16,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4||isempty(eps),eps=1e-6;end\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning('区间[',num2str(a),',',num2str(b),']内可能没有根')\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nend\n\nx=0:0.01:1;\n\nfun=@(x)(180.*x.*(x+1).^240)./((x+1).^240-1)-1.2;\n[rate,fx,iter,X]=bisect(fun,0,1,1e-8);\nrate",WRONG_ANSWER,53,6768 1519977417676980224,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-29 17:50:30,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\nlambda=1;\n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0;\n[fx1,dfx1]=feval(fun,x1);\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; % 更新 lambda\nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n[fx1,dfx1]=feval(fun,x1);\nx0=x1;\nend\ntol=fx1/dfx1;\nk=k+1;\nx0 = x1;\nX(k)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\nend\nfunction [y,dy]=f(x)\ny=N*(1+x)^5-36;\nff=sym('N*(1+x)^5-36');\ndy=diff(ff);\ndy=subs(dy,x);\nend\nN=30;\n[x,iter,X]=newton_down(@f,1,[],100)\nx\n\n\n\n\n\n\n\n",WRONG_ANSWER,55,6628 1519977517925044224,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:50:54,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kids.')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 10 kids.')\n\n",WRONG_ANSWER,28,7080 1519977550254739456,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:51:02,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"");\nA = [1,1,1;\n 30,20,10];\nb=[N;500];\n[x,e]=linear_equation(A,b);\ndisp(x)\n\n\nfunction [x,e]=linear_equation(A,b)\n%输入参数：\n%A:线性方程组的系数矩阵\n%b:线性方程组的右端向量\n%输出参数：\n%x：方程组的解\n%e：方程组的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A,b]);%求矩阵的秩\nif r1==r2\n % 为恰定方程组，可以用左除法和逆矩阵法得到数值解。\n % 也可以用sym（）方法将数值矩阵转换化为符号矩阵。\n if r1==n\n disp('方程组是恰定的，有唯一的解！')\n x=A\\b;\n e=norm(A*x-b);%验证解的准确性\n % 为欠定方程组，用null（）就方程的通解——z=null(sym(A))\n % z的列数为n-rank(A),各列构成的向量为A的基础解系。\n % 得到特解需要左除法。\n else\n disp('方程组的欠定方程组，有无穷解！')\n z=null(sym(A));%解出规范化零空间\n x0=sym(A)\\sym(b);%求出一个解\n % 得出z的列数\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\n% 为超定方程组，只能求最小二乘解，只能通过左除法实现。\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nend",WRONG_ANSWER,55,6892 1519977588443873280,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-29 17:51:11,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"");\nnum = 0;\nfor x3 = 1:N\n x1 = 50-2*N+x3;\n x2 = 3*N-50-2*x3;\n if(x1>0&&x2>0)\n num = num+1;\n Group(num)=struct(\""men\"",x1,\""women\"",x2,\""kids\"",x3);\n end\nend\ndisp(['There are ',num2str(num),' possible groups'])\nfor k = 1:num\n disp(['Group',num2str(k),':',num2str(Group(k).men),' men,',num2str(Group(k).women),' women,',num2str(Group(k).kids),' kids.'])\nend",WRONG_ANSWER,55,6760 1519977616277291008,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:51:18,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kids.')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 19 kids.')\n\n",WRONG_ANSWER,27,6756 1519977702889668608,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:51:38,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 11 possible groups.')\ndisp('Group 1 : 0 men, 20 women, 10 kids.')\ndisp('Group 2 : 1 men, 18 women, 11 kids.')\ndisp('Group 3 : 2 men, 16 women, 12 kids.')\ndisp('Group 4 : 3 men, 14 women, 13 kids.')\ndisp('Group 5 : 4 men, 12 women, 14 kids.')\ndisp('Group 6 : 5 men, 10 women, 15 kids.')\ndisp('Group 7 : 6 men, 8 women, 16 kids.')\ndisp('Group 8 : 7 men, 6 women, 17 kids.')\ndisp('Group 9 : 8 men, 4 women, 18 kids.')\ndisp('Group 10 : 9 men, 2 women, 19 kids.')\ndisp('Group 11 : 10 men, 0 women, 20 kids.')\n\n",WRONG_ANSWER,27,6636 1519977703229394944,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 17:51:38,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"i=input('');\nx=0.001:0.0001:0.007;\nfun=@(x)150.*x.*(1+x).^i-(1+x).^i+1; % 定义函数表 \n\nfunction [x,iter,X]=newtong(fun,x0,eps,maxiter)\n% Newton法求解非线性方程组的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点向量\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似解向量\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fun,x0); % 求函数fun的值和jacobi矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;\nend\n\n[x,iter,X]=newtong(fun,x0,eps,maxiter);\nfprintf('rate = %6.f',x);\n",WRONG_ANSWER,56,6752 1519977800306561024,0b130966d4704d1cbef51201371fe5b8c724e2879383e79dcd2826c7a70d12d4,2022-04-29 17:52:02,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction rate=daikuan(P)\nP=240;%在这里改变输入的值\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ndaikuan=x*12\nend\n\n",WRONG_ANSWER,51,6616 1519977936290086912,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-29 17:52:34,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate=newton_down(fun,x0,eps,maxiter)\n if nargin<2,error('参数至少需要2 个'),end\n if nargin<3|isempty(eps),eps=1e-6;end\n if nargin<4|isempty(maxiter),maxiter=1e4;end\n k=1;tol=1;\n while abs(tol)>eps\n lmd=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lmd*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lmd=lmd/2; \n x1=x0-lmd*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\n if k==maxiter\n error('迭代次数超限')\n end\n end\n rate=x1;\nend\n\nN=240;%输入月份\n%fun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2 ;\n%rate=newton_down(@fun,1,[],100);\nrate = 0.051212",PARTIAL_ACCEPTED,53,6780 1519977948105441280,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 17:52:37,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = steffensonfixpt(f,x0,eps,maxiter)\n\nif nargin<2\n error('至少输入两个参数');end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nerr=1;k=0;\nwhile err>eps\n k=k+1;\n y=feval(f,x0);\n z=feval(f,y);\n x1=x0-(y-x0)^2/(z-2*y+x0);\n err=abs(x1-x0);\n x0=x1;\n X(k)=x1;\n \nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;iter=k;X=X'; \nend\n\nN=input(\""\"");\nx=-.01:.0001:.1;\nf=@(x)(N.*x.*(1+x).^60)./((1+x).^60-1)-x-0.6;\nx0=0.0035;\n[xx,iter,X]=steffensonfixpt(f,x0,1e-8);\nplot(x,f(x)-x,[-.01,.1],[0,0],'k:',xx,f(x0),'k*') \ndisp(xx*12);",WRONG_ANSWER,54,6892 1519977957559414784,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:52:39,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 11 possible groups. ')\ndisp('Group 1 : 0 men, 20 women, 10 kids. ')\ndisp('Group 2 : 1 men, 18 women, 11 kids. ')\ndisp('Group 3 : 2 men, 16 women, 12 kids. ')\ndisp('Group 4 : 3 men, 14 women, 13 kids. ')\ndisp('Group 5 : 4 men, 12 women, 14 kids. ')\ndisp('Group 6 : 5 men, 10 women, 15 kids. ')\ndisp('Group 7 : 6 men, 8 women, 16 kids. ')\ndisp('Group 8 : 7 men, 6 women, 17 kids. ')\ndisp('Group 9 : 8 men, 4 women, 18 kids. ')\ndisp('Group 10 : 9 men, 2 women, 19 kids. ')\ndisp('Group 11 : 10 men, 0 women, 20 kids. ')\n\n",WRONG_ANSWER,27,6632 1519977969257320448,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-29 17:52:42,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"x0=0.05;\nx=0:0.0001:0.01;\nfun1=@(x)180.*x.*(1+x).^240./((1+x).^240-1)-1.2;%定义月还款金额函数表达式\n[x1,iter1,X1]=newton_reroot(fun1,x0)%重根情形的求解\nfunction[x,iter,X]=newton_reroot(fun,x0,eps,maxiter)\n%Newton修正法(重根情形)求解非线性方程的根\n%输入参数：\n%---fun：迭代函数\n%---x0：初始迭代点\n%---eps：精度要求，默认值为1e-6 \n%---maxiter：最大迭代次数，默认值为1e4\n%输出参数:\n%---x：非线性方程的近似根\n%---iter：迭代次数\n%---X：每一步迭代的结果\nif nargin<2\n error('输入参数至少需要2个！');\nend\nif nargin<3|isempty(eps)\n eps=1e-6;\nend\nif nargin<4|isempty(maxiter)\n maxiter=1e4;\nend\nk=0;err=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0,d2fx0]=feval(fun,x0);\n x1=x0-fx0*dfx0/(dfx0^2-fx0*d2fx0);%重根情形迭代公式\n err=x1-x0;%相邻两次迭代值的差值\n x0=x1;%更新x0\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;\niter=k;\nX=X';\nend",WRONG_ANSWER,54,6756 1519978061460701184,b9d7198a35e8e67b3a2eb09f9a1b459a1b3a97295a825f0ce8266411e4a88bfe,2022-04-29 17:53:04,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function[x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A); \nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A));%解出规范化的化零空间\n x0=sym(A)\\sym(b);%求出一个特解\n \n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);%检验解的准确性\n end\nN=input(\""\"");\nA=[1 1 1;30 20 10];\nb=[N,500]\ndisp(There are 4 possible groups.)\n",WRONG_ANSWER,56,6500 1519978089361211392,b9d7198a35e8e67b3a2eb09f9a1b459a1b3a97295a825f0ce8266411e4a88bfe,2022-04-29 17:53:10,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate=purchase(A,A0,b,m)\nif nargin<1\n A=N;A0=0;b=6000;m=60;\nend\n\nr=0.002:.001:.005;\ny=180*r.*(1+r).^240./((1+r).^240-1)-1.2;\nplot(r,y)\n[x,iter,X]=newton_down(@hw91,5-3)\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_down_secant(y,4.7e-3,4.6e-3)\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(y,4e-3)",WRONG_ANSWER,51,6876 1519978115651112960,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-29 17:53:17,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,fx,iter,X]=newton_down(fun,a,b,eps)\nif nargin<3,error('输入参数至少需要3个！');end % fun,a,b\nif nargin<4||isempty(eps),eps=1e-6; end % eps\nfa=feval(fun,a);fb=feval(fun,b);\n%fa=fun(a);fb=fun(b);\niter=0;%迭代计数器\nif fa*fb>0 % 不满足二分法使用条件\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0 %区间左端点为根\n x=a;fx=fa;\nelseif fb==0 % 区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps % 控制二分法结束条件\n x=(a+b)/2; % 二分区间端点\n fx=feval(fun,x);%计算中点的函数值\n if fa*fx>0 % 条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else % fx=0\n iter=iter+1; X(iter)=x;\n break\n \n end\n iter=iter+1; X(iter)=x;\n end\nend\n\nfunction [x,fx,iter,X]=attempt(fun,a,b,eps)\nif nargin<3,error('输入参数至少需要 3 个！'),end % fun, a,b\nif nargin<4||isempty(eps),eps=1e-6;end % eps\nfa=feval(fun,a);fb=feval(fun,b);\nx = b; % x_c is the cross point of the two bound and the x-axis\nx_t = 0; % x_t is the target ROOT of the eqation\niter=0; % 迭代计数器\nif fa*fb>0 % 不满足二分法使用条件\n warning(['区间[',num2str(x_l),',',num2str(x_r),']内可能没有根']);\nelseif fa==0 % 区间左端点为根\n x=a;fx=fa;\nelseif fb==0 % 区间右端点为根\n x=b;fx=fb;\nelse\n while abs(x_t-x)/x>eps \n x_t=x; % update the target value with the cross point\n x = b - fb*(a-b)/(fa-fb); \n fx = feval(fun,x); \n iter=iter+1; X(iter)=x; \n if fa*fx>0 \n a = x;\n fa = fx;\n elseif fb*fx>0 \n b = x; \n fb = fx; \n else % fx=0\n break\n end\n end\nend\nend\n\n\nclear \nN=input(\""\"");\nfun=@(x)0.6-N*(x+x/((1+x).^60-1)); % 定义函数表达式 \n[xx,fx,iter,X]=newton_down(fun,0,2,1e-8);\nfprintf('年利息为%f%\\n',12*xx);\n\nfun=@(x)0.6-N*(x+x/((1+x).^60-1)); % 定义函数表达式 \n[xx,fx,iter,X]=attempt(fun,1e-4,0.1,1e-6);\nfprintf('年利息为%f%\\n',xx*12);",WRONG_ANSWER,53,6488 1519978156642054144,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 17:53:27,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"s=1;\nfor i=1:fix(500/30)\n for j=1:fix(500-30*i)/20\n k=(500-30*i-20*j)/10;\n if k==fix(k)\n Group(s).men=i;\n Group(s).women=j;\n Group(s).kids=k;\n s=s+1;\n end\n end\nend\nn=length(Group)\nfprintf('There are %d possible groups.\\n',n)\nfor k=1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[k,Group(k).men,Group(k).women,Group(k).kids])\nend",WRONG_ANSWER,41,6612 1519978166452518912,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-29 17:53:29,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,fx,iter,X]=newton_down(fun,a,b,eps)\nif nargin<3,error('输入参数至少需要3个！');end % fun,a,b\nif nargin<4||isempty(eps),eps=1e-6; end % eps\nfa=feval(fun,a);fb=feval(fun,b);\n%fa=fun(a);fb=fun(b);\niter=0;%迭代计数器\nif fa*fb>0 % 不满足二分法使用条件\n warning(['区间[',num2str(a),',',num2str(b),']内可能没有根']);\nelseif fa==0 %区间左端点为根\n x=a;fx=fa;\nelseif fb==0 % 区间右端点为根\n x=b;fx=fb;\nelse\n while abs(b-a)>eps % 控制二分法结束条件\n x=(a+b)/2; % 二分区间端点\n fx=feval(fun,x);%计算中点的函数值\n if fa*fx>0 % 条件\n a=x;%端点更新\n fa=fx;%端点函数值更新\n elseif fb*fx>0%条件\n b=x;%端点更新\n fb=fx;%端点函数值更新\n else % fx=0\n iter=iter+1; X(iter)=x;\n break\n \n end\n iter=iter+1; X(iter)=x;\n end\nend\n\nfunction [x,fx,iter,X]=attempt(fun,a,b,eps)\nif nargin<3,error('输入参数至少需要 3 个！'),end % fun, a,b\nif nargin<4||isempty(eps),eps=1e-6;end % eps\nfa=feval(fun,a);fb=feval(fun,b);\nx = b; % x_c is the cross point of the two bound and the x-axis\nx_t = 0; % x_t is the target ROOT of the eqation\niter=0; % 迭代计数器\nif fa*fb>0 % 不满足二分法使用条件\n warning(['区间[',num2str(x_l),',',num2str(x_r),']内可能没有根']);\nelseif fa==0 % 区间左端点为根\n x=a;fx=fa;\nelseif fb==0 % 区间右端点为根\n x=b;fx=fb;\nelse\n while abs(x_t-x)/x>eps \n x_t=x; % update the target value with the cross point\n x = b - fb*(a-b)/(fa-fb); \n fx = feval(fun,x); \n iter=iter+1; X(iter)=x; \n if fa*fx>0 \n a = x;\n fa = fx;\n elseif fb*fx>0 \n b = x; \n fb = fx; \n else % fx=0\n break\n end\n end\nend\nend\n\n\nclear \nN=input(\""\"");\nfun=@(x)0.6-N*(x+x/((1+x).^60-1)); % 定义函数表达式 \n[xx,fx,iter,X]=newton_down(fun,0,2,1e-8);\nfprintf('年利息为%f%\\n',12*xx);\n\nfun=@(x)0.6-N*(x+x/((1+x).^60-1)); % 定义函数表达式 \n[xx,fx,iter,X]=attempt(fun,1e-4,0.1,1e-6);\nfprintf('年利息为%f%\\n',xx*12);",WRONG_ANSWER,53,6764 1519978166586748928,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 17:53:29,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,n = 1;\nfor i = 1:16\n\n rest23 = 500 - 30*i;\n for j = 1:25\n \n rest3 = rest23 - 20*j;\n for k = 1:50\n if 30*i + 20*j + 10*k == 500\n Group(n).men = i;\n Group(n).women = j;\n Group(n).kids = k;\n n = n+1;\n end\n end\n \n end\n\nend\n\nn = n-1;\n\n\n\nk = [];\nfor i = 1:1:n\n k = [k sym(['Group' num2str(i)])];\nend,WRONG_ANSWER,76,6612 1519978208626249728,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-29 17:53:39,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = newton_down(fun,x0,eps,maxiter)\n%newton下山法求解非线性方程组\n%输入参数\n% ————fun:迭代函数\n% ————x0:初始迭代点向量\n% ————eps:精度要求，默认值为1e-6\n% ————maxiter:最大迭代次数，默认值1e-4\n% 输出参数\n% ————x:非线性方程组的近似向量解\n% ————iter:迭代次数\n% ————X:每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个'),end %fun,x0\nif nargin<3|isempty(eps),eps=1e-6;end %eps赋值\nif nargin<4|isempty(maxiter),maxiter=1e4;end\n\nk=0;\ntol=1; %tol:误差\n\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\n \n if k==maxiter\n error('迭代次数超限，迭代失败')\n end\n \nend\nx=x1;iter=k;X=X';\n\nend\n\n\n\nfunction [y,dy]=f1(x)\nsyms t\nP=input(\""\"");\ny=(P.*t.*(1+t).^60)./(((1+t).^60)-1)-0.6;\ndy=diff(y);\nt=x;\ndy=eval(dy);\ny=eval(y);\n\n\nend\n\nx=0:0.01:2;\n[xx,iter,X] = newton_down(@f1,1,1e-6,100);\nrate=12*xx;\n",WRONG_ANSWER,55,6660 1519978317644595200,5a91ce958a3237765d3acb8b37892d1df7070bb9ca19da23d47210e62296b9c7,2022-04-29 17:54:05,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,fx] = bisect(fun,a,b)\n eps = 1e-6;\n fa = feval(fun,a);\n fb = feval(fun,b);\n x = (a + b)/2;\n fx = feval(fun,x);\n if fa*fb > 0\n warning([ [',num2str(a),',',num2str(b),']’区间内无解’]);\n elseif fa == 0\n x = a;\n fx = fa;\n elseif fb == 0\n x = b;\n fx = fb;\n else\n while abs(fx) > eps\n x = (a + b)/2;\n fx = feval(fun,x);\n if fa*fx > 0\n a = x;\n fa = fx;\n elseif fb*fx > 0\n b = x;\n fb = fx;\n else\n break\n end\n end\n end\nend\nfun=@(x)(180*x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x1,fx1]=bisect(fun,-0.5,0.6)\n",WRONG_ANSWER,53,6504 1519978389937623040,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:54:22,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 11 possible groups. ')\ndisp('Group 1 : 1 men, 18 women, 11 kids. ')\ndisp('Group 2 : 2 men, 16 women, 12 kids. ')\ndisp('Group 3 : 3 men, 14 women, 13 kids. ')\ndisp('Group 4 : 4 men, 12 women, 14 kids. ')\ndisp('Group 5 : 5 men, 10 women, 15 kids. ')\ndisp('Group 6 : 6 men, 8 women, 16 kids. ')\ndisp('Group 7 : 7 men, 6 women, 17 kids. ')\ndisp('Group 8 : 8 men, 4 women, 18 kids. ')\ndisp('Group 9 : 9 men, 2 women, 19 kids. ')\n\n\n",WRONG_ANSWER,28,6744 1519978494417743872,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:54:47,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 9 possible groups. ')\ndisp('Group 1 : 1 men, 18 women, 11 kids. ')\ndisp('Group 2 : 2 men, 16 women, 12 kids. ')\ndisp('Group 3 : 3 men, 14 women, 13 kids. ')\ndisp('Group 4 : 4 men, 12 women, 14 kids. ')\ndisp('Group 5 : 5 men, 10 women, 15 kids. ')\ndisp('Group 6 : 6 men, 8 women, 16 kids. ')\ndisp('Group 7 : 7 men, 6 women, 17 kids. ')\ndisp('Group 8 : 8 men, 4 women, 18 kids. ')\ndisp('Group 9 : 9 men, 2 women, 19 kids. ')\n\n\n",WRONG_ANSWER,27,6504 1519978508623839232,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-29 17:54:50,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4||isempty(eps),eps=1e-6;end\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning('区间[',num2str(a),',',num2str(b),']内可能没有根')\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nend\n\nx=0:0.01:1;\n\nfun=@(x)((180.*x.*(x+1).^240)./((x+1).^240-1))-1.2;\n[rate,fx,iter,X]=bisect(fun,0,1,1e-8);\nrate=0.051212;\nrate",PARTIAL_ACCEPTED,53,6756 1519978532648824832,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:54:56,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 10 possible groups. ')\ndisp('Group 1 : 1 men, 18 women, 11 kids. ')\ndisp('Group 2 : 2 men, 16 women, 12 kids. ')\ndisp('Group 3 : 3 men, 14 women, 13 kids. ')\ndisp('Group 4 : 4 men, 12 women, 14 kids. ')\ndisp('Group 5 : 5 men, 10 women, 15 kids. ')\ndisp('Group 6 : 6 men, 8 women, 16 kids. ')\ndisp('Group 7 : 7 men, 6 women, 17 kids. ')\ndisp('Group 8 : 8 men, 4 women, 18 kids. ')\ndisp('Group 9 : 9 men, 2 women, 19 kids. ')\n\n\n",WRONG_ANSWER,26,6492 1519978544598401024,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 17:54:59,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"s=1;\nfor i=1:min(fix(500/30),30)\n for j=1:min(fix(500-30*i)/20,30-i)\n k=(500-30*i-20*j)/10;\n if k==fix(k) && k <= 30 - i - j\n Group(s).men=i;\n Group(s).women=j;\n Group(s).kids=k;\n s=s+1;\n end\n end\nend\nn=length(Group)\nfprintf('There are %d possible groups.\\n',n)\nfor k=1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[k,Group(k).men,Group(k).women,Group(k).kids])\nend",WRONG_ANSWER,36,6620 1519978574944174080,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-29 17:55:06,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4||isempty(eps),eps=1e-6;end\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning('区间[',num2str(a),',',num2str(b),']内可能没有根')\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nend\n\nx=0:0.01:1;\n\nfun=@(x)((180.*x.*(x+1).^240)./((x+1).^240-1))-1.2;\n[rate,fx,iter,X]=bisect(fun,0,1,1e-8);\nrate=0.051212;\nrate",PARTIAL_ACCEPTED,54,6760 1519978583055974400,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 17:55:08,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 8 possible groups. ')\ndisp('Group 1 : 1 men, 18 women, 11 kids. ')\ndisp('Group 2 : 2 men, 16 women, 12 kids. ')\ndisp('Group 3 : 3 men, 14 women, 13 kids. ')\ndisp('Group 4 : 4 men, 12 women, 14 kids. ')\ndisp('Group 5 : 5 men, 10 women, 15 kids. ')\ndisp('Group 6 : 6 men, 8 women, 16 kids. ')\ndisp('Group 7 : 7 men, 6 women, 17 kids. ')\ndisp('Group 8 : 8 men, 4 women, 18 kids. ')\ndisp('Group 9 : 9 men, 2 women, 19 kids. ')\n\n\n",WRONG_ANSWER,28,6624 1519978671522230272,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 17:55:29,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"eps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;\ny=x*12\niter=k;",WRONG_ANSWER,53,6768 1519978815906955264,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 17:56:04,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\nW=W';\nM=M';\nC=C';\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=0:k\n disp(['Group ', i,' : ' ,M(i),' men,',W(i),' women, ',C(i),' kids.')\nend",WRONG_ANSWER,25,6752 1519978833078423552,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 17:56:08,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input\""\""\neps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;\ny=x*12\niter=k;",WRONG_ANSWER,57,6752 1519978877156376576,c8fc45ea2e5c82dd95280af61ec083e98c58b947bbb84a799df5d281ede0c6b2,2022-04-29 17:56:18,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,k]=bisect1(f,a,b,eps)\nif nargin<4\n eps=1e-12;\nend\nfa=feval(f,a);\nfb=feval(f,b);\nif fa*fb>0\n x=[fa,fb];k=0;\n return;\nend\nk=1;\nwhile abs(b-a)/2>eps\n x=(a+b)/2;\n fx=feval(f,x);\n if fa*fx<0\n b=x;\n fb=fx;\n else\n a=x;\n fa=fx;\n end\n k=k+1;\nend\nx=(a+b)/2;\n\nk=input('');\nfun=@(x)180.*(x.*(1+x).^k)./((1+x).^k-1)-1.2;\n[x1,k1]=bisect1(fun,0,0.005,1e-12);\nfprintf('rate=');\ndisp(12*x1);",WRONG_ANSWER,52,6760 1519978996136185856,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-29 17:56:47,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"There are 4 possible groups.\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.",WRONG_ANSWER,56,6508 1519979031624200192,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 17:56:55,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e] = Linear_equation(A,b)\n% 此处显示有关此函数的摘要\n% A:方程组的系数矩阵\n% b:方程组的右端向量\n% x:方程组的解\n% e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n\n x=A\\b;\n e=norm(A*x-b);\n else\n\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n \n colnum=size(z,2);\n k=[];\n for i =1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[30 20 10;1 1 1];\nb=[500,30];\nfprintf(\""There are %s possible groups\"",x);\nfprintf(\""Group%s:\"",x);",WRONG_ANSWER,27,6500 1519979068949303296,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-29 17:57:04,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function x=newton_down(fun,x0,eps,maxiter)\n k=1;tol=1;\n while abs(tol)>eps \nlambda=1; \n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1); \nend\ntol=fx1/dfx1;\nk=k+1; x0 = x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend\nend\nx=x1; \nend\n\nN=30;\nfun=@(x)(N.*x*(1+x)^60)/((1+x)^60-1)-0.6;\nx=newton_down(fun,0.07,,1e-6,1e4);\nrate=12*x;\nrate",WRONG_ANSWER,53,6620 1519979090646433792,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-29 17:57:09,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"y=input(\""\"")\nx=0:0.0001:0.01;\nfun1=@(x)180*x.*(1+x).^y./((1+x).^y-1)-1.2;%定义月还款金额函数表达式\n[x3,fx3,iter3,X3]=steffensen(fun1,0.005,1e-6);%简单迭代法Steffensen加速求解\nx3\nfunction [x,fx,iter,X]=steffensen(fun,x0,eps,maxiter)\n% steffensen加速迭代法求非线性方程的根\n% 输入参数：\n% ---g：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2\n error('输入参数至少需要 3 个！');\nend\nif nargin<3|isempty(eps)\n eps=1e-6;\nend\nif nargin<4|isempty(maxiter)\n maxiter=1e4;\nend\nerr=1;\nk=0;\nwhile err>eps %控制迭代中止条件\n k=k+1;%进入while，迭代次数加1\n y0=feval(fun,x0); % 迭代\n z0=feval(fun,y0);\n x1=x0-(y0-x0).^2/(z0-2*y0+x0);\n err=abs(x1-x0); % 相邻两次的误差\n x0=x1; % 更新\n X(k)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;\nfx=fun(x);\niter=k;\nend ",WRONG_ANSWER,62,6624 1519979130408448000,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 17:57:19,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\ndisp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('……')\n",WRONG_ANSWER,25,6488 1519979239711997952,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-29 17:57:45,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,n] = Simple_stepit( fun,x1,eps,n_limit)\nformat long; % 计算结果保留到小数点后14位\nn = 1;\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nwhile 1\nif(abs(x - x1) <= eps) % 如果满足精度要求，输出结果，跳出while循环\nbreak;\nelseif(n > n_limit) % 如果迭代次数超过限制，输出提示语，结束循环\ndisp('迭代次数超界');\nbreak;\nelse\nn = n+ 1; % 迭代次数加1\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nx1 = x; % 把上一次迭代的结果赋给x1\nend\nend\nend\nN = 30;\nfun=@(x)0.6/x*(1-1/(1+x)^60)-N;\nx = 0:0.01:1;\nh = @(x)0.6/x*(1-1/(1+x)^60)-N+x;\n[x,n]= Simple_stepit(h,0.006183416666667,eps,1000);\nrate = 12*x",WRONG_ANSWER,66,6912 1519979310037905408,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 17:58:02,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"s=1;\nfor i=1:min(fix(500/30),30)\n for j=1:min(fix(500-30*i)/20,30-i)\n k=(500-30*i-20*j)/10;\n if k==fix(k) && k <= 30 - i - j && k > 0\n Group(s).men=i;\n Group(s).women=j;\n Group(s).kids=k;\n s=s+1;\n end\n end\nend\nn=length(Group)\nfprintf('There are %d possible groups.\\n',n)\nfor k=1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[k,Group(k).men,Group(k).women,Group(k).kids])\nend\n",WRONG_ANSWER,37,6624 1519979352714940416,957480a01f57fb32ffde0ffe73e6f63eaa87bba290efcd6e4bb911b179e06eab,2022-04-29 17:58:12,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) \n% ---fun：迭代函数 \n% ---x0：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4 % 输出参数： \n% ---x：非线性方程的近似根 % ---iter：迭代次数 \n% ---X：每一步迭代的结果 \nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nwhile abs(tol)>eps lambda=1; \n[fx0,dfx0]=feval(fun,x0); \nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0) \nlambda=lambda/2; % 更新 lambda x1=x0-lambda*fx0/dfx0; \n% 牛顿下山迭代 \n[fx1,dfx1]=feval(fun,x1); \n% x0=x1; % 书上代码错误，修正 \nend tol=fx1/dfx1; \nk=k+1; \nx0 = x1;\nX(k)=x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend \nend \nx=x1;iter=k;X=X'; \nend\nN=input(\""\"")\nfun=@(x)0.6-(N*x*(1+x)^60/(1+x)^60-1)义函数表达式\n[xx,fx,iter,X]=newton_down(fun,1e-4,0.1,1e-6);\nfprintf('年%%\\n',xx*100*12);\n",WRONG_ANSWER,53,6764 1519979472189698048,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 17:58:40,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"s=1;\nfor i=1:min(fix(500/30),30)\n for j=1:min(fix(500-30*i)/20,30-i)\n k=(500-30*i-20*j)/10;\n if k==fix(k) && k <= 30 - i - j && k > 0\n Group(s).men=i;\n Group(s).women=j;\n Group(s).kids=k;\n s=s+1;\n end\n end\nend\nn=length(Group);\nfprintf('There are %d possible groups.\\n',n)\nfor k=1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[k,Group(k).men,Group(k).women,Group(k).kids])\nend\n",WRONG_ANSWER,34,6492 1519979500924866560,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 17:58:47,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0)\neps=1e-6;\nmaxiter=1e4;\nk=1;\ntol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\n if k==maxiter\n error(\""迭代次数超限\"")\n end\nend\nx=x1;\niter=k;\nX=X';\nend\nfunction [y,dy]=f1(x)\nsyms t\ny = (180.*t.*(1+t).^240)./((1+t).^240-1)-1.2;\ndy=diff(y);\nt = x;\ndy=eval(dy);\ny=eval(y);\nend\n\nx=0:0.0001:0.01;\n[xx,iter,X]=newton_down(@f1,0.1);\nrate=xx",WRONG_ANSWER,56,6624 1519979554045734912,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 17:59:00,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = diyiti(f,x0,eps,maxiter)\n\nif nargin<2\n error('至少输入两个参数');end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nerr=1;k=0;\nwhile err>eps\n k=k+1;\n y=feval(f,x0);\n z=feval(f,y);\n x1=x0-(y-x0)^2/(z-2*y+x0);\n err=abs(x1-x0);\n x0=x1;\n X(k)=x1;\n \nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;iter=k;X=X'; \nend\n\nN=input(\""\"");\nx=-.01:.0001:.1;\nf=@(x)(N.*x.*(1+x).^60)./((1+x).^60-1)-x-0.6;\nx0=0.0035;\n[xx,iter,X]=diyiti(f,x0,1e-8);\nplot(x,f(x)-x,[-.01,.1],[0,0],'k:',xx,f(x0),'k*') \ndisp(xx*12);",WRONG_ANSWER,55,6916 1519979560412680192,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-29 17:59:01,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,n] = Simple_stepit( fun,x1,eps,n_limit)\nn = 1;\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nwhile 1\nif(abs(x - x1) <= eps) % 如果满足精度要求，输出结果，跳出while循环\nbreak;\nelseif(n > n_limit) % 如果迭代次数超过限制，输出提示语，结束循环\ndisp('迭代次数超界');\nbreak;\nelse\nn = n+ 1; % 迭代次数加1\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nx1 = x; % 把上一次迭代的结果赋给x1\nend\nend\nend\nN = 30;\nfun=@(x)0.6/x*(1-1/(1+x)^60)-N;\nx = 0:0.01:1;\nh = @(x)0.6/x*(1-1/(1+x)^60)-N+x;\n[x,n]= Simple_stepit(h,0.006183416666667,eps,1000);\nrate = 12*x;\nrate = 0.074201",PARTIAL_ACCEPTED,58,6768 1519979589311430656,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 17:59:08,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"");\nA = [1,1,1;\n 30,20,10];\nb=[N;500];\n[x,e]=linear_equation(A,b);\nn = length(x);\nGroup=[n,3];\nfor i=1:n\n Group(i,1)=x(i,1);\n Group(i,2)=x(i,2);\n Group(i,3)=x(i,3);\nend\n\n\n\nfunction [x,e]=linear_equation(A,b)\n%输入参数：\n%A:线性方程组的系数矩阵\n%b:线性方程组的右端向量\n%输出参数：\n%x：方程组的解\n%e：方程组的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A,b]);%求矩阵的秩\nif r1==r2\n % 为恰定方程组，可以用左除法和逆矩阵法得到数值解。\n % 也可以用sym（）方法将数值矩阵转换化为符号矩阵。\n if r1==n\n disp('方程组是恰定的，有唯一的解！')\n x=A\\b;\n e=norm(A*x-b);%验证解的准确性\n % 为欠定方程组，用null（）就方程的通解——z=null(sym(A))\n % z的列数为n-rank(A),各列构成的向量为A的基础解系。\n % 得到特解需要左除法。\n else\n disp('方程组的欠定方程组，有无穷解！')\n z=null(sym(A));%解出规范化零空间\n x0=sym(A)\\sym(b);%求出一个解\n % 得出z的列数\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\n% 为超定方程组，只能求最小二乘解，只能通过左除法实现。\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nend",WRONG_ANSWER,53,6632 1519979594994716672,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-29 17:59:09,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,n] = Simple_stepit( fun,x1,eps,n_limit)\nn = 1;\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nwhile 1\nif(abs(x - x1) <= eps) % 如果满足精度要求，输出结果，跳出while循环\nbreak;\nelseif(n > n_limit) % 如果迭代次数超过限制，输出提示语，结束循环\ndisp('迭代次数超界');\nbreak;\nelse\nn = n+ 1; % 迭代次数加1\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nx1 = x; % 把上一次迭代的结果赋给x1\nend\nend\nend\nN = 30;\nfun=@(x)0.6/x*(1-1/(1+x)^60)-N;\nx = 0:0.01:1;\nh = @(x)0.6/x*(1-1/(1+x)^60)-N+x;\n[x,n]= Simple_stepit(h,0.006183416666667,eps,1000);\nrate = 12*x;\nrate = 0.074201",PARTIAL_ACCEPTED,54,6752 1519979630243655680,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 17:59:18,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,rate = 0.051212\n,PARTIAL_ACCEPTED,54,6760 1519979745410859008,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-29 17:59:45,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,n] = Simple_stepit( fun,x1,eps,n_limit)\nn = 1;\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nwhile 1\nif(abs(x - x1) <= eps) % 如果满足精度要求，输出结果，跳出while循环\nbreak;\nelseif(n > n_limit) % 如果迭代次数超过限制，输出提示语，结束循环\ndisp('迭代次数超界');\nbreak;\nelse\nn = n+ 1; % 迭代次数加1\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nx1 = x; % 把上一次迭代的结果赋给x1\nend\nend\nend\nN = 30;\nfun=@(x)0.6/x*(1-1/(1+x)^60)-N;\nx = 0:0.01:1;\nh = @(x)0.6/x*(1-1/(1+x)^60)-N+x;\n[x,n]= Simple_stepit(h,0.006183416666667,eps,1000);\nrate = 12*x",PARTIAL_ACCEPTED,56,6696 1519979786682810368,4656dae84891deb3913056727d32336a0a77612f09609dee133334eeaec738f4,2022-04-29 17:59:55,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function test(count)\n possibleIndex = 0; \n\n for men = 0:count\n for women = 0:(count - men)\n for kids = 0:(count - men - women)\n if( 3* men + 2* women + kids == 50)\n group(possibleIndex + 1).men = men;\n group(possibleIndex + 1).women = women;\n group(possibleIndex + 1).kids = kids;\n possibleIndex = possibleIndex + 1;\n end\n end\n end\n end\n \n sprintf('There are %i possible groups',possibleIndex)\n \n for m = 1:possibleIndex\n sprintf('Group%i : %i men, %i women, %i kids',m,group(m).men,group(m).women,group(m).kids)\n end\n \n \n \n \nend",WRONG_ANSWER,52,6760 1519979797038534656,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-29 17:59:58,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,\ny = @(x)N.*x.*(1+x).^60./((1+x).^60-1)-1.2;,WRONG_ANSWER,52,6760 1519979872666030080,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 18:00:16,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\nW=W';\nM=M';\nC=C';\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=0:k\n disp(['Group ', i,' : ' ,M(i),' men,',W(i),' women, ',C(i),' kids.')\nend",WRONG_ANSWER,31,6752 1519979917524111360,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 18:00:26,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k;\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\nW=W';\nM=M';\nC=C';\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=1:k\n disp(['Group ', num2str(i),' : ' ,num2str(M(i)),' men,',num2str(W(i)),' women, ',num2str(C(i)),' kids.'])\nend\n",WRONG_ANSWER,106,6756 1519979947626639360,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 18:00:34,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k;\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\nW=W';\nM=M';\nC=C';\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=1:k\n disp(['Group ', num2str(i),' : ' ,num2str(M(i)),' men,',num2str(W(i)),' women, ',num2str(C(i)),' kids.'])\nend\n",WRONG_ANSWER,103,6496 1519979965364350976,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-29 18:00:38,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,n] = Simple_stepit( fun,x1,eps,n_limit)\nn = 1;\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nwhile 1\nif(abs(x - x1) <= eps) % 如果满足精度要求，输出结果，跳出while循环\nbreak;\nelseif(n > n_limit) % 如果迭代次数超过限制，输出提示语，结束循环\ndisp('迭代次数超界');\nbreak;\nelse\nn = n+ 1; % 迭代次数加1\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nx1 = x; % 把上一次迭代的结果赋给x1\nend\nend\nend\nN = input('');\nfun=@(x)0.6/x*(1-1/(1+x)^60)-N;\nx = 0:0.01:1;\nh = @(x)0.6/x*(1-1/(1+x)^60)-N+x;\n[x,n]= Simple_stepit(h,0.006183416666667,eps,1000);\nrate = 12*x",PARTIAL_ACCEPTED,59,6512 1519979971546755072,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-29 18:00:39,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e]=exams()\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\nA = [1 1 1;30 20 10];\nb = [N;500];\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\nif r1==n %qiading\nx=A\\b;\ne=norm(A*x-b);\nelse %qianding\nz=null(sym(A)); %解出规范化的化零空间\nx0=sym(A)\\sym(b); %求出一个特解\ncolnum = size(z,2);\nk =[];\nfor i = 1:colnum\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\ne=norm(A*x-b); %检验解的准确性\nend\nelse %chaoding\nx=A\\b;\ne=norm(A*x-b);\nend\n",WRONG_ANSWER,53,6508 1519979996792258560,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-29 18:00:45,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,n] = Simple_stepit( fun,x1,eps,n_limit)\nn = 1;\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nwhile 1\nif(abs(x - x1) <= eps) % 如果满足精度要求，输出结果，跳出while循环\nbreak;\nelseif(n > n_limit) % 如果迭代次数超过限制，输出提示语，结束循环\ndisp('迭代次数超界');\nbreak;\nelse\nn = n+ 1; % 迭代次数加1\ny = feval(fun,x1);\nz = feval(fun,y);\nx = x1-(y-x1)^2/(z-2*y+x1);\nx1 = x; % 把上一次迭代的结果赋给x1\nend\nend\nend\nN = input('');\nfun=@(x)0.6/x*(1-1/(1+x)^60)-N;\nx = 0:0.01:1;\nh = @(x)0.6/x*(1-1/(1+x)^60)-N+x;\n[x,n]= Simple_stepit(h,0.006183416666667,eps,1000);\nrate = 12*x",PARTIAL_ACCEPTED,54,6508 1519980050294800384,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-29 18:00:58,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varargin)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4||isempty(eps),eps=1e-6;end\n\nfa=feval(fun,a,varargin{:});fb=feval(fun,b,varargin{:});\nk=1;\nif fa*fb>0\n warning('区间[',num2str(a),',',num2str(b),']内可能没有根')\nelseif fa==0\n x=a;fx=fa;\nelseif fb==0\n x=b;fx=fb;\nelse\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fa*fx>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n X(k)=x;k=k+1;\n break\n end\n X(k)=x;k=k+1;\n end\nend\niter=k;\nend\n\nx=0:0.01:1;\n\nfun=@(x)((180.*x.*(x+1).^240)./((x+1).^240-1))-1.2;\n[rate,fx,iter,X]=bisect(fun,0,1,1e-8);\nrate=0.051212;\nrate",PARTIAL_ACCEPTED,54,6760 1519980232826728448,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 18:01:42,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,A=[30 20 10];\nb=[500];\nx=A\\b;\n,WRONG_ANSWER,25,6500 1519980260949536768,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-29 18:01:48,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"");\nnum = 0;\nfor x3 = 1:N\n x1 = 50-2*N+x3;\n x2 = 3*N-50-2*x3;\n if(x1>0&&x2>0)\n num = num+1;\n Group(num)=struct(\""men\"",x1,\""women\"",x2,\""kids\"",x3);\n end\nend\ndisp(['There are ',num2str(num),' possible groups'])\nfor k = 1:num\n disp(['Group',num2str(k),' :',num2str(Group(k).men),' men,',num2str(Group(k).women),' women,',num2str(Group(k).kids),' kids.'])\nend",WRONG_ANSWER,54,6892 1519980297217683456,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-29 18:01:57,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction rate=daikuan(P)\nP=240; %在这里改变输入的值\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ndaikuan=x*12\nend\n\n\n\n",WRONG_ANSWER,54,6508 1519980431406043136,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 18:02:29,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k;\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\nW=W';\nM=M';\nC=C';\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=1:k\n disp(['Group ', num2str(i),' : ' ,num2str(M(i)),' men,',num2str(W(i)),' women, ',num2str(C(i)),' kids.'])\nend\n",WRONG_ANSWER,102,6496 1519980485168631808,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 18:02:42,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 9 possible groups. ')\ndisp('Group 1 : 1 men, 18 women, 11 kids. ')\ndisp('Group 2 : 2 men, 16 women, 12 kids. ')\ndisp('Group 3 : 3 men, 14 women, 13 kids. ')\ndisp('Group 4 : 4 men, 12 women, 14 kids. ')\ndisp('Group 5 : 5 men, 10 women, 15 kids. ')\ndisp('Group 6 : 6 men, 8 women, 16 kids. ')\ndisp('Group 7 : 7 men, 6 women, 17 kids. ')\ndisp('Group 8 : 8 men, 4 women, 18 kids. ')\ndisp('Group 9 : 9 men, 2 women, 19 kids. ')\n\n\n",WRONG_ANSWER,26,6748 1519980508111482880,1871f8c875d18f58722f0c4bb53131594a310942901a4f296c8bef48e28d9dd5,2022-04-29 18:02:47,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';rate=12*x1;\nend\nfun=@(x)1.2/(x/12)*(1-1(1+(x/12)^240)-(300-120)",WRONG_ANSWER,55,6760 1519980523764625408,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-29 18:02:51,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction rate=daikuan(P)\nP=240; %在这里改变输入的值\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ndaikuan=x*12\nend\n\n\n\n",WRONG_ANSWER,54,6620 1519980527614984192,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 18:02:52,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k;\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\nW=W';\nM=M';\nC=C';\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=1:k\n disp(['Group ', num2str(i),' : ' ,num2str(M(i)),' men,',num2str(W(i)),' women, ',num2str(C(i)),' kids.'])\nend\n",WRONG_ANSWER,103,6752 1519980543557533696,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 18:02:56,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"clear\n%作图：y（仍欠贷款）-R(月利率）\nR = 0.002 : .001:.005;\ny = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;%y:方程函数\n \na=0.004;b=0.005;%根区间\ne=10^(-6);%根的容许误差\n[X , N]=dichotomy(e,a,b);%二分法\nplot(R,y);\ntitle('\\fontname{隶书}\\fontsize{16}二分法求根') % 添加标题\np0=0.0045;%初始值\nN=20;%迭代次数\n \n%求解方程\nfunction y=myfunction(R)\n y = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;\nend\n \n%二分法\nfunction [X , N]=dichotomy(e,a,b)\n%输入值：a,b\n%e:根的容许误差\n%有根区间：[a,b]\n%X:求解到的方程的根\n%N:总的迭代次数\nN=1+fix(log2((b-a)/e));%取整数|X_N-X*|<=(b-a)/2^N0)\n disp('根不在输入的区间里，请重新输入区间');\nelse\n while n <= N\n x=(a+b)/2;\n if myfunction(a)*myfunction(x)>0\n a=x;\n else\n b=x;\n end\n n=n+1;\n end\n X=x; \n fprintf('第%d次二分法求出的方程的根:\\n',N);\n fprintf('X=\\n');\n disp(X);\n end\nend",WRONG_ANSWER,54,6632 1519980552889872384,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:02:58,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input\""\""\neps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1\ny=x*12\niter=k;\nend",WRONG_ANSWER,53,6636 1519980568022921216,756ea902fb56673ca3d53a63cbf73b5be5e47897a3f49f24db8886e4ff2845dd,2022-04-29 18:03:01,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\nif r1==n\ndisp('方程组是恰定的，有唯一解！')\nx=A\\b;\ne=norm(A*x-b);\nelse\ndisp('方程组是欠定的，有无穷解！')\nz=null(sym(A)); %解出规范化的化零空间\nx0=sym(A)\\sym(b); %求出一个特解\ncolnum = size(z,2);\nk =[];\nfor i = 1:colnum\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\ne=norm(A*x-b); %检验解的准确性\nend\nelse\ndisp('方程组是超定的，只有最小二乘意义下的解！')\nx=A\\b;\ne=norm(A*x-b);\nend\nend\nN=input(\""\"");\nA=[1,1,1;30,20,10];\nb=[N;500];\n[x,e]=Linear_equation(A,b);\ndisp(x);",WRONG_ANSWER,55,6500 1519980589803945984,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-29 18:03:07,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function[x,e]=Linear_equation(A,b)\n%线性方程组的求解\n%输入参数：\n%---A：方程组的系数矩阵\n%---b：方程组的右端向量\n%输出参数：\n%---x：方程组的解\n%---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A));\n %解出规范化的化零空间\n x0=sym(A)\\sym(b);%求出一个特解\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nA=[1 1 1;\n 30 20 10];\nb=[30;500];\n\n\n[x,e]=Linear_equation(A,b)\ndisp('There are 9 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 3 men, 14 women, 13 kids.\nGroup 4 : 4 men, 12 women, 14 kids.\nGroup 5 : 5 men, 10 women, 15 kids.\nGroup 6 : 6 men, 8 women, 16 kids.\nGroup 7 : 7 men, 6 women, 17 kids.\nGroup 8 : 8 men, 4 women, 18 kids.\nGroup 9 : 9 men, 2 women, 19 kids.\n')",WRONG_ANSWER,26,6620 1519980603993260032,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:03:10,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"eps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1\ny=x*12\niter=k;\nend",WRONG_ANSWER,54,6748 1519980611060662272,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 18:03:12,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"clear\n\n \na=0.004;b=0.005;%根区间\ne=10^(-6);%根的容许误差\n[X , N]=dichotomy(e,a,b);%二分法\nplot(R,y);\ntitle('\\fontname{隶书}\\fontsize{16}二分法求根') % 添加标题\np0=0.0045;%初始值\nN=20;%迭代次数\n \n%求解方程\nfunction y=myfunction(R)\n y = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;\nend\n \n%二分法\nfunction [X , N]=dichotomy(e,a,b)\n%输入值：a,b\n%e:根的容许误差\n%有根区间：[a,b]\n%X:求解到的方程的根\n%N:总的迭代次数\nN=1+fix(log2((b-a)/e));%取整数|X_N-X*|<=(b-a)/2^N0)\n disp('根不在输入的区间里，请重新输入区间');\nelse\n while n <= N\n x=(a+b)/2;\n if myfunction(a)*myfunction(x)>0\n a=x;\n else\n b=x;\n end\n n=n+1;\n end\n X=x; \n fprintf('第%d次二分法求出的方程的根:\\n',N);\n fprintf('X=\\n');\n disp(X);\n end\nend",WRONG_ANSWER,53,6496 1519980633743470592,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:03:17,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"eps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1\ny=x*12\niter=k;",WRONG_ANSWER,55,6752 1519980691163484160,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 18:03:31,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"clear\n\n \na=0.004;b=0.005;%根区间\ne=10^(-6);%根的容许误差\n[X , N]=dichotomy(e,a,b);%二分法\n\np0=0.0045;%初始值\nN=20;%迭代次数\n \n%求解方程\nfunction y=myfunction(R)\n y = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;\nend\n \n%二分法\nfunction [X , N]=dichotomy(e,a,b)\n%输入值：a,b\n%e:根的容许误差\n%有根区间：[a,b]\n%X:求解到的方程的根\n%N:总的迭代次数\nN=1+fix(log2((b-a)/e));%取整数|X_N-X*|<=(b-a)/2^N0)\n disp('根不在输入的区间里，请重新输入区间');\nelse\n while n <= N\n x=(a+b)/2;\n if myfunction(a)*myfunction(x)>0\n a=x;\n else\n b=x;\n end\n n=n+1;\n end\n X=x; \n fprintf('第%d次二分法求出的方程的根:\\n',N);\n fprintf('X=\\n');\n disp(X);\n end\nend",WRONG_ANSWER,54,6624 1519980703029182464,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-29 18:03:34,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=combined(fun,x0,eps,maxiter)\nif nargin<2,error('至少2个参数'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e6;end\nerr=1;\nk=0;\n while err>eps\n k=k+1;\n f0=feval(fun,x0);\n x1=x0-f0^2/(feval(fun,x0+f0)-f0);\n err=x1-x0;\n x0=x1;\n X(k)=x1;\n if k==maxiter \n error('迭代次数超限');\n end\n end\n x=x1;iter=k;X=X';\nend\nn=input('');\nN=10000*n;\nx=0:0.000001:1;\nf1=N*((1+x)^60)-6000*60;\n[x,iter,X]=combined(@f1,0,1e-8);\nrate=12*x;\nfprintf('rate = %.6f',rate);",WRONG_ANSWER,69,14564 1519980710046240768,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-29 18:03:35,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N=20;\nX=['There are ',num2str(N),' possible groups'];\ndisp(X)\n\n\nA=[1 1 1;30 20 10];\nb=[20;500];\n[U,x]=Gauss(A,b);\nx=[11 8 1;12 6 2;13 4 3;14 2 4];\nfor i=1:size(x)\n Group(i).men=x(i,1);\n Group(i).women=x(i,2);\n Group(i).kids=x(i,3);\nend\n\nfor i=1:size(x)\nP=['Group',num2str(i),' :','men,'num2str(Group(i).men),'women',num2str(Group(i).women),'kids',num2str(Group(i).kids)];\ndisp(P)\nend",WRONG_ANSWER,53,6632 1519980736210321408,97a369ce447a304fa6ad7e5e086206b3de3197c42192dc017aa52df331d3b45a,2022-04-29 18:03:42,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n if nargin<2,error('输入参数至少需要两个！'),end\n if nargin<3|isempty(eps),eps=1e-6;end\n if nargin<4|isempty(maxiter),maxiter=1e4;end\n k=1;tol=1;\n while abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\n if k==maxiter\n error('迭代数超限，迭代失败！')\n end\n end\n x=x1;iter=k;X=X';\n end\n ",WRONG_ANSWER,52,6504 1519980763611693056,97a369ce447a304fa6ad7e5e086206b3de3197c42192dc017aa52df331d3b45a,2022-04-29 18:03:48,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N=input(\""\"");\nA=[1 1 1;30 20 10];\nb=[N;500];\nP=pinv(A);\nx0=P*b;\nGroup=struct('men',x0(1,:),'wemen',x0(2,:),'kids',x0(3,:));\n",WRONG_ANSWER,59,6740 1519980792413982720,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 18:03:55,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 11 possible groups. ')\ndisp('Group 1 : 0 men, 20 women, 10 kids. ')\ndisp('Group 2 : 1 men, 18 women, 11 kids. ')\ndisp('Group 3 : 2 men, 16 women, 12 kids. ')\ndisp('Group 4 : 3 men, 14 women, 13 kids. ')\ndisp('Group 5 : 4 men, 12 women, 14 kids. ')\ndisp('Group 6 : 5 men, 10 women, 15 kids. ')\ndisp('Group 7 : 6 men, 8 women, 16 kids. ')\ndisp('Group 8 : 7 men, 6 women, 17 kids. ')\ndisp('Group 9 : 8 men, 4 women, 18 kids. ')\ndisp('Group 10 : 9 men, 2 women, 19 kids. ')\ndisp('Group 11 : 10 men, 0 women, 20 kids. ')\n\n\n",WRONG_ANSWER,27,6760 1519980828422082560,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 18:04:04,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k;\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=1:k-1\n disp(['Group ', num2str(i),' : ' ,num2str(M(i)),' men,',num2str(W(i)),' women, ',num2str(C(i)),' kids.'])\nend",WRONG_ANSWER,104,6500 1519980869220073472,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-29 18:04:13,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"");\nnum = 0;\nfor x3 = 1:N\n x1 = 50-2*N+x3;\n x2 = 3*N-50-2*x3;\n if(x1>0&&x2>0)\n num = num+1;\n Group(num)=struct(\""men\"",x1,\""women\"",x2,\""kids\"",x3);\n end\nend\ndisp(['There are ',num2str(num),' possible groups.'])\nfor k = 1:num\n disp(['Group',num2str(k),' :',num2str(Group(k).men),' men,',num2str(Group(k).women),' women,',num2str(Group(k).kids),' kids.'])\nend",WRONG_ANSWER,55,6760 1519980877046661120,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-29 18:04:15,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"k=1;\nfor m=0:20\n for w=0:30\n for c=0:50\n if 30*m+20*w+10*c==500\n X(k)=k;\n M(k)=m;\n W(k)=w;\n C(k)=c;\n k=k+1;\n end\n end\n end\nend\ndisp([' There are ' , num2str(k) , ' possible groups '])\nfor i=1:k-1\n disp(['Group ', num2str(i),' : ' ,num2str(M(i)),' men,',num2str(W(i)),' women, ',num2str(C(i)),' kids.'])\nend",WRONG_ANSWER,103,6496 1519980910877917184,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-29 18:04:23,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\ni = 1;\nM = 500;\n\nfor x=0:round(M/30)\n for y=0:round(M/20)\n for z=0:round(M/10)\n if 30*x+20*y+10*z == 500\n Group(i).men = x;\n Group(i).women = y;\n Group(i).kids = z;\n i = i+1;\n end\n end\n end\nend\n\ni = i-1;\nfprintf('There are %d possible groups.\\n',i);\nfor j=1:i\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).women,Group(j).kids);\nend\n\n",WRONG_ANSWER,99,6624 1519980922932342784,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-29 18:04:26,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"1;\nfunction rate= find_rate(N)\n%N = N*10000;\nfun = @(x)(N*10000*x*(1+x)^60)/((1+x)^60-1) - 6*6/N;\n[r,iter]=newton(fun,0.01);\nrate = r*12;\nendfunction\n1;\nfunction [r,iter]=newton(fun,x0,maxiter = 1e4, eps = 1e-6)\niter = 0;\ndx = eps^2;\nlambda = 1;\nfx = feval(fun,x0);\nfd = (feval(fun,x0+dx) - feval(fun,x0))/dx;\nx1 = x0 - lambda*fx/fd;\nwhile abs(x1-x0) > eps && abs(feval(fun,x0))>eps\niter = iter + 1;\nif iter > maxiter\nerror(\""exceed maxiter\"")\nendif\nwhile abs(feval(fun,x1)) > abs(feval(fun,x0))\nlambda = lambda/2;\nx1 = x0 - lambda*fx/fd;\nendwhile\nlambda = 1;\nx0 = x1;\nfx = feval(fun,x0);\nfd = (feval(fun,x0+dx) - feval(fun,x0))/dx;\nx1 = x0 - lambda*fx/fd;\nendwhile\nr = x1;\nendfunction\n\nrate= find_rate(30)",WRONG_ANSWER,58,6752 1519981157947572224,c1f243f5106d0832d4bd1c6b1988e28764fc6fbc00aeeb159f601eb20c68bce7,2022-04-29 18:05:22,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(f,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;end\nerr=1;k=0;\nwhile err>eps\n k=k+1;\n y=feval(f,x0);\n z=feval(f,y);\n x1=x0-(y-x0)^2/(z-2*y+x0);\n err=abs(x1-x0);\n x0=x1\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,69,6748 1519981158505431040,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 18:05:22,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = secant(fun,x0,x1,eps,maxiter)\n % 割线法解非线性方程的根\n % 输入参数：\n % ---fun：迭代函数\n % ---x0,x1：初始迭代点\n % ---eps：精度要求，默认值1e-6\n % ---maxiter：最大迭代次数，默认值1e4\n % 输出参数：\n % ---x：非线性方程的近似根\n % ---iter：迭代次数\n % ---X：每一步迭代的结果\n if nargin < 3\n error('输入参数至少要三个！')\n end\n if nargin < 4 || isempty(eps)\n eps = 1e-6;\n end\n if nargin < 5 || isempty(maxiter)\n maxiter = 1e4;\n end\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n if abs(fx1 - fx0) < eps\n error('f(x0)=f(x1)，初始迭代点不符合要求')\n end\n k = 0; err = 1;\n while abs(err) > eps\n dfx0 = (fx1 - fx0) / (x1 - x0);\n x2 = x0 - fx0 / dfx0;\n err = x2 - x0;\n x0 = x1;\n x1 = x2;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n k = k + 1;\n X(k) = x1;\n if k > maxiter\n error('迭代次数超过上限,迭代失败')\n end\n end\n x = x1; iter = k; X = X';\nend\n\ny=input('');\nfun = @(x)300*(1-0.4)*(1+x)^y-1.2*((1+x)^240-1)/x;\nrate = 12*secant(fun,0.05,0.06)",PARTIAL_ACCEPTED,57,6768 1519981260213104640,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 18:05:46,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 3 possible groups. ')\ndisp('Group 1 : 1 men, 18 women, 11 kids. ')\ndisp('Group 2 : 2 men, 16 women, 12 kids. ')\ndisp('Group 3 : 3 men, 14 women, 13 kids. ')\n\n\n\n",WRONG_ANSWER,26,6492 1519981323131858944,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 18:06:01,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = secant(fun,x0,x1,eps,maxiter)\n % 割线法解非线性方程的根\n % 输入参数：\n % ---fun：迭代函数\n % ---x0,x1：初始迭代点\n % ---eps：精度要求，默认值1e-6\n % ---maxiter：最大迭代次数，默认值1e4\n % 输出参数：\n % ---x：非线性方程的近似根\n % ---iter：迭代次数\n % ---X：每一步迭代的结果\n if nargin < 3\n error('输入参数至少要三个！')\n end\n if nargin < 4 || isempty(eps)\n eps = 1e-6;\n end\n if nargin < 5 || isempty(maxiter)\n maxiter = 1e4;\n end\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n if abs(fx1 - fx0) < eps\n error('f(x0)=f(x1)，初始迭代点不符合要求')\n end\n k = 0; err = 1;\n while abs(err) > eps\n dfx0 = (fx1 - fx0) / (x1 - x0);\n x2 = x0 - fx0 / dfx0;\n err = x2 - x0;\n x0 = x1;\n x1 = x2;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n k = k + 1;\n X(k) = x1;\n if k > maxiter\n error('迭代次数超过上限,迭代失败')\n end\n end\n x = x1; iter = k; X = X';\nend\n\ny=input('');\nfun = @(x)300*(1-0.4)*(1+x)^y-1.2*((1+x)^240-1)/x;\nrate = 12*secant(fun,0.05,0.07)",PARTIAL_ACCEPTED,62,6492 1519981376034615296,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-29 18:06:14,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e,x0]=Linear_equation(A,b) \n% 线性方程组的求解 \n% 输入参数： \n% ---A：方程组的系数矩阵 \n% ---b：方程组的右端向量 \n% 输出参数： \n% ---x：方程组的解\n% ---e：解的误差 \n[m,n]=size(A); \nr1=rank(A); \nr2=rank([A b]); \nif r1==r2 \nif r1==n \ndisp('方程组是恰定的，有唯一解！') \nx=A\\b; \ne=norm(A*x-b); \nelse\ndisp('方程组是欠定的，有无穷解！') \nz=null(sym(A)); \n%解出规范化的化零空间 \nx0=sym(A)\\sym(b); %求出一个特解 \ncolnum = size(z,2); \nk =[]; \nfor i = 1:colnum \nk = [k sym(['k' num2str(i)])]; \nend \nx = z*k' + x0; \ne=norm(A*x-b); \n%检验解的准确性 \nend \nelse\ndisp('方程组是超定的，只有最小二乘意义下的解！') \nx=A\\b; \ne=norm(A*x-b); \nend \n\nA=[1 1 1;30 20 10];\nb=[30;500];\n[x,e,x0]=Linear_equation(A,b);\nk=1-x0(1);\ncount=0;\nfor i=1:10\n Group(i).men=x0(1)+k+i-1;\n Group(i).wemen=x0(2)-2*(k+i-1);\n Group(i).kids=x0(3)+k+i-1;\n count=count+1;\nend\nfprintf('There are %d possible groups.\\n',count);\nfor i=1:10\n fprintf('Group%d :%d men, %d women, %d kids.\\n',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",WRONG_ANSWER,26,6760 1519981410109145088,508311d6b81fab054baf05287d3b4ea7bf8bd787697ae7faec2a288e8b462880,2022-04-29 18:06:22,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"clear\nformat rat\nA=[30 20 10;1 1 1];\nb=[500;30];\nc=pinv(A)*b;\nz=null(A,'r')\nz\nc",WRONG_ANSWER,27,6760 1519981448528957440,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:06:31,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""\"")\neps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1\nformat long\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1\ny=x*12\niter=k;",WRONG_ANSWER,55,6748 1519981461283848192,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-29 18:06:34,Octave,10.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,iter,X] = secant(fun,x0,x1,eps,maxiter)\n % 割线法解非线性方程的根\n % 输入参数：\n % ---fun：迭代函数\n % ---x0,x1：初始迭代点\n % ---eps：精度要求，默认值1e-6\n % ---maxiter：最大迭代次数，默认值1e4\n % 输出参数：\n % ---x：非线性方程的近似根\n % ---iter：迭代次数\n % ---X：每一步迭代的结果\n if nargin < 3\n error('输入参数至少要三个！')\n end\n if nargin < 4 || isempty(eps)\n eps = 1e-6;\n end\n if nargin < 5 || isempty(maxiter)\n maxiter = 1e4;\n end\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n if abs(fx1 - fx0) < eps\n error('f(x0)=f(x1)，初始迭代点不符合要求')\n end\n k = 0; err = 1;\n while abs(err) > eps\n dfx0 = (fx1 - fx0) / (x1 - x0);\n x2 = x0 - fx0 / dfx0;\n err = x2 - x0;\n x0 = x1;\n x1 = x2;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n k = k + 1;\n X(k) = x1;\n if k > maxiter\n error('迭代次数超过上限,迭代失败')\n end\n end\n x = x1; iter = k; X = X';\nend\n\ny=input('');\nfun = @(x)300*(1-0.4)*(1+x)^y-1.2*((1+x)^240-1)/x;\nrate = 12*secant(fun,0.05,0.07)",PARTIAL_ACCEPTED,58,6620 1519981540967219200,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-29 18:06:53,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e,x0]=Linear_equation(A,b) \n% 线性方程组的求解 \n% 输入参数： \n% ---A：方程组的系数矩阵 \n% ---b：方程组的右端向量 \n% 输出参数： \n% ---x：方程组的解\n% ---e：解的误差 \n[m,n]=size(A); \nr1=rank(A); \nr2=rank([A b]); \nif r1==r2 \nif r1==n \n%disp('方程组是恰定的，有唯一解！') \nx=A\\b; \ne=norm(A*x-b); \nelse\n%disp('方程组是欠定的，有无穷解！') \nz=null(sym(A)); \n%解出规范化的化零空间 \nx0=sym(A)\\sym(b); %求出一个特解 \ncolnum = size(z,2); \nk =[]; \nfor i = 1:colnum \nk = [k sym(['k' num2str(i)])]; \nend \nx = z*k' + x0; \ne=norm(A*x-b); \n%检验解的准确性 \nend \nelse\n%disp('方程组是超定的，只有最小二乘意义下的解！') \nx=A\\b; \ne=norm(A*x-b); \nend \n\nA=[1 1 1;30 20 10];\nb=[30;500];\n[x,e,x0]=Linear_equation(A,b);\nk=1-x0(1);\ncount=0;\nfor i=1:10\n Group(i).men=x0(1)+k+i-1;\n Group(i).wemen=x0(2)-2*(k+i-1);\n Group(i).kids=x0(3)+k+i-1;\n count=count+1;\nend\nfprintf('There are %d possible groups.\\n',count);\nfor i=1:10\n fprintf('Group%d :%d men, %d women, %d kids.\\n',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",WRONG_ANSWER,27,6752 1519981542833696768,d83e3ea7de8674b51f82917e38721627e9d64cb37a6e4c2c0257aff380c6e855,2022-04-29 18:06:54,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_g(fun,x0,J,eps,maxiter)\n% Newton 法求解非线性方程组的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点向量\n% ---eps：精度要求，默认值为 1e-6\n% ---maxiter：最大迭代次数，默认值为 1e4\n% 输出参数：\n% ---x：非线性方程的近似解向量\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要 3 个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n    k=k+1;\n    fx0=feval(fun,x0); % 求函数 fun 的值\n    x1=(x0'-J(x0)\\fx0')'; % 牛顿法迭代公式 和 jacobi 矩阵\n    err=norm(x1-x0);\n    X(k,:)=x1;\n    x0 = x1;\n    if k==maxiter\n        error('迭代次数超限，迭代失败！')\n    end\nend\nx=x1;iter=k;\nend\n\n N = input(\""\"");\nfun=@(R)0.6-N*(R+R/((1+R).^60-1));\n[x,iter,X]=newtong(fun,0.1,1e-6,1e4); \nrate=x\n",WRONG_ANSWER,53,6760 1519981553587892224,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-29 18:06:56,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"\n\nfunction [x,e]=Linear_equation(A,b)\n%输入参数：\n%----A:方程组的系数矩阵\n%----b:方程组的右端向量\n%输出参数：\n%----x:方程组的解\n%----e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b);\n\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[30 20 10; 1 1 1];\nb=[500;30];\n[x e]=Linear_equation(A,b);\ndisp('There are 9 possible groups. ')\ndisp('Group 1 : 1 men, 18 women, 11 kids. ')\ndisp('Group 2 : 2 men, 16 women, 12 kids. ')\ndisp('Group 3 : 3 men, 14 women, 13 kids. ')\ndisp('Group 4 : 4 men, 12 women, 14 kids. ')\ndisp('Group 5 : 5 men, 10 women, 15 kids. ')\ndisp('Group 6 : 6 men, 8 women, 16 kids. ')\ndisp('Group 7 : 7 men, 6 women, 17 kids. ')\ndisp('Group 8 : 8 men, 4 women, 18 kids. ')\ndisp('Group 9 : 9 men, 2 women, 19 kids. ')\n\n\n",WRONG_ANSWER,26,6492 1519981561351536640,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:06:58,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""\"")\neps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1;\ny=x*12\niter=k;",WRONG_ANSWER,56,6656 1519981564686008320,d83e3ea7de8674b51f82917e38721627e9d64cb37a6e4c2c0257aff380c6e855,2022-04-29 18:06:59,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e]=linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[~,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n\nN=input(\""\"");\nA = [30 20 10;\n 1 1 1];\nb = [500, N];\n[x,e] = linear_equation(A,b);\n",WRONG_ANSWER,56,6504 1519981633241911296,9768e8a39b0c166b0998496e5277b59d0b4051adc64eeed577d4b8d4d63d5f7e,2022-04-29 18:07:15,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"");\n",WRONG_ANSWER,56,6748 1519981647724851200,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:07:19,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""\"")\neps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1;\nrate=x1*12\niter=k;",WRONG_ANSWER,64,6492 1519981652208549888,1166c2e06bd782ea7811e3ede4e1e8f6437e3dcd49b7bba8f8a6f488bfc31593,2022-04-29 18:07:20,Octave,20.0,1519489154327527425,1517141269389144064,1141715823085969408,"total = input(\""\"");\n\ntmp = 3*total - 50;\n\ntype = 0;\n\nfor k = 0:tmp\n w = tmp-2*k;\n m = total - w -k;\n if (3*m+2*w+k == 50) && (m+w+k == total) && m>0 && w >0 && k >0\n type = type+1;\n Group(type) = struct(\""men\"",m,\""women\"",w,\""kids\"",k);\n end\nend\n\nfprintf(\""There are %d possible groups.\\n\"",type)\nfor i = 1:type-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men, Group(i).women, Group(i).kids);\nend\n\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",type,Group(type).men, Group(type).women, Group(type).kids);",ACCEPTED,53,6768 1519981678053851136,9768e8a39b0c166b0998496e5277b59d0b4051adc64eeed577d4b8d4d63d5f7e,2022-04-29 18:07:26,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368, ,WRONG_ANSWER,53,6368 1519981683468713984,f9c917192004d3c3a20c1383af0992882b60953c796e2c4093bdc6935ae56de7,2022-04-29 18:07:27,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N = input('')\nfun=@(x)N.*(x.*(1+x).^60)/((1+x).^60-1)-0.6 + x;\n[xx,iter,X]=newton_down(fun,0.00001,1e-8); % 不动点迭代求根\nrate = xx;\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2; % 更新 lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\nend\n \n",WRONG_ANSWER,53,6912 1519981726225432576,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-29 18:07:38,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"i=1;\nfor x=1:30\n for y=1:30\n for z=1:30\n if((3*x+2*y+z)==50&&(x+y+z)==30)\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n i=i+1; \n end\n end\n end\nend\ndisp(['There are ',num2str(i-1),' possible groups.']);\nfor j=1:i-1\n disp(['Group ',num2str(j),' : ',num2str(Group(j).men),' men, ',num2str(Group(j).wemen),' women, ',num2str(Group(j).kids),' kids.'])\nend",WRONG_ANSWER,88,6500 1519981742620966912,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:07:41,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""\"")\neps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1*12",WRONG_ANSWER,52,6656 1519981818906980352,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-29 18:08:00,Octave,20.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""\"");\neps=1e-6;\nmaxiter=1e4;\nk=0;err=1;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nrate=x1*12",ACCEPTED,55,6772 1519981862246715392,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-29 18:08:10,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function x=newton_down(fun,x0,eps,maxiter)\n k=1;tol=1;\n while abs(tol)>eps \nlambda=1; \n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1); \nend\ntol=fx1/dfx1;\nk=k+1; x0 = x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend\nend\nx=x1; \nend\n\nN=30;\nfun=@(x)(N.*x*(1+x)^60)/((1+x)^60-1)-0.6;\nx=newton_down(fun,0.07,,1e-6,1e4);\nrate=12*x;\nrate;\nrate = 0.074201\n",WRONG_ANSWER,52,6756 1519981934841737216,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-29 18:08:27,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N=input(\""\"");\n%sructure Group\nGroup.men;\nGroup.women;\nGroup.kids;\n\nm=1;\nfor i=1:100\n for j=1:100\n for k=1:100\n if (30i+20j+10k==500)&&(i+j+k==N)\n Group(m).men=i;\n Group(m).women=j;\n Group(m).kids=k;\n m=m+1;\n end\n end\n end\nend\nfprintf(\""There are XXX possible groups.\"");\nfprintf(Group);",WRONG_ANSWER,58,6756 1519981939677769728,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-29 18:08:28,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function x=newton_down(fun,x0,eps,maxiter)\n k=1;tol=1;\n while abs(tol)>eps \nlambda=1; \n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1); \nend\ntol=fx1/dfx1;\nk=k+1; x0 = x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend\nend\nx=x1; \nend\n\nN=input(\""\"");\nfun=@(x)(N.*x*(1+x)^60)/((1+x)^60-1)-0.6;\nx=newton_down(fun,0.07,,1e-6,1e4);\nrate=12*x;\nrate;\nrate = 0.074201\n",WRONG_ANSWER,55,6764 1519981963564331008,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-29 18:08:34,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368," function x=four_fun1(fun,a,b,eps,maxiter)\nif nargin<3\n % fun, a,b\n error('输入参数至少需要 3 个！');\nend \nif nargin<4|isempty(eps)\n % eps \n eps=1e-6;\nend \nif nargin<5|isempty(maxiter)\n maxiter=1e4;\nend\nX=(0:0.01:1);\nfa=feval(fun,a);fb=feval(fun,b); \n% fa=fun(a,varargin{:});fb=fun(b,varargin{:});\nk=0; % 迭代计数器 \nif (abs(fa)-abs(fb))eps\n k=k+1;\n % 完成迭代\n % 牛顿割线法迭代公式\n x1=a-fa*(b-a)/(fb-fa);\n fa=fb;\n a=b;\n b=x1;\n fb=feval(fun,b);\n % 储存每一个迭代值\n X(k)=x1;\n if k>maxiter\n error('迭代次数超限，迭代失败！');\n end\n end\nx=x1;\nend\nN=180,M=240,R=1.2;\nx=(0:0.00001:0.01);\nfun1=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\nfun1(0.004)\nfun1(0.006)\nfun2=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2+x;\nx=four_fun1(fun1,0.05,0.004,0.006,1e-6);",WRONG_ANSWER,56,6884 1519981973215424512,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 18:08:36,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e] = Linear_equation(A,b)\n% 此处显示有关此函数的摘要\n% A:方程组的系数矩阵\n% b:方程组的右端向量\n% x:方程组的解\n% e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n\n x=A\\b;\n e=norm(A*x-b);\n else\n\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n k=[];\n k=[11,12,13]\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[30 20 10;1 1 1];\nb=[500,30];\nfprintf(\""There are %s possible groups\"",x);\nfprintf(\""Group%s:\"",x);",WRONG_ANSWER,26,6504 1519982002961432576,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-29 18:08:44,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function x=newton_down(fun,x0,eps,maxiter)\n k=1;tol=1;\n while abs(tol)>eps \nlambda=1; \n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1); \nend\ntol=fx1/dfx1;\nk=k+1; x0 = x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend\nend\nx=x1; \nend\n\nN=input(\""\"");\nfun=@(x)(N.*x*(1+x)^60)/((1+x)^60-1)-0.6;\nx=newton_down(fun,0.07,,1e-6,1e4);\nrate=12*x;\nrate;\nrate =0.0742\n",WRONG_ANSWER,55,6636 1519982066291224576,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-29 18:08:59,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function x=newton_down(fun,x0,eps,maxiter)\n k=1;tol=1;\n while abs(tol)>eps \nlambda=1; \n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1); \nend\ntol=fx1/dfx1;\nk=k+1; x0 = x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend\nend\nx=x1; \nend\n\nN=input(\""\"");\nfun=@(x)(N.*x*(1+x)^60)/((1+x)^60-1)-0.6;\nx=newton_down(fun,0.07,,1e-6,1e4);\nrate=12*x;\nrate\n",WRONG_ANSWER,53,6764 1519982072821743616,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 18:09:00,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e] = Linear_equation(A,b)\n% 此处显示有关此函数的摘要\n% A:方程组的系数矩阵\n% b:方程组的右端向量\n% x:方程组的解\n% e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n\n x=A\\b;\n e=norm(A*x-b);\n else\n\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n \n colnum=size(z,2);\n k=[];\n for i =1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[30 20 10;1 1 1];\nb=[500,30];\nfprintf(\""There are %s possible groups\"",x);\nfprintf(\""Group%s:\"",x);",WRONG_ANSWER,28,6616 1519982121114976256,2ba943b978267503034acb4f52f525d0593dde92c6a4f6afcc1749a96e66763c,2022-04-29 18:09:12,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N=input(\""\"");\nx=0:0.01:1;\n[xx,iter,X]=newton_down(@f,1, ,100)\nplot(x,f(x),[0,1],[0,0],'k',xx,f(xx),'k*')\nfunction [y,dy]=f(x)\ny=N*x.*(1+x).^60./((1+x).^60-1)-0.6;\nff=sym('N*x.*(1+x).^60./((1+x).^60-1)-0.6')\ndy=diff(ff);\ndy=subs(dy,x);\n\n\nfunction[x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\n if k==maxiter\n error('迭代次数超限')\n end\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,53,6496 1519982180976082944,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-29 18:09:26,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"fprintf('There are %f possible groups.',i)\nfor a=1:16\n for b=1:25\n for c=1:50\n i=0;\n if 30*a+20*b+10*c==500\n i=i+1;\n fprintf('Group %f: ',i)\n fprintf(' %f men;',a);\n fprintf('%f women;',b);\n fprintf('%f kids;\\n',c);\n end\n end\n end\nend\nfprintf('There are %f possible groups.',i)",WRONG_ANSWER,82,6500 1519982189998030848,d83e3ea7de8674b51f82917e38721627e9d64cb37a6e4c2c0257aff380c6e855,2022-04-29 18:09:28,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\n% ---fun：迭代函数 \n% ---x0：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4 \n% 输出参数： % ---x：非线性方程的近似根 \n% ---iter：迭代次数 % ---X：每一步迭代的结果 \nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;\nend \nk=1;tol=1; \nwhile abs(tol)>eps \nlambda=1; \n[fx0,dfx0]=feval(fun,x0); \nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0) \nlambda=lambda/2; % 更新 lambda \nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n[fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \nend \ntol=fx1/dfx1; % Q: 为什么 tol 是这样？ \nk=k+1; \nx0 = x1; X(k)=x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend \nend \nx=x1;iter=k;X=X'; \nend\n\n N = input(\""\"");\nfun=@(R)0.6-N*(R+R/((1+R).^60-1));\n[x,iter,X]=newton_down(fun,0.1,1e-6,1e4); \nrate=x\n",WRONG_ANSWER,54,6756 1519982192711729152,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-29 18:09:29,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e] = Linear_equation(A,b)\n% 此处显示有关此函数的摘要\n% A:方程组的系数矩阵\n% b:方程组的右端向量\n% x:方程组的解\n% e:解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n\n x=A\\b;\n e=norm(A*x-b);\n else\n\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n \n colnum=size(z,2);\n k=[];\n for i =1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[30 20 10;1 1 1];\nb=[500,30];\n[x,e]=Linear_equation(A,b);\nfprintf(\""There are %s possible groups\"",x);\nfprintf(\""Group%s:\"",x);",WRONG_ANSWER,27,6764 1519982218473160704,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-29 18:09:35,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"i=1;\nfor x=1:30\n for y=1:30\n for z=1:30\n if((3*x+2*y+z)==50&&(x+y+z)==30)\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n i=i+1; \n end\n end\n end\nend\ndisp(['There are ',num2str(i-1),' possible groups.']);\nfor j=1:i-1\n disp(['Group ',num2str(j),' : ',num2str(Group(j).men),' men, ',num2str(Group(j).wemen),' women, ',num2str(Group(j).kids),' kids.']);\nend",WRONG_ANSWER,89,6500 1519982275326935040,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-29 18:09:49,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"i=input('');\nx=0.001:0.0001:0.007;\nfun=@(x)150.*x.*(1+x).^i-(1+x).^i+1; % 定义函数表 \n\nfunction [x,iter,X]=newtong(fun,x0,eps,maxiter)\n% Newton法求解非线性方程组的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点向量\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似解向量\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fun,x0); % 求函数fun的值和jacobi矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;\nend\n\n[x,iter,X]=newtong(fun,x0,eps,maxiter);\nfprintf('rate = %6.f',x);\n",WRONG_ANSWER,55,6624 1519982282943791104,5a91ce958a3237765d3acb8b37892d1df7070bb9ca19da23d47210e62296b9c7,2022-04-29 18:09:50,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function [x,fx] = bisect(fun,a,b)\n eps = 1e-6;\n fa = feval(fun,a);\n fb = feval(fun,b);\n x = (a + b)/2;\n fx = feval(fun,x);\n if fa*fb > 0\n warning([ [',num2str(a),',',num2str(b),']’区间内无解’]);\n elseif fa == 0\n x = a;\n fx = fa;\n elseif fb == 0\n x = b;\n fx = fb;\n else\n while abs(fx) > eps\n x = (a + b)/2;\n fx = feval(fun,x);\n if fa*fx > 0\n a = x;\n fa = fx;\n elseif fb*fx > 0\n b = x;\n fb = fx;\n else\n break\n end\n end\n end\nend\nfun=@(x)(180*x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x1,fx1]=bisect(fun,-0.5,0.6)\n",WRONG_ANSWER,51,6748 1519982290120257536,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-29 18:09:52,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,month = 60;\nmonthpay = 6000;\n,WRONG_ANSWER,54,6636 1519982294322937856,8c0f99c061618f2b53ecf39540bc86d0575e117e942cc728289e385826d2ad64,2022-04-29 18:09:53,Octave,10.0,1519489096731348992,1517175951723835392,1141715925804474368,"function[x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2\n error\nend\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n \n end\n tol=fx1/dfx1;\n x0=x1;\n X(k)=x1;\nend\nend\nrate=0.074201",PARTIAL_ACCEPTED,55,6748 1519982316594704384,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-29 18:09:58,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"i=0;\nfor a=1:16\n for b=1:25\n for c=1:50\n \n if 30*a+20*b+10*c==500\n i=i+1;\n fprintf('Group %f: ',i)\n fprintf(' %f men;',a);\n fprintf('%f women;',b);\n fprintf('%f kids;\\n',c);\n end\n end\n end\nend\nfprintf('There are %f possible groups.',i)",WRONG_ANSWER,84,6780 1519982320507990016,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-29 18:09:59,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,men + women + kids = 60;\n30*men+20*women+10*kids=500;\n,WRONG_ANSWER,52,6636 1519982329173413888,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-29 18:10:01,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"#matlab已成功\ni=1;\nfor x=1:30\n for y=1:30\n for z=1:30\n if((3*x+2*y+z)==50&&(x+y+z)==30)\n Group(i).men=x;\n Group(i).wemen=y;\n Group(i).kids=z;\n i=i+1; \n end\n end\n end\nend\ndisp(['There are ',num2str(i-1),' possible groups.']);\nfor j=1:i-1\n disp(['Group ',num2str(j),' : ',num2str(Group(j).men),' men, ',num2str(Group(j).wemen),' women, ',num2str(Group(j).kids),' kids.']);\nend",WRONG_ANSWER,88,6688 1519982333699063808,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-29 18:10:02,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,men + women + kids = 60;\n30*men+20*women+10*kids=500;\n,WRONG_ANSWER,54,6504 1519982376892022784,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-29 18:10:13,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"tol=300000;\nsys x;\nmrate=x;\nrate=12*mrate;\nmpay=6000;\nm=60;\ntolpay=m*mpay;\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end \nk=1;tol=1; \nwhile abs(tol)>eps \n lambda=1; [fx0,dfx0]=feval(fun,x0); x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2; % 更新 lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1); \n end\n tol=fx1/dfx1; \n k=k+1; x0 = x1; X(k)=x1;\n if k==maxiter error('迭代次数超限，迭代失败！') end\nend x=x1;iter=k;X=X';\nend",WRONG_ANSWER,54,6508 1519982387964985344,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-29 18:10:15,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"i=0;\nfor a=1:16\n for b=1:25\n for c=1:50\n if 30*a+20*b+10*c==500\n i=i+1;\n fprintf('Group %f: ',i)\n fprintf(' %f men;',a);\n fprintf('%f women;',b);\n fprintf('%f kids;\\n',c);\n end\n end\n end\nend\nfprintf('There are %f possible groups.',i)",WRONG_ANSWER,84,6744 1519982398123589632,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-29 18:10:18,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"R = 0.002 : .001:.005;\ny = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;%y:方程函数\n \n%a=0.004;b=0.005;%根区间\n%x0=1;\ne=10^(-6);%根的容许误差\n%fun=myfunction(R);\n[x,iter,X]=newton_down(@f,0.002,eps,1e4);\n\np0=0.0045;%初始值\nN=20;%迭代次数\n \n%求解方程\nfunction [y,dy]=f(R)\ny = 180*R.*(1+R).^240./((1+R).^240-1)-1.2;\nff=sym('180*R.*(1+R).^240./((1+R).^240-1)-1.2');\ndy= diff(ff);\ndy= subs(dy,R);\nend\n \nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% -maxiter∶最大迭代次数，默认值为1e4\n%fun=myfunction(a);\nif nargin<2,error('输入参数至少需要2个!') ,end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=le4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval( fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败!')\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,54,6752 1519982461000384512,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-29 18:10:33,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"A=[20 10;\n 1 1 ];\nb=[500;30];\nsolution=0;\nxsolute1=zeros(1,100);\nxsolute2=zeros(1,100);\nfor i=1:30\n if(i*30>=500)\n break;\n end\n b(1)=b(1)-30;\n b(2)=b(2)-1;\n [x,e]=GaussMainFactor(A,b);\n eps=1e-8;\n if(A*x-b0&x(2)>0)\n solution=solution+1;\n xsolute1(solution)=x(1);\n xsolute1(solution)=x(2);\n end\nend\nsolution\ndisp(['There are ',num2str(solution),' possible groups.'])\n\n\n\n",WRONG_ANSWER,26,6504 1519982518500110336,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-29 18:10:46,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"SUM=[1 1 1;30 20 10]; %系数矩阵 \nb=[30 500]'; %线性方程组的右端向量\nsyms k1 k2;\nU=rref(sym([SUM b]));\nx =[U(1:rank(SUM),length(SUM)-rank(SUM)+1:end)*[-k1;-k2;1];k1;k2];\nfprintf('There are %d possible groups.',length(x))\nfor i=1:length(x)\nfprintf('Group %d : ',i);\nend\n",WRONG_ANSWER,26,6624 1519982525584293888,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-29 18:10:48,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,function result=f1(x)\n result=180*(x*(1+x)^240)/(((1+x)^240)-1)；\nend\n,WRONG_ANSWER,55,6644 1519982539526160384,d83e3ea7de8674b51f82917e38721627e9d64cb37a6e4c2c0257aff380c6e855,2022-04-29 18:10:51,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter) % Newton 下山法求解非线性方程的根 % 输入参数：\n% ---fun：迭代函数 \n% ---x0：初始迭代点 \n% ---eps：精度要求，默认值为 1e-6 \n% ---maxiter：最大迭代次数，默认值为 1e4 \n% 输出参数： % ---x：非线性方程的近似根 \n% ---iter：迭代次数 % ---X：每一步迭代的结果 \nif nargin<2,error('输入参数至少需要 2 个！'),end \nif nargin<3|isempty(eps),eps=1e-6;end \nif nargin<4|isempty(maxiter),maxiter=1e4;\nend \nk=1;tol=1; \nwhile abs(tol)>eps \nlambda=1; \n[fx0,dfx0]=feval(fun,x0); \nx1=x0-lambda*fx0/dfx0; \n[fx1,dfx1]=feval(fun,x1); \nwhile abs(fx1)>=abs(fx0) \nlambda=lambda/2; % 更新 lambda \nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代 \n[fx1,dfx1]=feval(fun,x1); % x0=x1; % 书上代码错误，修正 \nend \ntol=fx1/dfx1; % Q: 为什么 tol 是这样？ \nk=k+1; \nx0 = x1; X(k)=x1;\nif k==maxiter error('迭代次数超限，迭代失败！') \nend \nend \nx=x1;iter=k;X=X'; \nend\n\n N = input(\""\"");\nfun=@(R)0.6-N*(R+R/((1+R).^60-1));\n[x,iter,X]=newton_down(fun,0.1,1e-6,1e4); \nrate=x\n",WRONG_ANSWER,53,6760 1519982607163490304,5a91ce958a3237765d3acb8b37892d1df7070bb9ca19da23d47210e62296b9c7,2022-04-29 18:11:08,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"a=zeros(16,3);\nb=0;\nfor i=1:16\n for j=1:30-i\n for k=30-i-j\n if 30*i+20*j+10*k==500\n b=b+1;\n a(b,1)=i;\n a(b,2)=j;\n a(b,3)=k;\n end\n end\n end\nend\noutput(\""There are \""'b'\"" possible groups.\"")\nfor i=1:b\n output(\""Group \""'b '\"": \""' a(b,1)'\"" men,\""'a(b,2)'\"" women,\""'a(b,3)'\"" kids.\"")\nend",WRONG_ANSWER,28,6748 1519982642034933760,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-29 18:11:16,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [X,e]=Linear_equation(A,B) \n% 线性方程组的求解 \n% 输入参数： \n% ---A：方程组的系数矩阵 \n% ---B：方程组的右端向量 \n% 输出参数： \n% ---X：方程组的解% \n% ---e：解的误差 \n[~,n]=size(A); \nr1=rank(A); \nr2=rank([A B]); \nif r1==r2 \nif r1==n \nX=A\\B; \ne=norm(A*X-B); \nelse\nz=null(sym(A)); \n%解出规范化的化零空间 \nx0=sym(A)\\sym(B); %求出一个特解 \ncolnum = size(z,2); \nk =[]; \nfor i = 1:colnum \nk = [k sym(['k' num2str(i)])]; \nend \nX = z*k' + x0; \ne=norm(A*X-B); \n%检验解的准确性 \nend \nelse\nX=A\\B; \ne=norm(A*X-B); \nend\nend\nN = input('');\nA = [30 20 10;\n 1 1 1];\nB=[500;\n N];\n[X,e] = Linear_equation(A,B);%调用函数求解\nX",WRONG_ANSWER,54,6748 1519982659378393088,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-29 18:11:20,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate=newton_down(N,eps,maxiter)\n% Newton 下山法求解非线性方程的根\nif nargin<1,error('输入参数至少需要 1个！'),end\nif nargin<2|isempty(eps),eps=1e-6;end\nif nargin<3|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\n\nsyms x;\nx = 0.1;\nfun =(N/60)*(1+x)-0.6;\n\nwhile abs(tol)>eps\nlambda=1;\n%[fx0,dfx0]=feval(fun,x0);\ndfx = diff(fun);\nfx0 = eval(fun);\ndfx0 = eval(dfx);\nx1=x-lambda*fx0/dfx0;\n%[fx1,dfx1]=feval(fun,x1);\ndfx1 = diff()\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; % 更新 lambda\nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n[fx1,dfx1]=feval(fun,x1);\nend\ntol=fx1/dfx1;\nk=k+1;\nx0 = x1;\nX(k)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\nend\n\n%function [y,dy] = f1(x)\n% 例 4-1 humps 函数，返回函数值和一阶导数值\n% 函数描述文件，主要功能是求解函数表达式的值及其导数值\n%syms t\n%y = 1./((t-.3).^2 +.01)+1./((t-.9).^2 +.04)-6; % 计算函数值\n%dy = diff(y); % 求 1 阶导数\n%t = x;\n%dy = eval(dy); % 求数值\n%y = eval(y);",WRONG_ANSWER,52,6756 1519982668937216000,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 18:11:22,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"pnt = 0;\nfor men = 1:30\n\tfor women = 1:30\n\t\tfor children = 1:30\n\t\t\tif men * 30 + women * 20 + children * 10 == 500\n\t\t\t\tpnt = pnt + 1;\n\t\t\t\tGroup(pnt).men = men;\n\t\t\t\tGroup(pnt).women = women;\n\t\t\t\tGroup(pnt).children = children;\n\t\t\tend\n\t\tend\n\tend\nend\n% str=['123' num2str(222) '456\\n']\n% printf(['123' '456\\n'])\n% printf(string(str))\n% printf(['123' '456\\n'])\n%%%%%%%%%%%%%%%%\n%%\n%% disp函数不能正常输出\n%%\n%%%%%%%%%%%%%%%%\nprintf(\""There are %d possible groups.\\n\"", length(Group));\n% disp(['There are ' num2str(length(Group)) ' possible groups.'])\nfor i = 1:length(Group)\n printf(\""Group %d : %d men, %d women, %d kids.\\n\"", i, Group(i).men, Group(i).women, Group(i).children);\n% \tdisp(['Group ' num2str(i) ' : ' num2str(Group(i).men) ' men, ' num2str(Group(i).women) ' women, ' num2str(Group(i).children) ' kids.']);\nend\n% Group 1 : 1 men, 18 women, 11 kids.\n% Group 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,97,6692 1519982696099528704,5a91ce958a3237765d3acb8b37892d1df7070bb9ca19da23d47210e62296b9c7,2022-04-29 18:11:29,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"a=zeros(5,3);\nb=0;\nfor i=1:16\n for j=1:30-i\n for k=30-i-j\n if 30*i+20*j+10*k==500\n b=b+1;\n a(b,1)=i;\n a(b,2)=j;\n a(b,3)=k;\n end\n end\n end\nend\noutput(\""There are \""'b'\"" possible groups.\"")\nfor i=1:b\n output(\""Group \""'b '\"": \""' a(b,1)'\"" men,\""'a(b,2)'\"" women,\""'a(b,3)'\"" kids.\"")\nend",WRONG_ANSWER,26,6620 1519982749031645184,c5d8955f8d024cc1f6e34be920b383ef27428bfd5c9c0d08aa5ae85a9bc72e9f,2022-04-29 18:11:41,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter) \nif nargin<3,error('输入参数至少需要 3 个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end \nif nargin<5|isempty(maxiter),maxiter=1e4;end \nf0 =feval(fun,x0);\nf1 =feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps \n lambda=1; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n \nwhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新 lambda \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代 \n f2=feval(fun,x2); \nend \nx0=x1;\nx1=x2;\nf0=f1;\nf1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！') \nend \nx=x1;iter=k;X=X'; \nend\nP=360;\nfun=@(x)180*(x*(1+x)^P)/((1+x)^P-1)-1.2;\n[x,iter,X]=newton_down(fun,0.007,0.006);\ndk=x*12;\nrate=dk\n",WRONG_ANSWER,54,6500 1519982800344760320,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-29 18:11:54,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x]=eat(A,b)\nn=length(b);\nfor i=1:n-1\n m=A(i+1:n,i)/A(i,i);\n A(i+1:n,i+1:n)=A(i+1:n,i+1:n)-m*A(i,i+1:n);\n b(i+1:n)=b(i+1:n)-m*b(i);\n A(i+1:n,i)=zeros(n-i,1);\nend\nU=[A,b];\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor i=n-1:-1:1\n x(i)=(b(i)-A(i,i+1:n)*x(i+1:n))/A(i,i);\nend\nend",WRONG_ANSWER,52,6488 1519982825724493824,475ad7ec182bfff856610cda7574c219f2a0cb438afb857d67a7fabb7f8e1276,2022-04-29 18:12:00,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"global monthPay N P;\nmonthPay = 0.6;\nP = 30;\nN = 60;\n\nmaxX=0.02;\nx0=0:0.00001:maxX;\nx1=0:0.00001:maxX;\n\n[xxx,iterrr,XXX]=newton_down(@calY,x0);\nNT = xxx;\n\n[x,iter,X]=secant(@calY,x0,x1);\nCUT = x;\n\nif (NT > CUT)\n fprintf('rate = %f', NT);\nelse\n fprintf('rate = %f', CUT);\nend\n\nfunction y=calY(x)\n global monthPay N P;\n if(x == 0)\n y = monthPay;\n else\n y = monthPay-P*x*((1+x)^N)/(((1+x)^N)-1);\n end\nend\n\nfunction [xxx,iterrr,XXX]=newton_down(fun,x0,eps,maxiter) \n %Newton下山法求解非线性方程的根\n %输入参数：\n %---fun：迭代函数 \n %---x0：初始迭代点\n %---eps：精度要求，默认值为1e-6 \n %---maxiter：最大迭代次数，默认值为1e4\n % 输出参数：\n %---x：非线性方程的近似根 \n %---iter：迭代次数 \n %---X：每一步迭代的结果\n if (nargin < 2)\n error('输入参数至少需要 2 个！');\n end\n\n if (nargin < 3 | isempty(eps))\n eps=1e-6;\n end\n\n if (nargin < 4 | isempty(maxiter))\n maxiter=1e4;\n end \n\n k=1;\n tol=1;\n while (abs(tol) > eps)\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while (abs(fx1)>=abs(fx0))\n lambda=lambda/2;\t\t\t%更新lambda \n x1=x0-lambda*fx0/dfx0;\t\t\t%牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n end \n\n tol=fx1/dfx1; \n k=k+1; \n x0=x1;\n X(k)=x1;\n if (k == maxiter)\n error('迭代次数超限，迭代失败！')\n end\n end \n xxx=x1;\n iterrr=k;\n XXX=X';\nend\n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter) \n % 割线法求解非线性方程的根 \n % 输入参数： \n %---fun：迭代函数 \n %---x0,x1：初始迭代点 \n %---eps：精度要求，默认值为1e-6 \n %---maxiter：最大迭代次数，默认值为1e4\n % 输出参数： \n %---x：非线性方程的近似根\n %---iter：迭代次数 \n %---X：每一步迭代的结果\n if (nargin < 3)\n error('输入参数至少需要 3 个！');\n end \n\n if (nargin < 4 | isempty(eps))\n eps=1e-6;\n end\n\n if (nargin < 5 | isempty(maxiter))\n maxiter=1e4;\n end\n\n f0 = feval(fun,x0);\t\t\t%计算x0处的函数值\n f1 = feval(fun,x1);\t\t\t%计算x1处的函数值\n k=0;\n if ((abs(f1)-abs(f0)) < eps)\n error('f(x0)=f(x1)，迭代条件不符要求，需重新选初始点.');\n end \n\n while (abs(x1-x0) > eps)\n k=k+1; \n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1; \n x0=x1;\n x1=x2; \n f1 = feval(fun,x1);\t\t\t%计算x1处的函数值\n X(k)=x2;\n if (k == maxiter)\n error('迭代次数超限，迭代失败！')\n end\n\tend\n x=x2;\n iter=k;\n X=X';\nend\n",WRONG_ANSWER,54,6880 1519982887443660800,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 18:12:14,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"pnt = 0;\nfor men = 0:30\n\tfor women = 0:30\n\t\tfor children = 0:30\n\t\t\tif men * 30 + women * 20 + children * 10 == 500\n\t\t\t\tpnt = pnt + 1;\n\t\t\t\tGroup(pnt).men = men;\n\t\t\t\tGroup(pnt).women = women;\n\t\t\t\tGroup(pnt).children = children;\n\t\t\tend\n\t\tend\n\tend\nend\n% str=['123' num2str(222) '456\\n']\n% printf(['123' '456\\n'])\n% printf(string(str))\n% printf(['123' '456\\n'])\n%%%%%%%%%%%%%%%%\n%%\n%% disp函数不能正常输出\n%%\n%%%%%%%%%%%%%%%%\nprintf(\""There are %d possible groups.\\n\"", length(Group));\n% disp(['There are ' num2str(length(Group)) ' possible groups.'])\nfor i = 1:length(Group)\n printf(\""Group %d : %d men, %d women, %d kids.\\n\"", i, Group(i).men, Group(i).women, Group(i).children);\n% \tdisp(['Group ' num2str(i) ' : ' num2str(Group(i).men) ' men, ' num2str(Group(i).women) ' women, ' num2str(Group(i).children) ' kids.']);\nend\n% Group 1 : 1 men, 18 women, 11 kids.\n% Group 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,110,6616 1519982895777742848,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-29 18:12:16,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e]=L_Equation(A,b)\n[m,n]=size(A);\nR1=rank(A);\nR2=rank([A b]);\nif R1==R2\n if R1==n\n disp('方程组恰定,解唯一')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组欠定，解不唯一')\n z=null(sym(A)); \n x0=sym(A)\\sym(b); \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); \n end\nelse\n disp('方程组超定，最小二乘意义下有解')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[30,20,10;1,1,1];\nB=[500;20];\n[x e]=L_Equation(A,B)\n\n%解出结果为[k1+10,10-2k1,k1]为题中答案，但没有时间写成group形式了55555~",WRONG_ANSWER,52,6500 1519982905139429376,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 18:12:19,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"n = 1;\nfor i = 1:16\n\n rest23 = 500 - 30*i;\n for j = 1:25\n \n rest3 = rest23 - 20*j;\n for k = 1:50\n if 30*i + 20*j + 10*k == 500\n Group(n).men = i;\n Group(n).women = j;\n Group(n).kids = k;\n n = n+1;\n end\n end\n \n end\n\nend\n\nn = n-1;\n\n\nsentence = ['There are ', num2str(n), ' possible groups.'];\nfor i = 1:1:n\n rest = [rest ['Group ', num2str(i), ' : ', num2str(Group(i).men), ' men, ', num2str(Group(i).women), ' women, ', num2str(Group(i).kids), ' kids.']];\nend\n\nresult = [sentence rest]\n\n%可以按要求算出結果，輸出格式有問題",WRONG_ANSWER,77,6752 1519982934466002944,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-29 18:12:26,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x]=eat(A,b)\nn=length(b);\nfor i=1:n-1\n m=A(i+1:n,i)/A(i,i);\n A(i+1:n,i+1:n)=A(i+1:n,i+1:n)-m*A(i,i+1:n);\n b(i+1:n)=b(i+1:n)-m*b(i);\n A(i+1:n,i)=zeros(n-i,1);\nend\nU=[A,b];\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor i=n-1:-1:1\n x(i)=(b(i)-A(i,i+1:n)*x(i+1:n))/A(i,i);\nend\nend",WRONG_ANSWER,54,6504 1519982991756017664,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-29 18:12:39,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,N=input('');\nx=0;y=0;z=0;\ni=0;\nfor z=1:50\n if 3*N-2*z-50<=0\n break\n end\n if -2*N+z+50<=0\n break\n end\n i=i+1;\n x=-2*N+z+50;\n y=3*N-2*z-50;\n X(i)=x;Y(i)=y;Z(i)=z;\nend\nfor k=1:length(X)\n Group(k).men=X(i);\n Group(k).wemen=Y(i);\n Group(k).kids=Z(i);\nend,WRONG_ANSWER,57,6764 1519983019572625408,474dbb6a978e0fc51433bc6bebe5b1c5223b800726c1bb138398043a722508f9,2022-04-29 18:12:46,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function rate=secant(r)\nN=input(\""\"");\n\nend",WRONG_ANSWER,54,6620 1519983029664137216,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-29 18:12:48,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"for j=1:10\nGroup(j).men=0; \nGroup(j).women=0;\nGroup(j).kids=0;\nend\nx=1;\n for a=1:30\n for b=1:30-a\n if 30*a+20*b+10*(30-a-b)==500\n Group(x).men=a;\n Group(x).women=b;\n Group(x).kids=30-a-b;\n x=x+1;\n end\n end\n end\n fprintf(\""There are %d possible groups.\\n\"",x)\n for i=1:x\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",Group(x).men,Group(x).women,Group(x).kids)\n end",WRONG_ANSWER,29,6492 1519983069971398656,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 18:12:58,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"pnt = 0;\nfor men = 0:30\n\tfor women = 0:30\n\t\tfor children = 0:30\n\t\t\tif men * 30 + women * 20 + children * 10 == 500\n\t\t\t\tpnt = pnt + 1;\n\t\t\t\tGroup(pnt).men = men;\n\t\t\t\tGroup(pnt).women = women;\n\t\t\t\tGroup(pnt).children = children;\n\t\t\tend\n\t\tend\n\tend\nend\n% str=['123' num2str(222) '456\\n']\n% printf(['123' '456\\n'])\n% printf(string(str))\n% printf(['123' '456\\n'])\n%%%%%%%%%%%%%%%%\n%%\n%% disp函数不能正常输出\n%%\n%%%%%%%%%%%%%%%%\n% printf(\""There are %d possible groups.\\n\"", length(Group));\ndisp(['There are ' num2str(length(Group)) ' possible groups.'])\nfor i = 1:length(Group)\n% printf(\""Group %d : %d men, %d women, %d kids.\\n\"", i, Group(i).men, Group(i).women, Group(i).children);\n\tdisp(['Group ' num2str(i) ' : ' num2str(Group(i).men) ' men, ' num2str(Group(i).women) ' women, ' num2str(Group(i).children) ' kids.']);\nend\n% Group 1 : 1 men, 18 women, 11 kids.\n% Group 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,100,6620 1519983115437654016,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 18:13:09,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"pnt = 0;\nfor men = 1:30\n\tfor women = 1:30\n\t\tfor children = 1:30\n\t\t\tif men * 30 + women * 20 + children * 10 == 500\n\t\t\t\tpnt = pnt + 1;\n\t\t\t\tGroup(pnt).men = men;\n\t\t\t\tGroup(pnt).women = women;\n\t\t\t\tGroup(pnt).children = children;\n\t\t\tend\n\t\tend\n\tend\nend\n% str=['123' num2str(222) '456\\n']\n% printf(['123' '456\\n'])\n% printf(string(str))\n% printf(['123' '456\\n'])\n%%%%%%%%%%%%%%%%\n%%\n%% disp函数不能正常输出\n%%\n%%%%%%%%%%%%%%%%\n% printf(\""There are %d possible groups.\\n\"", length(Group));\ndisp(['There are ' num2str(length(Group)) ' possible groups.'])\nfor i = 1:length(Group)\n% printf(\""Group %d : %d men, %d women, %d kids.\\n\"", i, Group(i).men, Group(i).women, Group(i).children);\n\tdisp(['Group ' num2str(i) ' : ' num2str(Group(i).men) ' men, ' num2str(Group(i).women) ' women, ' num2str(Group(i).children) ' kids.']);\nend\n% Group 1 : 1 men, 18 women, 11 kids.\n% Group 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,113,6856 1519983152439787520,46333a9e73be9735b768fa91d35a08768f6b7e00557ae3baef53a40634eb4209,2022-04-29 18:13:18,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,funcution y(x)\ninput('输入汽车总价= ')\nif x>36\n output('error');\nelse\nrate=[36-,WRONG_ANSWER,53,6496 1519983206038798336,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 18:13:30,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"n = 1;\nfor i = 1:16\n\n rest23 = 500 - 30*i;\n for j = 1:25\n \n rest3 = rest23 - 20*j;\n for k = 1:50\n if 30*i + 20*j + 10*k == 500\n Group(n).men = i;\n Group(n).women = j;\n Group(n).kids = k;\n n = n+1;\n end\n end\n \n end\n\nend\n\nn = n-1;\n\n\nsentence = ['There are ', num2str(n), ' possible groups.'];\nfor i = 1:1:n\n rest = [rest ['Group ', num2str(i), ' : ', num2str(Group(i).men), ' men, ', num2str(Group(i).women), ' women, ', num2str(Group(i).kids), ' kids.']];\nend\n\nresult = [sentence rest]\n\n%可以按要求算出結果，輸出格式有問題",WRONG_ANSWER,77,6608 1519983250099961856,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-29 18:13:41,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate = secant(year)\n\nfun = @(x)180 * x * (1+x)^year / ((1+x)^year - 1) - 1.2;\n\nx0 = -3;\nx1 = 2;\n\neps = 1e-6;\n\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\n\nwhile abs(x1-x0) > eps\n x2 = x1-f1*(x1-x0)/(f1-f0);\n f0 = f1;\n x0 = x1;\n x1 = x2;\n f1 = feval(fun,x1);\nend\n\nrate = x2;\n\nend\n\nrate = secant(240)\n\n% 能算出結果為0.043",WRONG_ANSWER,53,6500 1519983269381177344,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-29 18:13:46,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N=input('');\nx=0;y=0;z=0;\ni=0;\nfor z=1:50\n if 3*N-2*z-50<=0\n break\n end\n if -2*N+z+50<=0\n break\n end\n i=i+1;\n x=-2*N+z+50;\n y=3*N-2*z-50;\n X(i)=x;Y(i)=y;Z(i)=z;\nend\nfor k=1:length(X)\n Group(k).men=X(i);\n Group(k).wemen=Y(i);\n Group(k).kids=Z(i);\nend\nfprintf('There are %d possible groups',length(X))",WRONG_ANSWER,52,6500 1519983292160454656,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-29 18:13:51,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\nlambda=1;\n[fx0,dfx0]=feval(fun,x0);\nx1=x0-lambda*fx0/dfx0;\n[fx1,dfx1]=feval(fun,x1);\nwhile abs(fx1)>=abs(fx0)\nlambda=lambda/2; % 更新 lambda\nx1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n[fx1,dfx1]=feval(fun,x1);\nx0=x1;\nend\ntol=fx1/dfx1;\nk=k+1;\nx0 = x1;\nX(k)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\nend\nfunction [y,dy]=f(x)\ny=N*(1+x)^5-36;\nff=sym('N*(1+x)^5-36');\ndy=diff(ff);\ndy=subs(dy,x);\nend\nN=30;\n[x,iter,X]=newton_down(@f,1,[],100)\nx\n\n\n\n\n\n\n\n",WRONG_ANSWER,59,6760 1519983300591009792,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-29 18:13:53,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function [x,e]=hw06t1(A,b)\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组恰定，有唯一解')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组欠定，有无穷解')\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n \n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nelse\n disp('方程组欠定，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nA=[1 1 1;30 20 10];\nb=[30;500];\n[x,e]=hw06t1(A,b)",WRONG_ANSWER,27,6628 1519983313173921792,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-29 18:13:56,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function[x,e]=Linear_equation(A,b)\n%线性方程组的求解\n%输入参数：\n%---A：方程组的系数矩阵\n%---b：方程组的右端向量\n%输出参数：\n%---x：方程组的解\n%---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A));\n %解出规范化的化零空间\n x0=sym(A)\\sym(b);%求出一个特解\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nA=[1 1 1;\n 30 20 10];\nb=[30;500];\n\n\n[x,e]=Linear_equation(A,b)\ndisp('There are 9 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 3 men, 14 women, 13 kids.\nGroup 4 : 4 men, 12 women, 14 kids.\nGroup 5 : 5 men, 10 women, 15 kids.\nGroup 6 : 6 men, 8 women, 16 kids.\nGroup 7 : 7 men, 6 women, 17 kids.\nGroup 8 : 8 men, 4 women, 18 kids.\nGroup 9 : 9 men, 2 women, 19 kids.\n')",WRONG_ANSWER,27,6504 1519983430564085760,f9c917192004d3c3a20c1383af0992882b60953c796e2c4093bdc6935ae56de7,2022-04-29 18:14:24,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"N = input('')\nfun=@(x)N.*(x.*(1+x).^60)/((1+x).^60-1)-0.6 + x;\n[xx]=newton_down(fun,0.00001,1e-8); % 不动点迭代求根\nrate = xx;\n\nfunction [x]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2; % 更新 lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nx=x1;\nend\nend\n \n",WRONG_ANSWER,54,6636 1519983444409499648,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-29 18:14:27,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"1;\nfunction p = find_possible(N)\ngroup = [];\nfor i = 1:N-1\nfor j = 1:N-1-i\nfor k = 1:N-i-j-1\ng.men = i;\ng.women = j;\ng.kids = k;\ngroup = [group,g]\nendfor\nendfor\nendfor\np = group;\nendfunction\n\n",WRONG_ANSWER,52,6616 1519983485849223168,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 18:14:37,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"pnt = 0;\nfor men = 1:30\n\tfor women = 1:30\n\t\tfor children = 1:30\n\t\t\tif men * 30 + women * 20 + children * 10 == 500\n\t\t\t\tpnt = pnt + 1;\n\t\t\t\tGroup(pnt).men = men;\n\t\t\t\tGroup(pnt).women = women;\n\t\t\t\tGroup(pnt).children = children;\n\t\t\tend\n\t\tend\n\tend\nend\n% str=['123' num2str(222) '456\\n']\n% printf(['123' '456\\n'])\n% printf(string(str))\n% printf(['123' '456\\n'])\n%%%%%%%%%%%%%%%%\n%%\n%% disp函数不能正常输出\n%%\n%%%%%%%%%%%%%%%%\nprintf(\""There are %d possible groups.\\n\"", length(Group));\n% disp(['There are ' num2str(length(Group)) ' possible groups.'])\nfor i = 1:length(Group)\n printf(\""Group %d : %d men, %d women, %d kids.\\n\"", i, Group(i).men, Group(i).women, Group(i).children);\n% \tdisp(['Group ' num2str(i) ' : ' num2str(Group(i).men) ' men, ' num2str(Group(i).women) ' women, ' num2str(Group(i).children) ' kids.']);\nend\n% Group 1 : 1 men, 18 women, 11 kids.\n% Group 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,96,6912 1519983528039710720,c5d8955f8d024cc1f6e34be920b383ef27428bfd5c9c0d08aa5ae85a9bc72e9f,2022-04-29 18:14:47,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"There are 4 possible groups.\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.",WRONG_ANSWER,52,6636 1519983539142049792,64c5b938b1c1f69feb1f7f9b5e01b9b8bca6e218447cc6486b442e0c99030608,2022-04-29 18:14:50,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"A=[1 1 1;30 20 10];\nb=[20;500];\nz=null(sym(A));\nx0=sym(A)\\sym(b);\nx=zeros(3,4);\nfor i=1:4\n x(:,i)=x0+z*i\nend\ndisp(x)",WRONG_ANSWER,54,6764 1519983560767877120,52a39c884c0c9166ac2a9d555f5d0e94a335e3adac049b2f5ad8a55a0e14ad50,2022-04-29 18:14:55,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input(\""\"")",WRONG_ANSWER,53,6496 1519983612194242560,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-29 18:15:07,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"1;\nfunction p = find_possible(N)\ngroup = [];\nfor i = 1:N-1\nfor j = 1:N-1-i\nfor k = 1:N-i-j-1\ng.men = i;\ng.women = j;\ng.kids = k;\ngroup = [group,g];\nendfor\nendfor\nendfor\np = group;\nendfunction\n\n",WRONG_ANSWER,54,6764 1519983627436331008,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-29 18:15:11,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"pnt = 0;\nfor men = 1:30\n\tfor women = 1:30\n\t\tfor children = 1:30\n\t\t\tif men * 30 + women * 20 + children * 10 == 500\n\t\t\t\tpnt = pnt + 1;\n\t\t\t\tGroup(pnt).men = men;\n\t\t\t\tGroup(pnt).women = women;\n\t\t\t\tGroup(pnt).children = children;\n\t\t\tend\n\t\tend\n\tend\nend\n% str=['123' num2str(222) '456\\n']\n% printf(['123' '456\\n'])\n% printf(string(str))\n% printf(['123' '456\\n'])\n%%%%%%%%%%%%%%%%\n%%\n%% disp函数不能正常输出\n%%\n%%%%%%%%%%%%%%%%\nprintf(\""There are %d possible groups.\\n\"", length(Group));\n% disp(['There are ' num2str(length(Group)) ' possible groups.'])\nfor i = 1:length(Group)\n printf(\""Group %d : %d men, %d women, %d kids.\\n\"", i, Group(i).men, Group(i).women, Group(i).children);\n% \tdisp(['Group ' num2str(i) ' : ' num2str(Group(i).men) ' men, ' num2str(Group(i).women) ' women, ' num2str(Group(i).children) ' kids.']);\nend\n% Group 1 : 1 men, 18 women, 11 kids.\n% Group 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,97,6500 1519983830570680320,cbac9a50bb450bc8a49ef840efd65c7ad92933110e2dede9f72212bf8250991c,2022-04-29 18:15:59,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X]=newtong(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要 2 个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\nk=k+1;\n[fx0,J]=feval(fg,x0); % 求函数 fun 的值和 jacobi 矩阵\nx1=x0-J\\fx0; % 牛顿法迭代公式\nerr=norm(x1-x0);\nx0=x1;\nX(k,:)=x1;\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k\nendfuction",WRONG_ANSWER,52,6760 1519983885859995648,cbac9a50bb450bc8a49ef840efd65c7ad92933110e2dede9f72212bf8250991c,2022-04-29 18:16:12,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"disp(\""There are 11 possible groups\"");\ndisp(\""Group 1: 0 men, 20 women, 10 kids.\"");\ndisp(\""Group 2: 1 men, 18 women, 11 kids.\"");\ndisp(\""Group 3: 2 men, 16 women, 12 kids.\"");\ndisp(\""Group 4: 3 men, 14 women, 13 kids.\"");\ndisp(\""Group 5: 4 men, 12 women, 14 kids.\"");\ndisp(\""Group 6: 5 men, 10 women, 15 kids.\"");\ndisp(\""Group 7: 6 men, 8 women, 16 kids.\"");\ndisp(\""Group 8: 7 men, 6 women, 17 kids.\"");\ndisp(\""Group 9: 8 men, 4 women, 18 kids.\"");\ndisp(\""Group 10: 9 men, 2 women, 19 kids.\"");\ndisp(\""Group 11: 10 men, 0 women, 20 kids.\"");",WRONG_ANSWER,26,6496 1519983896249274368,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-29 18:16:15,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function[x,e]=Linear_equation(A,b)\n%线性方程组的求解\n%输入参数：\n%---A：方程组的系数矩阵\n%---b：方程组的右端向量\n%输出参数：\n%---x：方程组的解\n%---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n \tx=A\\b;\n\te=norm(A*x-b);\n else disp('方程组是欠定的，有无穷解！')\n \tz=null(sym(A));%解出规范化的化零空间\n \tx0=sym(A)\\sym(b);%求出一个特解\n\tcolnum=size(z,2);\n\tk=[];\n\tfor i=1:colnum\n \t\tk=[k sym(['k' num2str(i)])];\n\tend\n\tx=z*k'+x0;\n\te=norm(A*x-b);%检验解的准确性\n\tend\nelse\n \tdisp('方程组是超定的，只有最小二乘意义下的解！')\n\tx=A\\b;\n\te=norm(A*x-b);\nend",WRONG_ANSWER,26,6748 1519983937210855424,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-29 18:16:25,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"Group(1).men=[5,1,2];\nGroup(2).women=[10,18,16];\nGroup(3).kids=[15,11,12;\nfprintf(\""[Group(1),Group(2),Group(3)]\"")",WRONG_ANSWER,27,6488 1519983988742062080,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-29 18:16:37,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;",WRONG_ANSWER,52,6760 1519983997885644800,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-29 18:16:39,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N = input(\""\"");\nA = [1,1,1;\n 30,20,10];\nb=[N;500];\n[x,e]=linear_equation(A,b);\nn = length(x);\nGroup=[n,3];\nfor i=1:n\n Group(i,1)=x(i,1);\n Group(i,2)=x(i,2);\n Group(i,3)=x(i,3);\nend\n\n\n\nfunction [x,e]=linear_equation(A,b)\n%输入参数：\n%A:线性方程组的系数矩阵\n%b:线性方程组的右端向量\n%输出参数：\n%x：方程组的解\n%e：方程组的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A,b]);%求矩阵的秩\nif r1==r2\n % 为恰定方程组，可以用左除法和逆矩阵法得到数值解。\n % 也可以用sym（）方法将数值矩阵转换化为符号矩阵。\n if r1==n\n disp('方程组是恰定的，有唯一的解！')\n x=A\\b;\n e=norm(A*x-b);%验证解的准确性\n % 为欠定方程组，用null（）就方程的通解——z=null(sym(A))\n % z的列数为n-rank(A),各列构成的向量为A的基础解系。\n % 得到特解需要左除法。\n else\n disp('方程组的欠定方程组，有无穷解！')\n z=null(sym(A));%解出规范化零空间\n x0=sym(A)\\sym(b);%求出一个解\n % 得出z的列数\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\n% 为超定方程组，只能求最小二乘解，只能通过左除法实现。\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nend",WRONG_ANSWER,52,6744 1519984048196337664,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-29 18:16:51,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;",WRONG_ANSWER,52,6908 1519984151023878144,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 18:17:16,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"function [x,e] =Linear_equation(A,b)\n\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n colnum=size(z,2); \n k=[];\n for i=1:colnum\n k=[k sym(['k' num2str(i)])];\n end\n x=z*k'+x0;\n e=norm(A*x-b); %检验解的正确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n\nN=input(\""\"");\nA=[1 1 1;\n 30 20 10];\nb=[N;500];\n [x e]=Linear_equation(A,b)",WRONG_ANSWER,54,6764 1519984169940201472,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 18:17:20,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = diyiti(f,x0,eps,maxiter)\n\nif nargin<2\n error('至少输入两个参数');end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nerr=1;k=0;\nwhile err>eps\n k=k+1;\n y=feval(f,x0);\n z=feval(f,y);\n x1=x0-(y-x0)^2/(z-2*y+x0);\n err=abs(x1-x0);\n x0=x1;\n X(k)=x1;\n \nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;iter=k;X=X'; \nend\n\nN=input(\""\"");\nx=-.01:.0001:.1;\nf=@(x)(N.*x.*(1+x).^60)./((1+x).^60-1)-x-0.6;\nx0=0.0035;\n[xx,iter,X]=diyiti(f,x0,1e-8);\nplot(x,f(x)-x,[-.01,.1],[0,0],'k:',xx,f(x0),'k*') \ndisp(xx*12);",WRONG_ANSWER,55,6764 1519984182195945472,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-29 18:17:23,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,"function [x,iter,X] = diyiti(f,x0,eps,maxiter)\n\nif nargin<2\n error('至少输入两个参数');end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nerr=1;k=0;\nwhile err>eps\n k=k+1;\n y=feval(f,x0);\n z=feval(f,y);\n x1=x0-(y-x0)^2/(z-2*y+x0);\n err=abs(x1-x0);\n x0=x1;\n X(k)=x1;\n \nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;iter=k;X=X'; \nend\n\nN=input(\""\"");\nx=-.01:.0001:.1;\nf=@(x)(N.*x.*(1+x).^60)./((1+x).^60-1)-x-0.6;\nx0=0.0035;\n[xx,iter,X]=diyiti(f,x0,1e-8);\nplot(x,f(x)-x,[-.01,.1],[0,0],'k:',xx,f(x0),'k*') \ndisp(xx*12);",WRONG_ANSWER,56,6628 1519984288785793024,2ba943b978267503034acb4f52f525d0593dde92c6a4f6afcc1749a96e66763c,2022-04-29 18:17:49,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"N=input(\""\"");\nA=[30 20 10; 1 1 1];\nb=[500; N];\nsyms k1,k2;\nU=rref(syms([A,b]));\nx=U",WRONG_ANSWER,52,6496 1519984350739857408,52a39c884c0c9166ac2a9d555f5d0e94a335e3adac049b2f5ad8a55a0e14ad50,2022-04-29 18:18:03,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"a=input(\""\"")\nrate = (12000-1800000/a)/1800000",WRONG_ANSWER,54,6768 1519984357689831424,1871f8c875d18f58722f0c4bb53131594a310942901a4f296c8bef48e28d9dd5,2022-04-29 18:18:05,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"m+w+k=30\n30m+20w+10k=500\nfunction [x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A); \nr2=rank([A b]); \nif r1==r2 \nif r1==n disp('方程组是恰定的，有唯一解！')\n x=A\\b; e=norm(A*x-b); \n else disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); x0=sym(A)\\sym(b); \n colnum = size(z,2);\n k =[];\n for i = 1:colnum \n k = [k sym(['k' num2str(i)])];\n end x = z*k' + x0; e=norm(A*x-b);\nend\nend\nThere are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,29,6748 1519984397774782464,52a39c884c0c9166ac2a9d555f5d0e94a335e3adac049b2f5ad8a55a0e14ad50,2022-04-29 18:18:15,Octave,0.0,1519489154327527425,1517141269389144064,1141715823085969408,"fprintf( \""There are 4 possible groups.\"")\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.\n",WRONG_ANSWER,52,6488 1519984602305839104,8c0f99c061618f2b53ecf39540bc86d0575e117e942cc728289e385826d2ad64,2022-04-29 18:19:03,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"function[x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A,b]);\nif r1==r2\n if r1==n\n disp('weiyijie')\n x=A\\b;\n e=norm(A*x-b);\n end\n if r1~=n\n disp('wuqiongjie')\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n colnum=size(z,2);\n k=[];\n for i=1:colnum\n k=[k sym(['k' \n end\n x=z*k'+x0;\n e=norm(A*x-b);\n end\nend\nA=[1 1 1;30 20 10];\nb=[30;500];\n[x,e]=Linear_equation(A,b)",WRONG_ANSWER,27,6504 1519984693875871744,c259821df467d3cfb6759056f889d0103bc3890264a0191e423ee5ba6f46c0fb,2022-04-29 18:19:25,Octave,0.0,1519489096727154688,1517166904926183424,1141715925804474368,"function rate=newton(months)\neps=1e-5;\nX(k)=0;\nx0=1;\nx1=0;\nmaxiter=1e4;\nk=0;\nerr=1;\nfun=180*X(k)*(1+X(k))^240/[((1+X(k))^240-1]-1.2;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0]=feval(fun,x0);\n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=X(k)*12;\nend",WRONG_ANSWER,53,6632 1519984708509794304,1871f8c875d18f58722f0c4bb53131594a310942901a4f296c8bef48e28d9dd5,2022-04-29 18:19:29,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"m+w+k=30\n30m+20w+10k=500\nfunction [x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A); \nr2=rank([A b]); \nif r1==r2 \nif r1==n disp('方程组是恰定的，有唯一解！')\n x=A\\b; e=norm(A*x-b); \n else disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); x0=sym(A)\\sym(b); \n colnum = size(z,2);\n k =[];\n for i = 1:colnum \n k = [k sym(['k' num2str(i)])];\n end x = z*k' + x0; e=norm(A*x-b);\nend\nend\nA=[1,1,1,30]\nb=[30,20,10,500]\n[x,e]=Linear_equation(A,b)\nThere are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,27,6632 1519984800427966464,c1f243f5106d0832d4bd1c6b1988e28764fc6fbc00aeeb159f601eb20c68bce7,2022-04-29 18:19:51,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"i=0;\nfor x=1:15\n for y=1:23\n for z=1:28\n i=i+1;\n if((30*x+20*y+10*z)==500)&&((x+y+z)==30)\n fprintf('Group%d:%d men, %d women, %d kids. \\n',i,,x,y,z)\n end\n end\n end\n end\n fprintf('There are %d possible groups. \\n',i);",WRONG_ANSWER,26,6496 1519984838315114496,46333a9e73be9735b768fa91d35a08768f6b7e00557ae3baef53a40634eb4209,2022-04-29 18:20:00,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,funcution y(x)\nx=input('输入汽车总价= ')\nif x>36\n output('error');\nelse\nrate=[(36-x),WRONG_ANSWER,55,6792 1519985082834661376,46333a9e73be9735b768fa91d35a08768f6b7e00557ae3baef53a40634eb4209,2022-04-29 18:20:58,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,x=input('输入汽车总价= ')\nif x>36\n output('error');\nelse\nrate=[12*(36-x)/60],WRONG_ANSWER,54,6592 1519985330042732544,46333a9e73be9735b768fa91d35a08768f6b7e00557ae3baef53a40634eb4209,2022-04-29 18:21:57,Octave,0.0,1519489096731348992,1517175951723835392,1141715925804474368,x=input('输入汽车总价= ')\nif x>36\n output('error');\nelse\nrate=[12*(36-x)/60]\noutput(rate),WRONG_ANSWER,53,6624 1519985964141821952,81bc069bfd358f0ccf744b9f714f6a5bf88a072a1f62543f63d14734943b3bfd,2022-04-29 18:24:28,Octave,0.0,1519489154327527424,1517040002215354368,1141715823085969408,"x=sym('x',[1,2,3]);\n[x1,x2,x3]=solve(30*x(1)+20*x(2)+10*x(3)==500,x(1)+x(2)+x(3)=30,x(1),x(2),x(3));\n",WRONG_ANSWER,28,6496 1519596439645229056,c71c52541bbf514161cedc13a3c79e622028cad8719fe7cb67ef9833af7011e8,2022-04-28 16:36:38,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,cminch = 2.54;\ninchft = 12;\nmcm = 1/100;\nmft = mcm*cminch*inchft;\nstartFt = 25000;\nstartM = startFt*mft;\nG = 9.8;\ntop = 1000*100;\ns = top - startM;\ndouble initV;\ninitV = (2*G*s)^0.5,ACCEPTED,29,6508 1519599541853126656,494d8c03d5ae4d727e4acfe59308ce2a6e7083d017b0e0bce3df6a53f74c1c52,2022-04-28 16:48:58,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,在五四青年节即将到来之际，中共中央总书记、国家主席、中央军委主席习近平25日上午到中国人民大学考察调研区期间指出，立足新时代新征程，中国青年的奋斗目标和前行方向归结到一点，就是坚,WRONG_ANSWER,26,6500 1519603241636106240,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-28 17:03:40,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,28,6752 1519603995516108800,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:06:40,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,a=2.54;\nb=12;\nc=1/100;\nd=a*b*c;\ne=25000;\nf=d*e;\ng=9.8;\nh=100*1000;\ni=h-f;\ninitV=(2*g*i)^0.5;,WRONG_ANSWER,31,6604 1519604018580586496,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:06:45,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,a=2.54;\nb=12;\nc=1/100;\nd=a*b*c;\ne=25000;\nf=d*e;\ng=9.8;\nh=100*1000;\ni=h-f;\ninitV=(2*g*i)^0.5;\nend,WRONG_ANSWER,26,6752 1519604151703617536,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:07:17,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,a=2.54;\nb=12;\nc=1/100;\nd=a*b*c;\ne=25000;\nsmartM=d*e;\ng=9.8;\nh=100*1000;\ni=h-smartM;\ninitV=(2*g*i)^0.5;\nend,WRONG_ANSWER,29,6772 1519604316963377152,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:07:56,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,a=2.54;\nb=12;\nc=1/100;\nd=a*b*c;\ne=25000;\nsmartM=d*e;\ng=9.8;\nh=100*1000;\ni=h-smartM;\ninitV=(2*g*i)^0.5\n,ACCEPTED,30,7248 1519604457703243776,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-28 17:08:30,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,cmperinch = 2.54;\ninchesperft = 12;\nmeterspercm = 1/100;\nmetersperft = meterspercm * cmperinch * inchesperft;\nstartft = 25000;\nstartm = metersperft * startft;\ng = 9.8 ;\ntop = 100 * 1000; \ns = top - startm;\ninitv = (2*g*s)^0.5\n\n,WRONG_ANSWER,28,6500 1519604664180445184,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:09:19,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"A=[3 4 90];\nresult=triangle(A(1),A(2),A(3));\nfunction result=triangle(a,b,m)\ngama=m/180*pi;\nc=sprt(a^2+b^2-2*a*b*cos(gama));\ns=0.5*a*b*sin(gama);\nresult = [c,s];\nendfunction",WRONG_ANSWER,28,6756 1519604751732342784,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-28 17:09:40,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,cmperinch = 2.54;\ninchesperft = 12;\nmeterspercm = 1/100;\nmetersperft = meterspercm * cmperinch * inchesperft;\nstartft = 25000;\nstartm = metersperft * startft;\ng = 9.8 ;\ntop = 100 * 1000; \ns = top - startm;\ninitV = (2*g*s)^0.5\n\n,ACCEPTED,27,6508 1519604828785901568,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-28 17:09:58,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,cmperinch = 2.54;\ninchesperft = 12;\nmeterspercm = 1/100;\nmetersperft = meterspercm * cmperinch * inchesperft;\nstartft = 25000;\nstartm = metersperft * startft;\ng = 9.8 ;\ntop = 100 * 1000; \ns = top - startm;\ninitV = (2*g*s)^0.5\n\n,ACCEPTED,27,6488 1519604927385604096,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-28 17:10:22,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function result = area(tri)\na = tri(1);\nb = tri(2);\nc = tri(3)*pi/180;\nresult = [sqrt(a*a + b*b - 2*a*b*cos(c)),a*b*sin(c)*0.5];\nendfunction\nresult = area([3 4 90])",ACCEPTED,26,6628 1519604967239892992,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-28 17:10:31,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,initV = 1345.6\n\n\n,ACCEPTED,26,6648 1519605467599376384,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:12:31,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"A=[3 4 90];\nresult=triangle(A(1),A(2),A(3));\nfunction result=triangle(a,b,m)\ngama=m/180*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(gama));\ns=0.5*a*b*sin(gama);\n\nresult = [c,s];\nfprintf('result =');\ndisp(result);\nend",WRONG_ANSWER,28,6620 1519605529008177152,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-28 17:12:45,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"A = input(\""\"");\n\nresult = zeros(1 ,2);\n\nB = A(3)/180*pi;\nresult(1, 2) = A(1) * A(2) * sin(B)/2; \nresult(1, 1) = A(1)^2 + A(2)^2 - 2*A(1)*A(2)*cos(B);\nresult(1, 1) = result(1, 1)^(1/2);\n",WRONG_ANSWER,27,6496 1519605783883464704,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-28 17:13:46,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"A = input(\""\"");\n\nresult = zeros(1 ,2);\n\nB = A(3)/180*pi;\nresult(1, 2) = A(1) * A(2) * sin(B)/2; \nresult(1, 1) = A(1)^2 + A(2)^2 - 2*A(1)*A(2)*cos(B);\nresult(1, 1) = result(1, 1)^(1/2);\nresult\n",ACCEPTED,28,6508 1519606146908864512,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-28 17:15:12,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"\n\nA = input(\""\"");\n\nresult = zeros(1 ,2);\n\nB = A(3)/180*pi;\nresult(1, 2) = A(1) * A(2) * sin(B)/2; \nresult(1, 1) = A(1)^2 + A(2)^2 - 2*A(1)*A(2)*cos(B);\nresult(1, 1) = result(1, 1)^(1/2);\nresult\n",ACCEPTED,36,6756 1519606695100198912,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:17:23,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any[a,b,D]\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*c*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=input(\""\"");\n[c,S]=any(A(1),A(2),A(3));\nresult=[c,S];\n\n \n ",WRONG_ANSWER,27,6992 1519606752612487168,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:17:37,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any[a,b,D]\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*c*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=[3 4 90];\n[c,S]=any(A(1),A(2),A(3));\nresult=[c,S];\n\n \n ",WRONG_ANSWER,26,6512 1519607189575090176,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:19:21,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any(a,b,D)\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*c*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=input(\""\"");\n[c,S]=any(A(1),A(2),A(3));\nresult=[c,S]\n\n \n ",WRONG_ANSWER,26,6508 1519607333456482304,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:19:55,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any(a,b,D)\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*c*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=input(\""\"");\n[side,area]=any(A(1),A(2),A(3));\nresult=[side,area]\n\n \n ",WRONG_ANSWER,28,6652 1519607414599495680,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:20:15,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any(a,b,D)\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*c*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=[3 4 90];\n[side,area]=any(A(1),A(2),A(3));\nresult=[side,area]\n\n \n ",WRONG_ANSWER,28,6496 1519607579599224832,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:20:54,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any(a,b,D)\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*b*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=[3 4 90];\n[side,area]=any(A(1),A(2),A(3));\nresult=[side,area]\n\n \n ",ACCEPTED,29,6628 1519607664630333440,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:21:14,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any(a,b,D)\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*b*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=input(\""\"");\n[side,area]=any(A(1),A(2),A(3));\nresult=[side,area]\n\n \n ",ACCEPTED,27,6508 1519607733777629184,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-28 17:21:31,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S] = any(a,b,D)\n rad=D/180*pi();\n c=sqrt((a^2+b^2-2*a*b*cos(rad)));\n S=a*b*sin(rad)/2;\n end\nA=input(\""\"");\n[c,S]=any(A(1),A(2),A(3));\nresult=[c,S]\n\n \n ",ACCEPTED,27,6504 1519607883086479360,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-28 17:22:06,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,cm = 2.54;\nin = 12;\nme = 1/100;\nmeft = me * cm * in;\nst = 25000;\nstm = st *meft;\ng = 9.8;\ntop = 100*1000;\ns = top-stm;\ninitV = (2*g*s)^0.5,ACCEPTED,28,7056 1519609631356256256,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-28 17:29:03,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"a = input(\""\"");\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi();\na3 = sqrt(a1^2+a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [a3,area]",ACCEPTED,28,6856 1519613090109374464,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:42:48,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nsprintf('initV= %7.1f,initV);",WRONG_ANSWER,28,6652 1519613367847792640,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:43:54,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nfprintf('initV= %7.1f,initV);",WRONG_ANSWER,27,6744 1519613524257587200,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:44:31,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nfprintf('initV= %5.1f,initV);",WRONG_ANSWER,29,6760 1519613948859551744,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:46:13,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nfprintf('initV= %7.1f',initV)",PRESENTATION_ERROR,27,6968 1519613993054928896,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:46:23,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nfprintf('initV= %5.1f',initV)",PRESENTATION_ERROR,26,6532 1519614069781331968,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:46:41,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nfprintf('initV= %f',initV)",WRONG_ANSWER,26,6764 1519614118758236160,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:46:53,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nsprintf('initV= %5.1f',initV)",WRONG_ANSWER,26,6616 1519614244537012224,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:47:23,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,"x1=100000;\nx2=25000*12*2.54*0.01;\ng=9.8;\ninitV=sqrt(2*g*(x1-x2));\nfprintf('initV= %5.1f',initV)",PRESENTATION_ERROR,26,6488 1519614758142115840,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:49:26,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"A=input('A=');\nresult=triangle(A(1),A(2),A(3));\nfunction result=triangle(a,b,m)\ngama=m/180*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(gama));\ns=0.5*a*b*sin(gama);\n\nresult = [c,s];\nfprintf('result =');\ndisp(result);\nend",WRONG_ANSWER,30,7300 1519614868666236928,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-28 17:49:52,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"A=input('A=');\nresult=triangle(A(1),A(2),A(3));\nfunction result=triangle(a,b,m)\ngama=m/180*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(gama));\ns=0.5*a*b*sin(gama);\nresult = [c,s];\nfprintf('result =%d',result);\n%disp(result);\nend",WRONG_ANSWER,29,6632 1519658913912369152,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-28 20:44:53,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,s=25000*12*2.54*(1/100);\nx=100*1000;\nh=x-s;\ng=9.8;\ninitV = (2*g*h)^0.5,ACCEPTED,28,6748 1519659097648050176,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-28 20:45:37,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"a = input(“”);\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad =angle/180*pi;\na3 = sqrt(a1^2+a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [a3,area]",WRONG_ANSWER,28,6528 1519659215784804352,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-28 20:46:05,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"a = input(“”);\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad =angle/180*pi;\na3 = sqrt(a1^2+a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [a3,area]",WRONG_ANSWER,27,6604 1519659283329892352,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-28 20:46:21,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"a = input(“”);\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi;\na3 = sqrt(a1^2+a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [a3,area]",WRONG_ANSWER,28,6492 1519659362929393664,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-28 20:46:40,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"a = input(“”);\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi;\na3 = sqrt(a1^2+a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [a3,area]",WRONG_ANSWER,29,6784 1519659414347350016,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-28 20:46:52,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"a = input(“”);\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi;\na3 = sqrt(a1^2+a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [a3,area]",WRONG_ANSWER,27,6760 1519661675018498048,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 20:55:51,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function result=trigle(a,b,ang)\narg=ang*180/pi;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult=[c,s];\nend\n\nA=[3 4 90];\na=A(1);b=A(2);ang=A(3);\nresult=trigle(a,b,ang);",WRONG_ANSWER,27,6492 1519662114896117760,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 20:57:36,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function result=trigle(a,b,ang)\narg=ang*180/pi;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult=[c,s];\nend\n\nA=[3 4 90];\na=A(1);b=A(2);ang=A(3);\nresult=trigle(a,b,ang)",WRONG_ANSWER,28,7092 1519662452617285632,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 20:58:57,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function result=trigle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult=[c,s];\nend\n\nA=[3 4 90];\na=A(1);\nb=A(2);\nang=A(3);\nresult=trigle(a,b,ang);",WRONG_ANSWER,27,6640 1519663362336653312,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 21:02:34,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function result=trigle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult(1,1)=c;\nresult(1,2)=s;\nend\n\nA=[3 4 90];\na=A(1);\nb=A(2);\nang=A(3);\nresult=trigle(a,b,ang);",WRONG_ANSWER,31,8528 1519663547364196352,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 21:03:18,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"A=[3 4 90];\na=A(1);\nb=A(2);\nang=A(3);\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult(1,1)=c;\nresult(1,2)=s;\nresult\n\n",ACCEPTED,29,6504 1519663841582039040,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 21:04:28,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function result=trigle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult(1,1)=c;\nresult(1,2)=s;\nend\n\nA=[3 4 90];\na=A(1);\nb=A(2);\nang=A(3);\nresult=trigle(a,b,ang);",WRONG_ANSWER,29,6504 1519664837301420032,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 21:08:25,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,s]=trigle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nend\n\nA=[3 4 90];\na=A(1);\nb=A(2);\nang=A(3);\n[c,s]=trigle(a,b,ang);\nresult=[c,s]",ACCEPTED,29,7300 1519665284502290432,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 21:10:12,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function result=trigle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult=zeros(1,2);\nresult(1,1)=c;\nresult(1,2)=s;\nend\n\nA=[3 4 90];\na=A(1);\nb=A(2);\nang=A(3);\nresult=trigle(a,b,ang);",WRONG_ANSWER,26,6500 1519666488523395072,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-28 21:14:59,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,h=2.54*12*25000/100;\ns=100000-h;\ninitV=sqrt(2*s*9.8),ACCEPTED,25,6368 1519672358867075072,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-28 21:38:19,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,initV=1345.6,ACCEPTED,33,6740 1519672442467942400,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-28 21:38:39,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,result=[5 6],ACCEPTED,29,7660 1519683988942274560,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-28 22:24:31,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,initV=sqrt(2*9.8*(100*1000-25000*2.54*0.01*12)),ACCEPTED,27,6752 1519685634850074624,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-28 22:31:04,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c s]=cal(a,b,angle)\n angle=angle/180*pi;\n s=0.5*a*b*sin(angle);\n c=a^2+b^2-2*a*b*cos(angle);\n \nend\nresult[c s]=cal(3 4 90)",WRONG_ANSWER,27,7196 1519686000488517632,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-28 22:32:31,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c s]=cal(a,b,angle)\n angle=angle/180*pi;\n s=0.5*a*b*sin(angle);\n c=a^2+b^2-2*a*b*cos(angle);\n \nend\n\n[c s]=cal(3 4 90);\nresult=[c s]",WRONG_ANSWER,30,7088 1519686240671150080,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-28 22:33:28,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c s]=cal(a,b,angle)\n angle=angle/180*pi;\n s=0.5*a*b*sin(angle);\n c=sqrt(a^2+b^2-2*a*b*cos(angle));\n \nend\n\n[c s]=cal(3 4 90);\nresult=[c s]",WRONG_ANSWER,28,6492 1519686449555865600,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-28 22:34:18,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c s]=cal(a,b,angle)\n angle=angle/180*pi;\n s=0.5*a*b*sin(angle);\n c=sqrt(a^2+b^2-2*a*b*cos(angle));\n \nend\n\n[c s]=cal(3,4,90);\nresult=[c s]",ACCEPTED,28,6628 1519690001363808256,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-28 22:48:25,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,l0=25000*12*2.54/100;\nl=100000;\ninitV=sqrt(2*9.8*(l-l0)),ACCEPTED,26,6880 1519690597202444288,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-28 22:50:47,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"a=[3 4 90];\nresult=zeros(1,2);\nresult(1)=sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180));\nresult(2)=1/2*a(1)*a(2)*sin(a(3)*pi/180);\nresult",ACCEPTED,27,6632 1519699564309811200,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-28 23:26:25,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,initV=1345.6,ACCEPTED,25,6636 1519701703224508416,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-28 23:34:55,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,function [initV] = feichuan()\nstartFt=25000;\nstartM=0.0254*12*startFt;\nH=100000-startM;\ninitV=(2*9.8*H)^(1/2);\nend,WRONG_ANSWER,27,6636 1519701835328307200,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-28 23:35:26,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [length, area]= triangle(a1, a2, angle)\n rad=angle/180*pi();\n length= sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[length,area]= triangle(a(1), a(2), a(3));\nresult = [length, area]",ACCEPTED,30,8308 1519702315936813056,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-28 23:37:21,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,function [initV] = feichuan()\nstartFt=25000;\nstartM=0.0254*12*startFt;\nH=100000-startM;\ninitV=(2*9.8*H)^(1/2);\nend\nresult = [initV],WRONG_ANSWER,28,6632 1519702497512439808,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-28 23:38:04,Octave,0.0,1519595380449230854,1514802200680230912,1141715823085969408,startFt=25000;\nstartM=0.0254*12*startFt;\nH=100000-startM;\ninitV=(2*9.8*H)^(1/2);,WRONG_ANSWER,25,7076 1519703512643043328,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-28 23:42:06,Octave,10.0,1519595380449230855,1514817351877615616,1141715705586737152,"function [c,S]=triangle(a,b,angle)\n degree=angle*pi()/180;\n c=sqrt(a^2+b^2-2*a*b*cos(degree));\n S=1/2*sin(degree)*a*b;\nend\n[c,S] = triangle(3,4,90);\nresult=[c,S]",ACCEPTED,28,6880 1519706750360530944,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-28 23:54:58,Octave,5.0,1519595380449230854,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,26,7188 1519706858544218112,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-28 23:55:24,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,result =\n\n 5 6,WRONG_ANSWER,26,6636 1519706881713541120,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-28 23:55:30,Octave,0.0,1519595380449230855,1514817351877615616,1141715705586737152,result =\n\n 5 6,WRONG_ANSWER,26,6488 1519997255271088128,a4ca4b1396164d6438834b706d88736b6a16ec134be5ffe403f11f46d10d3554,2022-04-29 19:09:20,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,.,WRONG_ANSWER,52,6620 1519997283863662592,a4ca4b1396164d6438834b706d88736b6a16ec134be5ffe403f11f46d10d3554,2022-04-29 19:09:27,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,.\n,WRONG_ANSWER,32,6492 1519997296777920512,a4ca4b1396164d6438834b706d88736b6a16ec134be5ffe403f11f46d10d3554,2022-04-29 19:09:30,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,.\n,WRONG_ANSWER,26,6684 1520000244689960960,8b85c2a4da106258626ae838621ecf1403cc46517bb0f57a9bab944f1af10e6a,2022-04-29 19:21:13,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=steffenson(fun,x0,eps,maxiter)\nif nargin<2,error,end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\nk=k+1;\nf0=feval(fun,x0);\nx1=x0-f0^2/(feval(fun,x0+f0)-f0);\nerr=x1-x0;\nx0=x1;\nx(k)=x1;\nend\nx=x1;iter=k;X=X';\n[x,iter,X]=steffenson(fun,0.007,0.006)",WRONG_ANSWER,52,6500 1520002109381066752,a1ff24b6ff4575ec474c050804773f09c2f3daed477dd42cec39bdbd42537c74,2022-04-29 19:28:37,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"x,y,z=input(\""\"")\nGroup(1).men = x; Group(2).wemen = y;\nGroup(3).kids = z;\nx+y+z=N\nx*30+y*20+Z*10=500\nThere are XXX possible groups.\nGroup1 :x men, y women, z kids.\nGroup2 :x men, y women, z kids.\nGroup3 :x men, y women, z kids.",WRONG_ANSWER,53,6620 1520002169686765568,a1ff24b6ff4575ec474c050804773f09c2f3daed477dd42cec39bdbd42537c74,2022-04-29 19:28:52,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368, ,WRONG_ANSWER,51,6888 1520002943938494464,8b85c2a4da106258626ae838621ecf1403cc46517bb0f57a9bab944f1af10e6a,2022-04-29 19:31:56,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error,end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps;\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nx(k)=x2;\nend\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6764 1520002974359785472,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-29 19:32:04,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,rate=input('');\nfun=@(rate)180*(rate*(1+x)^240)/((1+rate)^240-1)-1.2;\nrate,WRONG_ANSWER,55,6880 1520003379177226240,7fd4808a97025c0e3ac351d77f78edab215c6f139fda2f8d1cf1bf18e7781849,2022-04-29 19:33:40,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：a\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nx=input(\""\"");\nfun=@(7.2x-0.2);\nrate=newton_secant(fun,0,1);\nA=['rate = ',rate];\ndisp(A);",WRONG_ANSWER,52,6752 1520004977571958784,b5c7d0e49e89251f73d9f0836eed995388c1e3a265fdc2056426335f7bdb3041,2022-04-29 19:40:01,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function result=newton_down(N)\nfun = @(x) (N*x.*(1+x).^60)./((1+x).^60-1)-0.6\nx0 = 0.5;\nx1 = 0.48;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-0.5*f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超é™ï¼Œè¿­ä»£å¤±è´¥ï¼')\nend\nx=x2;iter=k;X=X';\nresult = x*12;\n",WRONG_ANSWER,58,6544 1520005026292994048,b5c7d0e49e89251f73d9f0836eed995388c1e3a265fdc2056426335f7bdb3041,2022-04-29 19:40:13,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"function [Group,count] = solution(N)\n \nm=N;n=N;l=N;\nif 10*N>500\n error('ä¸å­˜åœ¨è§£');\nend\ndisp('满足æ¡ä»¶ï¼š30x+20y+10z=500的解')\ncount = 1;\n \nfor i=1:m\n \n for j=1:n\n \n for k=1:l\n \n x=i;y=j;z=k;\n \n xyz=500-(30*x+20*y+10*z);\n \n if xyz==0 \n \n disp(['x=',num2str(i),' y=',num2str(j),' z=',num2str(k)])\n Group(count) = struct('men',i,'women',j,'kids',k);\n count=count+1;\n end\n \n end\n \n end\n \nend\n",WRONG_ANSWER,27,6500 1520005078319140864,8b85c2a4da106258626ae838621ecf1403cc46517bb0f57a9bab944f1af10e6a,2022-04-29 19:40:25,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"for x=1:30\nfor y=1:30\nfor z=1：30\nif(30*x+20*y+10*z)==500&（x+y+z)==30\nfprintf('there have %d men,%d women,%d kids!\\n',x,y,z);\nend \nend\nend\nend\n",WRONG_ANSWER,26,6504 1520005778457526272,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 19:43:12,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"i=0;\nfor x=1:30\nfor y=1:30\nfor z=1:30\ni=i+1;\nif((30*x+20*y+10*z)==500)&&((x+y+z)==30)\nfprint('There are %d possible groups. \\n',i);\nfprint('Group i : %d men, %d women, % kids. /n',x,y,z);\nend\nend\nend\nend",WRONG_ANSWER,28,6640 1520006920113532928,b819fc6408effa0f394326ade6e85743cf24cadb972801f2e9033a922150a0f2,2022-04-29 19:47:44,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,%上课没有认真学，作业没有按时完成，什么都不会，也不想作弊。就这么直接交了吧。之后会自学并补交作业的。,WRONG_ANSWER,52,6632 1520006944226574336,b819fc6408effa0f394326ade6e85743cf24cadb972801f2e9033a922150a0f2,2022-04-29 19:47:50,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,%上课没有认真学，作业没有按时完成，什么都不会，也不想作弊。就这么直接交了吧。之后会自学并补交作业的。,WRONG_ANSWER,55,6804 1520007020458065920,b819fc6408effa0f394326ade6e85743cf24cadb972801f2e9033a922150a0f2,2022-04-29 19:48:08,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,%上课没有认真学，作业没有按时完成，什么都不会，也不想作弊。就这么直接交了吧。之后会自学并补交作业的。,WRONG_ANSWER,54,6508 1520007169783676928,8b85c2a4da106258626ae838621ecf1403cc46517bb0f57a9bab944f1af10e6a,2022-04-29 19:48:44,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"x=input('人数;');\ny=input('钱;');\ntotal=0;\nk=0;\nfor i=1:fix(y/3)\nfor j=1:fix((y-i*3)/2)\nif 2*i+j+x==y\ntotal=total+1;\nfprintf('men%dwomen%dkids%d\\n',i,j,x-i-j)\nend\nk=k+1;\nend\nend\nfprintf('There are %d possible groups\\n',total);\n",WRONG_ANSWER,28,6760 1520007649414905856,6f308ba2cd20fb126d99254f04343324e3231bd57a515436332c561e9e62463d,2022-04-29 19:50:38,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0)\nf1 = feval(fun,x1)\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input('');\nfun@(x)=N*(x*(1+x)^60)/((1+x)^60-1)-0.6\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,55,6812 1520007698324701184,f1d980979c7e79d3a67d067154708756c976905ac84bf663e93110473120963e,2022-04-29 19:50:50,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"flag=1;\ny=input(\""\"");\nep=1e-8;\nmaxiter=500;\ncount=1;\nfun=@(x)(y.*x.*(x+1).^60)./((x+1).^60-1)-0.6;\nx=[0.1,1];\nwhile flag\n fx=fun(x);\n if abs(diff(fx))<=ep||count>maxiter\n flag=0;\n break\n end\n m=x(2)-fx(2)*diff(x)/diff(fx);\n if abs(m-x(2))<=ep\n break\n end\n x=[x(2),m];\n count=count+1;\nend\nformat shortG\nrate=x(2)*12",PRESENTATION_ERROR,55,6668 1520007907968593920,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-29 19:51:40,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;\niter=k;\nX=X';\nEnd\n",WRONG_ANSWER,58,6756 1520007928289988608,64d86a82372e4c32334b51384b7c70e36ca24e9707f14479f938c3c10849d78b,2022-04-29 19:51:45,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function varargout=number(n)\nsym x,y,z;\nfor x=0:1:n\n for y=0:1:40-n\n z=n-x-y;\n if(30*x+20*y+10*z==500)\n print(x,'men',y,'women',z,'kids');\n end\n end\nend",WRONG_ANSWER,52,6512 1520008091934953472,b819fc6408effa0f394326ade6e85743cf24cadb972801f2e9033a922150a0f2,2022-04-29 19:52:24,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,%上课没有认真学，作业没有按时完成，什么都不会，也不想作弊。就这么直接交了吧。之后会自学并补交作业的。,WRONG_ANSWER,54,6496 1520008841499017216,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-29 19:55:22,Octave,20.0,1519830685240533001,1517141269389144064,1141715823085969408,"N=input('');\nM=30;W=20;K=10;G=0;\nfor i=1:N\n for j=1:N-1\n for n=N-i-j\n if(500==M*i+W*j+K*n)\n if(n>0)\n G=G+1;\n Group(G).men=i;\n Group(G).women=j;\n Group(G).kid=n;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',G)\nfor x=1:G-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',x,Group(x).men,Group(x).women,Group(x).kid)\nend \nfprintf('Group %d : %d men, %d women, %d kids.',G,Group(G).men,Group(G).women,Group(G).kid)",ACCEPTED,66,6628 1520009016451825664,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 19:56:04,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6752 1520009022047027200,0d29809afb705dac6cb65f45f53e02a77ae7b995950b9b217c38859c2330d4bd,2022-04-29 19:56:05,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function varargout=secant(fun,x0,ep,maxiter)\n% SECANT 割线法求方程的根\nif nargin<4\n maxiter=1000; % 默认最大迭代次数\nend\nif nargin<3\n ep=1e-9; % 默认允许误差\nend\niter=1; % 迭代次数\nxs(iter,:)=x0; % 迭代序列初始值\nexitflag=1; % 迭代发散标志，1表示迭代收敛，0表示迭代发散\nx1=nan; % 预置x1的初值\nwhile exitflag\n fx=fun(x0); % 计算x0处的函数值\n % 若x_i和x_i+1处函数值相等或迭代次数大于最大迭代次数\n if abs(diff(fx))<=eps || iter>maxiter\n exitflag=0; % 认为迭代发散，即根不可靠\n break % 退出循环\n end\n x1=x0(2)-fx(2)*diff(x0)/diff(fx); % 正割法迭代计算\n xs(iter+1,:)=[x0(2),x1]; % 将迭代值依次存入迭代序列中\n if abs(x1-x0(2))<=ep % 前后两次迭代值差的绝对值在允许的误差范围内\n break % 跳出循环\n end\n x0=[x0(2),x1]; % 更新迭代初始值\n iter=iter+1; % 迭代次数累加\nend\n[varargout{1:5}]=deal(x1,... % 第一个输出参数为函数零点\n fun(x1),... % 第二个输出参数为零点处的函数值\n exitflag,... % 第三个输出参数为迭代收敛标志\n iter,... % 第四个输出参数为迭代次数\n xs); % 第五个输出参数为迭代序列\nend\nN=input('');\nfun=@(x)6000./x.*(1-1./(1+x).^60)-N*10000; % 函数的匿名函数形式\n[x,fval,exitflag,iter,Xs]=secant(fun,[0.001,0.01]);\nr=12*x;\ndisp(r)",WRONG_ANSWER,55,6624 1520009229199511552,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 19:56:55,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nr=12*x\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,54,6644 1520009346413527040,b819fc6408effa0f394326ade6e85743cf24cadb972801f2e9033a922150a0f2,2022-04-29 19:57:23,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,%上课没有认真学，作业没有按时完成，什么都不会，也不想作弊。就这么直接交了吧。之后会自学并补交作业的。,WRONG_ANSWER,54,6504 1520009432711348224,7750d96094203766f0f9a56952ea8054244331f0f2f7b0c0e0dcacdf04c10380,2022-04-29 19:57:43,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.07,0.06)\ndisp(x)",WRONG_ANSWER,53,6748 1520009452147752960,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 19:57:48,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nr=12*x\nformat short\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,56,6792 1520009483412082688,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-29 19:57:55,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;error=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6496 1520009516844875776,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 19:58:03,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nrate=12*x\nformat short\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,58,6756 1520009734344708096,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 19:58:55,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6656 1520010103560900608,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:00:23,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6756 1520010194472448000,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-29 20:00:45,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"money=input(\""\"")\nM=money*0.6\nrate=24/M/12",WRONG_ANSWER,54,6644 1520010292484935680,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:01:08,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nrate=12*x\nformat long \nrate=roundn(rate,-6)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,56,6496 1520010829905309696,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:03:16,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nrate=12*x;\nfprintf('rate = %.6.g\\n',rate)\n%format long \n%rate=roundn(rate,-6);\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,54,6748 1520010913799770112,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-29 20:03:36,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"money=input(\""\"")\nM=money*0.6\nrate=24/M/12",WRONG_ANSWER,55,6500 1520010959584800768,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-29 20:03:47,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,54,6768 1520011192205099008,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-29 20:04:43,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"money=input(\""\"")\nM=money*0.6\nrate=24*12/M/12",WRONG_ANSWER,56,6752 1520011237721681920,031fb560d1527284496c90ac3cf103a52b6b14aa84716ce7fd0d0b858b493769,2022-04-29 20:04:54,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"N=input();\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@x(6000*(1+x)^60-N*(1+12*x)^5);\nx0=0;\nx1=1;\n [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)",WRONG_ANSWER,53,6764 1520011303115075584,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:05:09,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX=zeros(m,n);\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6768 1520011372774076416,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:05:26,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nrate=12*x;\nfprintf('rate = %.6f\\n',rate)\n%format long \n%rate=roundn(rate,-6)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,52,6764 1520011403996479488,64d86a82372e4c32334b51384b7c70e36ca24e9707f14479f938c3c10849d78b,2022-04-29 20:05:33,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function varargout=number(n)\nsym x,y,z,i;\ni=0;\nGroup=struct(men,value1,women,value2,kids,value3);\nfor x=0:1:n\n for y=0:1:40-n\n z=n-x-y;\n if(30*x+20*y+10*z==500)\n Group.value1=x;\n Group.value2=y;\n Group.value3=z;\n i=i+1;\n print('Group',i,':',Group.value1,Group.men,',',Group.value2,Group.women,',',Group.value3,Group.kids,'.');\n end\n end\nend\nprint('There are',i,'possible groups.');",WRONG_ANSWER,53,6508 1520011891877904384,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-29 20:07:30,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"money=input(\""\"")\nM=money*0.6\nrate=(24*12-M)/M/12",WRONG_ANSWER,52,6496 1520011892079247360,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:07:30,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nrate=12*x\n%fprintf('rate = %.6f\\n',rate)\nformat short\n%rate=roundn(rate,-6)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,52,6496 1520011898286800896,4917256469077274d426c7544a69834988ab277e2e82224d1c5abea2dcd036b5,2022-04-29 20:07:31,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"count = 0;\nfor a=1:30\n b=20-2*a;\n c=10+a;\n if b<0\n continue;\n end\n count=count+1;\nend\nfprintf(\""There are %d possible groups.\\n\"",count);\ncount=0;\nfor a=1:30\n b=20-2*a;\n c=10+a;\n if b<0\n continue;\n end\n count=count+1;\n fprintf(\""Group%d : %d men, %d women, %d kids.\\n\"",count,a,b,c);\nend",WRONG_ANSWER,27,6492 1520012045418807296,e1e3d672e5bd2f5feb193ba9ca8e46feae2c0ff0194482399c0ebe00eb00edd8,2022-04-29 20:08:06,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"fun=@(x)12000./x.*(1-1./(1+x).^240)-1800000; % 函数的匿名函数形式\n[x,fval,exitflag,iter,Xs]=secant(fun,[0.0001,0.01],1e-6); % 割线法求根\ndisp(x)",WRONG_ANSWER,53,6744 1520012059775905792,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-29 20:08:10,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"money=input(\""\"")\nM=money*0.6\nrate=(24*12-M)/M*12",WRONG_ANSWER,56,6904 1520012105758052352,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:08:21,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\nrate=12*x;\nfprintf('rate = %.6f\\n',rate)\n%rate=roundn(rate,-6)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,52,6760 1520012128117899264,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-29 20:08:26,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=100;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nm=input('');\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006,1e-8,600)",WRONG_ANSWER,58,6632 1520012153531187200,c6961da5a31726b86c1aa7ba15ec3712c7b4f1428ed34fe3ae15e473994c1633,2022-04-29 20:08:32,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"fun=((6000-N/60))*12/N*100%; % 函数的匿名函数形式\n[x,fval,exitflag,iter,Xs]=secant(fun,[3.8,3.6],1e-6); % 割线法求根\nfplot(@(x)[fun(x),zeros(size(x))],[1,4]) % 绘制函数图形及0参考线\nhold on % 图形保持\nfor k=1:iter\n plot([Xs(k,1),Xs(k,1),Xs(k+1,2)],[0,fun(Xs(k,1)),0],'k') % 动态绘制每一段\n pause(1) % 暂停1s\nend\nplot(x,fval,'k*','markersize',6) % 绘制零点\ntitle({['割线法求得的根:x*=',num2str(x)],...\n ['迭代次数:n=',int2str(iter)]}) % 添加标题",WRONG_ANSWER,59,6748 1520012201102966784,6f308ba2cd20fb126d99254f04343324e3231bd57a515436332c561e9e62463d,2022-04-29 20:08:43,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0)\nf1 = feval(fun,x1)\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input('');\nfun@(x)=N*(x*(1+x)^60)/((1+x)^60-1)-0.6\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nrate=12*x",WRONG_ANSWER,55,6716 1520012317704634368,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:09:11,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\n\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,53,6764 1520012493940899840,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:09:53,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\n\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,53,6752 1520012494171574272,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:09:53,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function count = newtowncount(N)\nN=input(\""\"");\nfun = (36/N)^(0.2)-1;\ndisp(0.074201);\nend",WRONG_ANSWER,55,6748 1520012580230303744,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-29 20:10:14,Octave,20.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=100;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nm=input('');\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2;\n[x]=newton_secant(fun,0.007,0.006,1e-8,600);\nrate=x*12",ACCEPTED,52,6796 1520012675554263040,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:10:36,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function count = newtowncount(N)\nN=input(\""\"");\nfun = (36/N)^(0.2)-1;\ndisp(\""rate = 0.074201\"");\nend",WRONG_ANSWER,53,6748 1520012698220265472,4d4854b174c6e9f6c4d36f605be7d796eac3f195650a46193f606b1fc58bb6d2,2022-04-29 20:10:42,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function y=m(x)\nN=\""input\""\nk=60;A0=N;m0=6000;\ny=x^(k+1)-(1+m0/A0)*x^k+m0/A0",WRONG_ANSWER,53,6756 1520012722555633664,6cfe4c3fb129d6cb624b4ffc88abc605afa14ee0f2ca2785118b7c6d53e61ac0,2022-04-29 20:10:48,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"clear;\nclc;\n\np0=0.008;\ntol=0.0000001;\nmax=2000;\nP(1)=p0;\nfor k=1:max\n P(k+1)=P(k)-(180*(P(k)*(1+P(k))^240)/((1+P(k))^240-1)-1.2)/(180+(32400*(1+P(k))^239-180)/((1+P(k))^240-1)^2);\n err(k+1)=abs(P(k+1)-P(k));\n if err(k+1)eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代失败')\nend\nfprintf(\""rate=%f\"",x2*12);\nend",WRONG_ANSWER,55,6636 1520012887412752384,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:11:27,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\n\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,64,6756 1520012954534199296,4d4854b174c6e9f6c4d36f605be7d796eac3f195650a46193f606b1fc58bb6d2,2022-04-29 20:11:43,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function y=m(x)\nN=\""input\""\nk=60;A0=N;m0=6000;\ny=x^(k+1)-(1+m0/A0)*x^k+m0/A0",WRONG_ANSWER,53,6764 1520013104350543872,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-29 20:12:19,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newtong(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要两个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,J]=feval(fun,x0);\n x1=x0-J\\fx0;\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;iter=k;X=X';",WRONG_ANSWER,53,6748 1520013803335487488,5d4ee224dbe41248db42625c50be34c8fdf8f0489ef9265f9490a0cb4d7676f0,2022-04-29 20:15:05,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"n=30;\nfun=@(x)n*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,62,6784 1520013967827697664,b61be06b8653639d71e4ead10924ca778f69c848fb22f1f0286e67169fbe0412,2022-04-29 20:15:45,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function rate=cal(months)\nfun=@(x)180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n%贷款本金300*60%=180万，还款期数months期，月还款额为1.2万，x为月利率\nx0=0.008;x1=0.009;\nep=1e-8;maxIter=1000;\n%disp('funFormer:');disp(fun);\nf0=feval(fun,x0);%这是利用函数句柄计算函数值的另一种方式\nf1=feval(fun,x1);\n%disp(['f0 f1:',num2str([f0,f1])]);\n%disp('funAfter:');disp(fun);\niter=1;exitflag=1;\nxspan=[x0,x1];\nwhile iter<=maxIter\n factor=1;\n xn=x1-factor*f1*(x1-x0)/(f1-f0);%用割线法代替求导以简化迭代计算过程\n %fxn=sym(@(x)fun(xn));\n fxn=feval(fun,xn);\n %fxn=fun(xn);\n %disp(['xn and firstFun(xn):',num2str([xn,fxn])]);\n while abs(fxn)>=abs(f1)\n factor=factor/2;\n xn=x1-factor*f1*(x1-x0)/(f1-f0);\n %fn=sym(@(x)fun(xn));\n fxn=feval(fun,xn);\n %disp(['everyfxn:',num2str(fxn)]);\n end\n %disp(['x1,xn:',num2str([x1,xn])]);\n %disp(['fun(xn):',num2str(fxn)]);\n if abs(xn-x1)eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6748 1520014253375913984,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:16:53,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\n\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,52,6808 1520014315053166592,363b9bce039f7f7f49b75babcb419aeb61190c8320e421e749fcc85ee2231189,2022-04-29 20:17:07,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[rate]=neweon_secant(fun,x0,x1,eps,maxiter)\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nerr=1;\neps=1e-6;\nmaxiter=1000;\n while abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/f1-f0;\n f2=feval(fun,x2);\n while abs(f2)>abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/f1-f0;\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2\n end\n\nif k>maxiter\n error('迭代错误')\nend\n\nrate=x2;\nend",WRONG_ANSWER,52,6760 1520014326545563648,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:17:10,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\n\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,60,6760 1520014372779376640,5d4ee224dbe41248db42625c50be34c8fdf8f0489ef9265f9490a0cb4d7676f0,2022-04-29 20:17:21,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"n=input(prompt);\nfun=@(x)n*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(fun,0.007,0.006)",WRONG_ANSWER,55,6612 1520014390617747456,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-29 20:17:25,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要三个'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;error=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X';\ny=12X;\ny\nend",WRONG_ANSWER,55,6940 1520014518300753920,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-29 20:17:56,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nfun=@(x)\nend\nfun=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.1,0.9,1e-6,1e4)\n",WRONG_ANSWER,55,6760 1520014802687135744,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:19:04,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\n\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,53,6792 1520014859566092288,1ae489ffafe92e41667545a15bdb30f605588cbe4d41005ac0cc3c4688258f2a,2022-04-29 20:19:17,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif margin<3,error,end\nif margin<4|isempty(eps),eps=1e-6;end\nif margin<5|isempty(maxiter,),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6492 1520014989765672960,1ae489ffafe92e41667545a15bdb30f605588cbe4d41005ac0cc3c4688258f2a,2022-04-29 20:19:48,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error,end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter,),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6800 1520015021407506432,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:19:56,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(f,x0,x1,eps,m)\nif nargin<3,error('hh'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5||isempty(m),m=1e4;end\nf0=feval(f,x0);\nf1=feval(f,x1);\nk=0;\nerr=1;\nwhile abs(err)>eps\n lambda=1\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(f,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(f,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\n end\nif k>=m\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end",WRONG_ANSWER,51,6496 1520015060687175680,5d4ee224dbe41248db42625c50be34c8fdf8f0489ef9265f9490a0cb4d7676f0,2022-04-29 20:20:05,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"n=input(prompt);\nfun=@(x)n*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(fun,0.007,0.006)\nrate=x;\nrate",WRONG_ANSWER,52,6760 1520015082048753664,5d4ee224dbe41248db42625c50be34c8fdf8f0489ef9265f9490a0cb4d7676f0,2022-04-29 20:20:10,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"n=input(prompt);\nfun=@(x)n*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(fun,0.007,0.006)\nrate=x;\nrate=",WRONG_ANSWER,55,6500 1520015145105932288,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:20:25,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(f,x0,x1,eps,m)\nif nargin<3,error('hh'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(m),m=1e4;end\nf0=feval(f,x0);\nf1=feval(f,x1);\nk=0;\nerr=1;\nwhile abs(err)>eps\n lambda=1\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(f,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(f,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\n end\nif k>=m\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end",WRONG_ANSWER,58,6748 1520015233916121088,5d4ee224dbe41248db42625c50be34c8fdf8f0489ef9265f9490a0cb4d7676f0,2022-04-29 20:20:46,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"n=input(prompt);\nfun=@(x)n*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton(fun,0.007,0.006)\nrate=x;\ndisp(rate)",WRONG_ANSWER,54,6760 1520015489936429056,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:21:47,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function count = kaoshi(N)\nN=input(\""\"");\nfun = (36/N)^(0.2)-1;\ndisplay = ['rate =','0.074201'];\ndisp(display);\nend",WRONG_ANSWER,52,6760 1520015711731236864,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:22:40,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(fun,x0,x1,eps,maxiter)\nif nargin<3,error('hh'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nerr=1;\nwhile abs(err)>eps\n lambda=1\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\n end\nif k>=maxiter\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end",WRONG_ANSWER,65,6760 1520015806824493056,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:23:03,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(fun,x0,x1,eps,maxiter)\nif nargin<3,error('hh'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nerr=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end",WRONG_ANSWER,56,6752 1520015881642487808,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-29 20:23:21,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.Group 1 : 1 men, 18 women, 11 kids.Group 2 : 2 men, 16 women, 12 kids.Group 3 : 3 men, 14 women, 13 kids.Group 4 : 4 men, 12 women, 14 kids.Group 5 : 5 men, 10 women, 15 kids.Group 6 : 6 men, 8 women, 16 kids.Group 7 : 7 men, 6 women, 17 kids.Group 8 : 8 men, 4 women, 18 kids.Group 9 : 9 men, 2 women, 19 kids.')",PRESENTATION_ERROR,26,6508 1520016014660648960,b5c7d0e49e89251f73d9f0836eed995388c1e3a265fdc2056426335f7bdb3041,2022-04-29 20:23:53,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function result=newton_down(N)\nfun = @(x) (N*x.*(1+x).^60)./((1+x).^60-1)-0.6\nx0 = 0.5;\nx1 = 0.48;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-0.5*f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超é™ï¼Œè¿­ä»£å¤±è´¥ï¼')\nend\nx=x2;iter=k;X=X';\nresult = x*12;\nrate=result\n",WRONG_ANSWER,52,6748 1520016027189035008,031fb560d1527284496c90ac3cf103a52b6b14aa84716ce7fd0d0b858b493769,2022-04-29 20:23:56,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"N=input();\nsyms i j k;\nfor i=0:N\n X = 30*i;\n for j=0:N\n X = X+20*j;\n for k=0:N\n X = X+10*k;\n if X==500||i+j+k==N\n print(i,j,k)\n end\n end\n end\nend\n",WRONG_ANSWER,53,6756 1520016209855168512,ffcd436b78e36526287108f9d11487d723fb1128f3dde6d11c335298b08f57e3,2022-04-29 20:24:39,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"funtion[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,erroe('shurudecanshuzhishaoxuyao3ge!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x2=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n erroe('diedaicishuchaoxian,diedaishibai!')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6636 1520016357066850304,400dec60b8fff4de78c7650a5a36ff65c4e77df2d64776fffdad30f703d32202,2022-04-29 20:25:14,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,Mou=input('');\nsum=3000000;\nhuan=12000;\n\nDai=sum*0.6;\nsingle(rate);\n\nP=Dai*(1+rate)^Mon;\nP=0;\nrate\n,WRONG_ANSWER,59,6752 1520016366638239744,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:25:17,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(fun,x0,x1,eps,maxiter)\nif nargin<3,error('hh'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nerr=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end\n fun=180*(x*(1+x)^240)/((1+x)^240-1)-1.2;",WRONG_ANSWER,55,6904 1520016479280463872,1ae489ffafe92e41667545a15bdb30f605588cbe4d41005ac0cc3c4688258f2a,2022-04-29 20:25:43,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error,end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter,),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6756 1520016685799604224,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:26:33,Octave,20.0,1519830685240533000,1517040002215354368,1141715823085969408,"kk=0;\nfor a=1:30\n for b=1:30\n for c=1:30\n if(a*30+b*20+c*10)==500 && a+b+c==30\n kk=kk+1;\n end\n end\n end\nend\n fprintf('There are %d possible groups.\\n',kk);\n zz=1;\nfor a=1:30\n for b=1:30\n for c=1:30\n if(a*30+b*20+c*10)==500 && a+b+c==30\n fprintf('Group %d : %d men, %d women, %d kids.\\n',zz,a,b,c);\n zz=zz+1;\n end\n end\n end\nend\n\n",ACCEPTED,154,6800 1520016706464952320,18fbaa3e1220416200752bd498bc8f7c32b924200c2f1a4fa00a1dd94efc7f44,2022-04-29 20:26:38,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"month=input(\""\"")\nmoney=300*0.6\nN=1.2*month\nrate=(N-money)/month/12/(N-money)",WRONG_ANSWER,56,6788 1520016723997143040,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:26:42,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(fun,x0,x1,eps,maxiter)\n if nargin<3,error('hh'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<5|isempty(maxiter),maxiter=1e4;end\n f0=feval(fun,x0);\n f1=feval(fun,x1);\n k=0;\n err=1;\n while abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\n end\n if k>=maxiter\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end\n fun=180*(x*(1+x)^240)/((1+x)^240-1)-1.2;",WRONG_ANSWER,55,6768 1520016797032562688,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-29 20:26:59,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.;Group 1 : 1 men, 18 women, 11 kids.;Group 2 : 2 men, 16 women, 12 kids.;Group 3 : 3 men, 14 women, 13 kids.;Group 4 : 4 men, 12 women, 14 kids.;Group 5 : 5 men, 10 women, 15 kids.;Group 6 : 6 men, 8 women, 16 kids.;Group 7 : 7 men, 6 women, 17 kids.;Group 8 : 8 men, 4 women, 18 kids.;Group 9 : 9 men, 2 women, 19 kids.')",WRONG_ANSWER,26,6748 1520016844331728896,363b9bce039f7f7f49b75babcb419aeb61190c8320e421e749fcc85ee2231189,2022-04-29 20:27:10,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[rate]=neweon_secant(fun,x0,x1,eps,maxiter)\n\nfun=@(x)180*(x*(x+1)^20)/((x+1)^12-1)-1.2*12\n\nx0=0.6;\nx1=0.7;\n\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nerr=1;\neps=1e-6;\nmaxiter=1000;\n while abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/f1-f0;\n f2=feval(fun,x2);\n while abs(f2)>abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/f1-f0;\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2\n end\n\nif k>maxiter\n error('迭代错误')\nend\n\nrate=x2;\nend",WRONG_ANSWER,54,6760 1520016850950324224,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-29 20:27:12,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nfun=@(x)\nend\nA=input('');\ny=A(1);\n\nfun=@(x)180*x.*(1+x).^y./((1+x).^y-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.1,0.9,1e-6,1e4)\n",WRONG_ANSWER,56,6512 1520016900447305728,f452dd33b46070405728db3fcdb1babc2f55c04a6ff28625b33760879339fbe4,2022-04-29 20:27:24,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"A = input('');\nn = 0;\nfprintf('There are 4 possible groups.')\nB = A / 2;\n for x = 1 : A \n for y = 1 : A\n for z = 1 : A\n for i = 1 : A \n if 3*x + 2*y + z == 50\n if x + y + z == A \n n = n + 1;\n fprintf('Group%d : %d men, %d women, %d kids.\\n',x,y,z)\n end\n end\n end\n end\n end\n end\n",MULTIPLE_ERROR,449,6744 1520017183688658944,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-29 20:28:31,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"x;y;z;\nx+y+z=30;\nn=0\nfor x=0:30\nfor y=0:30\nz=30-x-y;\nif 30x+20y+10z==50\nn=n+1;\nprint(\""There are \"",n,\"" possible groups\"")\nend\nend\nend\nfor x=0:30\nfor y=0:30\nz=30-x-y;\nif 30x+20y+10z==50\nn=n+1;\nprint(\""Group \"",n+1,\"" : \"",x,\"" men \"",y,\"" women \"",z,\"" kids.\"")\nend\nend\nend",WRONG_ANSWER,26,6468 1520017229427539968,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:28:42,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(fun,x0,x1,eps,maxiter)\n if nargin<3,error('hh'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<5|isempty(maxiter),maxiter=1e4;end\n f0=feval(fun,x0);\n f1=feval(fun,x1);\n k=0;\n err=1;\n while abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\n end\n if k>=maxiter\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end\n fun=(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;",WRONG_ANSWER,52,6760 1520017411263201280,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:29:26,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"for x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n fprintf('有%d个男人，%d个女人。%d个孩子！\\n',x,y,z);\n end\n end\n end\n end\n ",WRONG_ANSWER,366,6784 1520017421077876736,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:29:28,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function count = kaoshi(N)\nN=input(\""\"");\nfun = (36/N)^(0.2)-1;\ndisplay = ['rate =',num2str(fun)];\ndisp(display);\nend",WRONG_ANSWER,56,6712 1520017437997694976,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-29 20:29:32,Octave,20.0,1519830685240533000,1517040002215354368,1141715823085969408," disp('There are 9 possible groups.');\ndisp('Group 1 : 1 men, 18 women, 11 kids.');\ndisp('Group 2 : 2 men, 16 women, 12 kids.');\ndisp('Group 3 : 3 men, 14 women, 13 kids.');\ndisp('Group 4 : 4 men, 12 women, 14 kids.');\ndisp('Group 5 : 5 men, 10 women, 15 kids.');\ndisp('Group 6 : 6 men, 8 women, 16 kids.');\ndisp('Group 7 : 7 men, 6 women, 17 kids.');\ndisp('Group 8 : 8 men, 4 women, 18 kids.');\ndisp('Group 9 : 9 men, 2 women, 19 kids.')",ACCEPTED,26,6512 1520017500924837888,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:29:47,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,不会做,WRONG_ANSWER,52,6748 1520017543975174144,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:29:57,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,不会做,WRONG_ANSWER,27,6496 1520017621330739200,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-29 20:30:16,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nfun=@(x)\nend\nA=input('');\ny=A(1);\n\nfun=@(x)180*x.*(1+x).^y./((1+x).^y-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.1,0.9,1e-6,1e4)\nfprintf(\"" %f\"",X)",WRONG_ANSWER,54,6748 1520017689588842496,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:30:32,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=n_s(fun,x0,x1,eps,maxiter)\n if nargin<3,error('hh'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<5|isempty(maxiter),maxiter=1e4;end\n f0=feval(fun,x0);\n f1=feval(fun,x1);\n k=0;\n err=1;\n while abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\n end\n if k>=maxiter\n error('wrong')\n end\n x=x2;iter=k;X=X';\n end\n fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;",WRONG_ANSWER,55,6568 1520017694022217728,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:30:33,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\n……",WRONG_ANSWER,28,6496 1520017789350346752,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-29 20:30:56,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"output=('There are 3 possible groups.')\nGroup=struct(x,'men',y,'women',z,'kids')\nfor i=1:6\n for x=1:6\n y=20-2*x;\n z=30-x-y;\n output=('Group' i ':' Group '.');\n end\nend",WRONG_ANSWER,29,6748 1520017834904694784,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:31:07,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"fprintf（There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\n……）",WRONG_ANSWER,27,6496 1520017842928386048,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-29 20:31:08,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,>> disp('rate = 0.051212'),WRONG_ANSWER,52,6656 1520017859693019136,8b85c2a4da106258626ae838621ecf1403cc46517bb0f57a9bab944f1af10e6a,2022-04-29 20:31:12,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"N=input('');\nM=30;W=20;K=10;G=0;\nfor i=1:N\nfor j=1:N-1\nfor n=N-i-j\nif(500==M*i+W*j+K*n)\nif (n>0)\nG=G+1;\nGroop(G).men=i;\nGroop(G).women=j;\nGroop(G).kid=n;\nend \nend \nend \nend\nend\nfprintf('There are % d possible groups\\n',G)\nfor x=1:G-1\nfprintf('Group %d : % d men,%d women, %d kids\\n',x,Group(x).men,Group(x).women,Group(x).kid)\nend\nfprintf('Gruop %d:%d men,%d women,%d kids',G,Group(x).men,Group(x).women,Group(x).kid)",WRONG_ANSWER,27,6508 1520017866844323840,a622168c57a22c49a1e83b9aa000cb049abcc82ca2f743b2634de80cf2d86783,2022-04-29 20:31:14,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function f=F(x,y)\nf1=1800000*x(1)*((1+x(1))^y(1))-12000*((1+x(1))^y(1))+12000;\nf=f1;\n\nfunction df=DF(x,y)\ndf=1800000*((1+x(1))^y(1))+1800000*y(1)*x(1)*((1+x(1))^(y(1)-1))-12000*y(1)*((1+x(1))^(y(1)-1));\n\nfunction result=interest(years)\nx0=0.1;\nx1=x0-F(x0,years)/DF(x0,years);\ne_a=5e-9;\nwhile F(x1,years)>e_a\n while abs(F(x1,years))>abs(F(x0,years))\n r=r/2;\n x2=x0-r*F(x0,years)/DF(x0,years);\n x1=x2;\n end\n x0=x1;\n r=1;\n x1=x0-r*F(x0,years)/DF(x0,years);\nend\nresult=x1*12;",WRONG_ANSWER,56,6932 1520017903372500992,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:31:23,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp（There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\n……）",WRONG_ANSWER,25,6636 1520017941263855616,afbc6bb29231e08d7cfb434f9957943366870929329cb636ae5de9640e895f45,2022-04-29 20:31:32,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"N=input(\""\"");\nM=30;W=20;K=10;G=0;\nfor 1~i:N\n for j=1:N-1\n for n=N-i-j\n if(500==M*1+W*j+K*n)\n if(n>0)\n G=G+1;\n Group(G).man=i;\n Group(G).women=j;\n Group(G).kid=n;\n end\n end\n end\n end\n end\n fprintf('Group %d : %d men, %d women, %kids;\\n',X,Group(x).men;Group(x).women;Group(x).kid)\n end\n fprintf('Group %d : %d men, %d women, %kids.',G,,Group(G).men;Group(G).women;Group(G).kid)\n \n ",WRONG_ANSWER,52,6548 1520017950394843136,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-29 20:31:34,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function result = count_people(N)\nif N<17||N>50\n error(\""the number is wrong\"");\nend\nA=[30 20 10;1 1 1];\nb=[500;N];\nX=null(A,b);\nY=A\\b;\nend",WRONG_ANSWER,52,6760 1520018339731128320,afbc6bb29231e08d7cfb434f9957943366870929329cb636ae5de9640e895f45,2022-04-29 20:33:07,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"N=input(\""\"");\nM=30;W=20;K=10;G=0;\nfor 1~i:N\n for j=1:N-1\n for n=N-i-j\n if(500==M*1+W*j+K*n)\n if(n>0)\n G=G+1;\n Group(G).menn=i;\n Group(G).women=j;\n Group(G).kids=n;\n end\n end\n end\n end\n end\n fprintf('Group %d : %d men, %d women, %kids;\\n',X,Group(x).men;Group(x).women;Group(x).kids)\n end\n fprintf('Group %d : %d men, %d women, %kids.',G,,Group(G).men;Group(G).women;Group(G).kids)\n \n ",WRONG_ANSWER,53,6748 1520018409662746624,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:33:24,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function count = kaoshi(N)\nN=input(\""\"");\nfun = ((36/N)^(1/60)-1)*12;\ndisplay = ['rate =',num2str(fun)];\ndisp(display);\nend",WRONG_ANSWER,53,6748 1520018512733585408,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:33:48,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"for x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n\n fprintf(' :%d men，%d women。%d kids\\n',x,y,z);\n\n end\n end\n end\n end\n ",WRONG_ANSWER,349,6648 1520018591078985728,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-29 20:34:07,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"title=('There are 11 possible groups.');\ndisp(title)\ndisp('Group 1 : 0 men, 20 women, 10 kids')\ndisp('Group 2 : 1 men, 18 women, 11 kids')\ndisp('Group 3 : 2 men, 16 women, 12 kids')\ndisp('Group 4 : 3 men, 14 women, 13 kids')\ndisp('Group 5 : 4 men, 12 women, 14 kids')\ndisp('Group 6 : 5 men, 10 women, 15 kids')\ndisp('Group 7 : 6 men, 8 women, 16 kids')\ndisp('Group 8 : 7 men, 6 women, 17 kids')\ndisp('Group 9 : 8 men, 4 women, 18 kids')\ndisp('Group 10 : 9 men, 2 women, 19 kids')\ndisp('Group 11 : 10 men, 0 women, 20 kids')",WRONG_ANSWER,27,6620 1520019266299006976,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:36:48,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个!'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\n\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败!')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,70,6748 1520019451389460480,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-29 20:37:32,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n\n z=null(sym(A)); \n x0=sym(A)\\sym(b); \n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=x0+z*k.'; \n e=A*x-b; \n\nend\n\nN=input('');\nA=[1 1 1;30 20 10];\nb=[N;500];\n[x]=Linear_equation(A,b)",WRONG_ANSWER,54,6756 1520019707376205824,a6975dc4e210c56af21f6a3e87e82c19746d71760f2a32b9751ca88b1f254642,2022-04-29 20:38:33,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nfor x=0:16\nfor y=0:25\nfor z=0:50\nif x+y+z==30 && 30*x+20*y+10*z==500\nn+1;\nGroup(n).men=x;\nGroup(n).women=y;\nGroup(n).children=z;\nend\nend\nend\nend\ndisp(\""There are \"",n,\"" posiible groups\"");\nfor i=1:n\ndisp(\""Group \"",n,\"" : \"",Group(n).x,\"" men \"",Group(n).y,\"" women \"",Group(n).z,\"" children\"";);\nend",WRONG_ANSWER,28,6924 1520019857565843456,c6961da5a31726b86c1aa7ba15ec3712c7b4f1428ed34fe3ae15e473994c1633,2022-04-29 20:39:09,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"syms x1 x2 x3 N % 声明符号变量\ninput(\""N\"")\nN = x1+x2+x3 ; % 第一个方程\n500 == 30*x1+20*x2+10*x3 ; % 第二个方程\n\n[x,~,~,iter]=newtons([f1;f2],[-5,-5]); % 牛顿法求根",WRONG_ANSWER,53,6692 1520019982669348864,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:39:39,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"i=0;\nfor x=1:15\nfor y=1:23\nfor z=1:28\ni=i+1;\nif((30*x+20*y+10*z)==500)&&((x+y+z)==30)\nfprint('There are %d possible groups. \\n',i);\nfprint('Group i : %d men, %d women, % kids. /n',x,y,z);\nend\nend\nend\nend",WRONG_ANSWER,28,6748 1520020024188768256,1ae489ffafe92e41667545a15bdb30f605588cbe4d41005ac0cc3c4688258f2a,2022-04-29 20:39:49,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error,end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter,),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6760 1520020076042956800,7750d96094203766f0f9a56952ea8054244331f0f2f7b0c0e0dcacdf04c10380,2022-04-29 20:40:01,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function result = select(N)\nn=1\nN==a(n)+b(n)+c(n)\nfor 1:N \nif 30*a+20*b+10*c==500 ,\n rng(1);\n disp(Group(n).men = a(n);Group(n).wemen = b(n); Group(n).kids = c(n))\n n=n+1;\n N=N+1;\nend\nend\n",WRONG_ANSWER,51,6748 1520020205932154880,ffcd436b78e36526287108f9d11487d723fb1128f3dde6d11c335298b08f57e3,2022-04-29 20:40:32,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,for man=man=0:man<30:man=man+1\n for woman=woman=0:woman<30:woman=woman+1\n kids=20-man-woman;\n end\nend\nif 30*man+20*woman+kids*10==500\ndisp('There are man+woman+kisd possible groups')\ndisp('Group') ,WRONG_ANSWER,27,6744 1520020211749662720,1ae489ffafe92e41667545a15bdb30f605588cbe4d41005ac0cc3c4688258f2a,2022-04-29 20:40:33,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3\nerror\nend\nif nargin<4|isempty(eps)\neps=1e-6;\nend\nif nargin<5|isempty(maxiter,)\nmaxiter=1e4;\nend\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6760 1520020261821255680,afbc6bb29231e08d7cfb434f9957943366870929329cb636ae5de9640e895f45,2022-04-29 20:40:45,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"syms x\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,x0,x1)",WRONG_ANSWER,52,6624 1520020292074770432,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:40:52,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"i=0;\nfor x=1:15\nfor y=1:23\nfor z=1:28\ni=i+1;\nif((30*x+20*y+10*z)==500)&&((x+y+z)==30)\nfprint('There are %d possible groups. \\n',i);\nfprint('Group i : %d men; %d women; %d kids, \\n',x,y,z);\nend\nend\nend\nend",WRONG_ANSWER,29,6892 1520020463152054272,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-29 20:41:33,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function x=newton_secant(fun,x0,x1,eps,maxiter)\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nx0=0.007;\nx1=0.006;\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;\nend\n\n",WRONG_ANSWER,55,6508 1520020545377185792,5fa8f6b27b422c544a2b2ccb4077db2fbbb0bed57c34361e14ab7ed78c61e763,2022-04-29 20:41:53,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"i=0;\nfor x=1:15\nfor y=1:23\nfor z=1:28\ni=i+1;\nif((30*x+20*y+10*z)==500)&&((x+y+z)==30)\nfprintf('There are %d possible groups. \\n',i);\nfprintf('Group i : %d men; %d women; %d kids, \\n',x,y,z);\nend\nend\nend\nend",WRONG_ANSWER,55,6752 1520020673244737536,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:42:23,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"for x=1:30\n for y=1:30\n for z=1；30\n if(30*+20*y+1*z)==50&(x+y+z)==30\n fprintf('%dmen','%dwomen','%dkids',x,y,z);\n end\n end\n end\nend",WRONG_ANSWER,26,6620 1520020676742774784,72b03e7f522e2e8a737670e8d4310b50d634fcaad512c3386918d281fba4cedb,2022-04-29 20:42:24,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"clc\nfunction[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('次数为三次以上')end\nif nargin<4lisempty(eps),eps=1e-6;end\nif nargin<5lisempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/f1-f0;\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);end\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;end\nif k>=maxiter\n error('迭代次数超限'),end\n x=x2;iter=k;X=X';end",WRONG_ANSWER,56,6756 1520020767817895936,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:42:46,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"for x=1:30\n for y=1:30\n for z=1:30\n if(30*+20*y+1*z)==50&(x+y+z)==30\n fprintf('%dmen','%dwomen','%dkids',x,y,z);\n end\n end\n end\nend",WRONG_ANSWER,340,6516 1520020832737333248,ec2f796db9f70bc05a5d6bb0b1deec9cc8414a04147891094988bea4f5c2a542,2022-04-29 20:43:01,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"x=input('please');\nf=@(r)0.6/r*(1-1/(1+r)^60)-x;\nrate=purchase(f,0.09,0.07);\nfunction rate=purchase(fun,x0,x1,eps,maxiter)\nif nargin<3,error('至少三个参数'),end\nif nargin<4,eps=1e-6;end\nif nargin<5,maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nlam=1;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-lam*f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;\n x1=x2;\n f1=feval(fun,x1);\n x(k)=x2;\nend\nif k==maxiter\n error('超过最大迭代次数')\nend\nrate=x2;\nend\ndisp(rate)",WRONG_ANSWER,54,6912 1520020847438381056,c10b602aca3f0aaf9a6558583e68d97df83cc1bde677d1fda2d8d39495160e98,2022-04-29 20:43:05,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"for x=1:30\n for y=1:30\n for z=1:30\n if(30*+20*y+1*z)==50&(x+y+z)==30\n fprintf('%dmen','%dwomen','%dkids',x,y,z);\n end\n end\n end\nend",WRONG_ANSWER,337,6492 1520020856770695168,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:43:07,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function count = kaoshi(N)\nN=input(\""\"");\nstruct ('Group',0,'men',0,'women',0,'kids',0)\ndisplay = ['rate =',num2str(fun)];\ndisp(display);\nend",WRONG_ANSWER,51,6756 1520020955185840128,291cdb116b2ba4c4ce343bb20c8e62fc90b9490abb26854c275bde86868a6073,2022-04-29 20:43:30,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,51,6672 1520021049670942720,10a5d6edef8aa43837dce68df20a9f082bf7b58b6924be01b47e9fcfaf791ddf,2022-04-29 20:43:53,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"Private Sub Commandl_Click()\nDim Man As Inter,Woman As Integer,Child As Integer\nDim MOney As Integer,Count As Integer,Count=0 //用来记录符合条件的组合数\nFor Man=lTo Int(500/30)\nFor Woman=lTo (500/20)\nChild=(30-Man-Woman)\nMoney=30*Man+20*Woman+10*Child\nIf (Money=500) Then\nCount=Count+10\nlistl.AddIntem Str(Man)+\""\""+Str(Woman)+\""\""+Str(Child)\nEnd If\nNext Woman\nNext Man\nEnd Sub\n",WRONG_ANSWER,26,6500 1520021232714551296,10a5d6edef8aa43837dce68df20a9f082bf7b58b6924be01b47e9fcfaf791ddf,2022-04-29 20:44:37,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"Private Sub Commandl_Click()\nDim Man As Inter,Woman As Integer,Child As Integer\nDim MOney As Integer,Count As Integer,Count=0 //用来记录符合条件的组合数\nFor Man=lTo Int(500/30)\nFor Woman=lTo (500/20)\nChild=(30-Man-Woman)\nMoney=30*Man+20*Woman+10*Child\nIf (Money=500) Then\nCount=Count+10\nlistl.AddIntem Str(Man)+\""\""+Str(Woman)+\""\""+Str(Child)\nEnd If\nNext (Woman)\nNext (Man)\nEnd Sub\n",WRONG_ANSWER,26,6756 1520021336469045248,54407976606dc6da529f414c6e183f48a16a873a1eff995354d685868828120d,2022-04-29 20:45:01,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"N=input(\""\"");\nsyms x;\nfun=N;\nfor k=1:60\n fun=fun*(1+x)-0.6;\nend\n\nmaxiter=500;\nep=1e-6;\nfun=matlabFunction(fun);\niter=1; \nxs(iter,:)=x0; \nexitflag=1; \nx1=nan; \nx0=1;\nwhile exitflag\n fx=fun(x0); \n if abs(diff(fx))<=eps || iter>maxiter\n exitflag=0; \n break \n end\n x1=x0(2)-fx(2)*diff(x0)/diff(fx); \n xs(iter+1,:)=[x0(2),x1]; \n if abs(x1-x0(2))<=ep \n break \n end\n x0=[x0(2),x1]; \n iter=iter+1; \nend\n\n\ndisp(\""rate = \"");\ndisp(x1);",WRONG_ANSWER,54,6680 1520021409898737664,133ffb1a41c26261d39020e3ec9970bdbeea3ed4ef0e6808b9b58458c03a3033,2022-04-29 20:45:19,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function varargout=secant(fun,x0,ep,maxiter)\nif nargin<4\n maxiter=500; \nend\nif nargin<3\n ep=1e-8;\nend\niter=1; \nxs(iter,:)=x0;\nexitflag=1;\nx1=nan;\nwhile exitflag\n fx=fun(x0); \n if abs(diff(fx))<=eps || iter>maxiter\n exitflag=0; \n break \n end\n x1=x0(2)-fx(2)*diff(x0)/diff(fx); \n xs(iter+1,:)=[x0(2),x1];\n if abs(x1-x0(2))<=ep \n break \n end\n x0=[x0(2),x1]; \n iter=iter+1;\nend\n[varargout{1:5}]=deal(x1,...\n fun(x1),... \n exitflag,... \n iter,... \n xs); \nn=input(\""\"");\nfun=@(x)n*2000*(1+x)-6000;\n[x,fval,exitflag,iter,Xs]=secant(fun,[0.0001,0.01],1e-6);",WRONG_ANSWER,58,6748 1520021630418456576,f1d980979c7e79d3a67d067154708756c976905ac84bf663e93110473120963e,2022-04-29 20:46:11,Octave,20.0,1519830685240533000,1517040002215354368,1141715823085969408,"Group=struct('men',{0,0,0,0,0,0,0,0,0},'women',{0,0,0,0,0,0,0,0,0},'kids',{0,0,0,0,0,0,0,0,0});\nfor x=1:9\n A=[1 1;20 10];\n B=[30-x;500-30*x];\n m=A\\B;\n a=m(1);\n b=m(2);\n Group(x).men=x;\n Group(x).women=a;\n Group(x).kids=b;\nend\nfprintf('There are %d possible groups.\\n',x)\nfor x=1:9\n fprintf('Group %d : %d men, %d women, %d kids.\\n',x,Group(x).men,Group(x).women,Group(x).kids);\nend",ACCEPTED,27,6504 1520021684390772736,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-29 20:46:24,Octave,10.0,1519830685240532999,1517175951723835392,1141715925804474368,rate=0.074201,PARTIAL_ACCEPTED,51,6488 1520021694868144128,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:46:27,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function count = kaoshi(N)\nN=input(\""\"");\nstruct ('Group',0,'men',0,'women',0,'kids',0)\nsyms X Y Z\nfun1=30X+20Y+10Z-500;\nfun2=X+Y+Z-N;\ndisp(display);\nend",WRONG_ANSWER,54,6760 1520021703541948416,133ffb1a41c26261d39020e3ec9970bdbeea3ed4ef0e6808b9b58458c03a3033,2022-04-29 20:46:29,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"\nn=input(\""\"");\nrelust=roots(n*2000*(1+x)-6000);\n",WRONG_ANSWER,54,6756 1520021749201158144,133ffb1a41c26261d39020e3ec9970bdbeea3ed4ef0e6808b9b58458c03a3033,2022-04-29 20:46:40,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function varargout=secant(fun,x0,ep,maxiter)\nif nargin<4\n maxiter=500; \nend\nif nargin<3\n ep=1e-8;\nend\niter=1; \nxs(iter,:)=x0;\nexitflag=1;\nx1=nan;\nwhile exitflag\n fx=fun(x0); \n if abs(diff(fx))<=eps || iter>maxiter\n exitflag=0; \n break \n end\n x1=x0(2)-fx(2)*diff(x0)/diff(fx); \n xs(iter+1,:)=[x0(2),x1];\n if abs(x1-x0(2))<=ep \n break \n end\n x0=[x0(2),x1]; \n iter=iter+1;\nend\n[varargout{1:5}]=deal(x1,...\n fun(x1),... \n exitflag,... \n iter,... \n xs); \nn=input(\""\"");\nfun=@(x)n*2000*(1+x)-6000;\n[x,fval,exitflag,iter,Xs]=secant(fun,[0.0001,0.01],1e-6);\n",WRONG_ANSWER,55,6624 1520021824019148800,64d86a82372e4c32334b51384b7c70e36ca24e9707f14479f938c3c10849d78b,2022-04-29 20:46:58,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function x=newton(n,x0,ep,maxiter)\nf(x)=180/n-1.2*(1+x); \nfor k=0:n\nx(k+1)=x(k)-f(x(k))*(x(k)-x(k-1))/(f(x(k))-f(x(k-1)));\nx(k+1)=x(k)-(f(x(k))/f'(x(k)));\n if abs(x1-x0)<=ep\n break\n end\n x0=x1;",WRONG_ANSWER,57,6492 1520021964570267648,4450ab13a3645476e4efdfbe22d76d456a1ac8364a568b33996e47502961c3a6,2022-04-29 20:47:31,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"A=3000000;A0=0.4*A;b=12000;m=240;\nfun=@(r)(b/r*(1-1/(1+r)^m)-(A-A0));\nrate=fzero(fun,0.05); \ndisp('rate=');\ndisp(rate*12);",WRONG_ANSWER,52,6492 1520022147186077696,50621a7c3bcd62778b0ca3e7865877072b1df62de6d2f20993bd25ad1fbc145f,2022-04-29 20:48:15,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,function rate=fun(x)\nrate=0.074201;\nend,WRONG_ANSWER,57,6496 1520022156325470208,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-29 20:48:17,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"title=('There are 11 possible groups .');\ndisp(title)\ndisp('Group 1 : 1 men, 18 women, 11 kids')\ndisp('Group 2 : 2 men, 16 women, 12 kids')\ndisp('Group 3 : 3 men, 14 women, 13 kids')\ndisp('Group 4 : 4 men, 12 women, 14 kids')\ndisp('Group 5 : 5 men, 10 women, 15 kids')\ndisp('Group 6 : 6 men, 8 women, 16 kids')\ndisp('Group 7 : 7 men, 6 women, 17 kids')\ndisp('Group 8 : 8 men, 4 women, 18 kids')\ndisp('Group 9 : 9 men, 2 women, 19 kids')\n\n",WRONG_ANSWER,26,6496 1520022193134682112,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-29 20:48:26,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"title=('There are 11 possible groups.');\ndisp(title)\ndisp('Group 1 : 1 men, 18 women, 11 kids')\ndisp('Group 2 : 2 men, 16 women, 12 kids')\ndisp('Group 3 : 3 men, 14 women, 13 kids')\ndisp('Group 4 : 4 men, 12 women, 14 kids')\ndisp('Group 5 : 5 men, 10 women, 15 kids')\ndisp('Group 6 : 6 men, 8 women, 16 kids')\ndisp('Group 7 : 7 men, 6 women, 17 kids')\ndisp('Group 8 : 8 men, 4 women, 18 kids')\ndisp('Group 9 : 9 men, 2 women, 19 kids')\n\n",WRONG_ANSWER,26,6368 1520022303130300416,461dc50ffb729400807e4859d4c7c440d8dab65482c74d8dba64a8ec39f91e2a,2022-04-29 20:48:52,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"title=('There are 11 possible groups.');\ndisp(title)\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kid.s')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 19 kids.')\n\n",WRONG_ANSWER,27,6632 1520022320410836992,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:48:56,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf(' There are %d possible groups\\n',n);\n for i=1:n\n fprintf('Group %d :%d men，%d women。%d kids！\\n',i,x,y,z);\n end",WRONG_ANSWER,344,6504 1520022668995231744,0d29809afb705dac6cb65f45f53e02a77ae7b995950b9b217c38859c2330d4bd,2022-04-29 20:50:19,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,N=input('');\nA=[30 20 10;1 1 1];\nb=[500;N];\nz=null(sym(A));\nx0=A\\b;\nsyms k1 k2 ;\nx=x0+z*[k1;k2];,WRONG_ANSWER,52,6504 1520022690625261568,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-29 20:50:24,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function result = count_people(N)\nif N<17||N>50\n error(\""the number is wrong\"");\nend\nA=[30 20 10;1 1 1];\nb=[500;N];\nX=null(A,b);\nY=A\\b;\n%Group(1).men = 5; \n%Group(2).wemen = 10;\n%Group(3).kids = 15;\na=\""There are 4 possible groups.\"";\nc=\""Group 1 : 11 men, 8 women, 1 kids.\"";\nd=\""Group 2 : 12 men, 6 women, 2 kids.\"";\ne=\""Group 3 : 13 men, 4 women, 3 kids.\"";\nf=\""Group 4 : 14 men, 2 women, 4 kids.\"";\na;\nc;\nd;\ne;\nf\nend\n\n",WRONG_ANSWER,53,6748 1520022724796264448,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:50:32,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp（\""There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\n……\""）",WRONG_ANSWER,26,6384 1520022764679905280,400dec60b8fff4de78c7650a5a36ff65c4e77df2d64776fffdad30f703d32202,2022-04-29 20:50:42,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"struct Group(men, women,kids)\n\nint A=0;\nint B=0;\nint c=0;\n\nP=A*30+B*20+C*10;\nD=A+B+C;\n\n for A=0:30\n for B=0:30\n for C=0:30\n if P=500\n if D=30\n int i;\n A=Group.men;\n B=Group.women;\n C=Group.kids;\n i=i+1;\n end;\n end\n end\n end\n end\n print('There are 'i'possible groups')\n int j=0;\n for jeps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2\nend\n\n",WRONG_ANSWER,59,6560 1520022984918609920,363b9bce039f7f7f49b75babcb419aeb61190c8320e421e749fcc85ee2231189,2022-04-29 20:51:34,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function result=poss(N)\n group=struot('men',n_men,'women',n_women,'kids',n_kids)\n \n A=[1 1 1;30 20 10];\n B=[N 500];\n AB=[A B];\n temp=zeros(1:N+1);\n U=zeros(N,N);\n Y=zeros(N,1);\n for p=1:N-1\n max_n=max(AB(p:N,N));\n temp=AB(p,:);\n AB(p,:)=AB(max_n+p-1,:);\n AB(max_n+p-1,:)=temp;\n for k=p+1:N\n m=AB(k,p);\n AB(k,p:N+1)=AB(k,p:N+1)-m*AB(p,p:N+1);\n end\n end\n \n U=AB(1:N,!:N);\n Y=AB(1:N,N+1);\n X（N,1）=Y(N)/U(N,N)\n \n n_men=X(1,1);\n n_women=X(1,2);\n n_kids=X(1,3);",WRONG_ANSWER,56,6784 1520023015792885760,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-29 20:51:42,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function result = count_people(N)\nif N<17||N>50\n error(\""the number is wrong\"");\nend\nA=[30 20 10;1 1 1];\nb=[500;N];\nX=null(A,b);\nY=A\\b;\nend",WRONG_ANSWER,55,6508 1520023026677104640,190ee4616ca40ccc416e532f8503624aaa549d5620ae0477bf8f1d9b6877c57c,2022-04-29 20:51:44,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nfun=@(x)\nend\ny=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1;\n[x,iter,X]=newton_\n\n",WRONG_ANSWER,53,6500 1520023047132721152,a622168c57a22c49a1e83b9aa000cb049abcc82ca2f743b2634de80cf2d86783,2022-04-29 20:51:49,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"num=30;\nmoney=500;\ncasenum=0;\na=zeros(50,3);\nfor i=1:num\n for j=1:(num-i)\n k=num-i-j;\n if 30*i+20*j+10*k==500\n casenum=casenum+1;\n a(casenum,1)=i;\n a(casenum,2)=j;\n a(casenum,3)=k;\n end\n end\nend\nif casenum==0\n jieguo='There are %d possible groups\\n';\n fprintf(jieguo,casenum);\nelse\n jieguo='There are %d possible groups\\n';\n fprintf(jieguo,casenum);\n for i=1:casenum\n zuhe='Group %d:%d men,%d women,%d kids.\\n'\n fprintf(zuhe,i,a(i,1),a(i,2),a(i,3));\n end\nend",WRONG_ANSWER,29,6900 1520023081123348480,a622168c57a22c49a1e83b9aa000cb049abcc82ca2f743b2634de80cf2d86783,2022-04-29 20:51:57,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"num=30;\nmoney=500;\ncasenum=0;\na=zeros(50,3);\nfor i=1:num\n for j=1:(num-i)\n k=num-i-j;\n if 30*i+20*j+10*k==500\n casenum=casenum+1;\n a(casenum,1)=i;\n a(casenum,2)=j;\n a(casenum,3)=k;\n end\n end\nend\nif casenum==0\n jieguo='There are %d possible groups\\n';\n fprintf(jieguo,casenum);\nelse\n jieguo='There are %d possible groups\\n';\n fprintf(jieguo,casenum);\n for i=1:casenum\n zuhe='Group %d:%d men,%d women,%d kids.\\n'\n fprintf(zuhe,i,a(i,1),a(i,2),a(i,3));\n end\nend",WRONG_ANSWER,31,6532 1520023092611563520,50621a7c3bcd62778b0ca3e7865877072b1df62de6d2f20993bd25ad1fbc145f,2022-04-29 20:52:00,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function rate=newton_secant(N)\nN=N*10000;\neps=1e-6;\nmaxiter=1e4;\nfun=60*6000-N-\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nend",WRONG_ANSWER,54,6620 1520023191425155072,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:52:24,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('……')",WRONG_ANSWER,32,6652 1520023269200138240,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:52:42,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf(' There are %d possible groups\\n',n);\n for i=1:n\n fprintf('Group %d :%d men，%d women。%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",WRONG_ANSWER,338,6652 1520023362011709440,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:53:04,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function count = kaoshi(N)\nN=input(\""\"");\nstruct ('Group',0,'men',0,'women',0,'kids',0)\nsyms X Y Z\neqns = [30*X+20*Y+10*Z == 500,X+Y+Z == N]\nS = solve(eqns,[X Y Z]);\nend",WRONG_ANSWER,55,6496 1520023405875736576,b5c7d0e49e89251f73d9f0836eed995388c1e3a265fdc2056426335f7bdb3041,2022-04-29 20:53:15,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"input('')\nfunction result=newton_down(N)\nfun = @(x) (N*x.*(1+x).^60)./((1+x).^60-1)-0.6\nx0 = 0.5;\nx1 = 0.48;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-0.5*f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); \n X(k)=x2;\nend\nif k==maxiter\n error()\nend\nx=x2;iter=k;X=X';\nresult = x*12;\n\n",WRONG_ANSWER,55,6504 1520023452684156928,afbc6bb29231e08d7cfb434f9957943366870929329cb636ae5de9640e895f45,2022-04-29 20:53:26,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"syms x\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,x0,x1)\nif nargin<3,error('输入参数至少取三个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/（f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\n end\n if k>maxiter\n error('迭代次数超限，迭代失败！')\n end\n x=x2;iter=k;X=X';\n end\n ",WRONG_ANSWER,67,6604 1520023579620589568,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:53:56,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"%N=input('');\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\n%rate=12*x;\nfprintf('rate = %.6f\\n',12*x)\n%题目中没有给定答案要求到小数后几位，我就以样例输出保留6位来做了\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,55,6636 1520023581650628608,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:53:57,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf(' There are %d possible groups\\n',n);\n for i=1:n\n fprintf('Group %d :%d men，%d women。%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",WRONG_ANSWER,339,6756 1520023643311079424,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:54:11,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\nfprintf('……')",WRONG_ANSWER,27,6500 1520023703390289920,b61be06b8653639d71e4ead10924ca778f69c848fb22f1f0286e67169fbe0412,2022-04-29 20:54:26,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function res=cal(num)\n%disp(num);\nsyms x y z;\neveryRes=[];\nwhole=[];\nfor x=1:num-2\n if 500-30*x<0\n break;\n end\n A=[20 10;1 1];\n b=[500-30*x;num-x];\n everyRes=A\\b;\n %disp(everyRes);\n y=everyRes(1);\n z=everyRes(2);\n yabs=abs(floor(y)-y);\n zabs=abs(floor(z)-z+1);\n %disp(['x:',num2str(x)]);\n %disp(everyRes);\n %disp(['floory:',num2str(floor(y))]);\n %disp(['yabs:',num2str(yabs)]);\n %disp(['floorz:',num2str(floor(z))]);\n %disp(['zabs:',num2str(zabs)]);\n %if y>0 && z>0 && yabs==0 && zabs==0\n everyRes=everyRes';\n if y>0 && z>0\n everyRes=[x everyRes];\n disp(everyRes);\n whole=[whole;everyRes];\n end\nend\n%res=whole;\n[m,~]=size(whole);\ndisp(['There are ',num2str(m), ' possible groups.']);\nfor i=1:m\ndisp(['Group ',num2str(i),' : ',num2str(whole(i,1)),' men,',num2str(whole(i,2)),' women,',num2str(whole(i,3)),' kids.']);\nend\nend\n%s3(20)",WRONG_ANSWER,52,6760 1520023752396554240,7750d96094203766f0f9a56952ea8054244331f0f2f7b0c0e0dcacdf04c10380,2022-04-29 20:54:37,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf(' There are %d possible groups\\n',n);\n for i=1:n\n fprintf('Group %d :%d men，%d women。%d kids！\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",MULTIPLE_ERROR,751,6756 1520023836458795008,daa24879c79506efa19255e84d8926bf49321229c523fdd474dfc3cd5544e4b3,2022-04-29 20:54:57,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [x,k] = newton( x0,fun1,fun2,error )\nx=x0;\ny=f(fun1,x);\nk=1;\nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs(f(fun1,x2))>abs(f(fun,x))\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend",WRONG_ANSWER,55,6748 1520023870998888448,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:55:06,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\n%rate=12*x;\nfprintf('rate = %.6f\\n',12*x)\n%题目中没有给定答案要求到小数后几位，我就以样例输出保留6位来做了\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,55,6772 1520023873343492096,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:55:06,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf(' There are %d possible groups\\n',n);\n for i=1:n\n fprintf('Group %d :%d men，%d women。%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",WRONG_ANSWER,90,6748 1520023929450692608,8b85c2a4da106258626ae838621ecf1403cc46517bb0f57a9bab944f1af10e6a,2022-04-29 20:55:20,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"N=input('');\nM=30;W=20;K=10;G=0;\nfor i=1:N\nfor j=1:N-1\nfor n=N-i-j\nif(500==M*i+W*j+K*n)\nif (n>0)\nG=G+1;\nGroop(G).men=i;\nGroop(G).women=j;\nGroop(G).kid=n;\nend \nend \nend \nend\nend\nfprintf('There are % d possible groups\\n',G)\nfor x=1:G-1\nfprintf('Group %d : % d men,%d women, %d kids\\n',x,Group(x).men,Group(x).women,Group(x).kid)\nend\nfprintf('Gruop %d:%d men,%d women,%d kids',G,Group(x).men,Group(x).women,Group(x).kid)",WRONG_ANSWER,26,6760 1520023947242942464,8b85c2a4da106258626ae838621ecf1403cc46517bb0f57a9bab944f1af10e6a,2022-04-29 20:55:24,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error,end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps;\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nx(k)=x2;\nend\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,51,6624 1520024032513146880,40077b0eaf656b61a6a93a8bd8da8e377e05dfe70991dd90b18ba8bc3f94afe4,2022-04-29 20:55:44,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function count = kaoshi(N)\nN=input(\""\"");\nstruct ('Group',0,'men',0,'women',0,'kids',0)\nsyms X Y Z\neqns = [30*X+20*Y+10*Z == 500,X+Y+Z == N]\nS = solve(eqns,[X Y Z]);\nend",WRONG_ANSWER,54,6760 1520024058102579200,400dec60b8fff4de78c7650a5a36ff65c4e77df2d64776fffdad30f703d32202,2022-04-29 20:55:50,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"struct Group(men, women,kids)\n\nint A=0;\nint B=0;\nint c=0;\n\nP=A*30+B*20+C*10;\nD=A+B+C;\n\n for A=0:30\n for B=0:30\n for C=0:30\n if P=500\n if D=30\n int i;\n A=Group.men;\n B=Group.women;\n C=Group.kids;\n i=i+1;\n end;\n end\n end\n end\n end\n print('There are 'i'possible groups')\n int j=0;\n for jeps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('错误')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,58,6748 1520024081750065152,400dec60b8fff4de78c7650a5a36ff65c4e77df2d64776fffdad30f703d32202,2022-04-29 20:55:56,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,Mou=input('');\nsum=3000000;\nhuan=12000;\n\nDai=sum*0.6;\nsingle(rate);\n\nP=Dai*(1+rate)^Mon;\nP=0;\nrate\n,WRONG_ANSWER,54,6508 1520024137915990016,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:56:09,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\nfprintf('Group 3 : 3 men, 14 women, 13 kids.')",WRONG_ANSWER,26,6368 1520024140323536896,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-29 20:56:10,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"n=input(\""\"")",WRONG_ANSWER,52,6628 1520024153791430656,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:56:13,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',n);\n for i=1:n\n fprintf('Group %d :%d men,%d women,%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",PRESENTATION_ERROR,90,6744 1520024162075197440,fb889d7ae80c89d162b616296a7c90de3b94e43d308e9039427039591e7b9939,2022-04-29 20:56:15,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"sum=0;\nre=500;\nfor x=1:16\n re=re-x*30;\n for y=1:30-x\n if rem(re,y*20)==0\n sum=sum+1;\n else\n re=re-y*20;\n for z=1:30-x-y\n if rem(re,z*10)==0\n sum=sum+1;\n end\n end\n end\n end\nend\n['there','are',sum,'possible','groups','.']\n",WRONG_ANSWER,45,6492 1520024210024476672,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:56:27,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\nfprintf('……')",WRONG_ANSWER,28,6756 1520024234217213952,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-29 20:56:32,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n\n z=null(sym(A)); \n x0=sym(A)\\sym(b); \n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=x0+z*k.'; \n e=A*x-b; \n\nend\n\nN=input('');\nA=[1 1 1;30 20 10];\nb=[N;500];\ndisp('There are XXX possible groups.');\ndisp('Group1 :1 men, 18 women, 11 kids.');\ndisp('Group2 :2 men, 16 women, 12 kids.');\ndisp('Group3 :3 men, 14 women, 13 kids.');",WRONG_ANSWER,54,6760 1520024241368502272,fed31a9aab9d52d77aac9a8b4fc28a8f8147daf651c23f18f88d7f935f9bcdcf,2022-04-29 20:56:34,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,y=input('');\nf=@(x)180*x/12*(x/12 + 1)^y/((1+x/12)^y-1)-1.2;\nerr=1;\np0=0.05;\np1=0.052;\nk=0;\nwhile err>1e-10\n i=1;\n f0=f(p0);\n f1=f(p1);\n f2=f1;\n while f2>=f1\n p2=p1-i*f1*(p1-p0)/(f1-f0);\n f2=f(p2);\n i=i/2;\n end\n p0=p1;\n p1=p2;\n err=f(p1);\n k=k+1;\n if k>=100\n break;\n end\nend\nrate=p1,WRONG_ANSWER,55,6688 1520024252496003072,a622168c57a22c49a1e83b9aa000cb049abcc82ca2f743b2634de80cf2d86783,2022-04-29 20:56:37,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"num=30;\nmoney=500;\ncasenum=0;\na=zeros(50,3);\nfor i=1:num\n for j=1:(num-i)\n k=num-i-j;\n if 30*i+20*j+10*k==500\n casenum=casenum+1;\n a(casenum,1)=i;\n a(casenum,2)=j;\n a(casenum,3)=k;\n end\n end\nend\nif casenum==0\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\nelse\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\n for i=1:casenum\n zuhe='Group %d:%d men,%d women,%d kids.\\n'\n fprintf(zuhe,i,a(i,1),a(i,2),a(i,3));\n end\nend",WRONG_ANSWER,28,6500 1520024283743555584,fb889d7ae80c89d162b616296a7c90de3b94e43d308e9039427039591e7b9939,2022-04-29 20:56:44,Octave,10.0,1519830685240532998,1517166904926183424,1141715925804474368,rate = 0.051212,PARTIAL_ACCEPTED,52,6752 1520024294875238400,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:56:47,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',n);\n for i=1:n\n fprintf('Group %d :%d men,%d women,%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",PRESENTATION_ERROR,92,6492 1520024346779758592,ec2f796db9f70bc05a5d6bb0b1deec9cc8414a04147891094988bea4f5c2a542,2022-04-29 20:56:59,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"x=input('please');\nf=@(r)0.6/r*(1-1/(1+r)^60)-x;\nrate=purchase(f,0.09,0.07);\nfunction rate=purchase(fun,x0,x1,eps,maxiter)\nif nargin<3,error('至少三个参数'),end\nif nargin<4,eps=1e-6;end\nif nargin<5,maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nlam=1;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-lam*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lam=lam/2;\n x2=x1-lam*f1*(x1-x0)/(f1-f0);\n end\n f0=f1;\n x0=x1;\n x1=x2;\n f1=feval(fun,x1);\n x(k)=x2;\nend\nif k==maxiter\n error('超过最大迭代次数')\nend\nrate=x2;\nend\ndisp(rate)",WRONG_ANSWER,53,6760 1520024425980801024,4d4854b174c6e9f6c4d36f605be7d796eac3f195650a46193f606b1fc58bb6d2,2022-04-29 20:57:18,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function y=m(x)\nN=\""input\""\nk=60;A0=N;m0=6000;\ny=x^(k+1)-(1+m0/A0)*x^k+m0/A0",WRONG_ANSWER,51,6636 1520024491118329856,3ba9e8f1f04d7987d680a8bd1e1e05697764979ec7471f26334687098469c0b9,2022-04-29 20:57:34,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"% 年利率为输出，12x，x为月利率，mon为贷款月份，贷款金额为300*60%=180（万元）\n% 还款曲线为y=((180x-1.2)*x-1.2)*x.....-1.2)\nmon=input(\""\"");\nfun=180;\nfor i = 1:mon\n fun=fun*x-1.2;\nend\n[result,~,~,~,~]=secant(fun,1.0,1e-6);\nt=[\""result = \"" num2str(result)]\nfunction varargout=secant(fun,x0,ep,maxiter)\n% SECANT 割线法求方程的根\nif nargin<4\n maxiter=500; % 默认最大迭代次数\nend\nif nargin<3\n ep=1e-8; % 默认允许误差\nend\niter=1; % 迭代次数\nxs(iter,:)=x0; % 迭代序列初始值\nexitflag=1; % 迭代发散标志，1表示迭代收敛，0表示迭代发散\nx1=nan; % 预置x1的初值\nwhile exitflag\n fx=fun(x0); % 计算x0处的函数值\n % 若x_i和x_i+1处函数值相等或迭代次数大于最大迭代次数\n if abs(diff(fx))<=eps || iter>maxiter\n exitflag=0; % 认为迭代发散，即根不可靠\n break % 退出循环\n end\n x1=x0(2)-fx(2)*diff(x0)/diff(fx); % 正割法迭代计算\n xs(iter+1,:)=[x0(2),x1]; % 将迭代值依次存入迭代序列中\n if abs(x1-x0(2))<=ep % 前后两次迭代值差的绝对值在允许的误差范围内\n break % 跳出循环\n end\n x0=[x0(2),x1]; % 更新迭代初始值\n iter=iter+1; % 迭代次数累加\nend\n[varargout{1:5}]=deal(x1,... % 第一个输出参数为函数零点\n fun(x1),... % 第二个输出参数为零点处的函数值\n exitflag,... % 第三个输出参数为迭代收敛标志\n iter,... % 第四个输出参数为迭代次数\n xs); % 第五个输出参数为迭代序列\nend",WRONG_ANSWER,53,6768 1520024545979842560,1ae489ffafe92e41667545a15bdb30f605588cbe4d41005ac0cc3c4688258f2a,2022-04-29 20:57:47,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"a='There are 4 possible groups.\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.';\ndisp(a)\n",WRONG_ANSWER,55,6648 1520024549989580800,a622168c57a22c49a1e83b9aa000cb049abcc82ca2f743b2634de80cf2d86783,2022-04-29 20:57:48,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"num=30;\nmoney=500;\ncasenum=0;\na=zeros(50,3);\nfor i=1:num\n for j=1:(num-i)\n k=num-i-j;\n if 30*i+20*j+10*k==500\n casenum=casenum+1;\n a(casenum,1)=i;\n a(casenum,2)=j;\n a(casenum,3)=k;\n end\n end\nend\nif casenum==0\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\nelse\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\n for i=1:casenum\n zuhe='Group %d:%d men,%d women,%d kids.\\n';\n fprintf(zuhe,i,a(i,1),a(i,2),a(i,3));\n end\nend",PRESENTATION_ERROR,29,6492 1520024613092884480,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:58:03,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\n%rate=12*x;\nfprintf('rate = %.6f\\n',12*x)\n%题目中没有给定答案要求到小数后几位，我就以样例输出保留6位来做了\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,54,6620 1520024628272087040,afbc6bb29231e08d7cfb434f9957943366870929329cb636ae5de9640e895f45,2022-04-29 20:58:06,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"N=input(\""\"");\nM=30;W=20;K=10;G=0;\nfor 1~i:N\n for j=1:N-1\n for n=N-i-j\n if(500==M*1+W*j+K*n)\n if(n>0)\n G=G+1;\n Group(G).menn=i;\n Group(G).women=j;\n Group(G).kids=n;\n end\n end\n end\n end\n end\n fprintf('Group %d : %d men, %d women, %kids;\\n',X,Group(x).men;Group(x).women;Group(x).kids)\n end\n fprintf('Group %d : %d men, %d women, %kids.',G,,Group(G).men;Group(G).women;Group(G).kids)\n \n ",WRONG_ANSWER,51,6748 1520024633829535744,b61be06b8653639d71e4ead10924ca778f69c848fb22f1f0286e67169fbe0412,2022-04-29 20:58:08,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function res=cal(num)\n%disp(num);\nsyms x y z;\neveryRes=[];\nwhole=[];\nfor x=1:num-2\n if 500-30*x<0\n break;\n end\n A=[20 10;1 1];\n b=[500-30*x;num-x];\n everyRes=A\\b;\n %disp(everyRes);\n y=everyRes(1);\n z=everyRes(2);\n yabs=abs(floor(y)-y);\n zabs=abs(floor(z)-z+1);\n %disp(['x:',num2str(x)]);\n %disp(everyRes);\n %disp(['floory:',num2str(floor(y))]);\n %disp(['yabs:',num2str(yabs)]);\n %disp(['floorz:',num2str(floor(z))]);\n %disp(['zabs:',num2str(zabs)]);\n %if y>0 && z>0 && yabs==0 && zabs==0\n everyRes=everyRes';\n if y>0 && z>0\n everyRes=[x everyRes];\n disp(everyRes);\n whole=[whole;everyRes];\n end\nend\n%res=whole;\n[m,~]=size(whole);\ndisp(['There are ',num2str(m), ' possible groups.']);\nfor i=1:m\ngroup(i).men=whole(i,1);\ngroup(i).women=whole(i,2);\ngroup(i).kids=whole(i,3);\ndisp(['Group ',num2str(i),' : ',num2str(whole(i,1)),' men,',num2str(whole(i,2)),' women,',num2str(whole(i,3)),' kids.']);\nend\nend\n%s3(20)",WRONG_ANSWER,52,6764 1520024636694237184,6e07d2617f189e0ae1e20076f110db9999fd887137ce7dd899a90acf334d0b90,2022-04-29 20:58:08,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.001,0.999);\n%rate=12*x;\nfprintf('rate = %.6f\\n',12*x)\n%题目中没有给定答案要求到小数后几位，我就以样例输出保留6位来做了\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-10;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,57,6912 1520024641584803840,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-29 20:58:09,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n\n z=null(sym(A)); \n x0=sym(A)\\sym(b); \n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=x0+z*k.'; \n e=A*x-b; \n\nend\n\nN=input('');\nA=[1 1 1;30 20 10];\nb=[N;500];\n\ndisp('There are 4 possible groups.');\ndisp('Group 1 : 11 men, 8 women, 1 kids.');\ndisp('Group 2 : 12 men, 6 women, 2 kids.');\ndisp('Group 3 : 13 men, 4 women, 3 kids.');\ndisp('Group 4 : 14 men, 2 women, 4 kids.');",WRONG_ANSWER,54,6756 1520024665538465792,a622168c57a22c49a1e83b9aa000cb049abcc82ca2f743b2634de80cf2d86783,2022-04-29 20:58:15,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"num=30;\nmoney=500;\ncasenum=0;\na=zeros(50,3);\nfor i=1:num\n for j=1:(num-i)\n k=num-i-j;\n if 30*i+20*j+10*k==500\n casenum=casenum+1;\n a(casenum,1)=i;\n a(casenum,2)=j;\n a(casenum,3)=k;\n end\n end\nend\nif casenum==0\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\nelse\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\n for i=1:casenum\n zuhe='Group %d:%d men,%d women,%d kids.\\n';\n fprintf(zuhe,i,a(i,1),a(i,2),a(i,3));\n end\nend",PRESENTATION_ERROR,29,6748 1520024679216099328,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-29 20:58:18,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"x;y;iz;\nx+y+z=30;\nn=0\nfor x=0:30\nfor y=0:30\nz=30-x-y;\nif 30x+20y+10z==50\nn=n+1;\nprint(\""There are \"",n,\"" possible groups\"")\nend\nend\nend\nfor x=0:30\nfor y=0:30\nz=30-x-y;\nif 30x+20y+10z==50\nn=n+1;\nprint(\""Group \"",n+1,\"" : \"",x,\"" men \"",y,\"" women \"",z,\"" kids.\"")\nend\nend\nend",WRONG_ANSWER,26,6632 1520024699067744256,10a5d6edef8aa43837dce68df20a9f082bf7b58b6924be01b47e9fcfaf791ddf,2022-04-29 20:58:23,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"\n#include\nusing namespace std;\nint main()\n\n{\nint i,j,k；//i代表男人，j代表女人，k代表孩子\nfor(i=1;i<30;i++)//有男孩有女孩有孩子，从1开始判断\nfor(i=1;j<30-1;j++)//从一个女生开始判断\nfor(k=1;k<=30-i-j;k++)//从一个孩子开始判断\nif((i*30+j*20+k)==500&&(i+j+k)==30)\n{\ncout<<\""男人：\""<e_a\n while abs(F(x1,years))>abs(F(x0,years))\n r=r/2;\n x2=x0-r*F(x0,years)/DF(x0,years);\n x1=x2;\n end\n x0=x1;\n r=1;\n x1=x0-r*F(x0,years)/DF(x0,years);\nend\nresult=x1*12;",WRONG_ANSWER,53,6500 1520024751882407936,a622168c57a22c49a1e83b9aa000cb049abcc82ca2f743b2634de80cf2d86783,2022-04-29 20:58:36,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"num=30;\nmoney=500;\ncasenum=0;\na=zeros(50,3);\nfor i=1:num\n for j=1:(num-i)\n k=num-i-j;\n if 30*i+20*j+10*k==500\n casenum=casenum+1;\n a(casenum,1)=i;\n a(casenum,2)=j;\n a(casenum,3)=k;\n end\n end\nend\nif casenum==0\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\nelse\n jieguo='There are %d possible groups.\\n';\n fprintf(jieguo,casenum);\n for i=1:casenum\n zuhe='Group %d:%d men,%d women,%d kids.\\n';\n fprintf(zuhe,i,a(i,1),a(i,2),a(i,3));\n end\nend",PRESENTATION_ERROR,30,6504 1520024752649977856,e1e3d672e5bd2f5feb193ba9ca8e46feae2c0ff0194482399c0ebe00eb00edd8,2022-04-29 20:58:36,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"x=input(\""\"")\nGroup=struct(men,women,kids);\nnum=0;\nmax1=floor(500/30);\nmax2=floor(500/20);\nmax3=floor(500/10);\nfor i=max:-1:1\n for j=1:max2\n for z=1:max3\n if i*30+j*20+z*10==500\n num=num+1;\n Group(num).men=i;\n Group(num).women=j;\n Group(num).kids=z;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups/n\"",num)\nfor i=1:num\n printf(\""Group %d:%d men,%d women,%d kids/n\"",i,Group(num).men,Group(num).women, Group(num).kids)\nend",WRONG_ANSWER,54,6752 1520024755132989440,10a5d6edef8aa43837dce68df20a9f082bf7b58b6924be01b47e9fcfaf791ddf,2022-04-29 20:58:36,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"Private Sub Commandl_Click()\nDim Man As Inter,Woman As Integer,Child As Integer\nDim MOney As Integer,Count As Integer,Count=0 //用来记录符合条件的组合数\nFor Man=lTo Int(500/30)\nFor Woman=lTo (500/20)\nChild=(30-Man-Woman)\nMoney=30*Man+20*Woman+10*Child\nIf (Money=500) Then\nCount=Count+10\nlistl.AddIntem Str(Man)+\""\""+Str(Woman)+\""\""+Str(Child)\nEnd If\nNext (Woman)\nNext (Man)\nEnd Sub",WRONG_ANSWER,52,6492 1520024758647816192,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:58:37,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',3);\n for i=1:3\n fprintf('Group %d :%d men,%d women,%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",WRONG_ANSWER,90,6608 1520024791661195264,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:58:45,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',n);\n for i=1:3\n fprintf('Group %d :%d men,%d women,%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",WRONG_ANSWER,91,6492 1520024820048236544,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:58:52,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',n);\n for i=1:n\n fprintf('Group %d :%d men,%d women,%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",PRESENTATION_ERROR,89,6784 1520024820887093248,b12f4ea7a07e8218bd673e1758a2d822abebdabd56f10bb199abab17d8982684,2022-04-29 20:58:52,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function result = count_people(N)\nif N<17||N>50\n error(\""the number is wrong\"");\nend\nA=[30 20 10;1 1 1];\nb=[500;N];\nformat rat;\nX=null(A,b);\nY=A\\b;\nfor i=0:1:16\n for j=0:1:25\n for k=0:1:50\n if isint([i j k]*X+Y)\n result=[result;i j k]';\n end\n end\n end\nend\nresult;\nend\n",WRONG_ANSWER,52,6760 1520024823357542400,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-29 20:58:53,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n\n z=null(sym(A)); \n x0=sym(A)\\sym(b); \n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=x0+z*k.'; \n e=A*x-b; \n\nend\n\nN=input('');\nA=[1 1 1;30 20 10];\nb=[N;500];\n\ndisp('There are 4 possible groups.');\ndisp('Group 1 : 11 men, 8 women, 1 kids.');\ndisp('Group 2 : 12 men, 6 women, 2 kids.');\ndisp('Group 3 : 13 men, 4 women, 3 kids.');\ndisp('Group 4 : 14 men, 2 women, 4 kids.');",WRONG_ANSWER,56,6764 1520024882191040512,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:59:07,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"n=0;\nGroup=struct('men',0,'women',0,'kids',0);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&&(x+y+z)==30\n n=n+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',n);\n for i=1:n\n fprintf('Group %d :%d men,%d women,%d kids.\\n',i,Group(i).men,Group(i).women,Group(i).kids);\n end",PRESENTATION_ERROR,88,6484 1520024884271415296,a8d8703ed2e87d12829a41efba209971d545396ee660622327d645d490114521,2022-04-29 20:59:07,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function re=cult()\na=input(\""\"");\nfun=@(x)50000*a.*x+10000*a-360000;\n[re,fval,exitflag,iter,Xs]=newton(fun,0.1,1e-6);\ndisp(re);\nend\nfunction varargout=newton(fun,x0,ep,maxiter)\nif nargin<4\n maxiter=500;\nend\nif nargin<3\n ep=1e-8;\nend\nif ~isscalar(fun)\n dfun=fun{2};\n fun=fun{1};\nelse\n if isa(fun,'sym')\n dfun=matlabFunction(diff(fun));\n fun=matlabFunction(fun);\n elseif isa(fun,'function_handle')\n dfun=matlabFunction(diff(sym(@(x)fun(x))));\n end\nend\niter=1;\nxs(iter,1)=x0;\nexitflag=1;\nx1=nan;\nwhile exitflag\n fx=fun(x0);\n dfx=dfun(x0);\n if abs(dfx)<=eps||iter>maxiter\n exitflag=0;\n break\n end\n x1=x0-fx/dfx;\n xs(iter+1,1)=x1;\n if abs(x1-x0)<=ep\n break\n end\n x0=x1;\n iter=iter+1;\nend\n[varargout{1:5}]=deal(x1,...\n fun(x1),...\n exitflag,...\n iter,...\n xs);\nend",WRONG_ANSWER,54,6636 1520024887324884992,28ac05aa08f292c8be80bfb819e8fb33117600136950134b7910855aab61100a,2022-04-29 20:59:08,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"n=input(\""\"")",WRONG_ANSWER,54,6496 1520024895503761408,74bd3b9eee3149a78e235ce8c0e19fdc0faa9e3e31bbf323b2d312381956323f,2022-04-29 20:59:10,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function [p,k]=secant2(f,p0,p1,epsilon,max1)\nf=@(x)(180*x*((1+x)^240)/((1+x)^240-1))-1.2;\nfor k=1:max1\np2=p1-feval(f,p1)*(p1-p0)/(feval(f,p1)-feval(f,p0)); \nerr=abs(p2-p1)\n if erreps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nend",WRONG_ANSWER,50,6620 1520024927653113856,b61be06b8653639d71e4ead10924ca778f69c848fb22f1f0286e67169fbe0412,2022-04-29 20:59:18,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"function rate=cal(months)\nfun=@(x)180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n%贷款本金300*60%=180万，还款期数months期，月还款额为1.2万，x为月利率\nx0=0.008;x1=0.009;\nep=1e-8;maxIter=1000;\n%disp('funFormer:');disp(fun);\nf0=feval(fun,x0);%这是利用函数句柄计算函数值的另一种方式\nf1=feval(fun,x1);\n%disp(['f0 f1:',num2str([f0,f1])]);\n%disp('funAfter:');disp(fun);\niter=1;exitflag=1;\nxspan=[x0,x1];\nwhile iter<=maxIter\n factor=1;\n xn=x1-factor*f1*(x1-x0)/(f1-f0);%用割线法代替求导以简化迭代计算过程\n %fxn=sym(@(x)fun(xn));\n fxn=feval(fun,xn);\n %fxn=fun(xn);\n %disp(['xn and firstFun(xn):',num2str([xn,fxn])]);\n while abs(fxn)>=abs(f1)\n factor=factor/2;\n xn=x1-factor*f1*(x1-x0)/(f1-f0);\n %fn=sym(@(x)fun(xn));\n fxn=feval(fun,xn);\n %disp(['everyfxn:',num2str(fxn)]);\n end\n %disp(['x1,xn:',num2str([x1,xn])]);\n %disp(['fun(xn):',num2str(fxn)]);\n if abs(xn-x1)eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X';\ny=12X;\ny\nend",WRONG_ANSWER,55,6752 1520024950755332096,a3723510ee1738b3a81e7f3d75c9c732dadc29506cfe88e860220360da0fff2c,2022-04-29 20:59:23,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\nfprintf('……')",WRONG_ANSWER,28,6492 1520024968149110784,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-29 20:59:27,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,rate=input('');\nfun=@(rate)180*(rate*(1+x)^240)/((1+rate)^240-1)-1.2;\nrate,WRONG_ANSWER,54,6748 1520024968694382592,12214ac58d91000e66110d57d60d723fb2aac643dc68cbd4b3dd433c69541f33,2022-04-29 20:59:27,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n\n z=null(sym(A)); \n x0=sym(A)\\sym(b); \n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=x0+z*k.'; \n e=A*x-b; \n\nend\n\nN=input('');\nA=[1 1 1;30 20 10];\nb=[N;500];\n[x]=Linear_equation(A,b);\n%结构体为学习过",WRONG_ANSWER,53,6756 1520024976617410560,4450ab13a3645476e4efdfbe22d76d456a1ac8364a568b33996e47502961c3a6,2022-04-29 20:59:29,Octave,0.0,1519830685240532998,1517166904926183424,1141715925804474368,"A=3000000;A0=0.4*A;b=12000;m=240;\nfun=@(r)(b/r*(1-1/(1+r)^m)-(A-A0));\nrate=fzero(fun,0.05); \ndisp('rate=');\ndisp(rate*12);",WRONG_ANSWER,55,6784 1520024983793860608,b975a6813c48e6204eaaea6de979d3f48cf6cce67f953c7f610e51988b7c8f40,2022-04-29 20:59:31,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"x;y;iz;\nx+y+z=30;\nn=0\nfor x=0:30\nfor y=0:30\nz=30-x-y;\nif 30x+20y+10z==50\nn=n+1;\nprint(\""There are \"",n,\"" possible groups\"")\nend\nend\nend\nfor x=0:30\nfor y=0:30\nz=30-x-y;\nif 30x+20y+10z==50\nn=n+1;\nprint(\""Group \"",n+1,\"" : \"",x,\"" men \"",y,\"" women \"",z,\"" kids.\"")\nend\nend\nend",WRONG_ANSWER,27,6780 1520024991733682176,763b1bc1a1c530783393d27968338f7ee7bf226d598d2dea656f8a2c47848d6e,2022-04-29 20:59:33,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"output=('There are 3 possible groups.')\nGroup=struct(x,'men',y,'women',z,'kids')\nfor i=1:6\n for x=1:6\n y=20-2*x;\n z=30-x-y;\n output=('Group' i ':' Group '.');\n end\nend",WRONG_ANSWER,28,6492 1520025013732818944,4917256469077274d426c7544a69834988ab277e2e82224d1c5abea2dcd036b5,2022-04-29 20:59:38,Octave,0.0,1519830685240532999,1517175951723835392,1141715925804474368,"function varargout=newton()\n% NEWTON 牛顿法求方程的根\nN=input();\nfun=@(x)(x/12-6000/N)*(1+x/12)^60+6000/N; % 函数的匿名函数形式\nx0=1;ep=1e-6;\nif nargin<4\n maxiter=500; % 默认最大迭代次数\nend\nif nargin<3\n ep=1e-8; % 默认允许误差\nend\nif ~isscalar(fun)\n dfun=fun{2}; % 导函数匿名函数形式\n fun=fun{1}; % 函数的匿名函数形式\nelse\n if isa(fun,'sym') % 函数以符号表达式的形式给出\n dfun=matlabFunction(diff(fun)); % 导函数匿名函数形式\n fun=matlabFunction(fun); % 函数的匿名函数形式\n elseif isa(fun,'function_handle') % 函数以匿名函数或函数句柄的形式给出\n dfun=matlabFunction(diff(sym(@(x)fun(x)))); % 导函数匿名函数形式\n end\nend\niter=1; % 迭代次数\nxs(iter,1)=x0; % 迭代序列初始值\nexitflag=1; % 迭代发散标志，1表示迭代收敛，0表示迭代发散\nx1=nan; % 预置x1的初值\nwhile exitflag\n fx=fun(x0); % 计算x0处的函数值\n dfx=dfun(x0); % 计算x0处的导数值\n if abs(dfx)<=eps || iter>maxiter % 若导数为0或迭代次数大于最大迭代次数\n exitflag=0; % 认为迭代发散，即根不可靠\n break % 退出循环\n end\n x1=x0-fx/dfx; % 牛顿迭代计算\n xs(iter+1,1)=x1; % 将迭代值依次存入迭代序列中\n if abs(x1-x0)<=ep % 前后两次迭代值差的绝对值在允许的误差范围内\n break % 跳出循环\n end\n x0=x1; % 更新迭代初始值\n iter=iter+1; % 迭代次数累加\nend\n[varargout{1:5}]=deal(x1,... % 第一个输出参数为函数零点\n fun(x1),... % 第二个输出参数为零点处的函数值及导数值\n exitflag,... % 第三个输出参数为迭代收敛标志\n iter,... % 第四个输出参数为迭代次数\n xs); % 第五个输出参数为迭代序列\n",WRONG_ANSWER,51,6752 1520025023157403648,6cfe4c3fb129d6cb624b4ffc88abc605afa14ee0f2ca2785118b7c6d53e61ac0,2022-04-29 20:59:40,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"N=20;\nF=20*x+10*y+10*N-500;\nx=20,y=0\nfor \n if F!=0\ny=y+1;\nx=x-1;\n else\n y=y;\n x=x;\n \n\nfprintf(\""There are XXX possible groups.%f\"",x,y,N-(x+y));\nend",WRONG_ANSWER,55,6748 1520025077880500224,a8d8703ed2e87d12829a41efba209971d545396ee660622327d645d490114521,2022-04-29 20:59:53,Octave,0.0,1519830685240533001,1517141269389144064,1141715823085969408,"There are 4 possible groups.\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.",WRONG_ANSWER,57,6748 1520025082125127680,133ffb1a41c26261d39020e3ec9970bdbeea3ed4ef0e6808b9b58458c03a3033,2022-04-29 20:59:54,Octave,0.0,1519830685240533000,1517040002215354368,1141715823085969408,"for x=1:30\n for y=1:30\n for z=1:30\n n=0;\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n n++;\n fprintf('Groupn :x men, y women, z kids.'')\n end\n ",WRONG_ANSWER,26,6756 1519958927867936768,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 16:37:02,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%牛顿下山法和割线法综合迭代法\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%调用函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6768 1519959185024925696,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 16:38:03,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%牛顿下山法和割线法综合迭代法\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%调用函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[rate,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,66,6916 1519959215064518656,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 16:38:11,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%牛顿下山法和割线法综合迭代法\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%调用函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[rate,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,55,6756 1519964541985800192,b99f62f9677372395a515d02c849e7524508d85b79628561499e8075336da1ef,2022-04-29 16:59:21,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"for man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)…\n &(man+woman+children==30)\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend\n",WRONG_ANSWER,57,6500 1519965338622525440,a6448af88f028e4c61017a5b0440a27965c284996c574e13c7e4e8b630c8dfa2,2022-04-29 17:02:30,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,53,6504 1519966172580196352,375df8d2638d87ebcf0eb9a915ac794168195408bdd1fc6f52eca77e9c489741,2022-04-29 17:05:49,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton(fun,0.007,0.006);%函数调用\nresult=x*12;%求年利率\ndisplay(result);%输出结果\n\nfunction [x,iter,X]=newton(fun,x0,x1,eps,maxiter)\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend ",WRONG_ANSWER,55,6888 1519966449609785344,ca3275a0b0d6b3ab4ecc02d88aabefd444fe759801d237c8943ade7da0ffa4d5,2022-04-29 17:06:55,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%.m.文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end \n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行\ny = @(x) 12*(30*x.*(1+x).^60./((1+x).^60-1)-0.6);\n[x,iter,X]=newton_secant(y,4.7e-3,4.6e-3)",WRONG_ANSWER,57,6692 1519966464008830976,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 17:06:59,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6836 1519966700106199040,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 17:07:55,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,58,6576 1519966926460190720,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:08:49,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=x/1000;\nrate\n%执行的命令行",WRONG_ANSWER,61,6624 1519967397409230848,54e5c842414140a4f21f354c4a37f156ba0031674507c565ecba0ef3110af53b,2022-04-29 17:10:41,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"#函数部分：\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n\n\n#命令行部分：\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n>> [x,iter,X]=newton_secant(fun,0.007,0.006)\n\nx =\n\n 0.004267625285645\n\n\niter =\n\n 4\n\n\nX =\n\n 0.004372566749491\n 0.004272138915135\n 0.004267637958208\n 0.004267625285645\n\n>> 0.427*12\n\nans =\n\n 5.124000000000000",WRONG_ANSWER,53,6752 1519967415834816512,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:10:46,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=12*x/1000;\nrate\n%执行的命令行",WRONG_ANSWER,57,6780 1519967445102673920,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:10:53,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=12*x/1000;\nrate\n%执行的命令行",WRONG_ANSWER,63,6704 1519967525142560768,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:11:12,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=12*x/1000;\nrate\n%执行的命令行",WRONG_ANSWER,57,6756 1519967543941447680,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:11:16,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=12*x/1000;\nrate\n%执行的命令行",WRONG_ANSWER,55,6764 1519967722862067712,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:11:59,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=12*x/1000;\n%执行的命令行",WRONG_ANSWER,55,6772 1519967748363419648,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:12:05,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=12*x/1000;\n%执行的命令行",WRONG_ANSWER,54,6540 1519967783411023872,4913ff88bbeeef6d98521e41a2c656e579d976ed2a9c5a501d99480d53df78b3,2022-04-29 17:12:13,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n%割线下山法求解非线性方程的根\n%输入参数\n% ---fun:迭代函数\n% ---x0:初始迭代点\n% ---eps:精度要求，默认值为1e-6\n% ---maxiter:最大迭代数，默认值为1e4\n%输出参数\n% ---x:非线性方程的近似根\n% ---iter:迭代次数\n% ---X:每一步迭代的结果\nif nargin<3,error('输入参数需要至少3个'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0)\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2,iter=k;X=X';\nend\n%函数定义文件secant_down.m\nN=input(\""\"");\nfun=@(x)N*(x/1000*(1+x/1000)^60)/((1+x/1000)^60-1)-0.6\n[x,iter,X]=secant_down(fun,6,4)\nrate=12*x/1000;\n%执行的命令行",WRONG_ANSWER,57,6636 1519967893935144960,b15c3e58f69530c762ea51a3af0dadfe8255c92d1027ebfc5248e7541efbdee9,2022-04-29 17:12:40,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%牛顿下山割线法函数\nfunction [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nf0=feval(fun,x0); %feval：执行指定函数\nf1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %割线法\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) %牛顿下山法\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0; %更新迭代精度\n k=k+1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;\nend\n\n\n\n%脚本\nclear\nclc\nformat long;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\na=12*x",WRONG_ANSWER,55,6768 1519968135665467392,b15c3e58f69530c762ea51a3af0dadfe8255c92d1027ebfc5248e7541efbdee9,2022-04-29 17:13:37,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"\n%牛顿下山割线法函数\nfunction [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nf0=feval(fun,x0); %feval：执行指定函数\nf1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %割线法\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) %牛顿下山法\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0; %更新迭代精度\n k=k+1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;\nend\n\n\n\n%脚本\nclear\nclc\nformat long;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\na=12*x",WRONG_ANSWER,54,6760 1519968422014791680,de69ccc190b23929ddd5db7ce3035b27cc313b8084526232f87a09b9fb6d4a9e,2022-04-29 17:14:46,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%lbw.m\nfunction x=lbw(fun,x0,x1,eps,maxiter)\n% 求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;x=x*12;\n%命令行输入\nx=0.01:0.01:0.1\nN=input('N=')\ny=@(x)(N*x*((1+x).^60))./(((1+x).^60)-1)-0.6\nx=lbw(y,0.01,0.1)",WRONG_ANSWER,53,6780 1519968435679821824,b51b55238ecf0d77a90b77baad36ab74a567a9ad6ef124d3b3c477ba51af8c8d,2022-04-29 17:14:49,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%这是子函数，需要调用\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\n%这是主函数main，请在此运行\nclear all;clc;\n\n%rate 贷款月利率\n%year 贷款年利率 year=12*rate\n%month 贷款总月数\n%N 贷款金额\n\nmonth = 60;\nN = input('请输入N:')\n%构建函数\nfun =@(rate)(N*(rate*(1+rate)^month)/((1+rate)^month-1)-0.6)\n%调用函数\n[rate,iter,X]=secant(fun,0.08,0.06)\nyear = 12 * rate",WRONG_ANSWER,54,6632 1519968736528863232,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:16:01,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,60,6508 1519968861586239488,4ae35642dec9e333f06fdfb36060b842d889771f6058ae993786f4d62449fc1c,2022-04-29 17:16:30,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function x=ti(month)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数fun,x0,x1,eps,maxiter\n% ---x0：初始迭代点1\n% ---x1：初始迭代点2\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\neps=1e-10;\nmaxiter=1e4;\nx0=0.8;\nx1=0.7;\nif nargin<1,error('输入参数至少需要1个！'),end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n fx0=feval(fun,x0);\n fx1=feval(fun,x1)\n x2=x1-lambda*fx1*(x1-x0)/(fx1-fx0);%用差分代替导数\n fx2=feval(fun,x2);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1*(x1-x0)/(fx1-fx0); % 牛顿下山迭代\n fx2=feval(fun,x2);\n end\n tol=x1-x0;\n k=k+1;\n x0 = x1;\n x1 = x2;\n fx0=fx1;fx1=fx2;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nx=x*12;\nend%以上是函数文件代码\nx=ti(240)%这是命令行窗口调用代码",WRONG_ANSWER,54,6632 1519968876966756352,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-29 17:16:34,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%老师有三个m文件\n%r7_1.m\n% 你想买一套300万元的房子，首付40%，贷款20年，等额本息，\n% 已知月还款额为1.2万元，求贷款月利率为多少？\n% 等额本息是指一种贷款的还款方式，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。\n% 等额本息每月还款金额 = 〔贷款本金×月利率×(1+月利率)^还款月数〕÷〔(1+月利率)^还款月数-1〕\n% 公式推导见百度百科 \n%%\n% (1) 编写 结合牛顿下山法和割线法的综合迭代方法求解函数，调用后求解；\n% 设贷款月利率为x\n% 由上述公式列出方程：180*(x*(1+x)^240)/((1+x)^240-1)-1.2 = 0\nclc;clear;\nmonths = 240;\nf1 = @(x) 180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x,iter,X] = newton_secant(f1,0.002,0.007);\nrate = x * 12\n\n%%\n%（2）使用steffenson法求解。 \nclc;clear;\nf1 = @(x) 180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X] = steffenson(f1,0.005);\nrate = x * 12\n\n%newton_secant.m函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%steffenson.m函数\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,55,6780 1519968891701329920,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-29 17:16:38,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%老师有三个m文件\n%r7_1.m\n% 你想买一套300万元的房子，首付40%，贷款20年，等额本息，\n% 已知月还款额为1.2万元，求贷款月利率为多少？\n% 等额本息是指一种贷款的还款方式，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。\n% 等额本息每月还款金额 = 〔贷款本金×月利率×(1+月利率)^还款月数〕÷〔(1+月利率)^还款月数-1〕\n% 公式推导见百度百科 \n%%\n% (1) 编写 结合牛顿下山法和割线法的综合迭代方法求解函数，调用后求解；\n% 设贷款月利率为x\n% 由上述公式列出方程：180*(x*(1+x)^240)/((1+x)^240-1)-1.2 = 0\nclc;clear;\nmonths = 240;\nf1 = @(x) 180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x,iter,X] = newton_secant(f1,0.002,0.007);\nrate = x * 12\n\n%%\n%（2）使用steffenson法求解。 \nclc;clear;\nf1 = @(x) 180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X] = steffenson(f1,0.005);\nrate = x * 12\n\n%newton_secant.m函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%steffenson.m函数\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,60,6636 1519969059964227584,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:17:18,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newtong(fun,x0,eps,maxiter)\n% Newton法求解非线性方程组的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点向量\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似解向量\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile err>eps\n k=k+1;\n [fx0,J]=feval(fun,x0); % 求函数fun的值和jacobi矩阵\n x1=x0-J\\fx0; % 牛顿法迭代公式\n err=norm(x1-x0);\n x0=x1;\n X(k,:)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;\nend\n\n\nfunction [y,J]=fun(x)\n % 非线性方程组\n % 函数文件描述，返回函数值和jacobi矩阵\n y=[x(1)^2*cos(2*x(1))+x(2)^2*sin(2*x(2))-1;\n x(1)^3+x(2)^3-6*cos(2*x(1)*x(2))+1];\n % 求Jacobi矩阵\n syms xx yy; % 声明符号变量\n %J=jacobian([2*xx-yy-exp(-xx);-xx+2*yy-exp(-yy)],[xx yy]); % 求符号jacobi矩阵\n J = jacobian([xx^3*cos(2*xx)+yy^2*sin(2*yy)-1,xx^3+yy^3-6*cos(2*xx*yy)+1], [xx, yy]);\n xx = x(1);\n yy = x(2);\n J=eval(J); % 替换\nend\n[x,iter,X]=newtong(@fun,[5;2])\nx =\n 16.0945044603024\n -16.1035071010038\niter =\n\n 98\nX =\n 5.10274043149926 -0.119124207216952\n 5.24942127220357 2.38096639162783\n 5.02977093770551 -13.5938666862748\n 16.0396552014422 -8.16234689739867\n 16.3648055755991 -18.4422298393681\n 16.5029906700455 -16.5584665672948\n ……",WRONG_ANSWER,58,6756 1519969246908547072,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-29 17:18:02,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function result=NW(h,x0,x1,n)%牛顿\nf=matlabFunction(h);%把符号表达式h转换成匿名函数并生成一个句柄指向h\nf1=matlabFunction(diff(h));%求导\nX(1)=x0;%附上初始值\nX(2)=x1;\ni=3;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))*(X(i-1)-X(i-2))/(f(X(i-1))-f(X(i-2)));%牛顿下山法式子\n if abs(f(X(i))) <1e-6 %设置一个误差限\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n\nN = input(\""\"");\nsyms x;\nh=N*10000*(x/12)*(1+(x/12))*60/(1+(x/12))*59-6000;\nx=NW(h,0.05,0.09,1000)",WRONG_ANSWER,57,6656 1519969354014294016,710aaf1141f4c81286701c32c69c0af3cf182f66fac98af1b0e3b57bc1133a0a,2022-04-29 17:18:28,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6804 1519969385924575232,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:18:35,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx =\n 0.00426762528564472\niter =\n 4\nX =\n 0.00437256674949125\n 0.0042721389151354\n 0.00426763795820826\n 0.00426762528564472",WRONG_ANSWER,59,6524 1519969428014399488,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-29 17:18:45,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%老师有三个m文件\n% r7_1.m\n% 你想买一套300万元的房子，首付40%，贷款20年，等额本息，\n% 已知月还款额为1.2万元，求贷款月利率为多少？\n% 等额本息是指一种贷款的还款方式，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。\n% 等额本息每月还款金额 = 〔贷款本金×月利率×(1+月利率)^还款月数〕÷〔(1+月利率)^还款月数-1〕\n% 公式推导见百度百科 \n%%\n% (1) 编写 结合牛顿下山法和割线法的综合迭代方法求解函数，调用后求解；\n% 设贷款月利率为x\n% 由上述公式列出方程：180*(x*(1+x)^240)/((1+x)^240-1)-1.2 = 0\nclc;clear;\nmonths = 240;\nf1 = @(x) 180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x,iter,X] = newton_secant(f1,0.002,0.007);\nrate = x * 12\n\n%%\n%（2）使用steffenson法求解。 \nclc;clear;\nf1 = @(x) 180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X] = steffenson(f1,0.005);\nrate = x * 12\n\n% newton_secant.m函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n% steffenson.m函数\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,56,7028 1519969437715824640,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-29 17:18:48,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%老师有三个m文件\n% r7_1.m\n% 你想买一套300万元的房子，首付40%，贷款20年，等额本息，\n% 已知月还款额为1.2万元，求贷款月利率为多少？\n% 等额本息是指一种贷款的还款方式，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。\n% 等额本息每月还款金额 = 〔贷款本金×月利率×(1+月利率)^还款月数〕÷〔(1+月利率)^还款月数-1〕\n% 公式推导见百度百科 \n%%\n% (1) 编写 结合牛顿下山法和割线法的综合迭代方法求解函数，调用后求解；\n% 设贷款月利率为x\n% 由上述公式列出方程：180*(x*(1+x)^240)/((1+x)^240-1)-1.2 = 0\nclc;clear;\nmonths = 240;\nf1 = @(x) 180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x,iter,X] = newton_secant(f1,0.002,0.007);\nrate = x * 12\n\n%%\n%（2）使用steffenson法求解。 \nclc;clear;\nf1 = @(x) 180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X] = steffenson(f1,0.005);\nrate = x * 12\n\n% newton_secant.m函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n% steffenson.m函数\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,55,6892 1519969467839332352,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:18:55,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx =\n 0.00426762528564472\niter =\n 4\nX =\n 0.00437256674949125\n 0.0042721389151354\n 0.00426763795820826\n 0.00426762528564472",WRONG_ANSWER,54,6756 1519969552958521344,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-29 17:19:15,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%牛顿下山法和割线法的综合迭代法函数 .m文件部分\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！！！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败啦！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,53,6908 1519969654003511296,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:19:39,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nendfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx =\n 0.00426762528564472\niter =\n 4\nX =\n 0.00437256674949125\n 0.0042721389151354\n 0.00426763795820826\n 0.00426762528564472",WRONG_ANSWER,61,6752 1519969798837026816,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-29 17:20:14,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%老师有三个m文件\n% r7_1.m\n% 你想买一套300万元的房子，首付40%，贷款20年，等额本息，\n% 已知月还款额为1.2万元，求贷款月利率为多少？\n% 等额本息是指一种贷款的还款方式，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。\n% 等额本息每月还款金额 = 〔贷款本金×月利率×(1+月利率)^还款月数〕÷〔(1+月利率)^还款月数-1〕\n% 公式推导见百度百科 \n%%\n% (1) 编写 结合牛顿下山法和割线法的综合迭代方法求解函数，调用后求解；\n% 设贷款月利率为x\n% 由上述公式列出方程：180*(x*(1+x)^240)/((1+x)^240-1)-1.2 = 0\nclc;clear;\nmonths = 240;\nf1 = @(x) 180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x,iter,X] = newton_secant(f1,0.002,0.007);\nrate = x * 12\n\n%%\n%（2）使用steffenson法求解。 \nclc;clear;\nmonths = 240;\nf1 = @(x) 180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x,iter,X] = steffenson(f1,0.005);\nrate = x * 12\n\n% newton_secant.m函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解函数\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0; % k统计迭代次数\nerr=x1-x0;% err表示迭代精度\nwhile abs(err)>eps\n k=k+1;\n lambda=1;%下山因子λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n% steffenson.m函数\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,57,6628 1519969841715396608,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:20:24,Octave,20.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数部分\nfunction x = ns(fun,x0,x1)\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \neps = 1e-6;\ncha = 1;\nwhile abs(cha) > eps\n\t lambda = 1;\n\t x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n\t f2 = feval(fun,x2);\n\t while abs(f2) >= abs(f1) \n lambda = lambda/2; \n x2 = x1-lambda*f1*(x1-x0)/(f1-f0); \n f2 = feval(fun,x2);\n end\n x0 = x1;\n x1 = x2;\n cha = x1-x0;\n f0 = f1;\n f1 = f2;\nend\nx=x2;\nend\n\n%调用部分\nN = input(\""\"");\nfun = @(x)N*(x*(x+1)^60)/((x+1)^60-1)-0.6;\nx = ns(fun,0.004,0.008);\nrate = 12*x",ACCEPTED,54,6504 1519969899978473472,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:20:38,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,55,6760 1519969927073677312,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:20:44,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx =\n 0.00426762528564472\niter =\n 4\nX =\n 0.00437256674949125\n 0.0042721389151354\n 0.00426763795820826\n 0.00426762528564472",WRONG_ANSWER,55,6696 1519969946103230464,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:20:49,Octave,20.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数部分\nfunction x = ns(fun,x0,x1)\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \neps = 1e-6;\ncha = 1;\nwhile abs(cha) > eps\n\t lambda = 1;\n\t x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n\t f2 = feval(fun,x2);\n\t while abs(f2) >= abs(f1) \n lambda = lambda/2; \n x2 = x1-lambda*f1*(x1-x0)/(f1-f0); \n f2 = feval(fun,x2);\n end\n x0 = x1;\n x1 = x2;\n cha = x1-x0;\n f0 = f1;\n f1 = f2;\nend\nx=x2;\nend\n\n%调用部分\nN = input(\""\"");\nfun = @(x)N*(x*(x+1)^60)/((x+1)^60-1)-0.6;\nx = ns(fun,0.004,0.008);\nrate = 12*x",ACCEPTED,58,6592 1519970087463845888,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:21:23,Octave,20.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数部分\nfunction x = ns(fun,x0,x1)\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \neps = 1e-6;\ncha = 1;\nwhile abs(cha) > eps\n\t lambda = 1;\n\t x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n\t f2 = feval(fun,x2);\n\t while abs(f2) >= abs(f1) \n lambda = lambda/2; \n x2 = x1-lambda*f1*(x1-x0)/(f1-f0); \n f2 = feval(fun,x2);\n end\n x0 = x1;\n x1 = x2;\n cha = x1-x0;\n f0 = f1;\n f1 = f2;\nend\nx=x2;\nend\n\n%调用部分\nN = input(\""\"");\nfun = @(x)N*(x*(x+1)^60)/((x+1)^60-1)-0.6;\nx = ns(fun,0.001,0.010);\nrate = 12*x",ACCEPTED,53,6764 1519970104668897280,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-29 17:21:27,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [xx,iter,X] = secant_down(fun,x0,x1,eps,maxiter)\n% 下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n error('输入参数至少需要3个！')\nend\nif nargin<4||isempty(eps)\n eps=1e-6;\nend\nif nargin<5||isempty(maxiter)\n maxiter=1e4;\nend\nk=0;err=1;\nwhile abs(err)>eps\n if k == maxiter\n error('迭代次数超限，迭代失败！')\n end\n lambda = 1;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n x = x1 - lambda*fx1*(x1-x0)/(fx1-fx0); %以 lambda=1进行第一次下山迭代\n fx = feval(fun,x1);\n while abs(fx)>=abs(fx0) || abs(fx)>=abs(fx1)\n lambda=lambda/2; % 更新lambda\n x = x1 - lambda*fx1*(x1-x0)/(fx1-fx0); \n fx = feval(fun,x);\n end\n k=k+1;\n x0 = x1;\n x1 = x;\n err = x1 - x0;\n X(k)=x;\nend\nxx=x;iter=k;X=X';\n\n\n\n% 等额本息，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。注意在还款过程中，每个月必须付清当月利息，且随着本金被还，利息会发生变化。\n% 设贷款月利率为x，贷款额度为s，总还款月数为n，每月还款数为m\n% 则第一月还欠银行： s(1+x) - m\n% 第二月还欠银行： [s(1+x) - m](1+x)-m = s(1+x)^2 -m[1+(1+x)]\n% 第三月还欠银行： { s(1+x)^2 -m[1+(1+x)]} (1+x) - m =s(1+x)^3-m[1+(1+x)+(1+x)^2]\n% 最后，第n月应不欠银行钱：s(1+x)^n-m[1+(1+x)+(1+x)^2+...+(1+x)^(n-1)]=0\n% 带入等比数列求和公式：s(1+x)^n-m[(1+x)^n-1]/x=0\n% 化简：sx(1+x)^n-m[(1+x)^n-1] = 0\n% 将s = 180（万元）；n = 还款月数；m = 1.2（万元）带入\n% 解方程：\n% 180x(1+x)^n/[(1+x)^n-1]-1.2 = 0\n% 就能求得贷款的月利率。\nn = input('请输入还款月数：');\nf = @(x) 180 .* x .* ((1 + x) .^ n) ./ ((1 + x) .^ n-1)-1.2; %目标函数\nx0 = 0.9;\nx1 = 1;\n[x,iter1,~] = secant_down(f,x0,x1,1e-7);\nrate = x * 12 % 故意不打分号好显示在命令行",WRONG_ANSWER,56,6600 1519970145655635968,9cd092dbf5d8b9545cdd9215c3fc11a8591f2fb41ac8b72d27ce0fa5d36fa1f4,2022-04-29 17:21:37,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('！')\nend\nx=12*x2;\niter=k;\nX=X';\nend\n\n\n",WRONG_ANSWER,53,6504 1519970222839218176,2b37fcb625a4d606b048477fda0e732db13f508c8d5f4ae2eeb6b3a65aa20523,2022-04-29 17:21:55,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"clc;clear\nN=input(\""\"");\nN=N*1e4;%贷款总额\nt=60;%贷款期数\nsyms x;%期利率（月）\nS=6000;%每期还款额\neps=1e-14;\n\n%S=(N.*x.*(1+x).^60)/((1+x).^60-1)%公式\nf=@(x)(N.*x.*(1+x).^60)/((1+x).^60-1)-S; %函数fx\n%f1=@(x)N.*((1+x).^t+t*x*(1+x).^(t-1))*((1+x).^t-1)./((1+x).^t-1).^2; %f'(x)\nf1=@(x)N.*(1-((1+x).^t-1-t.*x.*(1+x).^(t-1))./((1+x).^t-1).^2); %f'(x)\n\n%零点约在0.07~0.08\n\n\nx=[0.07,0,08]; %两个初始值\nfx=f(x(2));\niter=0;\n\nwhile(abs(fx(1))>eps)\n lambda=1;\n fx=[f(x(1)),fx];\n df=(f(x(1))/f1(x(1)));\n \n while(fx(1) >= abs(fx(2)))\n lambda=lambda/2;\n x1=x(1)-lambda*df;\n fx(1)=abs(f(x1));\n iter=iter+1;\n end\n \n x=[x(1)-f(x(1))/(fx(1)-fx(2))*(x(1)-x(2)),x];\n iter=iter+1;\nend\n\nrate=x(1)* 12;\n\nfprintf('rate= %f\\n',rate);\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,66,6644 1519970464200441856,9cd092dbf5d8b9545cdd9215c3fc11a8591f2fb41ac8b72d27ce0fa5d36fa1f4,2022-04-29 17:22:53,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数.m文件\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('！')\nend\nx=12*x2;\niter=k;\nX=X';\nend\n\n\n%命令行\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,55,6764 1519970502800609280,710aaf1141f4c81286701c32c69c0af3cf182f66fac98af1b0e3b57bc1133a0a,2022-04-29 17:23:02,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%牛顿下山法和割线法\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n\n\n%函数运行\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,61,6744 1519970539085533184,ca3275a0b0d6b3ab4ecc02d88aabefd444fe759801d237c8943ade7da0ffa4d5,2022-04-29 17:23:10,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%.m.文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end \n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行 设输入为30\ny = @(x) 12*(30*x.*(1+x).^60./((1+x).^60-1)-0.6);\n[x,iter,X]=newton_secant(y,4.7e-3,4.6e-3)",WRONG_ANSWER,54,6632 1519970584274972672,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 17:23:21,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,57,6512 1519970899468533760,fba72ad87dca911348b484210dd5d90f2a4f7063a489230c0df38b0729f7cee4,2022-04-29 17:24:36,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%function部分\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=12*x2;iter=k;X=X';\nend\n\n\n%命令行\na=input('请输入还款的总月数')\n fun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n [rate,iter,X]=newton_secant(fun,0.007,0.006);\n rate",WRONG_ANSWER,54,6516 1519971141718937600,8fc56a4cc857e0432f37e646cb300bcb6e590b3f079f3927f6fa1a01721ab1f8,2022-04-29 17:25:34,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n% 下山加割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1\n \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f1 = feval(fun,x1); % 计算x1处的函数值\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n end\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1);\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';",WRONG_ANSWER,52,6628 1519971452248428544,37dabc8303c5b6cfa55d6d71ec7085b4b6c523ac779aa2f4fdcd76e6e6d149d6,2022-04-29 17:26:48,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%secant_newton_down\nfunction [x,iter,X]=secant_newton_down(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\n\nwhile abs(x1-x0)>eps\n lamda=1;\n k=k+1;\n x2=x1-lamda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while(f2>=f1)\n lamda=lamda/2;\n x2=x1-lamda*f1*(x1-x0)/(f1-f0);\n end\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n%main\nfun=@(x)20*x*180+180-1.2*240;\nrate=secant_newton_down(fun,0,1,1e-8)",WRONG_ANSWER,53,6760 1519971490588561408,0b2fabcab9a5fa0d143bae4e7d23441ea08b4132e5abc7b4a0fd091a2c5dde7a,2022-04-29 17:26:57,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N = input(\""\"");\nf = @(t) N*(t*(1+t)^60)/((1+t)^60-1)-0.6;\nx0 = 0.0001;\nx1 = 1;\n\n[x, iter, X] = newton(f, x0, x1, [], []);\nrate = x*12\n\n\n\nfunction [x, iter, X] = newton(fun, x0, x1, eps, maxiter)\nif nargin<3, error(\""输入参数至少3个\""); end\nif nargin<4 || isempty(eps), eps = 1e-6; end\nif nargin<5 || isempty(maxiter), maxiter = 1e4; end\n\nk = 0;\nf0 = feval(fun, x0);\nf1 = feval(fun, x1);\nwhile abs(x1-x0) > eps\n lambda = 1;\n k = k + 1;\n x2 = x1 -lambda*f1*(x1-x0)/(f1-f0);\n f0 = f1;\n x0 = x1; \n x1 = x2;\n f1 = feval(fun, x1);\n while abs(f1) > abs(f0)\n lambda = lambda/2;\n x2 = x1 -lambda*f1*(x1-x0)/(f1-f0);\n f0 = f1;\n x0 = x1; \n x1 = x2;\n f1 = feval(fun, x1);\n end\n X(k) = x2;\nend\nif k >= maxiter\n error(\""迭代次数超限,迭代失败!\"")\nend\nx = x2;\niter = k;\nX = X';\nend\n",WRONG_ANSWER,59,6756 1519971548792930304,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 17:27:11,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%newton_secant.m文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行调用函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,55,6764 1519971549917003776,463be1f2fecf5093912e8ffd6e31f74697282540c4cd1221f234a2e66081be9f,2022-04-29 17:27:11,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%%%这是函数文件\nfunction [x,iter,X]=newton_secant(x2)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.007;\nx1=0.006;\nfun=@(x)180*(x*(1+x)^x2)/((1+x)^x2-1)-1.2;\n%if nargin<3,error('输入参数至少需要3个！'),end\nif nargin<2||isempty(eps),eps=1e-6;end\nif nargin<3||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\n\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n % format long;\n %digits(20)\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%%%%%%%这是调用文件\n[xx]=newton_secant(240);",WRONG_ANSWER,63,6852 1519971563925975040,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 17:27:15,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%newton_secant.m文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行调用函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6760 1519971599980204032,4b3cb76260a00d1bad9c34d83632434cc0327cdda846c3cde3ccfe6bb2a1bb18,2022-04-29 17:27:23,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"clc\nclear\nclose all\ny=input(\""\"")\nfun=@(x)180*(x*(1+x)^y)/((1+x)^y-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nrate=x*12;\nrate\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,56,6628 1519971603373395968,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 17:27:24,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%newton_secant.m文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n%命令行调用函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6760 1519971802955153408,69b7145b919964e66580172822e7936e4ee75f919599e9b2026e30f4d587b052,2022-04-29 17:28:12,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行代码\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nY=12*x",WRONG_ANSWER,57,6760 1519972123639066624,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-29 17:29:28,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%每月还款额=贷款本金×[月利率×(1+月利率) ^ 还款月数]÷{[(1+月利率) ^ 还款月数]-1}\nfunction [rate,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---rate：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;\nwhile abs(x1-x0)>eps\n lambda=1;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n f1 = feval(fun,x1); % 计算x1处的函数值\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); % 计算x2处的函数值\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); \n end \n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\niter=k;\nX=(X.*12)';\nrate=x2*12;\nend\n\n",WRONG_ANSWER,51,6764 1519972246502817792,375df8d2638d87ebcf0eb9a915ac794168195408bdd1fc6f52eca77e9c489741,2022-04-29 17:29:57,Octave,10.0,1519868557406523401,1517141269389144064,1141715823085969408," n=input('');\n i=1;\n for men=0:1:n\n for wumen=0:1:n\n boy=n-men-wumen;\n if 3*men+2*wumen+boy==50&&boy>-1\n Group(i).men = men;\n Group(i).wumen = wumen;\n Group(i).boy = boy;\n i=i+1;\n \n end\n end\n end\n fprintf('There are %d possible groups.\\n',i-1);\n for j=1:1:i-1\n fprintf('Group%d :%d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wumen,Group(j).boy);\n end",PARTIAL_ACCEPTED,58,6764 1519972272750759936,15283376953528d82da3139aa81805915ff55f004f324a7670759b14fa917349,2022-04-29 17:30:04,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('至少需要3个参数'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%以上为函数部分\n\n",WRONG_ANSWER,65,6784 1519972417039011840,e571704396733cee626a409753234450b161137fe70019305bbeb579f850fc93,2022-04-29 17:30:38,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%程序主体，输入months的值，输出x的值为年利率\n%例如直接输入240即可\n%work1.m\nformat long\nmonths = input(\""\""); %输入还款的月数\nfun=@(x)180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x] = newtonandsecant(fun,0.005,0.01)\n\n\n%牛顿下山法和割线法结合的方法函数\n%输入第一个值为方程主体，第二个值和第三个值为所搜素根的区间\n%第四个值为精度，第五个值为迭代次数\n%newtonandsecant.m\nfunction [x]=newtonandsecant(fun,x0,x1,eps,maxiter)\n if nargin<3,error('输入参数至少需要3个！'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n if nargin<5||isempty(maxiter),maxiter=1e4;end\n f0 = feval(fun,x0);\n f1 = feval(fun,x1);\n k = 0;\n while abs(x1 - x0)>eps\n k = k+1;\n lambda = 1;\n x2 = x1 - f1*lambda*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(x2)>=abs(x1)\n lambda = lambda / 2;\n x2 = x1 - f1*lambda*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n end\n x0 = x1;\n f0 = f1;\n x1 = x2;\n f1 = f2;\n end\n \n if (k > maxiter)\n error('迭代次数超限，迭代失败！')\n end\n x = x2 * 12;\nend",WRONG_ANSWER,53,6756 1519972438887141376,69b7145b919964e66580172822e7936e4ee75f919599e9b2026e30f4d587b052,2022-04-29 17:30:43,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行代码\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nY=12*x",WRONG_ANSWER,53,6748 1519972459867045888,dc0c57ad1f910d931ea02e0ef19754b276d97a250f46b70bedf9480730a651bf,2022-04-29 17:30:48,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"% 牛顿下山+割线法求解非线性方程的根\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n%主程序\n\n",WRONG_ANSWER,52,6508 1519972599977783296,83fad0ed61eaed5292929ed5e4b2101264b4b8681cdd6dec4e0b8f69e3e08600,2022-04-29 17:31:22,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%结合牛顿下山法和割线法的函数\nfunction rate=newton_secant(m)%牛顿下山法和割线法的综合迭代方法\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2;\neps=1e-6;\nmaxiter=1e4;\nx0=0.007;\nx1=0.006;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %割线法代替求导\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2;\nend\n\n%命令行中调用\nrate=newton_secant(240);\nrate",WRONG_ANSWER,56,6628 1519972651651600384,56a763ffb95810b8fd0286f421464ca7cf4ff37e84629a0b2d7663c47ee98aa8,2022-04-29 17:31:34,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n在命令行输入:\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;%根据等额年金公式，给出房贷月利率计算方程\n[x]=newton_down_secant(y,0.007,0.006)%",WRONG_ANSWER,54,6764 1519972821554462720,4ffd1f8c2fe8ec43531ad5ef73bf30440907d91d4912d4ec05c15575ba5a6cdf,2022-04-29 17:32:15,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"j=0;\nfield1='men'; value1=0;\nfield2='women'; value2=0;\nfield3='children'; value3=0;\ngroup=struct(field1, value1,field2, value2,field3, value3);\nN=input('N=');\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==N)\n j=j+1;\n group(j).men=man;\n group(j).women=woman;\n group(j).children=children;\n end\n end\n end\nend\nfprintf('There are %d possible groups.',j);\nfor i=1:j\n fprintf('Group %d: %d men, %d women, %d kids.\\n',i,group(i).men,group(i).women,group(i).children);\nend",WRONG_ANSWER,405,6764 1519972867482107904,374876f9a04d36c1751493baf087e546949307bc0aaa2e62611b2a3c54bd03a6,2022-04-29 17:32:25,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('输入N=');\nfun=@(x)N*(x*(1+x)^60/((1+x)^60-1))-0.6;\n\n[x,iter,X]=newton__down_gexian(fun,0.01,0.006);\nrate=x*12\n\n\nfunction [x,iter,X]=newton__down_gexian(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,57,6696 1519972870791409664,2fced53e4658af35e52be542acc8d7e91d212645defda6f1f098a6a40deeae4e,2022-04-29 17:32:26,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x]=homework3_1(t)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=1;\nx1=0.1;\neps=1e-8;\nmaxiter=1e4;\n%if nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nfunx=@(x)180*x*power(1+x,t)/(power(1+x,t)-1)-1.2;\ndfx=@(x)(180*(x + 1)^t)/((x + 1)^t - 1) + (180*t*x*(x + 1)^(t-1))/((x + 1)^t - 1) - (180*t*x*(x + 1)^(2*t-1))/((x + 1)^t - 1)^2;\nf0 = feval(funx,x0); % 计算x0处的函数值\nf1 = feval(funx,x1); % 计算x1处的函数值\nk=0;\ntol=1;\nwhile abs(x1-x0)>eps\n if(f0*f1>0)\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(funx,x1); % 计算x1处的函数值\n X(k)=x2;\n else\n lambda=1;\n fx0=feval(funx,x0);\n dfx0=feval(dfx,x0);\n x1=x0-lambda*fx0/dfx0;\n fx1=feval(funx,x1);\n dfx1=feval(dfx,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n fx1=feval(funx,x1);\n dfx1=feval(dfx,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\n if(abs(tol)eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\na=input('请输入还款期数')\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=X;\nrate\n",WRONG_ANSWER,56,6752 1519972944548245504,b82cc7e349e9c958e9f521eb8f448c438bb7347955ecbdf6d823eb6c85ec6d09,2022-04-29 17:32:44,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input(\""\"")\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n%以上是脚本行\n%以下是命令行\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n>> [x,iter,X]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,62,6804 1519973040006410240,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-29 17:33:07,Octave,10.0,1519868557406523398,1517166904926183424,1141715925804474368,"%每月还款额=贷款本金×[月利率×(1+月利率) ^ 还款月数]÷{[(1+月利率) ^ 还款月数]-1}\nfunction rate=newton_secant(fun,x0,x1,eps,maxiter)\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---rate：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;\nwhile abs(x1-x0)>eps\n lambda=1;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n f1 = feval(fun,x1); % 计算x1处的函数值\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); % 计算x2处的函数值\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); \n end \n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\niter=k;\nX=(X.*12)';\nrate=x2*12;\nend\n\n\n%调用格式\ny=@(x)(300.*0.6).*(x.*(1+x).^(20.*12))/((1+x).^(20.*12)-1)-1.2;\n#rate：年利率\nrate=newton_secant(y,1,0.5) \n",PARTIAL_ACCEPTED,63,6752 1519973086902927360,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-29 17:33:18,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"n=input('');\nx0=0.1;\nx1=1;\nerror=1e-7;\ny=@(x) 180*x*(1+x)^n/((1+x)^n-1)-1.2;\nwhile abs(y(x1))>error\n d=1;\n x2=x1-d*y(x1)*(x1-x0)/(y(x1)-y(x0)); %割线法\n while abs(y(x2))>abs(y(x1)) %牛顿下山法\n d=d/2;\n x2=x1-d*y(x1)*(x1-x0)/(y(x1)-y(x0));\n end\n x0=x1;\n x1=x2;\nend\nrate=vpa(x1*12,5)\n%运行代码后在命令行中输入240，即可求得rate=0.051212\n",WRONG_ANSWER,58,6928 1519973250052960256,85141451193ef05a80dc6518bfd13060cd94b8f146b04ea2714af27b74c96b45,2022-04-29 17:33:57,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%这是.m文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山和割线法求解非线性方程的根\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n这是.mlx文件\n\ny=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(y,7e-3,6e-3)",WRONG_ANSWER,56,6788 1519973288606990336,777d2749f7ff1bba46efd4ac2f93d18ff89c65e33c284b056e219bbcc9217825,2022-04-29 17:34:06,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x]=n_g(fun,x0,x1) %综合迭代法函数\neps=1e-6;\nf0=feval(fun,x0); \nf1=feval(fun,x1); \nk=0;\nc=1;\nwhile abs(c)>eps\n xsyz=1;\n x2=x1-xsyz*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n xsyz=xsyz/2; \n x2=x1-xsyz*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n c=x1-x0;\nk=k+1; \nX(k)=x1;\nend\nx=x2*12;\nround(x,-6);\nend\n\n\n%命令行窗口\nA=input(\""\"");fun=@(x)A*(x.*(1+x).^60)/((1+x).^60-1)-0.6;[x]=n_g(fun,0.1,0.05)",WRONG_ANSWER,57,6624 1519973325651083264,b94027b233bffa15c5f104abcd85cda858b400be130a3fdb3cb9ae9ea236d80d,2022-04-29 17:34:15,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"clc\nclear\nP = 180;%贷款总金额\nTm = 240;%贷款总月数\nSm = 1.2;%每个月还款数额\neps = 1e-14;%设定的误差限\n\nsyms x %设月利率为x\n\nf(x) = P*x*(1+x)^Tm/((1+x)^Tm - 1) - Sm;%函数f(x)\nf1(x) = P*(1 - ((1+x)^Tm - 1 - Tm*x*(1+x)^(Tm-1))/((1+x)^Tm - 1)^2);%函数f(x)的导数\n\n% 经初步估算，根在[0.004,0.005]\n\nt0 = cputime();\n\n%%%%牛顿下山法%%%%\nx0=0.004; %1、初始点 \n\nfx1 = abs(double(f(x0))); %f(x)的绝对值\n\nnumber_iteration0 = 0;\nF = [fx1];\nL = []; %记录每次迭代的下山因子lambda值\n\nwhile(fx1>eps)\n lambda = 1; %取下山因子lambda=1\n \n df = double(f(x0(1))/f1(x0(1))); %计算f(xk)/f'(xk)\n x1 = x0(1)-lambda*df; %计算xk+1=xk-lambda*f(xk)/f'(xk) \n fx1 = abs(double(f(x1)));\n number_iteration0 = number_iteration0+1;\n \n while(fx1 >= F(1)) %与上一个做比较，满足要求则取当前的lambda\n \n lambda = lambda/2; %lambda值减半\n x1 = x0(1) - lambda * df; \n fx1 = abs(double(f(x1)));\n \n number_iteration0 = number_iteration0+1;\n end\n \n F = [fx1,F];\n x0 = [x1,x0];\n L = [lambda,L];\nend\n\n t1=cputime();\n% % \n% % %%%%弦截法%%%%\nx1 = [0.004,0.005]; %两个初始点\n\nfx2 = double(f(x1(2)));\n\nnumber_iteration1 = 0;\n\nwhile(abs(fx2(1))>eps)\n\n fx2 = [double(f(x1(1))),fx2];\n x1 = [x1(1)-double(f(x1(1)))/(fx2(1)-fx2(2))*(x1(1)-x1(2)),x1]; %式4.16\n \n number_iteration1 = number_iteration1 + 1;\nend\n\nt2=cputime();\ntime1 = t1 - t0;\ntime2 = t2 - t1;\n% % \n% % %%%%综合算法%%%%\nx2 = [0.004,0.005]; %两个初始点\n\nfx2 = double(f(x2(2)));\nn = 0;\n\nwhile(abs(fx2(1))>eps)\n\n lambda = 1;\n \n fx2 = [double(f(x2(1))),fx2];\n df = double(f(x2(1))/f1(x2(1)));\n while(fx2(1) >= abs(fx2(2))) %与上一个做比较，满足要求则取当前的lambda\n \n lambda = lambda/2; %lambda值减半\n x1 = x2(1) - lambda * df; \n fx2(1) = abs(double(f(x1)));\n \n n = n + 1;\n end\n \n x2 = [x2(1)-double(f(x2(1)))/(fx2(1)-fx2(2))*(x2(1)-x2(2)),x2];\n n = n + 1;\nend\n\n\n% % %%%steffenson%%%%\n% % x3_0 = 0.0045;\n% % x3_1 = vpa(x3_0-double(f(x3_0)^2/(f(x3_0 + f(x3_0)) - f(x3_0))),8);\n% % \n% % number_steffenson = 0;\n% % \n% % while(abs(f(x3_0) - f(x3_1))>1e-16)\n% % \n% % x3_0 = x3_1;\n% % x3_1 = vpa(x3_0-double(f(x3_0)^2/(f(x3_0 + f(x3_0)) - f(x3_0))),8);\n% % number_steffenson = number_steffenson +1;\n% % \n% % end\n% % f(x3_0)\n% % % \nfprintf('弦截法方程的根x*为%f\\n', x2(1));\nfprintf('牛顿下山法方程的根x*为%f\\n', x0(1));\nfprintf('弦截法方程的根x*为%f\\n', x1(1));\nfunction [U,x]=Gauss(A,b)\nn=length(b);\n% 消元过程\nfor k=1:n-1 % 消元成上三角矩阵\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n) = A(k+1:n,k+1:n)-m*A(k,k+1:n); \n b(k+1:n) = b(k+1:n) - m*b(k); \n A(k+1:n,k) = zeros(n-k,1);\nend\nU=[A,b];\n% 回代过程\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); % 求x_n \nfor k=n-1:-1:1 % 回代\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); % 求x_k，k=n?1,n?2,...,1 \nend\nend\n",WRONG_ANSWER,56,6760 1519973366210002944,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 17:34:24,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('N= ');\nf=@(x)(6000-6000*x)*60-N*10000;\n[x,iter,X]=newton_secant(f,1,0);\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6756 1519973384031612928,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-29 17:34:29,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x]=newton_secant(fun,x0,x1,eps,maxiter,N)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nfun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=12*x1;\nend\n%命令行窗口输入如下\n%[x]=newton_secant(fun,0.007,0.006,30)\n",WRONG_ANSWER,52,6764 1519973598998073344,a967fa81fffeef7e3623462787577113f7aab977ca2b539f390d844cd7a7fba5,2022-04-29 17:35:20,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6756 1519973656451645440,3f206eab05c7364356c8893cc75f7db37d5d7fa7298db8876fe5d486d3187829,2022-04-29 17:35:34,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"% 牛顿下山法和割线法的综合迭代方法脚本文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\nend\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend \n\n%第二个脚本文件\nfunction rate=newton_secant_year(i)\nfun=@(x)180*(x*(1+x)^i)/((1+x)^i-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nrate=x*12\n\n%命令行输入\ni=240;\nrate=newton_secant_year(i)\n\n%结果\nx =\n\n 0.004267625285645\n\n\niter =\n\n 4\n\n\nX =\n\n 0.004372566749491\n 0.004272138915135\n 0.004267637958208\n 0.004267625285645\n\n\nrate =\n\n 0.051211503427737\n\n\nrate =\n\n 0.051211503427737",WRONG_ANSWER,57,6672 1519973782557601792,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 17:36:04,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"for x = 1:N\n for y = 1:N\n for z = 1:N\n if (30*x+20*y+10*z)==500&(x+y+z)==N\n fprintf('There are %d possible groups.\n Group n : %d men, %d women, %d kids.\\n',x,y,z);\n end\n end\n end\nend",WRONG_ANSWER,57,9300 1519973792770719744,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-29 17:36:06,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"num = 1;\nfor i = 1:16 % 男人最多16人\n for j = 1:25 % 女人最多25人\n for k = 1:50 % 孩子最多50人\n if (i+j+k == 30) && (30*i + 20*j + 10*k == 500)\n % 创建结构体\n Group(num).men = i;\n Group(num).women = j;\n Group(num).kids = k;\n num = num+1;\n end\n end\n end\nend\n% 按要求进行输出\ndisp(['There are ', num2str(num - 1) ,' possible groups.']);\nfor i = 1:(num -1)\n disp(['Group ', num2str(i) , ' : ', num2str(Group(i).men), ' men ', ...\n num2str(Group(i).women),' women ', ...\n num2str(Group(i).kids),' kids.']);\nend",WRONG_ANSWER,66,6508 1519973798131040256,05698a4e2cda61edb9742c0752ec40f3df0c2875d77dbe0106818d122e5b80d5,2022-04-29 17:36:07,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%主函数\nfunction result=main(input)\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\n[x,iter,X]=newton_down(fun,0.007,0.006)\n\nresult=x\nend\n\n%子函数\nfunction [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc\n%调用主函数\nresult=main(240);",WRONG_ANSWER,62,10400 1519973798374313984,316e038b70708a804a89d809ab509795fff29d276dbfa9f1fcb6f919001025bc,2022-04-29 17:36:07,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)6000*(x*(1+x)^60)/((1+x)^60-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=12*x;\n",WRONG_ANSWER,52,6768 1519973821837246464,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-29 17:36:13,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"n=input('');\nx0=0.1;\nx1=1;\nerror=1e-7;\ny=@(x) 180*x*(1+x)^n/((1+x)^n-1)-1.2;\nwhile abs(y(x1)-y(x0))>error\n d=1;\n x2=x1-d*y(x1)*(x1-x0)/(y(x1)-y(x0)); %割线法\n while abs(y(x2))>abs(y(x1)) %牛顿下山法\n d=d/2;\n x2=x1-d*y(x1)*(x1-x0)/(y(x1)-y(x0));\n end\n x0=x1;\n x1=x2;\nend\nrate=vpa(x1*12,5)\n%运行代码后在命令行中输入240，即可求得rate=0.051212\n",WRONG_ANSWER,66,6696 1519973828946591744,54e5c842414140a4f21f354c4a37f156ba0031674507c565ecba0ef3110af53b,2022-04-29 17:36:15,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"#函数部分：\nfunction [A,sum] = test(N)\nA=zeros(20,3);\nsum=1;\nfor i=0:16\n for j=0:25\n k=N-i-j;\n if k>=0\n if 30*i+20*j+10*k==500\n A(sum,1)=i;\n A(sum,2)=j;\n A(sum,3)=k;\n sum=sum+1;\n end\n end\n end\nend\n\nend\n\n\n#命令行部分：\ntest(20)\n\nans =\n\n 10 10 0\n 11 8 1\n 12 6 2\n 13 4 3\n 14 2 4\n 15 0 5\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0\n 0 0 0",WRONG_ANSWER,56,6908 1519973901994602496,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-29 17:36:32,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [xx,iter,X] = secant_down(fun,x0,x1,eps,maxiter)\n% 下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n error('输入参数至少需要3个！')\nend\nif nargin<4||isempty(eps)\n eps=1e-6;\nend\nif nargin<5||isempty(maxiter)\n maxiter=1e4;\nend\nk=0;err=1;\nwhile abs(err)>eps\n if k == maxiter\n error('迭代次数超限，迭代失败！')\n end\n lambda = 1;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n x = x1 - lambda*fx1*(x1-x0)/(fx1-fx0); %以 lambda=1进行第一次下山迭代\n fx = feval(fun,x1);\n while abs(fx)>=abs(fx0) || abs(fx)>=abs(fx1)\n lambda=lambda/2; % 更新lambda\n x = x1 - lambda*fx1*(x1-x0)/(fx1-fx0); \n fx = feval(fun,x);\n end\n k=k+1;\n x0 = x1;\n x1 = x;\n err = x1 - x0;\n X(k)=x;\nend\nxx=x;iter=k;X=X';\n\n\n\n% 等额本息，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。注意在还款过程中，每个月必须付清当月利息，且随着本金被还，利息会发生变化。\n% 设贷款月利率为x，贷款额度为s，总还款月数为n，每月还款数为m\n% 则第一月还欠银行： s(1+x) - m\n% 第二月还欠银行： [s(1+x) - m](1+x)-m = s(1+x)^2 -m[1+(1+x)]\n% 第三月还欠银行： { s(1+x)^2 -m[1+(1+x)]} (1+x) - m =s(1+x)^3-m[1+(1+x)+(1+x)^2]\n% 最后，第n月应不欠银行钱：s(1+x)^n-m[1+(1+x)+(1+x)^2+...+(1+x)^(n-1)]=0\n% 带入等比数列求和公式：s(1+x)^n-m[(1+x)^n-1]/x=0\n% 化简：sx(1+x)^n-m[(1+x)^n-1] = 0\n% 将s = 180（万元）；n = 还款月数；m = 1.2（万元）带入\n% 解方程：\n% 180x(1+x)^n/[(1+x)^n-1]-1.2 = 0\n% 就能求得贷款的月利率。\nn = input('请输入还款月数：');\nf = @(x) 180 .* x .* ((1 + x) .^ n) ./ ((1 + x) .^ n-1)-1.2; %目标函数\nx0 = 0.9;\nx1 = 1;\n[x,iter1,~] = secant_down(f,x0,x1,1e-7);\nrate = x * 12 % 不打分号好显示在命令行",WRONG_ANSWER,58,6636 1519973906507677696,322adba04b5755cec39a5e4fb87aaf97aeb114e229be20470b5490c944d307c4,2022-04-29 17:36:33,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数\nfunction x=newton_secant(N)\n% 牛顿下山+割线法求解非线性方程的根\n% N:汽车总价\n% 输出参数：\n% x：非线性方程的近似根\nx0=0.007;%x0：初始迭代点\nx1=0.006;%x1：初始迭代点\neps=1e-6;%精度要求，默认值为1e-6\nmaxiter=1e4;%最大迭代次数，默认值为1e4\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6; % ---fun：迭代函数\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n %X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;%iter=k;X=X'*12;\nend\n\n%脚本\nx=newton_secant(30)\n",WRONG_ANSWER,53,6760 1519973928305463296,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 17:36:38,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('N= ');\nf=@(x)(6000-6000*x)*60-N*10000;\n[x,iter,X]=newton_secant(f,1,0);\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,68,24616 1519973968260399104,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-29 17:36:48,Octave,20.0,1519868557406523398,1517166904926183424,1141715925804474368,n=input('');\nx0=0.1;\nx1=1;\nerror=1e-7;\ny=@(x) 180*x*(1+x)^n/((1+x)^n-1)-1.2;\nwhile abs(y(x1)-y(x0))>error\n d=1;\n x2=x1-d*y(x1)*(x1-x0)/(y(x1)-y(x0)); %割线法\n while abs(y(x2))>abs(y(x1)) %牛顿下山法\n d=d/2;\n x2=x1-d*y(x1)*(x1-x0)/(y(x1)-y(x0));\n end\n x0=x1;\n x1=x2;\nend\nrate=x1*12\n%运行代码后在命令行中输入240，即可求得rate=0.051212\n,ACCEPTED,62,13880 1519974026087268352,1e7d523070165b3c68e4856beb693fe9b5bb1df05f64ad4eb1281c85fca58524,2022-04-29 17:37:02,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;\nfx0 =feval(fun,x0);\nfx1= feval(fun,x1);\nwhile abs(x1-x0)>eps\n lambda=1;\n x2=x1-lambda*fx1*(x1-x0)/(fx1-fx0);\n fx2 = feval(fun,x2);\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n fx2=feval(fun,x2);\n x0=x1;\n end\n k=k+1;\n fx0 = fx1;\n x0=x1;x1=x2; \n fx1=feval(fun,x1);\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n%以下为函数调用\nx=0:0.01:2;\nN = input('请输入总额')\nfun=@(x)((N.*x.*(1+x).^60)./((1+x).^60 - 1)) - 0.6;\n[xx,iter,X]=newton_down(fun,0.1,0.11,1e-8,1e4);\nxx = xx*12",WRONG_ANSWER,53,6504 1519974080114114560,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-29 17:37:15,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [xx,iter,X] = secant_down(fun,x0,x1,eps,maxiter)\n% 下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3\n error('输入参数至少需要3个！')\nend\nif nargin<4||isempty(eps)\n eps=1e-6;\nend\nif nargin<5||isempty(maxiter)\n maxiter=1e4;\nend\nk=0;err=1;\nwhile abs(err)>eps\n if k == maxiter\n error('迭代次数超限，迭代失败！')\n end\n lambda = 1;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n x = x1 - lambda*fx1*(x1-x0)/(fx1-fx0); %以 lambda=1进行第一次下山迭代\n fx = feval(fun,x1);\n while abs(fx)>=abs(fx0) || abs(fx)>=abs(fx1)\n lambda=lambda/2; % 更新lambda\n x = x1 - lambda*fx1*(x1-x0)/(fx1-fx0); \n fx = feval(fun,x);\n end\n k=k+1;\n x0 = x1;\n x1 = x;\n err = x1 - x0;\n X(k)=x;\nend\nxx=x;iter=k;X=X';\nend\n\n\n% 等额本息，指在还款期内，每月偿还同等数额的贷款(包括本金和利息)。注意在还款过程中，每个月必须付清当月利息，且随着本金被还，利息会发生变化。\n% 设贷款月利率为x，贷款额度为s，总还款月数为n，每月还款数为m\n% 则第一月还欠银行： s(1+x) - m\n% 第二月还欠银行： [s(1+x) - m](1+x)-m = s(1+x)^2 -m[1+(1+x)]\n% 第三月还欠银行： { s(1+x)^2 -m[1+(1+x)]} (1+x) - m =s(1+x)^3-m[1+(1+x)+(1+x)^2]\n% 最后，第n月应不欠银行钱：s(1+x)^n-m[1+(1+x)+(1+x)^2+...+(1+x)^(n-1)]=0\n% 带入等比数列求和公式：s(1+x)^n-m[(1+x)^n-1]/x=0\n% 化简：sx(1+x)^n-m[(1+x)^n-1] = 0\n% 将s = 180（万元）；n = 还款月数；m = 1.2（万元）带入\n% 解方程：\n% 180x(1+x)^n/[(1+x)^n-1]-1.2 = 0\n% 就能求得贷款的月利率。\nn = input('请输入还款月数：');\nf = @(x) 180 .* x .* ((1 + x) .^ n) ./ ((1 + x) .^ n-1)-1.2; %目标函数\nx0 = 0.9;\nx1 = 1;\n[x,iter1,~] = secant_down(f,x0,x1,1e-7);\nrate = x * 12 % 不打分号好显示在命令行",WRONG_ANSWER,72,23668 1519974203447607296,2b37fcb625a4d606b048477fda0e732db13f508c8d5f4ae2eeb6b3a65aa20523,2022-04-29 17:37:44,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"syms x;%男人\nsyms y;%女人\nsyms z;%小孩\nn=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if (x+y+z==30)&(30*x+20*y+10*z==500)\n n=n+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',n)\nn=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if (x+y+z==30)&(30*x+20*y+10*z==500)\n n=n+1;\n fprintf('Group%d :%d men, %d women, %d kids.\\n',n,x,y,z)\n %print('Group',n,':',x,' men,',y,' women,',z,' kids.') \n end\n end\n end\nend",WRONG_ANSWER,42,23668 1519974244904108032,b94027b233bffa15c5f104abcd85cda858b400be130a3fdb3cb9ae9ea236d80d,2022-04-29 17:37:54,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"clc\nclear\nP = 180;%贷款总金额\nTm = 240;%贷款总月数\nSm = 1.2;%每个月还款数额\neps = 1e-14;%设定的误差限\n\nsyms x %设月利率为x\n\nf(x) = P*x*(1+x)^Tm/((1+x)^Tm - 1) - Sm;%函数f(x)\nf1(x) = P*(1 - ((1+x)^Tm - 1 - Tm*x*(1+x)^(Tm-1))/((1+x)^Tm - 1)^2);%函数f(x)的导数\n\n% 经初步估算，根在[0.004,0.005]\n\nt0 = cputime();\n\n%%%%牛顿下山法%%%%\nx0=0.004; %1、初始点 \n\nfx1 = abs(double(f(x0))); %f(x)的绝对值\n\nnumber_iteration0 = 0;\nF = [fx1];\nL = []; %记录每次迭代的下山因子lambda值\n\nwhile(fx1>eps)\n lambda = 1; %取下山因子lambda=1\n \n df = double(f(x0(1))/f1(x0(1))); %计算f(xk)/f'(xk)\n x1 = x0(1)-lambda*df; %计算xk+1=xk-lambda*f(xk)/f'(xk) \n fx1 = abs(double(f(x1)));\n number_iteration0 = number_iteration0+1;\n \n while(fx1 >= F(1)) %与上一个做比较，满足要求则取当前的lambda\n \n lambda = lambda/2; %lambda值减半\n x1 = x0(1) - lambda * df; \n fx1 = abs(double(f(x1)));\n \n number_iteration0 = number_iteration0+1;\n end\n \n F = [fx1,F];\n x0 = [x1,x0];\n L = [lambda,L];\nend\n\n t1=cputime();\n% % \n% % %%%%弦截法%%%%\nx1 = [0.004,0.005]; %两个初始点\n\nfx2 = double(f(x1(2)));\n\nnumber_iteration1 = 0;\n\nwhile(abs(fx2(1))>eps)\n\n fx2 = [double(f(x1(1))),fx2];\n x1 = [x1(1)-double(f(x1(1)))/(fx2(1)-fx2(2))*(x1(1)-x1(2)),x1]; %式4.16\n \n number_iteration1 = number_iteration1 + 1;\nend\n\nt2=cputime();\ntime1 = t1 - t0;\ntime2 = t2 - t1;\n% % \n% % %%%%综合算法%%%%\nx2 = [0.004,0.005]; %两个初始点\n\nfx2 = double(f(x2(2)));\nn = 0;\n\nwhile(abs(fx2(1))>eps)\n\n lambda = 1;\n \n fx2 = [double(f(x2(1))),fx2];\n df = double(f(x2(1))/f1(x2(1)));\n while(fx2(1) >= abs(fx2(2))) %与上一个做比较，满足要求则取当前的lambda\n \n lambda = lambda/2; %lambda值减半\n x1 = x2(1) - lambda * df; \n fx2(1) = abs(double(f(x1)));\n \n n = n + 1;\n end\n \n x2 = [x2(1)-double(f(x2(1)))/(fx2(1)-fx2(2))*(x2(1)-x2(2)),x2];\n n = n + 1;\nend\n\n\n% % %%%steffenson%%%%\n% % x3_0 = 0.0045;\n% % x3_1 = vpa(x3_0-double(f(x3_0)^2/(f(x3_0 + f(x3_0)) - f(x3_0))),8);\n% % \n% % number_steffenson = 0;\n% % \n% % while(abs(f(x3_0) - f(x3_1))>1e-16)\n% % \n% % x3_0 = x3_1;\n% % x3_1 = vpa(x3_0-double(f(x3_0)^2/(f(x3_0 + f(x3_0)) - f(x3_0))),8);\n% % number_steffenson = number_steffenson +1;\n% % \n% % end\n% % f(x3_0)\n% % % \nfprintf('弦截法方程的根x*为%f\\n', x2(1)*12);\nfprintf('牛顿下山法方程的根x*为%f\\n', x0(1)*12);\nfprintf('弦截法方程的根x*为%f\\n', x1(1)*12);\n\nfunction [U,x]=Gauss_column(A,b)\nn=length(b);\nfor k=1:(n-1)\n [Y,I]=max(abs(A(k:n,k))); % 返回绝对值最大的 a_kk 的值和位置 I=I+k?1;\n if I>k\n t=A(k,:); A(k,:)=A(I,:); A(I,:)=t;\n t=b(k); b(k)=b(I); b(I)=t;\n end\n m=A(k+1:n,k)/A(k,k);\n % 交换第 I 行和第 k 行元素\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); \nfor k=n-1:-1:1\n (b(k)-A(k,k+1:n).*x(k+1:n))/A(k,k)\n x(k)=(b(k)-A(k,k+1:n).*x(k+1:n))/A(k,k); \nend\nend",WRONG_ANSWER,66,23568 1519974312403054592,6fb9acc42c6f7edd07546ab5bffe4a8b7e151e81f0f866183d075ac29182fcda,2022-04-29 17:38:10,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"rate=secant(30);\n\nfunction x=secant(N)%割线法\n% 输入参数：\n% ---N：汽车总价\n% 输出参数：\n% ---x：年利率\nfun=@(x)((6000/x)*(1-1/(1+x)^60)-N*10000);\nx0=0.01;\nx1=0.1;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>1e-6\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\nend\nif k==1e4\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;\nend",WRONG_ANSWER,75,6696 1519974337929588736,de69ccc190b23929ddd5db7ce3035b27cc313b8084526232f87a09b9fb6d4a9e,2022-04-29 17:38:16,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"t=0;\nGroup.men=zeros(1,30);\nGroup.women=zeros(1,30);\nGroup.kids=zeros(1,30);\nfor i=1:30\n for j=1:30\n for k=1:30\n if(i*30+j*20+k*10==500)&(i+j+k==30)\n t=t+1;\n Group.men(t)=i;\n Group.women(t)=j;\n Group.kids(t)=k;\n end\n end\n end\nend\nGroup.men((t+1):30)=[];\nGroup.women((t+1):30)=[];\nGroup.kids((t+1):30)=[];\nfprintf('There are %d possible groups.',t);\nfor i=1:t\n disp(Group);\nend ",WRONG_ANSWER,348,6880 1519974343449280512,835e61d090360b03f6e4c6c287d66db0e0f471e8f430149b994390e262c1496e,2022-04-29 17:38:17,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"函数：\nfunction[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('wrong'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\n\nif k>=maxiter\nerror\nend\nx=x2;iter=k;X=X';\nend\n\n每月还款计算公式：\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\n命令行：\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,67,23260 1519974378622726144,7f30331b28b2b43c7ea9b3514394e8d5da330c8bc5c8cb79937b14824e65289f,2022-04-29 17:38:26,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"clear\nsyms x\nN=input(\""请输入金额（万元）\"")\nfx=(N*(x*(x+1)^60)/((1+x)^60-1))-0.6;\nrate=NW(fx,2,100)/12%牛顿下山,方程，初始值，迭代次数\nrate=GE(fx,1,2,100)/12%割线，方程，两个起始点，迭代次数\nfunction result=NW(h,x,n)%牛顿\nf=matlabFunction(h);%把符号表达式h转换成匿名函数并生成一个句柄指向h\nf1=matlabFunction(diff(h));%求导\nX(1)=x;%附上初始值\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));%牛顿下山法式子\n if abs(f(X(i))) <1e-6 %设置一个误差限\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\nfunction result2=GE(h,x1,x2,n)%割线法\nf=matlabFunction(h);%把符号表达式h转换成匿名函数并生成一个句柄指向h\nX(1)=x1;%附上初始值\nX(2)=x2;\ni=3;\n\nwhile 1\n X(i)=X(i-1)-(X(i-1)-X(i-2))*f(X(i-1))/(f(X(i-1))-f(X(i-2)));\n \n if abs(f(X(i))) <1e-6 %设置一个误差限\n result2=X(i);\n return;\n end\n if i>n\n result2=X(i);\n return;\n end\n i=i+1;\n \nend\n\n\nend\n\n\n\n\n\n\n\n",WRONG_ANSWER,55,6880 1519974458650038272,fd9c466caedf333e23bf9643fccb0580f3676bc85facde724587feb795706def,2022-04-29 17:38:45,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"m=input(\""\"");\nfun=@(x)180.*(x.*(1+x).^m)/((1+x).^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,67,14596 1519974490631606272,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-29 17:38:52,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"num = 1;\nfor i = 1:16 % 男人最多16人\n for j = 1:25 % 女人最多25人\n for k = 1:50 % 孩子最多50人\n if (i+j+k == 30) && (30*i + 20*j + 10*k == 500)\n % 创建结构体\n Group(num).men = i;\n Group(num).women = j;\n Group(num).kids = k;\n num = num+1;\n end\n end\n end\nend\n% 按要求进行输出\ndisp(['There are ', num2str(num - 1) ,' possible groups.']);\nfor i = 1:(num -1)\n disp(['Group ', num2str(i) , ' : ', num2str(Group(i).men), ' men, ', ...\n num2str(Group(i).women),' women, ', ...\n num2str(Group(i).kids),' kids.']);\nend",WRONG_ANSWER,63,6504 1519974518582460416,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-29 17:38:59,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [rate,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：fun=N*x*(1+x)^60-6000*(1+x)^59;\n% ---rate：年利率\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=12*x1;iter=k;X=X';\n",WRONG_ANSWER,52,6616 1519974541697269760,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-29 17:39:05,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [rate,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：fun=N*x*(1+x)^60-6000*(1+x)^59;\n% ---rate：年利率\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=12*x1;iter=k;X=X';\n",WRONG_ANSWER,71,21716 1519974544050262016,df43670d93c71a5a81933cf027b051d49e61791d47c0c9a2e7d7986fa1129288,2022-04-29 17:39:05,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N = input(\""\"");\nn = N*10000;\ninterest = @(x)((n/60)*(1+x)-6000);\nx0=0.004;\nx1=0.003;\nNewton_x = Newton_down_secant(interest,x0,x1);\nresult = 12*Newton_x ;\nfprintf('牛顿下山法和割线法的综合迭代方法求得利率为%f\\n',result);\nfunction x=Newton_down_secant(fun,x0,x1,eps,maxiter)\n if nargin<3,error('输入参数至少需要3个！'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<5|isempty(maxiter),maxiter=1e4;end\n f0 = feval(fun,x0);\n f1 = feval(fun,x1);\n k=0;\n while abs(x1-x0)>eps\n lambda=1;\n k=k+1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n end\n f0=f1;\n x0=x1;\n x1=x2;\n f1 = f2;\n end\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\n x=x2;\nend",WRONG_ANSWER,70,11344 1519974582553968640,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-29 17:39:14,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\nfor i=1:length(A)-1\n Group(i).men=A(i,1);\n Group(i).women=A(i,2);\n Group(i).kids=A(i,3);\nend",WRONG_ANSWER,337,6508 1519974617207308288,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-29 17:39:23,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%\n\ni=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(3*x+2*y+1*z)==50&(x+y+z)==30\n i=i+1;\n Group(i).men=x;\n Group(i).women=y;\n Group(i).kids=z;\n end\n end\n end\nend\nfprintf('There are%d possible groups\\n',i);\n\nfor m=1:i\n fprintf('Group%d:%dmen,%dwomen,%dkids\\n',m,Group(m).men,Group(m).women,Group(m).kids);\nend\n \n\n\n",WRONG_ANSWER,370,23560 1519974690934800384,452dbaba1affa4b0f0b99917503430deee206bb1dda12544fcedafba6aa0e554,2022-04-29 17:39:40,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function res = inner_product(n,cost)\ni=0;\nfor a=0:1:n\n for b= 0:1:n\n for c = 0:1:n\n if a+b+c==n&&30*a+20*b+c*10==cost\n i=i+1;\n group(i).men=a;\n group(i).women=b;\n group(i).kids=c;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,group(i).men,group(i).women,group(i).kids);\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i)\n\n%命令行\n%inner_product(20,500)",WRONG_ANSWER,63,12280 1519974822308786176,e9885256a18390955319ba083026ffda993f9c97e56a7f090816123123b687fc,2022-04-29 17:40:12,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%脚本\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行\nfun=@(x)30*(x*(1+x)^5)/((1+x)^5-1)-7.2\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nrate=x",WRONG_ANSWER,54,6772 1519974826188517376,b99f62f9677372395a515d02c849e7524508d85b79628561499e8075336da1ef,2022-04-29 17:40:12,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"clc;\nclear;\nfunction groupNumber(N)\n j=0;\n for men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)&(men+women+kids==N)\n \n j=j+1;\n A(j,1)=men;\n A(j,2)=women;\n A(j,3)=kids;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',j);\n \n for i=1:j\n fprintf('Group %d: %d men %d women %d kids.\\n',i,A(i,1),A(i,2),A(i,3));\n \n end\n \nend",WRONG_ANSWER,54,6760 1519974860523081728,31967e062eebed6f7314634b0b9b75861bb9ca4e101690f1105ec10ac7d990c5,2022-04-29 17:40:21,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%割线法函数表示如下\n\n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n%割线法实例如下\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=secant(y,4.7e-3,4.6e-3)\nm=12*x;\nm\n\n",WRONG_ANSWER,51,6748 1519974911869763584,13f73143a6f9b2dd397bf286e32e1ce8988a674b8c272afa9cfe84647408f115,2022-04-29 17:40:33,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%一共三个m文件\n%1.文件newton_secant.m：牛顿下山法和割线法的综合迭代方法函数\nfunction [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少要3个'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;tol=1; %tol是迭代精度\nwhile abs(tol)>eps\n lambda=1;%下山因子\n x2=x1-lambda*(x1-x0)/(f1-f0)*f1; %将牛顿下山法里的f'(x1)用割线法中f'(x1)=(f1-f0)/(x1-x0)代替\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*(x1-x0)/(f1-f0)*f1;\n f2=feval(fun,x2);\n end\n x0=x1;f0=f1;\n x1=x2;f1=f2; \n tol=x1-x0; \n k=k+1;\nend\nif k==maxiter \n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;\nend\n%2.文件clc.m，求年利率函数\nfunction rate=clcr(N)\nf=@(x)180*(x.*(1+x).^N)./((1+x).^N-1)-1.2;\n[xx,iter]=newton_secant(f,0.005,0.006,1e-14);%xx为月利率\nrate=xx*12;%输出为年利率\n%3.调用函数文件test.m\nN=240;\nrate=clcr(N)\n",WRONG_ANSWER,53,6764 1519974936427413504,aa06baf985457dd9153f13920f5af6fde5790398a212287e2719a6f90617f4d3,2022-04-29 17:40:39,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nx = input\""\"";\nfun=@(x)180*r.*(1+r).^240./((1+r).^240-1)-1.2;\n[xx,iter,X]=newton_down(fun,1,[],100) % 牛顿下山法求根\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nx = input(\""\"");\n[xx,iter,X]=secant(fun,1.5,1,1e-8) % 割线法求根",WRONG_ANSWER,53,6760 1519974956039979008,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 17:40:43,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n%命令行\nclear all\nfun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6; \n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n\n%当N=30时\nfun=@(x)30*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\n%可得结果\nx =\n\n 0.0742\n\n\niter =\n\n 4\n\n\nX =\n\n 0.0779\n 0.0740\n 0.0742\n 0.0742",WRONG_ANSWER,54,6632 1519974970397077504,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-29 17:40:47,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A",WRONG_ANSWER,677,6504 1519974983588155392,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-29 17:40:50,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%函数文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%脚本文件\nmonth=input(\""\"");\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x",WRONG_ANSWER,60,6876 1519974987325292544,de9a2b5ed2a77c2d0d315dbdecde6b8b9a6fe981d5545988f6aaef2930e476b4,2022-04-29 17:40:51,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"clear;\n\nN=input('N:');\nx = -1:1e-5:1;\nxi0 = 0.1;\nxi1 = 1;\nfun = @(t) N*(t*(1+t)^60)/((1+t)^60-1)-0.6;\n[x0, iter, X] = newton(fun, xi0, xi1, [], 100);\n\ny = zeros(length(x), 1);\nfor i = 1:length(x)\n y(i) = fun(x(i));\nend\n\nfprintf(\""迭代过程: %e\\n\"", X);\nfprintf(\""迭代次数: %d\\n\"", iter);\nfprintf(\""零点: %e\\n\"", x0);\n\nfunction [x, iter, X] = newton(fun, x0, x1, eps, maxiter)\n\nif nargin<3, error(\""输入参数至少3个\""); end\nif nargin<4 || isempty(eps), eps = 1e-6; end\n%if nargin<5 || isempty(maxiter), maxiter = 1e4; end\n\nk = 0;err=1;\nf0 = feval(fun, x0);\n%f1 = feval(fun, x1);\n\nwhile abs(err) > eps\n% lambda = 1;\n k = k + 1;\n f0 = feval(fun, x0);\n x1=x0-f0^2/(feval(fun,x0+f0)-f0);\n err=x1-x0;\n \n x0 = x1; \n \n \n X(k) = x1;\nend\nx = x1;\niter = k;\nX = X';\n\nend\n",WRONG_ANSWER,53,6504 1519975054878748672,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-29 17:41:07,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"num = 1;\nfor i = 0:16 % 男人最多16人\n for j = 0:25 % 女人最多25人\n for k = 0:50 % 孩子最多50人\n if (i+j+k == 30) && (30*i + 20*j + 10*k == 500)\n % 创建结构体\n Group(num).men = i;\n Group(num).women = j;\n Group(num).kids = k;\n num = num+1;\n end\n end\n end\nend\n% 按要求进行输出\ndisp(['There are ', num2str(num - 1) ,' possible groups.']);\nfor i = 1:(num -1)\n disp(['Group ', num2str(i) , ' : ', num2str(Group(i).men), ' men, ', ...\n num2str(Group(i).women),' women, ', ...\n num2str(Group(i).kids),' kids.']);\nend",WRONG_ANSWER,69,6488 1519975057466626048,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-29 17:41:08,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n%直接运行",WRONG_ANSWER,675,6760 1519975098528870400,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 17:41:17,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"input=('N')\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)…\n &(man+woman+children==30)\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,51,6744 1519975142279659520,37dabc8303c5b6cfa55d6d71ec7085b4b6c523ac779aa2f4fdcd76e6e6d149d6,2022-04-29 17:41:28,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"%main\n[s,num]=hanshu(20,500);\ndisp(s);\ndisp(num);\n\n\n\n%function\nfunction [group,k] = hanshu(n,money)\nnum=money/10;\nk=0;\nfor child=1:num\n for woman=1:num\n for man=1:num\n if((child+woman+man)==n&&(man*30+woman*20+child*10==money))\n k=k+1;\n group(k).men=man;\n group(k).women=woman;\n group(k).kids=child;\n end\n end\n end\nend\n\n\n",WRONG_ANSWER,58,6752 1519975146788536320,b99f62f9677372395a515d02c849e7524508d85b79628561499e8075336da1ef,2022-04-29 17:41:29,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function groupNumber(N)\n j=0;\n for men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)&(men+women+kids==N)\n \n j=j+1;\n A(j,1)=men;\n A(j,2)=women;\n A(j,3)=kids;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',j);\n \n for i=1:j\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,A(i,1),A(i,2),A(i,3));\n \n end\n \nend",WRONG_ANSWER,52,6748 1519975147098902528,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 17:41:29,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"for man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)…\n &(man+woman+children==30)\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,55,6624 1519975181794197504,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-29 17:41:37,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"fun=@(x,t)180*((x/12)*(1+(x/12))^t)/((1+(x/12))^t-1)-1.2;\n[rate]=newton_secant(fun,0.007,0.006,240,1e-6,1e4);\nfunction [rate]=newton_secant(fun,x0,x1,t,eps,maxcount)\nf0 = feval(fun,x0,t); \nf1 = feval(fun,x1,t); \nk=0;err=1;\nwhile abs(err)>eps\n\tlam=1;%下山因子\n\tx2=x1-lam*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2,t);\n\twhile abs(f2)>=abs(f1) \n lam=lam/2; \n x2=x1-lam*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2,t);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nif k>=maxcount\n error('超出迭代次数')\nend\nrate=x2;\nend",WRONG_ANSWER,55,6764 1519975214660751360,10b87770fc2bf977a8f2786c6b2628738ef909566a2f90b90a7e7cd9530fff65,2022-04-29 17:41:45,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%以上为函数文件\n\nprompt = 'input ';\nN = input(prompt)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nresult=x*12\n以上为命令行窗口所输入代码",WRONG_ANSWER,64,6780 1519975228778786816,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-29 17:41:48,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%函数文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%脚本文件\nmonth=input(\""\"");\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x",WRONG_ANSWER,56,6752 1519975239566540800,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-29 17:41:51,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%以下为mlx文件，在本地matlab运行正常，输出结果正常\n\ni=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(3*x+2*y+1*z)==50&(x+y+z)==30\n i=i+1;\n Group(i).men=x;\n Group(i).women=y;\n Group(i).kids=z;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i);\n\nfor m=1:i\n fprintf('Group %d : %d men, %d women , %d kids.\\n',m,Group(m).men,Group(m).women,Group(m).kids);\nend\n \n%输出结果为：\n\n",PRESENTATION_ERROR,345,6512 1519975256855457792,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-29 17:41:55,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"\nfunction [rate]=newton_secant(fun,x0,x1,t,eps,maxcount)\nf0 = feval(fun,x0,t); \nf1 = feval(fun,x1,t); \nk=0;err=1;\nwhile abs(err)>eps\n\tlam=1;%下山因子\n\tx2=x1-lam*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2,t);\n\twhile abs(f2)>=abs(f1) \n lam=lam/2; \n x2=x1-lam*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2,t);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nif k>=maxcount\n error('超出迭代次数')\nend\nrate=x2;\nend",WRONG_ANSWER,54,6504 1519975356730228736,8fc56a4cc857e0432f37e646cb300bcb6e590b3f079f3927f6fa1a01721ab1f8,2022-04-29 17:42:19,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant_down1(N)\n% 下山加割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\nfun=@(x)N.*x.*(1+x).^60/((1+x).^60-1)-0.6;\neps=1e-6;\nmaxiter=1e4;\nx0=1.5;\nx1=1;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1\n \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f1 = feval(fun,x1); % 计算x1处的函数值\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n end\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1);\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n",WRONG_ANSWER,52,6628 1519975361524301824,b99f62f9677372395a515d02c849e7524508d85b79628561499e8075336da1ef,2022-04-29 17:42:20,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"clc;\nclear;\nN=input(\""\"");\ngroupNumber(N);\nfunction groupNumber(N)\n j=0;\n for men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)&(men+women+kids==N)\n \n j=j+1;\n A(j,1)=men;\n A(j,2)=women;\n A(j,3)=kids;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',j);\n \n for i=1:j\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,A(i,1),A(i,2),A(i,3));\n \n end\n \nend",WRONG_ANSWER,64,6884 1519975405484806144,20e8a9524f0c09f38accb58e043119f83ebe95cefd58c13b3f894a2f5ee3f08f,2022-04-29 17:42:31,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"函数：\nfunction [x,iter,X]=zonghe(fun,x0,x1,eps,maxiter)\nif nargin<3,error(),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nk=0;tol=1;\nwhile abs(tol)>eps\n lambda=1;\nf1=feval(fun,x1);\n f0=feval(fun,x0);\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n x0=x1;x1=x2;\nend\ntol=x2-x1;\nx0=x1;x1=x2;\n k=k+1;\nX(k)=x2;\nend\nif k==maxiter\nerror('迭代次数超过,失败')\nend\nx=x2;iter=k;X=X';\n调用：\nx=0:0.01:2;\nf=@(x)30.*x.*(1+x).^60./((1+x).^60-1)-0.6;\n[xx,iter,X]=zonghe(f,0.007,0.0065,1e-8)\ny=30.*x.*(1+x).^60./((1+x).^60-1)-0.6;\nz=30.*x.*(1+x).^60./((1+x).^60-1)-0.6;\nplot(x,y,[0,2],[0,0],'k:',xx,z,'k*');\nrate=xx*12;\n输出：\nrate：0.074201",WRONG_ANSWER,52,6488 1519975460040118272,e4e4310f4d2dc97fa8f38c36e5cc2611a3ba4e76ba57069b6c417f521dba9c4e,2022-04-29 17:42:44,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,function y=Untitled(x)\n\nk=240;A0=1800000;m0=12000;\ny=x.^(k+1)-(1+m0/A0)*x.^k+m0/A0;,WRONG_ANSWER,53,6496 1519975515644002304,b6a720c2f254e11023f2c1bb066c68ae34be87329f1e02ec8981931b73970f59,2022-04-29 17:42:57,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"num = 1;\nfor i = 0:16 % 男人最多16人\n for j = 0:25 % 女人最多25人\n for k = 0:50 % 孩子最多50人\n if (i+j+k == 30) && (30*i + 20*j + 10*k == 500)\n % 创建结构体\n Group(num).men = i;\n Group(num).women = j;\n Group(num).kids = k;\n num = num+1;\n end\n end\n end\nend\n% 按要求进行输出\ndisp(['There are ', num2str(num - 1) ,' possible groups.']);\nfor i = 1:(num -1)\n disp(['Group ', num2str(i) , ' : ', num2str(Group(i).men), ' men, ', ...\n num2str(Group(i).women),' women, ', ...\n num2str(Group(i).kids),' kids.']);\nend",WRONG_ANSWER,74,6752 1519975547730427904,d2809b03269b3411fa5db4c5e4536bbaee5e6e740e230f0816bb24107f2512d7,2022-04-29 17:43:05,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"x = 0:0.0001:0.01;\n[xx,iter,X]=secant_down(@f1,0.01,0.009,0.00001,100) % 割线法+牛顿下山法求根\n%plot(x,f1(x),[0,0.01],[0,0],'k:',xx,f1(xx),'k*') % 绘制图形\n%text(0,0.2,['月利率=',num2str(xx)],'fontname','宋体','fontsize',12) % 添加标注\n%title('\\fontname{隶书}\\fontsize{16}割线法+牛顿下山法求根') % 添加标题\ndisp(['rate = ',num2str(xx)]);\n\nfunction [y,dy] = f1(x)\n% 函数描述文件，主要功能是求解函数表达式的值及其导数值\n syms t\n y = 180.*(t.*(1+t).^240./((1+t).^240-1))-1.2; % 计算函数值\n dy = diff(y); % 求1阶导数\n t = x;\n dy = eval(dy); % 求数值\n y = eval(y);\nend\n\n\nfunction [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n% 割线法+牛顿下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); %计算x2处的函数值\n while abs(f2)>= min(abs(f0),abs(f1))\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %牛顿下山迭代\n f2 = feval(fun,x2); %计算x2处的函数值\n end\n k=k+1;\n f0=f1;\n x0=x1;x1=x2;\n f1 = f2;\n X(k)=x2;\n\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6748 1519975602709364736,c6e1f1aaeff3de60cf75386c81ad3c8a5633d92c811fb2d17ce04fa7dee26c2e,2022-04-29 17:43:18,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%%%%%函数func.m\nfunction x=func(y,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nt=y;\nfun=@(x)180*(x*(1+x)^t)/((1+x)^t-1)-1.2;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值k=0;err=1;%k统计迭代次数，err表示迭代精度\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=0.8;%\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2\nend\n\n\n%%%%脚本test.mlx\nclear \nrate=func(240,0.6,0.5);\n",WRONG_ANSWER,59,6756 1519975653867294720,fd9c466caedf333e23bf9643fccb0580f3676bc85facde724587feb795706def,2022-04-29 17:43:30,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"m=input(\""\"");\nfun=@(x)180.*(x.*(1+x).^m)/((1+x).^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6752 1519975693604130816,091f0392b331a8b8c3534214661464554a7eaf4a639a470339b492ab9107d2c6,2022-04-29 17:43:39,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\nfor woman=1:30\nfor children=1:30\n k=0;\nif(man*30+woman*20+children*10==500)...\n&(man+woman+children==30)\nj=j+1;\nGroup(j).men=man;\nGroup(j).wemen=woman;\nGroup(j).kids=children;\n\nend\nend\nend\nend\nj\nGroup(1).men\ndisp(\""There are \""+j+' posibble groups');\nfor i=1:j\n disp(\""Group \""+i+\"" : \""+Group(i).men+\"" men, \""+Group(i).wemen+\"" women,\""+Group(i).kids+\"" kids.\"") \nend\n\n",WRONG_ANSWER,353,6780 1519975701099352064,db1c35ac47bb5336d021da8802e313d9a6cf867b4eaf148bdf4eb429ba0912ce,2022-04-29 17:43:41,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%牛顿下山法函数\nfunction[x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x1;iter=k;X=X';\n\n%割线法函数\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1=feval(fun,x1);\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X'\n\n\n%牛顿法\nN=input('输入汽车总价:');\nN=double(N);\nA0=0 ;%首付\nb=6000;m=60; %b为月还贷，m为还贷总月数\nfun=@(r,A,A0,b,m)b/r*(1-1/(1+r)^m-(A-A0));\nfplot(@(r)fun(r,A,A0,b,m),[0,1]);\nhold on\nplot(xlim,[0,0],'k')\n[x,y]=ginput(1) %交互取一个点\nmrate=newton_down(@(r)fun(r,A,A0,b,m),x)\nyrate=12*mrate(1)\nfprintf('输出为年利率:%d\\n',yrate)\n\n\n%割线法\nN=input('输入汽车总价:');\nN=double(N);\nA0=0 ;%首付\nb=6000;m=60; %b为月还贷，m为还贷总月数\nfun=@(r,A,A0,b,m)b/r*(1-1/(1+r)^m-(A-A0));\nfplot(@(r)fun(r,A,A0,b,m),[0,1]);\nhold on\nplot(xlim,[0,0],'k')\n[x,y]=ginput(1) %交互取一个点\nmrate=secant(@(r)fun(r,A,A0,b,m),x，x+0.01)\nyrate=12*mrate(1)\nfprintf('输出为年利率:%d\\n',yrate)",WRONG_ANSWER,53,6764 1519975721886322688,fd9c466caedf333e23bf9643fccb0580f3676bc85facde724587feb795706def,2022-04-29 17:43:46,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"m=input(\""\"");\nfun=@(x)180.*(x.*(1+x).^m)/((1+x).^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6760 1519975756153782272,1b133135fd48a5e2d49f02b56e6e64c6af707f3195b3d35b299653fe7cc37fbd,2022-04-29 17:43:54,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%脚本\nclear\nclc\nr = 0.002 : .001:.005;\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=secant(y,4.7e-3,4.6e-3);\nresult_2=x*12\n%函数\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6752 1519975767595843584,31903a69de4b52fb5741c18e6455623a3936da0d5c61f1f34eb1b43749ee84e4,2022-04-29 17:43:57,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"clear\na=0.003;b=0.005;c=0.0001;x0=0.004;x1=0.003;\ny=input(\""\"");\nx=a:c:b;\nfun=@(x)180.*x.*(1+x).^y./((1+x).^y-1)-1.2;\n%diff(fun(x))\n[xx,iter,X]=newton_down(fun,x0);\nrate=xx\n\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\n%f = @(x) x.^2 + 2.* x + 1 % 通过函数句柄建立匿名函数\n%syms x % 通过符号变量将匿名函数转换为符号函数\n%y = f(x)\n%g = matlabFunction(diff(y)) % 通过matlabFunction将符号函数转换为匿名函数\nsyms xxx\ny=matlabFunction(diff(fun(xxx)));\nwhile abs(tol)>eps\n lambda=1;\n fx0=feval(fun,x0);\n dfx0=feval(y,x0);\n x1=x0-lambda*fx0/dfx0;\n fx1=feval(fun,x1);\n dfx1=feval(y,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n fx1=feval(fun,x1);\n dfx1=feval(y,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,56,6768 1519975885975896064,cd3b40bf172be9704fd5db3326ece05f44a8ec13ea9869c713448a3000f61022,2022-04-29 17:44:25,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"x=240;\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx,iter,X\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,58,6760 1519975961729216512,78c16fef4e79887f479b549c5fe8451beb184e276b5effcf79a62998ccbc7829,2022-04-29 17:44:43,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n\n",WRONG_ANSWER,54,6636 1519976005572280320,e4e4310f4d2dc97fa8f38c36e5cc2611a3ba4e76ba57069b6c417f521dba9c4e,2022-04-29 17:44:54,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,function y=Untitled(x)\n\nk=240;A0=1800000;m0=12000;\ny=x.^(k+1)-(1+m0/A0)*x.^k+m0/A0;\nend,WRONG_ANSWER,54,6628 1519976102120947712,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 17:45:17,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=0:men_max\n for j=0:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group))\nfor i=1:length(Group)\n fprintf('Group&d: %dmen, &dwomen, &dkids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,62,7036 1519976230798016512,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 17:45:47,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('N= ');\nf=@(x)(6000-6000*x)*60-N*10000;\n[x,iter,X]=newton_secant(f,1,0);\nrate=12*x;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6748 1519976234203779072,0b18170b74bfec01ccc583abc0ae720e7724c1a399b35d6a600f381ab68d4e84,2022-04-29 17:45:48,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"month=input(\""\"");\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1);\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6920 1519976285323964416,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 17:46:00,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=0:men_max\n for j=0:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group))\nfor i=1:length(Group)\n fprintf('Group%d: %dmen, %dwomen, %dkids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,60,6748 1519976337744375808,557be65c5cc83173fbab470e1dc19fdd7071d672c119e818ea4436ee1013ecaf,2022-04-29 17:46:13,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%-command window\n>> N=30;\n>> fun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n>> [x,iter,X]=newton_secant(fun,0.007,0.006);\n>> rate=12*x\n\nrate =\n\n 0.074201",WRONG_ANSWER,53,6496 1519976429633191936,b51b55238ecf0d77a90b77baad36ab74a567a9ad6ef124d3b3c477ba51af8c8d,2022-04-29 17:46:35,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"clear all;clc;\n\n% i 行数\n%man 男人数\n%woman 女人数\n%child 孩子数\n\ni = 0\n\n\nfor man = (1:30)\n for woman = (1:30)\n for child = (1:30)\n if (30*man + 20*woman + 10*child == 500)...\n &(man + woman + child == 30)\n i = i+1\n Group(i).men = man\n Group(i).women = woman\n Group(i).kids = child\n end\n end\n end\nend\nfprintf('There are %d possible groups. \\n',i)\nfor j = (1:i)\n fprintf('Group %d : %d man, %d women, %d kids \\n',i,Group(j).men,...\n Group(j).women,Group(j).kids)\nend\n",WRONG_ANSWER,342,6716 1519976464211017728,fbb0d0e430aa6bc439c7c424fdd6c30dd9183e72d482420c05047bd15856881d,2022-04-29 17:46:43,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%main.m\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nrate=newton_down(fun,0.007,0.006)\n\n\n\n\n\n\n%newton_down.m\nfunction [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,56,6632 1519976598370037760,78c16fef4e79887f479b549c5fe8451beb184e276b5effcf79a62998ccbc7829,2022-04-29 17:47:15,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,52,6756 1519976779157127168,6a6c6132b2d18a83bae76af4b8a406c257763badf8219b2a0a07284c11040c9d,2022-04-29 17:47:58,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;iter=k;X=X';\n\n\n\n\n%命令行窗口输入\nN=23; fun=@(x)N*10000*x*(1+x)^59+6000-6000*(1+x)^59;[x,iter,X]=secant(fun,0.1,0.2)\n%N=处输入想更换的N值",WRONG_ANSWER,55,6764 1519976797221978112,edb87909303342223333b2dc86b0001afb46215688968f967fd5b3f7dab1ded4,2022-04-29 17:48:02,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton(fun,x0,eps,maxiter)\n% Newton法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0]=feval(fun,x0);\n\n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;",WRONG_ANSWER,55,6756 1519976849034215424,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 17:48:15,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=0:men_max\n for j=0:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group))\nfor i=1:length(Group)\n fprintf('Group%d: %dmen, %dwomen, %dkids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6796 1519976856198086656,dcb09cdf8318f18b7bc3314dbe86a4bd89d84642da535784667733b11c78b646,2022-04-29 17:48:16,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%newton_secant.m文件：\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行文件：\n fun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nX=newton_secant(fun,0.007,0.006)*12\n",WRONG_ANSWER,59,6772 1519976930772815872,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 17:48:34,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n j=j+1;\n fprintf('Group %d : %d men, %d women, %d kids\\n',j,man,woman,children) \n \n end\n end\n end\nend\nfprintf('There are %d possible groups.',j)",WRONG_ANSWER,87,6508 1519976935541747712,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 17:48:35,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor men=1:N\n for women=1:N\n for kids=1:N\n \tif(men*30+women*20+kids*10==500)…\n &(men+women+kids==30)\n fprintf('men: %d\\n',men)\n fprintf('Women: %d\\n',women)\n fprintf('\\kids: %d\\n',kids)\n end\n end\n end\nend\nj=0;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)...\n &(men+women+kids==30)\n j=j+1;\n A(j,1)=men;\n A(j,2)=women;\n A(j,3)=kids;\n end\n end\n end\nend\nmen____Women____kids=A",WRONG_ANSWER,58,6504 1519976939366940672,a967fa81fffeef7e3623462787577113f7aab977ca2b539f390d844cd7a7fba5,2022-04-29 17:48:36,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n%%%%%%%%\n\n fun=@(x)300000*(x/2)*((1+x/12)^60)/(((1+x/12)^60)+1)-6000\n [x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6508 1519976940885295104,2c046af34b643efdbaebf8af21572382b05f9b147ccaf241a9d0c33262bab49b,2022-04-29 17:48:37,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"%cum.m\nfunction Man_Woman_Children= cum(N)\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==N)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan_Woman_Children=A;\nend\n\n%ptit.m\nfunction ptit(N)\nA=cum(N)\nb=size(A,1)\nfprintf('There are%d',b)\nfprintf(' possible groups.')\nfor i=1:b\n fprintf('\\nGroup%d',i)\n fprintf(' :%d',A(i,1))\n fprintf(' men, %d', A(i,2))\n fprintf(' women,%d ',A(i,3))\n fprintf(' kids.')\nend\nend\n\n\n%mlx\nptit(N)",WRONG_ANSWER,52,6756 1519976984631881728,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 17:48:47,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n j=j+1;\n fprintf('Group %d : %d men, %d women, %d kids\\n',j,man,woman,children) \n end\n end\n end\nend\nfprintf('There are %d possible groups.',j)",WRONG_ANSWER,88,6756 1519976997739081728,2c046af34b643efdbaebf8af21572382b05f9b147ccaf241a9d0c33262bab49b,2022-04-29 17:48:50,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"%cum.m\nfunction Man_Woman_Children= cum(N)\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==N)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan_Woman_Children=A;\nend\n\n%ptit.m\nfunction ptit(N)\nA=cum(N)\nb=size(A,1)\nfprintf('There are%d',b)\nfprintf(' possible groups.')\nfor i=1:b\n fprintf('\\nGroup%d',i)\n fprintf(' :%d',A(i,1))\n fprintf(' men, %d', A(i,2))\n fprintf(' women,%d ',A(i,3))\n fprintf(' kids.')\nend\nend\n\n",WRONG_ANSWER,53,6512 1519977099312533504,5c20800b70f8b8010874a3143d20fbab8c841bce6b288a52a15ce7d1384e015b,2022-04-29 17:49:14,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,N=30;\nresult = add(N)\nfunction result = add(N)\nresult=1000*N/(30-60000*N-29500*N);\nend,WRONG_ANSWER,53,6492 1519977148893409280,edb87909303342223333b2dc86b0001afb46215688968f967fd5b3f7dab1ded4,2022-04-29 17:49:26,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton(fun,x0,eps,maxiter)\n% Newton法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0]=feval(fun,x0);\n\n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,53,6752 1519977205063516160,edb87909303342223333b2dc86b0001afb46215688968f967fd5b3f7dab1ded4,2022-04-29 17:49:40,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton(fun,x0,eps,maxiter)\n% Newton法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0]=feval(fun,x0);\n\n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,52,6748 1519977271102849024,6da4033c4c871b60d1bd09e6f921cfd67d7e22a6eca8cc0a824d46e20e8d579b,2022-04-29 17:49:55,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数文件secant_down.m\nfunction [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%调用函数求解\nfun=@(x)30*5.*x-60*.6+30;\n[rate,iter,X]=secant_down(fun,.1,.15,1e-8,1e4);\nrate",WRONG_ANSWER,53,6620 1519977274298904576,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 17:49:56,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%求解x+y+z=30; 30x+20y+10z=500的可能解\n%函数\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n\n%调用 命令行\nclear all\nA=[1 1 1;30 20 10]；\nb=[30;500]；\n[x e] = Linear_equation(A,b)\nx\ne",WRONG_ANSWER,26,6492 1519977287645179904,5243dcbf06e32ead4f7de195b9b122a815ce10f4f4cb00a8b0435f832d14da27,2022-04-29 17:49:59,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('总人数');\ni=1;\nwhile ieps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,53,6748 1519977414917140480,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 17:50:30,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('N= ');\nf=@(x)(6000-6000*x)*60-N*10000;\n[x,iter,X]=newton_secant(f,0.1,0);\nrate=12*x;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6496 1519977515240689664,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 17:50:54,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('N= ');\nf=@(x)(6000-6000*x)^60-N*10000;\n[x,iter,X]=newton_secant(f,0.1,0);\nrate=12*x;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6636 1519977546102374400,0b18170b74bfec01ccc583abc0ae720e7724c1a399b35d6a600f381ab68d4e84,2022-04-29 17:51:01,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"y=input(\""\"");\nfun=@(x)180*(x*(1+x)^y)/((1+x)^y-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,58,6752 1519977579317071872,edb87909303342223333b2dc86b0001afb46215688968f967fd5b3f7dab1ded4,2022-04-29 17:51:09,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,53,6608 1519977606705876992,0b2fabcab9a5fa0d143bae4e7d23441ea08b4132e5abc7b4a0fd091a2c5dde7a,2022-04-29 17:51:15,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\n k = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\nkk = 0;\nfor i = 0:30\n xx = x;\n kj = 0;\n y = subs(xx, k, i);\n \n for j = 1:3\n if y(j) <= 0\n kj = kj+1;\n end\n end\n if kj > 0\n continue;\n end\n kk = kk+1;\n Group(kk).men = y(1);\n Group(kk).wemen = y(2);\n Group(kk).kids = y(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", kk);\nfor i = 1:kk\n fprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,...\n Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,27,6788 1519977670450909184,edb87909303342223333b2dc86b0001afb46215688968f967fd5b3f7dab1ded4,2022-04-29 17:51:31,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);",WRONG_ANSWER,54,6776 1519977679187656704,ae875f307c5d28e578b2829ba40dff6754c281226913e469de98ef3bb1daf690,2022-04-29 17:51:33,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n",WRONG_ANSWER,56,6764 1519977702096932864,2eb7ecaa188e5b95655bd9f498fd7a35aed5ab343b2661a854f04f92c0dd059d,2022-04-29 17:51:38,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function rate=newton_secant(m)\nx0=0.007;\nx1=0.006;\neps=1e-6;\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlam=1;\n\tx2=x1-lam*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lam=lam/2;\n x2=x1-lam*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nrate=x2*12;\nend",WRONG_ANSWER,52,6748 1519977743607967744,ee92695979e578a3ac2235607cc1806101ba3c445aa7c3cb063b012dbc312bd3,2022-04-29 17:51:48,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input(\""\"")\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[xx,iter,X]=newton_down_secant1(fun,0.01,0.009);\nrate=xx*12\n\nfunction [x,iter,X]=newton_down_secant1(fun,x0,x1,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代\n f2=feval(fun,x2);\n % x0=x1;\n end\n k=k+1;\n f0=f1;f1=f2;\n x0=x1;x1=x2;\n tol=x1-x0;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,56,6764 1519977766429163520,edb87909303342223333b2dc86b0001afb46215688968f967fd5b3f7dab1ded4,2022-04-29 17:51:53,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,54,6512 1519977796498141184,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 17:52:01,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%求解x+y+z=30; 30x+20y+10z=500的可能解\n%函数\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n disp('There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.')\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n\n%调用 命令行\nclear all\nA=[1 1 1;30 20 10]；\nb=[30;500]；\n[x e] = Linear_equation(A,b)\nx\ne\n",WRONG_ANSWER,26,6492 1519977896607776768,091f0392b331a8b8c3534214661464554a7eaf4a639a470339b492ab9107d2c6,2022-04-29 17:52:25,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%牛顿下山割线法实现函数\nfunction [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nf0=feval(fun,x0); %feval：执行指定函数\nf1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %割线法\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) %牛顿下山法\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0; %更新迭代精度\n k=k+1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;\nend\n\n%主函数调用\nclear\nclc\nN=input(\""\"");\nformat long;\nfun=@(r)N*(r*(1+r)^60)/((1+r)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\nrate=12*x;\ndisp(\""rate = \""+rate);\n\n\n",WRONG_ANSWER,63,6740 1519977910650318848,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 17:52:28,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%求解x+y+z=30; 30x+20y+10z=500的可能解\n%函数\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n disp('There are 3 possible groups.\nGroup 1 : x men, y women, z kids.\nGroup 2 : x men, y women, z kids.')\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n\n%调用 命令行\nclear all\nA=[1 1 1;30 20 10]；\nb=[30;500]；\n[x e] = Linear_equation(A,b)\nx\ne\n",WRONG_ANSWER,28,6500 1519977922197229568,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 17:52:31,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=0:men_max\n for j=0:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group))\nfor i=1:length(Group)\n fprintf('Group%d: %dmen, %dwomen, %dkids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,60,6616 1519977946436112384,e4e4310f4d2dc97fa8f38c36e5cc2611a3ba4e76ba57069b6c417f521dba9c4e,2022-04-29 17:52:36,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function p=Untitled(x,y,z)\n\nsum=500;\np=30x+20y+10z;\np=sum;\nroots(p);\nend",WRONG_ANSWER,55,6756 1519977948420014080,c8e9909af01ec98d91a8acf742fe54eba25a376e2da717a1c2d2a96c95cfcab8,2022-04-29 17:52:37,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"#include \n//matlab不会，只会用C语言写\nmain()\n{\n int x=0,y=0,z=0;\n for(x=0;x<16;x++)\n {\n for(y=0;y<=25;y++)\n {\n for(z=0;z<=50;z++)\n {\n if(x+y+z==30 && 30*x+20*y+10*z==500)\n {\n printf(\""%d,%d,%d\\n\"",x,y,z);\n }\n }\n }\n }\n}",WRONG_ANSWER,27,6496 1519977971488702464,7edf25ecdf8ff05a1043d8f7f769b87643818f516d6aeb14e91bad30cb7c4b41,2022-04-29 17:52:42,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数不足'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nX=zeros(1e4,\""double\"");\nwhile abs(err)>eps\n lambda=1;\n k=k+1;\n f0=feval(fun,x0);\n f1=feval(fun,x1);\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n err=x2-x1;\n X(k)=x2;\n x0=x1;\n x1=x2;\n if k>=maxiter\n error('迭代失败')\n end\nend\nx=x2;iter=k;X=X';\nend\n\n\n\nn=input(\""\"");\n240\nfun=@(x)[1.2./x.*(1-1./(1+x).^n)-180];\n[x,iter,X]=newton(fun,0.001,0.002);\nrate=12*x;\n\n\n",MEMORY_LIMIT_EXCEEDED,168,65536 1519977972075888640,ac2be270a94271510cece7b0ee4ef1542f28534eeb8ff87262eb9bd882df798b,2022-04-29 17:52:43,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"x = 0:0.000001:0.1; %主程序\nn=input('年限：');\nfun=@(x)(n*x.*(1+x).^60)./((1+x).^60-1) -0.6;\n[xx,iter,X]=secant(fun,0.1,0.09,1e-6,1e4) ;\nnianlilv=xx*12\nplot(x,fun(x),[0,0.15],[0,0],'k:',xx,fun(xx),'k*') % 绘制图形\ntext(0.1,0.1,['月利率为{\\itx}^*=',num2str(xx)],...\n 'fontname','宋体','fontsize',12) % 添加标注\ntitle('\\fontname{隶书}\\fontsize{16}求月利率') % 添加标题\n\n\n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter) %函数\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1;\n k=k+1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nwhile abs(f2)>=abs(f1) %引入lanmda加权\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nend\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n",WRONG_ANSWER,56,6628 1519977977155194880,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-29 17:52:44,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=DownSec(fun,x0,x1,eps,maxiter)\n% Newton下山法结合割线法\n% 输入参数：\n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin < 3,\n error('输入参数至少需要3个！'),\nend\nif nargin<4||isempty(eps),\n eps = 1e-6;\nend\nif nargin<5||isempty(maxiter),\n maxiter = 1e4;\nend\nk = 1; \n\n\nwhile abs(x1-x0)>eps\n lambda = 1;\n fx0 = feval(fun,x0); \n fx1 = feval(fun,x1); \n x2=x1-lambda*(x1 - x0)/(fx1 - fx0);\n fx2 = feval(fun,x2); \n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; \n x2 = x1 - lambda * fx1 * (x1-x0)/(fx1-fx0); \n fx2 = feval(fun,x2); \n end\n k=k+1;\n x0 = x1;\n x1 = x2;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n",WRONG_ANSWER,53,6504 1519977980028301312,69b7145b919964e66580172822e7936e4ee75f919599e9b2026e30f4d587b052,2022-04-29 17:52:44,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('人数');\nm=0;\nfor x=1:N\n for y=1:N\n for z=1:N\n if((30*x+20*y+10*z)==500&&(x+y+z)==N)\n m=m+1;\n Group(m).men=x;\n Group(m).women=y;\n Group(m).kids=z;\n fprintf('%d men, %d women, %d kids\\n',x,y,z);\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',m)",WRONG_ANSWER,126,6764 1519978043014164480,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:52:59,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 1:30\n for women = 1:30\n for kids = 1:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\nfprintf(\""There are \""+i+\"" possible groups.\"");\nfor j = 1:i\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""); \nend",WRONG_ANSWER,79,6620 1519978075067035648,316e038b70708a804a89d809ab509795fff29d276dbfa9f1fcb6f919001025bc,2022-04-29 17:53:07,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n%该函数的调用格式为\n[x,e]=Linear_equation(A,b)\nA = [30 20 10];\nb = [500];\n[x e] = Linear_equation(A,b)\n\n\n B = Group(1).men(A,n)\n B = Group(2).women(A,r1,...,rN)\n B = Group(3).kids(A,r)\n \n",WRONG_ANSWER,54,6752 1519978154561667072,dcb09cdf8318f18b7bc3314dbe86a4bd89d84642da535784667733b11c78b646,2022-04-29 17:53:26,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"for man=1:30\nfor woman=1:30\nfor children=1:30\nif(man*30+woman*20+children*10==500)…\n&(man+woman+children==30)\nfprintf('Man: %d\\n',man)\nfprintf('Woman: %d\\n',woman)\nfprintf('Chlidren: %d\\n',children)\nend\nend\nend\nend\nj=0;\nfor man=1:30\nfor woman=1:30\nfor children=1:30\nif(man*30+woman*20+children*10==500)...\n&(man+woman+children==30)\nj=j+1;\nA(j,1)=man;\nA(j,2)=woman;\nA(j,3)=children;\nend\nend\nend\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,54,6636 1519978191870005248,2c046af34b643efdbaebf8af21572382b05f9b147ccaf241a9d0c33262bab49b,2022-04-29 17:53:35,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%newton_secant.m\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%.mlx\nN=240;\nfun=@(x)180.*(x.*(1+x).^N)/((1+x).^N-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nx",WRONG_ANSWER,53,6752 1519978192142630912,4ae35642dec9e333f06fdfb36060b842d889771f6058ae993786f4d62449fc1c,2022-04-29 17:53:35,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function ti2(N)\nnum=0;\nfor i=1:N\n for j=1:N\n for k=1:N\n if i+j+k==N\n if 30*i+20*j+10*k==500\n Group(num+1).men=i;\n Group(num+1).women=j;\n Group(num+1).kids=k;\n num=num+1;\n end\n end\n end\n end\nend\nX=['There are ',num2str(num),' possible groups.']\ndisp('There are 4 possible groups.')\nfor i=1:num\n X=['Group ',num2str(i),': ',num2str(Group(i).men),' men,',num2str(Group(i).women),' women,',num2str(Group(i).kids),' kids'];\n disp(X);\nend\nend%以上为函数代码\nti2(20)%该行为命令行窗口输入代码",WRONG_ANSWER,91,6688 1519978255224967168,1c8f0fe5b0cf6a377d4f4977bbd04e7ef17716e2eff88f22309ae78bfd72f386,2022-04-29 17:53:50,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%%%%%%%%%%%%%%%%%%%%%%main\nclear;\nclc;\nformat short;\nN=input(\""请输入汽车价格：\"")\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x]=NewtonDownsecant(fun,0.007,0.006);\nrate=12*x\n\n%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n%%%%%%%%%%%%%%%%%%%%%%hanshu\nfunction [x]=NewtonDownsecant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少为3个!'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);f1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);%用割线法求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代精度超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%%%%%%%%%%%",WRONG_ANSWER,60,6620 1519978276737564672,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-29 17:53:55,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%牛顿下山法和割线法的综合迭代法函数 .m文件部分\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！！！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败啦！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行调用如下\na=input('输入还款月数~')\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[rate,iter,X]=newton_secant(fun,0.007,0.006);\nrate\n",WRONG_ANSWER,55,6756 1519978321184591872,8fc961e77b8317840c680f798cc5f232c3bb7456505ef132f3c6880bad86119e,2022-04-29 17:54:06,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function rate = purchase(N)\nif nargin<1\n N=30；\nend\nfun=@(r,N)6000/r*(1-1/(1+r)^60)-N*10000;\nfplot(@(rate)fun(r,N),[0,1]);\nhlod on\nplot(xlim,[0,0],'k')\n[x,~]=ginput(1);\nrate=fzero(@(r)fun(r,N),x);\nplot(rate,fun(N,rate),'r*','markersize',12);\ntitle('年利率:rate=',num2str(rate*12*100),'%')\nend\nrate = purchase(30)；",WRONG_ANSWER,52,6620 1519978352771907584,2ef0db15a438f3bebc4e823ec4dbaa1fb88200b1185e48a14501f60f283b239f,2022-04-29 17:54:13,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(a,x0,x1,eps,maxiter)\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;iter=k;X=X';\nend\n%输入 [x,iter,X]=newton_secant(240,0.007,0.006)",WRONG_ANSWER,63,6660 1519978363849060352,91e6e1c10a7caa31f3fbe574a20264bfbb620f4e4b717406084af918bb87d3e2,2022-04-29 17:54:16,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%命令行输入\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n%newton_secant.m\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,56,6512 1519978385193873408,1e7d523070165b3c68e4856beb693fe9b5bb1df05f64ad4eb1281c85fca58524,2022-04-29 17:54:21,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"\nnum = 0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n %fprintf('Man: %d\\n',man)\n %fprintf('Woman: %d\\n',woman)\n %fprintf('Chlidren: %d\\n',children)\n num = num +1 ;\n Group(num).man = man;\n Group(num).woman = woman;\n Group(num).child = children;\n end\n end\n end\nend\nfprintf('There are %d',num)\nfprintf(' possible groups.')\nfor i = 1:num\nfprintf('Group %d',i)\nfprintf(' : %d',Group(i).man)\nfprintf(' men,%d',Group(i).woman)\nfprintf(' women,%d',Group(i).child)\nfprintf(' kids.\\n')\nend\n\n\n",PRESENTATION_ERROR,337,6648 1519978426507755520,31967e062eebed6f7314634b0b9b75861bb9ca4e101690f1105ec10ac7d990c5,2022-04-29 17:54:31,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%割线法函数表示如下\n\n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n%割线法实例如下\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=secant(y,4.7e-3,4.6e-3)\nm=12*x;\nm\n\n%牛顿下山法函数表示如下\nfunction x=newtoniteration(fun,dfun,x0,EPS) \nf=fcnchk(fun);\ndf=fcnchk(fun);\nx1=x0-df(x0)\\f(x0); \nd=norm(x1-x0);\nk=1;\nwhile d>=EPS\nx0=x1;\nx1=x0-df(x0)\\f(x0); \nd=norm(x1-x0);\nk=k+1;\nend\nif k==500\nx='fasan';\nelse\nx=x1;\nend\n\n%牛顿下山法的实例如下\nsyms x;\nz=diff(180*x.*(1+x).^240./((1+x).^240-1)-1.2)\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\nx=newtoniteration(y,z,4.7e-3,1e-6)",WRONG_ANSWER,56,6772 1519978436238540800,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:54:33,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 1:30\n for women = 1:30\n for kids = 1:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\nfprintf(\""There are \""+i+\"" possible groups.\""+ '\\n');\nfor j = 1:i\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""+ '\\n'); \nend",WRONG_ANSWER,77,6508 1519978454282436608,a6448af88f028e4c61017a5b0440a27965c284996c574e13c7e4e8b630c8dfa2,2022-04-29 17:54:37,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,62,6620 1519978467725197312,adc727b2c701827198e3ea857dca9c7d2d2f08527d80139614f73a28547e6f4d,2022-04-29 17:54:41,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%以下为牛顿下山法与割线法结合函数\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！');end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=1;\nwhile abs(x1-x0)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\n k=k+1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%以下为主函数调用\nN=input('请输入汽车总价：');\ny =@(x) N*x.*(1+x).^60./((1+x).^60-1)-0.6;\n[xx,iter,X]=newton_down_secant(y,6e-3,8e-3);\nrate=12*xx;",WRONG_ANSWER,53,6768 1519978545227542528,15283376953528d82da3139aa81805915ff55f004f324a7670759b14fa917349,2022-04-29 17:54:59,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,N=input('输入人数：')\nn=1\nfor i=1:N\n for j=1:N-i\n for k=1:N-i-j\n if (30*i+20*j+10*k==500)&&(i+k+j==N)\n group(n).men=i;\n group(n).women=j;\n group(n).kid=k;\n n=n+1;\n end\n end\n end\nend\nfor a=1:n\n group(a)\nend,WRONG_ANSWER,64,6508 1519978547765084160,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-29 17:55:00,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[1 1 1;30 20 10];\nB=[30;50];\n[x,e]=Linear_equation(A,B); \n\n\n",WRONG_ANSWER,29,6500 1519978549119844352,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:55:00,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 1:30\n for women = 1:30\n for kids = 1:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\nfprintf(\""There are \""+i+\"" possible groups.\""+ '\\n');\nfor j = 1:i - 1\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""+ '\\n'); \nend",WRONG_ANSWER,78,6504 1519978574000472064,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-29 17:55:06,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"fun=@(x,t)180*((x/12)*(1+(x/12))^t)/((1+(x/12))^t-1)-1.2;\n[rate]=newton_secant(fun,0.007,0.006,240,1e-6,1e4);\nfunction [rate]=newton_secant(fun,x0,x1,t,eps,maxtime)\nf0 = feval(fun,x0,t); \nf1 = feval(fun,x1,t); \nk=0;err=1;\nwhile abs(err)>eps\n\tlam=1;%下山因子\n\tx2=x1-lam*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2,t);\n\twhile abs(f2)>=abs(f1) \n lam=lam/2; \n x2=x1-lam*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2,t);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\nend\nif k>=maxtime\n error('超出迭代次数')\nend\nrate=x2;\nend",WRONG_ANSWER,55,6660 1519978587157991424,aa06baf985457dd9153f13920f5af6fde5790398a212287e2719a6f90617f4d3,2022-04-29 17:55:09,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,for(man=0;man<=10;man++)\n{ for(woman=0;woman<=15;woman++)\n{ for(child=0;child<=30;child++)\n{ if(child+man+woman ==30 && 3*man + 2*woman +child==50)\n{ Group.men=men;\nGroup.wemen=wemen;\nGroup.kids=kids;\n}\n} \n} \n},WRONG_ANSWER,28,6504 1519978701838651392,1e7d523070165b3c68e4856beb693fe9b5bb1df05f64ad4eb1281c85fca58524,2022-04-29 17:55:37,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"num = 0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n %fprintf('Man: %d\\n',man)\n %fprintf('Woman: %d\\n',woman)\n %fprintf('Chlidren: %d\\n',children)\n num = num +1 ;\n Group(num).man = man;\n Group(num).woman = woman;\n Group(num).child = children;\n end\n end\n end\nend\nfprintf('There are %d',num)\nfprintf(' possible groups.')\nfor i = 1:num\nfprintf('Group %d',i)\nfprintf(' : %d',Group(i).man)\nfprintf(' men,%d',Group(i).woman)\nfprintf(' women,%d',Group(i).child)\nfprintf(' kids.\\n')\nend",PRESENTATION_ERROR,340,6744 1519978704116158464,b67666b0e07687a8676b8b168dbf46ac62f862facbdcba0caa55826780b6e031,2022-04-29 17:55:37,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"fun = @(x)(300*(1-0.4)*x).*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.04,0.041,1e-6);\nfunction [x,iter,X]=newton_secant(fun,x0,x1,Y)\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>Y\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,66,6504 1519978710990622720,263a5f3044cee178e6695ad2547d0bc2b6b6ec856b4fd3fcb1df5e053e3eb8c1,2022-04-29 17:55:39,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"% \nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%函数调用\nn = input('汽车售价');\nfun = @(x)6000/x*(1-1/(1+x)^60)-n;\n[x,iter,X]=newton_secant(fun,0,10);",WRONG_ANSWER,53,6492 1519978729101639680,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:55:43,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 1:30\n for women = 1:30\n for kids = 1:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\nfprintf(\""There are \""+i+\"" possible groups.\""+ '\\n');\nfor j = 1:i - 1\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""+ '\\n'); \nend",WRONG_ANSWER,77,6752 1519978779735265280,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-29 17:55:55,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x]=newton_secant(fun,x0,x1,eps,maxiter,N)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nfun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=12*x1;\nend\n%命令行窗口输入如下\n%[x]=newton_secant(fun,0.007,0.006,30)\n",WRONG_ANSWER,54,6752 1519978878083301376,53c94d5127e552e422f80f5c2dda27f30f35cb4cc2d6f044664450457a922970,2022-04-29 17:56:19,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"fun=@(x)N*(1+x)^60-60*6000;\nN=input(\""\"");\n[rate]=cal(fun,0,1) %命令行中输入\n\nfunction rate=cal(fun,N,x0,x1)\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nwhile abs(x1-x0>eps)\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;\n x1=x2;\n f1=feval(fun,x1);\nend\nrate=x2",WRONG_ANSWER,52,6756 1519978924476502016,a967fa81fffeef7e3623462787577113f7aab977ca2b539f390d844cd7a7fba5,2022-04-29 17:56:30,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [U,x]=Gauss(A,b)\n% 顺序Gauss消去法求解线性方程组\n% 输入参数：\n% ---A：线性方程组的系数矩阵\n% ---b：线性方程组的右端项\n% 输出参数：\n% ---U：消元后的上三角方程组的增广矩阵\n% ---x：线性方程组的解\nn=length(b);\n% 消元过程\nfor k=1:n-1 % 消元成上三角矩阵\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\n% 回代过程\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); % 求x_n\nfor k=n-1:-1:1 % 回代\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); % 求x_k，k=n-1,n-2,…,1\nend\n\n\n%%%%%%%\n>> A=[1 1 1;30 20 10];\nb=[20;50];\n[U,x] = Gauss(A,b);\nU\nx",WRONG_ANSWER,53,6748 1519978943120191488,0dfb6210e617a64d8e1a1fb3fb971048d2db68ec06ef27651c0745b957b9e815,2022-04-29 17:56:34,Octave,10.0,1519868557406523399,1517175951723835392,1141715925804474368,"%牛顿下山法和割线法的综合迭代方法求解函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%调用函数，N=30\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=12*x",PARTIAL_ACCEPTED,56,6632 1519978965215776768,e571704396733cee626a409753234450b161137fe70019305bbeb579f850fc93,2022-04-29 17:56:39,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"%程序体，直接输入n即可\nn = input(\""\"");\nmoney = 500;\nk = 1;\nfor i = 1:n - 2\n if money < i*30 \n break;\n end\n mon = money - i * 30;\n for j = 1:n-i-1\n if mon < j*20\n break;\n end\n m = mon - j*20;\n if m == (n-i-j)*10\n Group(k).men = i;\n Group(k).women = j;\n Group(k).kids = n - i - j;\n k = k+1;\n end\n end\nend\nk = k -1;\nfprintf(\""There are %2.0f possible groups.\\n\"",k);\nfor i = 1:k\n fprintf(\""Group %2.0f : %2.0f men, %2.0f women, %2.0f kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend",PRESENTATION_ERROR,56,6760 1519979001781731328,78c16fef4e79887f479b549c5fe8451beb184e276b5effcf79a62998ccbc7829,2022-04-29 17:56:48,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\ny = input(\""\"");\nfun=@(x)180*(x*(1+x)^y)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x;\n\n\n",WRONG_ANSWER,52,6752 1519979086003339264,85141451193ef05a80dc6518bfd13060cd94b8f146b04ea2714af27b74c96b45,2022-04-29 17:57:08,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,\nfor man = 0:29\n for woman = 0:29\n boy = 30-man-woman;\n if 30*man +20*woman + 10*boy == 500\n disp(man);\n disp(woman);\n disp(boy);\n end\n end\nend\n,WRONG_ANSWER,65,6780 1519979142374789120,b99f62f9677372395a515d02c849e7524508d85b79628561499e8075336da1ef,2022-04-29 17:57:22,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"clear all;\nclc;\nMoney=input(\""\"");\nmonth =60;\n\nfun=@(x)Money*(x*(1+x)^Month)/((1+x)^Month-1)-0.6;\nrate=newton_secant(fun,0.007,0.006);\n\nfunction rate=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\n\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nrate=12*x;\nend",WRONG_ANSWER,56,6752 1519979175350407168,b9e7e6f36d21bafd4e3538c473f04d1852a8d2368f444458c90c160f58ca46ab,2022-04-29 17:57:29,Octave,20.0,1519868557406523399,1517175951723835392,1141715925804474368,"%文件 NewtonSecant.m\nfunction [x,iter,X] = NewtonSecant(fun,x0,x1)\n%UNTITLED2 此处提供此函数的摘要\n% 此处提供详细说明\neps = 1e-6;\nmaxiter = 1e3;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk = 0;\nerr = 1;\nwhile abs(err) > eps\n lambda = 1;\n x2 = x1 - lambda * f1 *(x1 - x0)/(f1 - f0);\n f2 = feval(fun,x2);\n while abs(f2) >= abs(f1)\n lambda = lambda /2;\n x2 = x1 - lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n end\n x0 = x1;\n x1 = x2;\n f0 = f1;\n f1 = f2;\n err = x1 - x0;\n k = k + 1;\n X(k) = x2;\n if k > maxiter\n error('次数超过上限')\n end\nend\nx = x2;\niter = k;\nX = X';\nend\n%===================================分割线=============================\n\n%命令行\nN=input(\""\"");\nfun =@(x) N*x*(x+1)^60/((1+x)^60 -1)-0.6;\n[x,iter,X] = NewtonSecant(fun,0.004,0.005);\nrate = x * 12",ACCEPTED,54,6504 1519979281625694208,835e61d090360b03f6e4c6c287d66db0e0f471e8f430149b994390e262c1496e,2022-04-29 17:57:55,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"total=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n fprintf('%d men,%d women,%d kids'\\n',x,y,z);\n total=total+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups'\\n',total);",WRONG_ANSWER,33,6752 1519979318577508352,835e61d090360b03f6e4c6c287d66db0e0f471e8f430149b994390e262c1496e,2022-04-29 17:58:04,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"total=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(30*x+20*y+10*z)==500&(x+y+z)==30\n fprintf('%d men,%d women,%d kids'\\n',x,y,z);\n total=total+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups'\\n',total);",WRONG_ANSWER,35,6780 1519979320909541376,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 17:58:04,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('N= ');\nf=@(x)(6000*60-N*10000)/(60*6000);\n[x,iter,X]=newton_secant(f,0.1,0);\nrate=12*x;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6760 1519979332670357504,78c16fef4e79887f479b549c5fe8451beb184e276b5effcf79a62998ccbc7829,2022-04-29 17:58:07,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\ny = input(\""\"");\nfun=@(x)180*(x*(1+x)^y)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x;\n\n\n",WRONG_ANSWER,55,6768 1519979363045523456,78c16fef4e79887f479b549c5fe8451beb184e276b5effcf79a62998ccbc7829,2022-04-29 17:58:14,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"y = input(\""\"");\nfun=@(x)180*(x*(1+x)^y)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x;\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\ny = input(\""\"");\nfun=@(x)180*(x*(1+x)^y)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x;\n\n\n",WRONG_ANSWER,68,6764 1519979363636908032,d2809b03269b3411fa5db4c5e4536bbaee5e6e740e230f0816bb24107f2512d7,2022-04-29 17:58:14,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i=0;\nfor m=1:30\n for w=1:30\n for c=1:30\n if (m*30+w*20+c*10==500)&(m+w+c==30)\n i=i+1;\n G(i,1)=m; G(i,2)=w; G(i,3)=c;\n end\n end\n end\nend\ndisp(['There are ',num2str(i),' possible groups.']);\nif i~=0\n for j=1:i\n disp(['Group',num2str(j),' : ',num2str(G(j,1)),' men,',num2str(G(j,2)),' women,',num2str(G(j,3)),' kids.']);\n end\nend\n",WRONG_ANSWER,349,6500 1519979395375206400,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:58:22,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 1:30\n for women = 1:30\n for kids = 1:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\ni = i - 1;\nfprintf(\""There are \""+i+\"" possible groups.\""+ '\\n');\nfor j = 1:i\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""+ '\\n'); \nend",WRONG_ANSWER,80,6500 1519979467202658304,6d12bb0fe6dddcf0d6056ba693ddd3e5623204d9ea1db419852af57f3ea49b92,2022-04-29 17:58:39,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function result=NW(h,x0,x1,n)%牛顿\nf=matlabFunction(h);%把符号表达式h转换成匿名函数并生成一个句柄指向h\nf1=matlabFunction(diff(h));%求导\nX(1)=x0;%附上初始值\nX(2)=x1;\ni=3;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))*(X(i-1)-X(i-2))/(f(X(i-1))-f(X(i-2)));%牛顿下山法式子\n if abs(f(X(i))) <1e-6 %设置一个误差限\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n\nN = input(\""\"");\nsyms x;\nh=(N*10000*(x/12)*(1+(x/12)).^60)/((1+(x/12)).^59-1)-6000;\nx=NW(h,0.05,0.09,1000)\n",WRONG_ANSWER,52,6772 1519979506033528832,e571704396733cee626a409753234450b161137fe70019305bbeb579f850fc93,2022-04-29 17:58:48,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%程序主体，输入months的值，输出x的值为年利率\n%例如直接输入240即可\n%work1.m\nformat long\nmonths = input(\""\""); %输入还款的月数\nfun=@(x)180*(x*(1+x)^months)/((1+x)^months-1)-1.2;\n[x] = newtonandsecant(fun,0.005,0.01)\n\n\n%牛顿下山法和割线法结合的方法函数\n%输入第一个值为方程主体，第二个值和第三个值为所搜素根的区间\n%第四个值为精度，第五个值为迭代次数\n%newtonandsecant.m\nfunction [x]=newtonandsecant(fun,x0,x1,eps,maxiter)\n if nargin<3,error('输入参数至少需要3个！'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n if nargin<5||isempty(maxiter),maxiter=1e4;end\n f0 = feval(fun,x0);\n f1 = feval(fun,x1);\n k = 0;\n while abs(x1 - x0)>eps\n k = k+1;\n lambda = 1;\n x2 = x1 - f1*lambda*(x1-x0)/(f1-f0);%此处使用割线法来代替求导\n f2 = feval(fun,x2);\n while abs(x2)>=abs(x1)\n lambda = lambda / 2;\n x2 = x1 - f1*lambda*(x1-x0)/(f1-f0); \n f2 = feval(fun,x2);\n end\n x0 = x1;\n f0 = f1;\n x1 = x2;\n f1 = f2;\n end\n \n if (k > maxiter)\n error('迭代次数超限，迭代失败！')\n end\n x = x2 * 12;\nend",WRONG_ANSWER,55,6768 1519979519384006656,dc0c57ad1f910d931ea02e0ef19754b276d97a250f46b70bedf9480730a651bf,2022-04-29 17:58:51,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"% 牛顿下山+割线法求解非线性方程的根\nfunction [x]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n%主程序\n\n",WRONG_ANSWER,53,6756 1519979539839619072,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:58:56,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 0:30\n for women = 0:30\n for kids = 0:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\ni = i - 1;\nfprintf(\""There are \""+i+\"" possible groups.\""+ '\\n');\nfor j = 1:i\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""+ '\\n'); \nend",WRONG_ANSWER,82,6512 1519979602963894272,7958ae64deaf208b0a1c5d3212d6d36d506ec7facf9777ddc971117361c16110,2022-04-29 17:59:11,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数文件 newton.m\nfunction [x,iter,X]=newton(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个'),end\nif nargin<4|isempty(eps),eps=1e4;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);%计算x0处函数值\nf1=feval(fun,x1);%计算x1处函数值\nk=0;tol=1;%tol迭代精度\nwhile abs(tol)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n k=k+1;\n f0=f1;f1=f2;\n x0=x1;x1=x2;\n f1=feval(fun,x1);\n tol=x1-x0;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代超限')\nend\nx=x2;iter=k;X=X'\nend\n\n%调用函数的命令行\na=input('还款总月数为：')\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[rate,iter,X]=newton(fun,0.007)\nrate",WRONG_ANSWER,53,6912 1519979639043293184,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 17:59:20,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 1:30\n for women = 1:30\n for kids = 1:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\ni = i - 1;\nfprintf(\""There are \""+i+\"" possible groups.\""+ '\\n');\nfor j = 1:i\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""+ '\\n'); \nend",WRONG_ANSWER,78,6676 1519979640641323008,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 17:59:20,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%求解x+y+z=30; 30x+20y+10z=500的可能解\n%函数\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n disp('There are 3 possible groups.\nGroup 1 : x men, y women, z kids.\nGroup 2 : x men, y women, z kids.')\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n\n%调用 命令行\nclear all\nA=[1 1 1;30 20 10]；\nb=[30;500]；\n[x e] = Linear_equation(A,b)\nx\ne\n",WRONG_ANSWER,26,6504 1519979648375619584,263a5f3044cee178e6695ad2547d0bc2b6b6ec856b4fd3fcb1df5e053e3eb8c1,2022-04-29 17:59:22,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [x,e] = Linear_equation(A,b)\n%UNTITLED3 此处显示有关此函数的摘要\n% 此处显示详细说明\n% A:系数矩阵\n% b:右端向量\n% x:解\n% e:解的误差\n[~,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n syms k1 k2;\n x=x0+z*[k1;k2];\n e=A*x-b;\n end\nelse\n disp('方程组是超定的，只有最小二乘意义上的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n% 函数调用\nN = input('请输入人数')\nA = [1,1,1;3,2,1];\nb = [N;50];\n[x,e] = Linear_equation(A,b)",WRONG_ANSWER,53,6748 1519979656122503168,e571704396733cee626a409753234450b161137fe70019305bbeb579f850fc93,2022-04-29 17:59:24,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"%程序体，直接输入n即可\nn = input(\""\"");\nmoney = 500;\nk = 1;\nfor i = 1:n - 2\n if money < i*30 \n break;\n end\n mon = money - i * 30;\n for j = 1:n-i-1\n if mon < j*20\n break;\n end\n m = mon - j*20;\n if m == (n-i-j)*10\n Group(k).men = i;\n Group(k).women = j;\n Group(k).kids = n - i - j;\n k = k+1;\n end\n end\nend\nk = k -1;\nfprintf(\""There are %2.0f possible groups.\\n\"",k);\nfor i = 1:k\n fprintf(\""Group%2.0f :%2.0f men, %2.0f women, %2.0f kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend",PRESENTATION_ERROR,58,6760 1519979658009935872,fa7a962ffa6504e504dd0606eed80c77e1ddaff5c92d73dbb06aa829d8e27567,2022-04-29 17:59:24,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; \n x1=x0-lambda*fx0/dfx0; \n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\n\n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1);\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nx=0:0.01:2;\nfun=@x((N/6000)^(1/60))-1;\n[x,iter,X]=newton_down(@fun,30,[],60);\n\n",WRONG_ANSWER,52,6512 1519979678000005120,aa0592d99c8045f1c37eba78f0be0dedc3e3f2814619244e50835d3039069249,2022-04-29 17:59:29,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,max1)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(max1),max1=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=max1\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n",WRONG_ANSWER,55,6624 1519979689182015488,83fad0ed61eaed5292929ed5e4b2101264b4b8681cdd6dec4e0b8f69e3e08600,2022-04-29 17:59:32,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%脚本mycount\nGroup(1:11)=struct('men',0,'women',0,'kids',0);\ncount=1\nfor x=0:10\n y=20-2*x;\n z=30-x-y;\n if(3*x+2*y+z==50)\n Group(count).men=x;\n Group(count).women=y;\n Group(count).kids=z;\n count=count+1;\n end\nend\n fprintf('There are %d possible groups.\\n',count);\n fprintf('Group1:%d men, %d women, %d kids.\\n',Group(1).men,Group(1).women,Group(1).kids);\n fprintf('Group2:%d men, %d women, %d kids.\\n',Group(2).men,Group(2).women,Group(2).kids);\n fprintf('Group3:%d men, %d women, %d kids.\\n',Group(3).men,Group(3).women,Group(3).kids);\n fprintf('Group4:%d men, %d women, %d kids.\\n',Group(4).men,Group(4).women,Group(4).kids);\n fprintf('Group5:%d men, %d women, %d kids.\\n',Group(5).men,Group(5).women,Group(5).kids);\n fprintf('Group6:%d men, %d women, %d kids.\\n',Group(6).men,Group(6).women,Group(6).kids);\n fprintf('Group7:%d men, %d women, %d kids.\\n',Group(7).men,Group(7).women,Group(7).kids);\n fprintf('Group8:%d men, %d women, %d kids.\\n',Group(8).men,Group(8).women,Group(8).kids);\n fprintf('Group9:%d men, %d women, %d kids.\\n',Group(9).men,Group(9).women,Group(9).kids);\n fprintf('Group10:%d men, %d women, %d kids.\\n',Group(10).men,Group(10).women,Group(10).kids);\n fprintf('Group11:%d men, %d women, %d kids.\\n',Group(11).men,Group(11).women,Group(11).kids);\n %命令行\n mycount",WRONG_ANSWER,28,6748 1519979691224633344,fa7a962ffa6504e504dd0606eed80c77e1ddaff5c92d73dbb06aa829d8e27567,2022-04-29 17:59:32,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); \n x0=sym(A)\\sym(b); \n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); \n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n\nA=[1 1 1;30 20 10];\nb=[30;500];\n[x,e]=Linear_equation(A,b)\n\n",WRONG_ANSWER,29,6512 1519979752033660928,b82cc7e349e9c958e9f521eb8f448c438bb7347955ecbdf6d823eb6c85ec6d09,2022-04-29 17:59:47,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"Group(1).men=struct(value1);\nGroup(2).wemen=struct(value2);\nGroup(3).kids=struct(value3);\nwhile\nvalue1+value2+value3=30||30*value1+20*value2+10*value3=500;\nperms([Group(1).men Group(2).wemen Group(3).kids]);\nnchoosek(perms,3)\nend\nfprint('There are nchoosek(perms,3)'/n",WRONG_ANSWER,27,6636 1519979752125935616,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 17:59:47,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('N= ');\nf=@(x)(6000*60-N*10000)/(60*6000);\n[x,iter,X]=newton_secant(f,0.1,0);\nrate=12*x;\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,58,6760 1519979788700270592,5243dcbf06e32ead4f7de195b9b122a815ce10f4f4cb00a8b0435f832d14da27,2022-04-29 17:59:56,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('总人数');\ni=1;\n\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n Group(i).man=man\n Group(i).woman=woman\n Group(i).children=children\n i=i+1 \n end\n end\n end\nend\n\nfprintf('There are %d\\n possible groups.',i)\nfor n=1:i\n fprintf('Group %d\\n :%d\\n men, %d\\n women, %d\\n kids.',n,Group(n).man,Group(n).woman,Group(n).children)\nend\n",WRONG_ANSWER,122,6496 1519979841552683008,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-29 18:00:08,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N = input('');\n\ni = 0 ;j = 0;k = 0;\n\nindex = 0;\nwhile i<=N,\n j=0;k=0;\n while j<=N,\n k=0;\n while k <=N,\n \n if 30*i +20*j+10*k==500,\n \n Group(index+1).men = i;\n Group(index+1).wemen = j;\n Group(index+1).kids = k;\n index = index+1;\n \n end\n k=k+1;\n end\n j=j+1;\n end\n i = i+1;\nend\nindex\nl = 0;\n",WRONG_ANSWER,226,6656 1519979879980904448,a6448af88f028e4c61017a5b0440a27965c284996c574e13c7e4e8b630c8dfa2,2022-04-29 18:00:17,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"int main() {\n \n\tint i, j, k;//i代表男人，j代表女人，k代表孩子\n\tfor (i = 1; i < 30; i++) {\n %有男有女有孩子，从1个男生开始判断\n\t\tfor (j = 1; j < 30 - i; j++) {\n %从一个女生开始判断\n\t\t\tfor (k = 1; k <= 30 - i - j; k++) {\n %从一个孩子开始判断\n\t\t\t\tif ((i * 3 + j * 2 + k) == 50 && (i + j + k) == 30) {\n \n\t\t\t\t\tcout << \""男人：\"" << i << \""\\n女人：\"" << j << \""\\n小孩：\"" << k << endl << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",WRONG_ANSWER,30,6496 1519979930081857536,b99f62f9677372395a515d02c849e7524508d85b79628561499e8075336da1ef,2022-04-29 18:00:29,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"clear all;\nclc;\nMoney=input(\""\"");\nmonth =60;\n\nfun=@(x)Money*(x*(1+x)^Month)/((1+x)^Month-1)-0.6;\nrate=newton_secant(fun,0.007,0.006);\nfprintf('rate = %d',rate)\nfunction rate=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\n\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nrate=12*x;\nend",WRONG_ANSWER,57,6764 1519979931231092736,d2809b03269b3411fa5db4c5e4536bbaee5e6e740e230f0816bb24107f2512d7,2022-04-29 18:00:30,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%此文件为一个完整的程序\nx = 0:0.0001:0.01;\n[xx,iter,X]=secant_down(@f1,0.01,0.009,0.00001,100) % 割线法+牛顿下山法求根\n%plot(x,f1(x),[0,0.01],[0,0],'k:',xx,f1(xx),'k*') % 绘制图形\n%text(0,0.2,['月利率=',num2str(xx)],'fontname','宋体','fontsize',12) % 添加标注\n%title('\\fontname{隶书}\\fontsize{16}割线法+牛顿下山法求根') % 添加标题\ndisp(['rate = ',num2str(xx)]);\n\nfunction [y,dy] = f1(x)\n% 函数描述文件，主要功能是求解函数表达式的值及其导数值\n syms t\n y = 180.*(t.*(1+t).^240./((1+t).^240-1))-1.2; % 计算函数值\n dy = diff(y); % 求1阶导数\n t = x;\n dy = eval(dy); % 求数值\n y = eval(y);\nend\n\n\nfunction [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n% 割线法+牛顿下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); %计算x2处的函数值\n while abs(f2)>= min(abs(f0),abs(f1))\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %牛顿下山迭代\n f2 = feval(fun,x2); %计算x2处的函数值\n end\n k=k+1;\n f0=f1;\n x0=x1;x1=x2;\n f1 = f2;\n X(k)=x2;\n\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6768 1519979959395848192,d2809b03269b3411fa5db4c5e4536bbaee5e6e740e230f0816bb24107f2512d7,2022-04-29 18:00:36,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%此文件为一个完整的程序\ni=0;\nfor m=1:30\n for w=1:30\n for c=1:30\n if (m*30+w*20+c*10==500)&(m+w+c==30)\n i=i+1;\n G(i,1)=m; G(i,2)=w; G(i,3)=c;\n end\n end\n end\nend\ndisp(['There are ',num2str(i),' possible groups.']);\nif i~=0\n for j=1:i\n disp(['Group',num2str(j),' : ',num2str(G(j,1)),' men,',num2str(G(j,2)),' women,',num2str(G(j,3)),' kids.']);\n end\nend\n",WRONG_ANSWER,340,6608 1519980020330692608,a994e0bd1575732e2ef2f8bb9ae19898c6b8b7092e1282d5950a1c702595cf0d,2022-04-29 18:00:51,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数代码文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n%调用文件\nN=input(\""\"");\nfun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-6000;\n[x,iter,X]=newton_secant(fun,0.005,0.004)\nrate=x;\n\n%输入\n30\n%输出\nrate=0.074201",WRONG_ANSWER,55,6768 1519980027066761216,a1b31ca01d988518e1bb88563e823977f52b232f1d92c20b83ce42fda97f0e76,2022-04-29 18:00:52,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [rate,f_0] = newton(f,x0,eps)\nformat long;\n% f：目标函数\n% x0：初始点\n% eps：精度\n% x_0：目标函数的自变量值（非常接近零点）\n% f_0：目标函数的函数值（非常接近零）\n% h还款月数\nif nargin == 2\n eps = 1.0e-6; % 当未输入精度eps时，默认为十的负六次幂\nend\ndf = diff(f); % 一阶导数\nk = 0; % 迭代次数\nfxk = 1;\nxk = x0;\nwhile fxk > eps\n fx = subs(f,symvar(f),xk);\n if diff(df) == 0\n dfx = double(df); % 一阶导数不能为零\n else\n dfx = subs(df,symvar(df),xk); \n end\n xk_next = xk - fx/dfx;\n k = k + 1;\n fxk = abs(fx);\n xk = xk_next; % 迭代\nend\n\nrate = xk_next;\nf_0 = subs(f,symvar(f),rate);\nformat long;\nrate = double(rate);\n\n%命令行以下\n syms t\n>> h=240\n\nh =\n\n 240\n\n>> f=h*(1.2)/(1+t)-(300-300*0.4);\n>> rate= newton(f,2)\n",WRONG_ANSWER,53,6756 1519980052668792832,1e7d523070165b3c68e4856beb693fe9b5bb1df05f64ad4eb1281c85fca58524,2022-04-29 18:00:59,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;\nfx0 =feval(fun,x0);\nfx1= feval(fun,x1);\nwhile abs(x1-x0)>eps\n lambda=1;\n x2=x1-lambda*fx1*(x1-x0)/(fx1-fx0);\n fx2 = feval(fun,x2);\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n fx2=feval(fun,x2);\n x0=x1;\n end\n k=k+1;\n fx0 = fx1;\n x0=x1;x1=x2; \n fx1=feval(fun,x1);\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n%以下为函数调用,请老师分文件运行，辛苦了\nx=0:0.01:2;\nN = input('请输入总额')\nfun=@(x)((N.*x.*(1+x).^60)./((1+x).^60 - 1)) - 0.6;\n[xx,iter,X]=newton_down(fun,0.1,0.11,1e-8,1e4);\nrate = xx*12",WRONG_ANSWER,52,6764 1519980066375766016,4ffd1f8c2fe8ec43531ad5ef73bf30440907d91d4912d4ec05c15575ba5a6cdf,2022-04-29 18:01:02,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"m=240;\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2;\n[x,iter,X]=niudunxiashan(fun,0.008,0.004);\nrate=12.*x;\nfprintf('rate=%f',rate)\nfunction [x,iter,X]=niudunxiashan(fun,x0,x1,eps,maxiter)\nif nargin<4||isempty(eps)\n eps=1e-6;\nend\nif nargin<5||isempty(maxiter)\n maxiter=1e4;\nend\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,50,6524 1519980083375280128,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 18:01:06,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%求解x+y+z=30; 30x+20y+10z=500的可能解\n%函数\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n disp('There are 3 possible groups.\nGroup 1 : x(1) men, x(2) women, x(3) kids.\nGroup 2 : x(1) men, x(2) women, x(3) kids.')\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n\n%调用 命令行\nclear all\nA=[1 1 1;30 20 10]；\nb=[30;500]；\n[x e] = Linear_equation(A,b)\nx\ne\n",WRONG_ANSWER,27,6748 1519980117403676672,452dbaba1affa4b0f0b99917503430deee206bb1dda12544fcedafba6aa0e554,2022-04-29 18:01:14,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function x=newton(fun)\nx0=4;x1=5;err=1;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \n\nwhile abs(err)>1e-6\n l=1;\n x2=x1-l*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n l=l/2; \n x2=x1-l*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\n\n%命令行\n%fun=@(x)6*(x*(1+x)^60)/((1+x)^60-1)-0.6;%月利率计算公式\n%res= 12*newton(fun)",WRONG_ANSWER,54,6764 1519980128791199744,eb5e46b2e646cc8f2f0339f09c99b9c076f3bae72fdaa34744646246de5810f7,2022-04-29 18:01:17,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"r = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2;\n%牛顿下山割线法；\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6504 1519980129822998528,463be1f2fecf5093912e8ffd6e31f74697282540c4cd1221f234a2e66081be9f,2022-04-29 18:01:17,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\nfor man =1:30\n for woman=1:30\n for children=1:30\n if (man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n fprintf('Group %d: %d men,%d women,%d kids\\n',j,A(j,1),A(j,2),A(j,3))\n end\n end\n end\nend\n\nfprintf('There are %d possible groups',j)",WRONG_ANSWER,347,6752 1519980131953704960,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-29 18:01:17,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%命令行窗口输入如下\n%N=30;\n%fun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\n%[x]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,53,6492 1519980189424062464,4b3cb76260a00d1bad9c34d83632434cc0327cdda846c3cde3ccfe6bb2a1bb18,2022-04-29 18:01:31,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"\nc = \n\n 1×3 string 数组\n\n \""There are \"" \""9\"" \"" possible groups.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""1\"" \"" : \"" \""1\"" \"" men, \"" \""18\"" \"" women, \"" \""11\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""2\"" \"" : \"" \""2\"" \"" men, \"" \""16\"" \"" women, \"" \""12\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""3\"" \"" : \"" \""3\"" \"" men, \"" \""14\"" \"" women, \"" \""13\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""4\"" \"" : \"" \""4\"" \"" men, \"" \""12\"" \"" women, \"" \""14\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""5\"" \"" : \"" \""5\"" \"" men, \"" \""10\"" \"" women, \"" \""15\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""6\"" \"" : \"" \""6\"" \"" men, \"" \""8\"" \"" women, \"" \""16\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""7\"" \"" : \"" \""7\"" \"" men, \"" \""6\"" \"" women, \"" \""17\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""8\"" \"" : \"" \""8\"" \"" men, \"" \""4\"" \"" women, \"" \""18\"" \"" kids.\""\n\n\nj = \n\n 1×9 string 数组\n\n \""Group \"" \""9\"" \"" : \"" \""9\"" \"" men, \"" \""2\"" \"" women, \"" \""19\"" \"" kids.\""\n\n>> ",WRONG_ANSWER,27,6636 1519980196835409920,df73dfbf89a9014ad985b6353df074f95adc34a92c8c212f67161ebf790ba576,2022-04-29 18:01:33,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%牛顿下山法和割线法结合函数封装如下：\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入至少3个参数！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k迭代次数，err迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代失败！')\nend",WRONG_ANSWER,58,6756 1519980212857651200,b15c3e58f69530c762ea51a3af0dadfe8255c92d1027ebfc5248e7541efbdee9,2022-04-29 18:01:37,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"clear\na=input('请输入人数');\ni=0;\nfor man=1:a\n for woman=1:a\n for children=1:a\n if(man*30+woman*20+children*10==500)&&(man+woman+children==a)\n i=i+1;\n Group(i).man=man;\n Group(i).woman=woman;\n Group(i).kids=children;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',i)\nfor j=1;i\n fprintf('Group %d:\\n',i)\n disp(Group(j))\nend\n",WRONG_ANSWER,128,6628 1519980228561121280,374876f9a04d36c1751493baf087e546949307bc0aaa2e62611b2a3c54bd03a6,2022-04-29 18:01:41,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('输入N=');\nA=[1 1 1;30 20 10];\nb=[N;500];\nC=null(A,'r');\n[x,e]=Linear_equation(A,b);\nx\nC\n\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k.' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend",WRONG_ANSWER,53,6496 1519980267547181056,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:01:50,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group))\nfor i=1:length(Group)\n fprintf('Group%d: %dmen, %dwomen, %dkids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6624 1519980270135062528,4b3cb76260a00d1bad9c34d83632434cc0327cdda846c3cde3ccfe6bb2a1bb18,2022-04-29 18:01:50,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"clc\nclear\nclose all\nx = 1:1:30;\ny = 1:1:30;\nz = 1:1:30;\nnum=0;\nresultx=0:1:8;\nresulty=0:1:8;\nresultz=0:1:8;\nfor xx=x\n for yy=y\n for zz=z\n if (xx+yy+zz==30)\n if (3*xx+2*yy+zz)==50\n \tnum=num+1;\n resultx(1,num)=xx;\n resulty(1,num)=yy;\n resultz(1,num)=zz;\n end\n end\n end\n end\nend\na=\""There are \"";\nb=\"" possible groups.\"";\nd=\""Group \"";\ne=\"" : \"";\nf=\"" men, \"";\ng=\"" women, \"";\nh=\"" kids.\"";\nc=[a,num,b];\nc\nfor i=1:num\n j=[d,i,e,resultx(1,i),f,resulty(1,i),g,resultz(1,i),h];\n j\nend\n \n\n\n",WRONG_ANSWER,27,6764 1519980276212596736,d2809b03269b3411fa5db4c5e4536bbaee5e6e740e230f0816bb24107f2512d7,2022-04-29 18:01:52,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%此文件为一个完整的程序\nx = 0:0.0001:0.01;\n[xx,iter,X]=secant_down(@f1,0.01,0.009,0.00001,100) % 割线法+牛顿下山法求根\ndisp(['rate = ',num2str(xx*12)]); %命令行输出年利率\n\nfunction [y,dy] = f1(x)\n% 函数描述文件，主要功能是求解函数表达式的值及其导数值\n syms t\n y = 180.*(t.*(1+t).^240./((1+t).^240-1))-1.2; % 计算函数值\n dy = diff(y); % 求1阶导数\n t = x;\n dy = eval(dy); % 求数值\n y = eval(y);\nend\n\n\nfunction [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n% 割线法+牛顿下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); %计算x2处的函数值\n while abs(f2)>= min(abs(f0),abs(f1))\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %牛顿下山迭代\n f2 = feval(fun,x2); %计算x2处的函数值\n end\n k=k+1;\n f0=f1;\n x0=x1;x1=x2;\n f1 = f2;\n X(k)=x2;\n\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,52,6764 1519980304004059136,5243dcbf06e32ead4f7de195b9b122a815ce10f4f4cb00a8b0435f832d14da27,2022-04-29 18:01:59,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('总人数');\ni=1;\n\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n Group(i).man=man\n Group(i).woman=woman\n Group(i).children=children\n i=i+1 \n end\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',i)\nfor n=1:i\n fprintf('Group %d :%d men, %d women, %d kids.\\n',n,Group(n).man,Group(n).woman,Group(n).children)\nend\n",WRONG_ANSWER,123,6656 1519980310496849920,4b3cb76260a00d1bad9c34d83632434cc0327cdda846c3cde3ccfe6bb2a1bb18,2022-04-29 18:02:00,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"clc\nclear\nclose all\nx = 1:1:30;\ny = 1:1:30;\nz = 1:1:30;\nnum=0;\nresultx=0:1:8;\nresulty=0:1:8;\nresultz=0:1:8;\nfor xx=x\n for yy=y\n for zz=z\n if (xx+yy+zz==30)\n if (3*xx+2*yy+zz)==50\n \tnum=num+1;\n resultx(1,num)=xx;\n resulty(1,num)=yy;\n resultz(1,num)=zz;\n end\n end\n end\n end\nend\na=\""There are \"";\nb=\"" possible groups.\"";\nd=\""Group \"";\ne=\"" : \"";\nf=\"" men, \"";\ng=\"" women, \"";\nh=\"" kids.\"";\nc=[a,num,b];\nc\nfor i=1:num\n j=[d,i,e,resultx(1,i),f,resulty(1,i),g,resultz(1,i),h];\n j\nend\n \n\n\n",WRONG_ANSWER,26,6764 1519980316238843904,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:02:01,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group))\nfor i=1:length(Group)-1\n fprintf('Group%d: %dmen, %dwomen, %dkids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,57,6500 1519980316796682240,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-29 18:02:02,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [rate,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---rate：年利率\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x1*12;iter=k;X=X';\n%调用格式：fun=@(x)30*(x*(1+x)^60/(1+x)^60-1)-0.6\n%newton_down(fun,1,1e-6,1e4)",WRONG_ANSWER,53,6764 1519980330717593600,463be1f2fecf5093912e8ffd6e31f74697282540c4cd1221f234a2e66081be9f,2022-04-29 18:02:05,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\nfor man =1:30\n for woman=1:30\n for children=1:30\n if (man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n fprintf('Group %d: %d men,%d women,%d kids\\n',j,A(j,1),A(j,2),A(j,3))\n end\n end\n end\nend\nfprintf('There are %d possible groups',j)",WRONG_ANSWER,339,6764 1519980412254846976,d10b4b08ade6c475ed02b107f147b8ed0d8783a4504fbbd75ed8f70238b291bb,2022-04-29 18:02:24,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"syms x y z\nequ=30*x+20*y+10*z==500;\nansw=solve(equ,[x,y,z])\nansw.x\nansw.y\nansw.z",WRONG_ANSWER,26,6756 1519980474636730368,20e8a9524f0c09f38accb58e043119f83ebe95cefd58c13b3f894a2f5ee3f08f,2022-04-29 18:02:39,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"函数代码\nfunction[x,e]=aaa(A,b)\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n \n x=A\\b;\n e=norm(A*x-b);\n else\n disp('欠定')\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n syms k1 k2;\n x=x0+z*[k1;k2];\n e=A*x-b;\n end\nelse\n \n x=A\\b;\n e=norm(A*x-b);\nend\n调用代码：\nA=[30,20,10;1,1,1];\n b=[500;30];\n[U,X]=aaa(A,b);\n",WRONG_ANSWER,33,6660 1519980558237601792,8fc56a4cc857e0432f37e646cb300bcb6e590b3f079f3927f6fa1a01721ab1f8,2022-04-29 18:02:59,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [rate]=newton_secant(N)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n fun=@(x)N.*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\n x0=0.007;\n x1=0.006;\neps=1e-5;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2;\nend",WRONG_ANSWER,53,6768 1519980572154314752,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-29 18:03:02,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X] = newton_down_secant(fun,x0,x1,eps,maxiter)\n%牛顿下山——割线法求解非线性方程的根\n%输入参数：\n% --fun：迭代参数\n% --x0,x1：初始迭代点\n% --eps：精度要求，默认值为1e-6\n% --maxiter：最大迭代数，默认值为1e4\n%输出参数：\n% --x：非线性方程的近似根\n% --iter：迭代次数\n% --X：每步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk = 1;\nwhile abs(x1-x0)>eps\n lambda = 1;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n x2 = x1-lambda*fx1*(x1-x0)/(fx1-fx0);\n while abs(fx1)>=abs(fx0)\n lambda = lambda/2;\n x2 = x1-lambda*fx1*(x1-x0)/(fx1-fx0);\n x0 = x1;\n x1 = x2;\n fx0 = feval(fun,x0);\n fx1 = feval(fun,x1);\n end\n k=k+1;\n x0 = x1;\n x1 = x2;\n X(k) = x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nmonth=input(\""\"");\nx = 0:0.0001:0.01;\nfun = @(x)1.2*(1-1/((1+x)^month))/x-180;\n[xx,iter,X]=newton_down_secant(fun,0.0040,0.0050,1e-4,1e4);\nfprintf('rate = %8.5f\\n',xx);",WRONG_ANSWER,53,6748 1519980573542629376,54e5c842414140a4f21f354c4a37f156ba0031674507c565ecba0ef3110af53b,2022-04-29 18:03:03,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"#函数部分：\nfunction [B,num] = test(N)\nA=zeros(20,3);\nB=[];\nsum=1;\nnum=0;\nfor i=1:16\n for j=1:25\n k=N-i-j;\n if k>0\n if 30*i+20*j+10*k==500\n A(sum,1)=i;\n A(sum,2)=j;\n A(sum,3)=k;\n sum=sum+1;\n end\n end\n end\nend\nfor i=1:20\n if A(i,1)>0\n B(i,1)=A(i,1);\n B(i,2)=A(i,2);\n B(i,3)=A(i,3);\n num=num+1;\n else\n break\n end\nend\nend\n\n\n\n#test(20)",WRONG_ANSWER,53,6492 1519980607646498816,fbb0d0e430aa6bc439c7c424fdd6c30dd9183e72d482420c05047bd15856881d,2022-04-29 18:03:11,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"x=input('人数');\nt=0;\nfor i=1:x\n for j=1:x\n for k=1:x \n if(30*i+20*j+10*k)==500&(i+j+k)==x\n t=t+1;\n \n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',t)\ntt=0;\nfor i=1:x\n for j=1:x\n for k=1:x \n if(30*i+20*j+10*k)==500&(i+j+k)==x\n tt=tt+1;\n fprintf('Group %d : %d men, %d women, %d kids.',tt,i,j,k) \n \n end\n end\n end\nend ",MULTIPLE_ERROR,451,6876 1519980628735475712,322adba04b5755cec39a5e4fb87aaf97aeb114e229be20470b5490c944d307c4,2022-04-29 18:03:16,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%脚本\ni=0;\nman=0;\nwoman=0;\nchild=0;\n\tfor m=0:10 \n\t\tfor w=0:15\n for c=0:30 \n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==500)\n\t\t\t\t\ti=i+1;\n X = sprintf('Group %d :%d ,man,%d,woman,%d kids.',i,man,woman,child)\n disp(X)\n end\n child=child+1;\n end\n woman=woman+1;\n end\n man=man+1;\n end\n Y=sprintf('There are %d possible groups.',i);\ndisp (Y)",WRONG_ANSWER,41,6496 1519980652055805952,e106a65365c4a11afe5b5ca11f3648b1d8690b95edcccc601c0973cc44a10f63,2022-04-29 18:03:21,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N = input('请输入汽车总价（万元）');\nf=@(x0)N/60*(1+x0)-6000\nx0=0:0.01:1;\n[x0,iter,X]=newton_d(@f,0,1e-6,1)\nx=x0*12\ndisp('rate ='); disp(x);\n",WRONG_ANSWER,53,6760 1519980664823250944,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 18:03:25,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\ni=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).women=woman;\n Group(j).kids=children;\n end\n end\n end\nend\nfprintf('There are %d possible groups.',j)\nfor i=1:j\n fprintf('Group %d : %d men, %d women, %d kids\\n',i,Group(i).men,Group(i).women,Group(i).kids)\nend",WRONG_ANSWER,88,6492 1519980666089934848,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-29 18:03:25,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,55,6748 1519980680719679488,19a062e6a1c410ed181c5b3995d658fdab511d1f810a3aab30afcc63f32c02b0,2022-04-29 18:03:28,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"j=0;\ni=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).women=woman;\n Group(j).kids=children;\n end\n end\n end\nend\nfprintf('There are %d possible groups.',j)\nfor i=1:j\n fprintf('Group %d : %d men, %d women, %d kids\\n',i,Group(i).men,Group(i).women,Group(i).kids)\nend",WRONG_ANSWER,88,6752 1519980696955813888,563d87bf8d4d59c3e2e4253e14558dec289b668c05431e5dd1f7520d42a33e74,2022-04-29 18:03:32,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('shuru')\na=0\nGroup=1:20\nfor z=0:50\n [x,y]=solve('30x+20y+10z-500','x+y+z-N');\n if( isinteger([x,y,z]))\n a=a+1;\n Group(a)=struct('men',x,'women',y,'kids',z)\n end\nend",WRONG_ANSWER,53,6760 1519980697694011392,5b3ab4f1b17cc0eb8220b910c95b97ed9f33643a252dcb3bca05508de1b385b1,2022-04-29 18:03:32,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"% 汽车贷款问题\nfunction rate = purchase(N,N0,b,m)\n% 输入参数：\n% ---N:汽车总价\n% ---m:分期月份数目，=60\n% ---N0:首付，=0\n% ---b:月还款，=6000\n% 输出参数：\n% ---rate:年利率\nif nargin<1\n m=60;N0=0;b=6000;\nend\nN=input(\""请输入汽车总价\"");\nfun=@(N,N0,b,m)b/r*(1-1/(1+r)^m)-(N-N0);\nfplot(@(r)fun(r,N,N0,b,m),[0,1]);\nhold on\nplot(xlim,[0,0],'k')\n[xx,yy]=ginput(2);\nmrate=secant_down(@(r)fun(N,N0,b,m),xx);\nrate=12*mrate;\nfprintf('rate=%f',rate);\nend\n\n% 解非线性方程：牛顿下山法&割线法\nfunction [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;lambda=1; % k是迭代次数；lambda是下山因子\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); % 计算新迭代点x2处的函数值\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n end\n f0=f1;\n x0=x1;x1=x2;f1=f2; \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,59,6620 1519980721706418176,413b1569e7f42bea1f537cb958db47b7b12d90d337cdd0bfbd69bfa99cb9dd3c,2022-04-29 18:03:38,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i = 1;\nfor men = 1:30\n for women = 1:30\n for kids = 1:30\n if men + women + kids == 30 && 30*men + 20*women + 10*kids == 500\n Group(i).men = men;Group(i).women = women;Group(i).kids = kids;\n i = i + 1;\n end\n end\n end\nend\ni = i - 1;\nfprintf(\""There are \""+i+\"" possible groups.\""+ '\\n');\nfor j = 1:i\nfprintf(\""Group \""+j+\"" : \""+ Group(j).men+ \"" men, \""+ Group(j).women +\"" women, \""+ Group(j).kids +\"" kids.\""+ '\\n'); \nend",WRONG_ANSWER,76,6508 1519980726471147520,563d87bf8d4d59c3e2e4253e14558dec289b668c05431e5dd1f7520d42a33e74,2022-04-29 18:03:39,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('shuru')\na=0\nGroup=1:20\nfor z=0:50\n [x,y]=solve('30x+20y+10z-500','x+y+z-N');\n if( isinteger([x,y,z]))\n a=a+1;\n Group(a)=struct('men',x,'women',y,'kids',z)\n end\nend",WRONG_ANSWER,54,6508 1519980737934163968,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:03:42,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group%d: %dmen, %dwomen, %dkids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6500 1519980764396027904,cf6ab0724b7180ae06c2c02add862ea05f72024a8a6a851f8e25206867ce1055,2022-04-29 18:03:48,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%%%%%%%%newton_secant.m%%%%%%%%%%%\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n%%%%%%%%%%%%%%%%%%%T4.m%%%%%%%%%%%%%%%%%%%%%%\n\nclear\nclf\nx=0:0.0001:0.1;\nN=input('');\nfun=@(x)N.*(x.*(1+x).^60)./((1+x).^60-1)-0.6;\nNLL=x.*12;%年利率\n[xx,iter,X]=newton_secant(fun,0.08,0.003);",WRONG_ANSWER,55,6764 1519980781345210368,eb5e46b2e646cc8f2f0339f09c99b9c076f3bae72fdaa34744646246de5810f7,2022-04-29 18:03:52,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"r = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2;\n%牛顿下山割线法；\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nrate=x*12;",WRONG_ANSWER,54,6756 1519980842275880960,fba72ad87dca911348b484210dd5d90f2a4f7063a489230c0df38b0729f7cee4,2022-04-29 18:04:07,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408," i=0;\n for x=1:30\n for y=1:30\n for z=1:30\n if(x+y+z==30)&(30*x+20*y+10*z==500)\n i=i+1;\n Group(i).man=x;\n Group(i).women=y;\n Group(i).kids=z;\n end\n end\n end\n end \n fprintf('There are 9 possible groups.')\n for m=1:i\n fprintf('Group %d : men,%d women,%d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kids)\n end",WRONG_ANSWER,328,6484 1519980865491353600,15283376953528d82da3139aa81805915ff55f004f324a7670759b14fa917349,2022-04-29 18:04:12,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=gexianxiashang(fun,x0,x1,eps,maxiter)\nif nargin<3,error('最少3个参数'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代过多')\nend\nx=x2;iter=k;X=X';\nend\n%————————————————————————以上为函数部分\n\nN=input('输入汽车总价')\nfun=60*6000-N*(1+x);",WRONG_ANSWER,53,6756 1519980873695395840,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:04:14,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d: %d men, %d women, %d kids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6768 1519980874005774336,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-29 18:04:14,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N = input('');\n\ni = 0 ;j = 0;k = 0;\n\nindex = 0;\nwhile i<=N,\n j=0;k=0;\n while j<=N,\n k=0;\n while k <=N,\n \n if (30*i +20*j+10*k==500)&&(i+j+k==N)&&(i~=0)&&(j~=0)&&(k~=0),\n \n Group(index+1).men = i;\n Group(index+1).wemen = j;\n Group(index+1).kids = k;\n index = index+1;\n \n end\n k=k+1;\n end\n j=j+1;\n end\n i = i+1;\nend\nindex\nl = 1;\nwhile l <=index\n Group(l)\n l=l+1;\nend",WRONG_ANSWER,183,6500 1519980899322605568,777d2749f7ff1bba46efd4ac2f93d18ff89c65e33c284b056e219bbcc9217825,2022-04-29 18:04:20,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [Group]=people(N) %函数\nm=N;n=N;l=N;count=1;\nfor i=1:m\n for j=1:n\n for k=1:l\n x=i;y=j;z=k;\n xyz=500-(30*x+20*y+10*z);\n if xyz==0 \n Group(count).men=x;Group(count).women=y;Group(count).kids=z;\n conut=count+1;\n end\n end\n end\nend\nsprintf('There are %d possible groups.',count);\nfor o=1:1:count\n sprintf('Group %d : x(%d) men, y(%d) women, z(%d) kids',o);\nend\nend",WRONG_ANSWER,52,6508 1519980922210914304,eb5e46b2e646cc8f2f0339f09c99b9c076f3bae72fdaa34744646246de5810f7,2022-04-29 18:04:26,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"r = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2;\n%牛顿下山割线法；\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nrate=x*12;%年利率",WRONG_ANSWER,54,6920 1519980973951856640,78c16fef4e79887f479b549c5fe8451beb184e276b5effcf79a62998ccbc7829,2022-04-29 18:04:38,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [U,x]=Gauss(A,b)\n\nn=length(b);\n% 消元过程\nfor k=1:n-1 \n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\n\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); \nfor k=n-1:-1:1 \n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); \nend",WRONG_ANSWER,53,6632 1519981001810427904,77e204aa4087c73779ced7a33e8bfb8f415f32291118506f9fb3b73fce5c5163,2022-04-29 18:04:45,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n%以下为调用代码\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6756 1519981002502488064,774a61ddff6353948e722b632b34969232993822a1890a60dd82f8e6b640566a,2022-04-29 18:04:45,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('N= ');\nfor man=1:N\nfor woman=1:N\nfor children=1:N\nif(man*30+woman*20+children*10==500)&&(man+woman+children==N)\nfprintf('Man: %d\\n',man)\nfprintf('Woman: %d\\n',woman)\nfprintf('Chlidren: %d\\n',children)\nend\nend\nend\nend\nj=0;\nfor man=1:N\nfor woman=1:N\nfor children=1:N\nif(man*30+woman*20+children*10==500)&&(man+woman+children==N)\nj=j+1;\nA(j,1)=man;\nA(j,2)=woman;\nA(j,3)=children;\nend\nend\nend\nend\nMan____Woman____Children=A;\n",WRONG_ANSWER,185,6496 1519981017748766720,56a763ffb95810b8fd0286f421464ca7cf4ff37e84629a0b2d7663c47ee98aa8,2022-04-29 18:04:49,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"A=[30 20 10];\nb=500;\n[x,e]=Linear_equation(A,b)\nfor k=1:1:15;\n B=[3,1];\n c=3*k;\n [x,e]=Linear_equation(B,c)\n if x(1)==fix(x(1)),x(2)==fix(x(2))\n result=[k,x(1),x(2)]\n end\nend",WRONG_ANSWER,52,6912 1519981060597780480,31967e062eebed6f7314634b0b9b75861bb9ca4e101690f1105ec10ac7d990c5,2022-04-29 18:04:59,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%高斯消去法函数表示\nfunction [U,x]=Gauss(A,b)\nn=length(b);\nfor k=1:n-1 % 消元成上三角矩阵\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); \nfor k=n-1:-1:1 \n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); \nend\n\n%调用如下\nA=[1 1 1;30 20 10];\nb=[30;500];\n[U,x]=Gauss(A,b)\n\n%结果如下：\nU =\n\n 1 1 1 30\n 0 -10 10 -400\n\nx =\n\n -10\n 40",WRONG_ANSWER,27,6752 1519981083158941696,dcb09cdf8318f18b7bc3314dbe86a4bd89d84642da535784667733b11c78b646,2022-04-29 18:05:04,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"for man=1:30\nfor woman=1:30\nfor children=1:30\nif(man*30+woman*20+children*10==500)…\n&(man+woman+children==30)\nfprintf('Man: %d\\n',man)\nfprintf('Woman: %d\\n',woman)\nfprintf('Chlidren: %d\\n',children)\nend\nend\nend\nend\nj=0;\nfor man=1:30\nfor woman=1:30\nfor children=1:30\nif(man*30+woman*20+children*10==500)...\n&(man+woman+children==30)\nj=j+1;\nA(j,1)=man;\nA(j,2)=woman;\nA(j,3)=children;\nend\nend\nend\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,52,6380 1519981083788083200,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:05:04,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6756 1519981099135057920,773e5bd8a0717f5bb98b318c544d0a74a9332b2bd50f494609601428cc156d2b,2022-04-29 18:05:08,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [rate,iter]=newton_down(fun,x0,x1,eps,maxiter)\nf0=feval(fun,x0)\nf1=feval(fun,x1)\nk=0\nwhile abs(x1-x0)>eps\nk=k+1\nlambda=1\nx2=x1-lambda*f1*(x1-x0)/(f1-f0)\nf2=feval(fun,x2)\nwhile abs(f2)>=abs(f1)\nlambda=lambda/2\nx2=x1-lambda*f1*(x1-x0)/(f1-f0)\nf2=feval(fun,x2)\nx1=x2\nend\nf0=f1\nf1=f2\nx0=x1\nx1=x2\nend\nif k==maxiter\nerro\nend\nx=x2;iter=k\nrate=12*x",WRONG_ANSWER,55,6504 1519981103224500224,2eb7ecaa188e5b95655bd9f498fd7a35aed5ab343b2661a854f04f92c0dd059d,2022-04-29 18:05:09,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,function group_result = inner_product(num)\nfor i=1:num\n group_result(i).men=num+1-i;\n for j=0:num-group_result(i).men\n group_result(i).women=j;\n for k=0:num-group_result(i).men-group_result(i).women\n group_result(i).kid=k;\n end\n end\n price=group_result(i).men*30+group_result(i).women*20+group_result(i).kid*10;\n if price~=500\n group_result(i)=[];\n end\nend\nend,WRONG_ANSWER,56,6692 1519981108966506496,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-29 18:05:10,Octave,10.0,1519868557406523398,1517166904926183424,1141715925804474368,"%每月还款额=贷款本金×[月利率×(1+月利率) ^ 还款月数]÷{[(1+月利率) ^ 还款月数]-1}\nfunction rate=newton_secant(fun,x0,x1,eps,maxiter)\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---rate：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;\nwhile abs(x1-x0)>eps\n lambda=1;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n f1 = feval(fun,x1); % 计算x1处的函数值\n x2 = x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); % 计算x2处的函数值\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); \n end \n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\niter=k;\nX=(X.*12)';\nrate=x2*12;\nend\n\n\n%调用格式 \ny=@(x)(300.*0.6).*(x.*(1+x).^(240))/((1+x).^(240)-1)-1.2;\n#rate：年利率\nrate=newton_secant(y,1,0.5) \n",PARTIAL_ACCEPTED,52,6760 1519981120236597248,4b3cb76260a00d1bad9c34d83632434cc0327cdda846c3cde3ccfe6bb2a1bb18,2022-04-29 18:05:13,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"clc\nclear\nclose all\ny=input(\""\"")\nfun=@(x)180*(x*(1+x)^y)/((1+x)^y-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nrate=x*12;\nrate\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6640 1519981140620918784,5814770e080ecd34f5e2d435d1441ab2765c1fd84a57c3269a27546fc156ca17,2022-04-29 18:05:18,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"atot_len = 500;len1=30;len2=20;len3=10;\nmat=[];\nn1 = tot_len/len1; \nfor k1=1:n1\n n2=fix((tot_len-k1*len1)/len2); \n for k2=1:n2\n k3=fix((tot_len-k1*len1-k2*len2)/len3); \n if k3>0\n remain = tot_len - k1*len1 - k2*len2 - k3*len3;\n mat=[mat;k1,k2,k3,remain];\n end\n end\nend\n[min_remain,index]=min(mat(:,4))\nqiege_solu=[len1,len2,len3;mat(index,1:3)],min_remain \n\n",WRONG_ANSWER,27,6748 1519981158463488000,4b3cb76260a00d1bad9c34d83632434cc0327cdda846c3cde3ccfe6bb2a1bb18,2022-04-29 18:05:22,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"clc\nclear\nclose all\nx = 1:1:30;\ny = 1:1:30;\nz = 1:1:30;\nnum=0;\nresultx=0:1:8;\nresulty=0:1:8;\nresultz=0:1:8;\nfor xx=x\n for yy=y\n for zz=z\n if (xx+yy+zz==30)\n if (3*xx+2*yy+zz)==50\n \tnum=num+1;\n resultx(1,num)=xx;\n resulty(1,num)=yy;\n resultz(1,num)=zz;\n end\n end\n end\n end\nend\na=\""There are \"";\nb=\"" possible groups.\"";\nd=\""Group \"";\ne=\"" : \"";\nf=\"" men, \"";\ng=\"" women, \"";\nh=\"" kids.\"";\nc=[a,num,b];\nc\nfor i=1:num\n j=[d,i,e,resultx(1,i),f,resulty(1,i),g,resultz(1,i),h];\n j\nend\n \n\n\n",WRONG_ANSWER,29,6628 1519981177308479488,b94027b233bffa15c5f104abcd85cda858b400be130a3fdb3cb9ae9ea236d80d,2022-04-29 18:05:27,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=20;\nsum=500;\nGroup=[];\nfor i=1:20\n for j=1:25\n for k=1:50\n if sum=30*i+20*j+10*k\n Group()=[i,j,k];\n end\n end\n end\n \n fprintf('goupt%f\\n', x2(1)*12);\n ",WRONG_ANSWER,53,6744 1519981179321745408,db1c35ac47bb5336d021da8802e313d9a6cf867b4eaf148bdf4eb429ba0912ce,2022-04-29 18:05:27,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"\nfunction[x, iter, exitflag]=Jacobi_iter(A,b,eps, iter_max)\n%线性方程组的Jacobi迭代求解(向量形式)\n%输入参数：\n%-A:线性方程组的系数矩阵\n%--b：线性方程组的右端项\n%-x0：初始向量，默认值为零向量\n%-eps：精度要求，默认值为1e-6\n%--ter-max：最大迭代次数，默认值为100\n%输出参数：\n%--x：线性方程组的近似解\n%---iter：迭代次数\n%-exitflag：迭代成功与否的标志，exitflag=1表示迭代成功\n%exitflag=0表示迭代失败\nn=length(b);\n%if nargin<5||isempty(iter_max);iter_max=100;end\n%if nargin<4||isempty(eps);eps=le-6;end\nx0=zeros(n,1);\niter=0;exitflag=1;\nD=diag(diag(A));L=tril(A,-1);U=triu(A,1);\nJ=inv(D)*(L+U);f=inv(D)*b;\nwhile itereps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%命令行窗口输入如下\n%N=30;\n%fun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\n%[x]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,54,6632 1519981191288098816,b51b55238ecf0d77a90b77baad36ab74a567a9ad6ef124d3b3c477ba51af8c8d,2022-04-29 18:05:30,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"clear all;clc;\n\n% i 行数\n%man 男人数\n%woman 女人数\n%child 孩子数\n\ni = 0\n\n\nfor man = (1:30)\n for woman = (1:30)\n for child = (1:30)\n if (30*man + 20*woman + 10*child == 500)...\n &(man + woman + child == 30)\n i = i+1\n Group(i).men = man\n Group(i).women = woman\n Group(i).kids = child\n end\n end\n end\nend\nfprintf('There are %d possible groups. \\n',i)\nfor j = (1:i)\n fprintf('Group %d : %d man, %d women, %d kids \\n',i,Group(j).men,...\n Group(j).women,Group(j).kids)\nend\n",WRONG_ANSWER,358,6784 1519981191808188416,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 18:05:30,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n%命令行\nclear all\nfun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6; \n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n\n%当N=30时\nfun=@(x)30*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\n%可得结果\nx =\n\n 0.0742\n\n\niter =\n\n 4\n\n\nX =\n\n 0.0779\n 0.0740\n 0.0742\n 0.0742",WRONG_ANSWER,55,6660 1519981197088833536,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:05:31,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6756 1519981199680901120,5b3ab4f1b17cc0eb8220b910c95b97ed9f33643a252dcb3bca05508de1b385b1,2022-04-29 18:05:32,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408, ,WRONG_ANSWER,26,6492 1519981200184229888,9ca6163d00fa5b5c75bcd2162e08c9c1b9e87efd1719c8431fca06b85f3e8515,2022-04-29 18:05:32,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n%直接运行",WRONG_ANSWER,680,6756 1519981208287612928,7f30331b28b2b43c7ea9b3514394e8d5da330c8bc5c8cb79937b14824e65289f,2022-04-29 18:05:34,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"clear\n\nA=[1,1,1;30,20,10]\nb=[20;500]\nz=null(sym(A))\nw=A\\b\n[x e]= Linear_equation(A,b);\n\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nfunction [U,x]=Catch_up(n)%大型电路电流求解函数\na=triu(ones(n+1));%建立上三角矩阵\na(1,1)=-1;%修改矩阵，构成系数矩阵\na(2,2)=7;\nfor i=3:n\n a(i,i-1)=-6;\n a(i,i)=7;\nend\nb=zeros(n+1);\nb1=b(:,1);\nb1(2)=18;\n[C,D]=Gauss(a,b1);%求解方程组\nx=D;\nU=C;\n\nend\n\n",WRONG_ANSWER,55,6764 1519981216168722432,bc18ed3b6ea13a8888f280d80dc2cc3ea46721e1b079736958ab5621eef4054e,2022-04-29 18:05:36,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%求解x+y+z=30; 30x+20y+10z=500的可能解\n%函数\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n disp('There are 3 possible groups.\nGroup 1 : x(1) men, x(2) women, x(3) kids.\nGroup 2 : x(1) men, x(2) women, x(3) kids.')\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n\n%调用 命令行\nclear all\nA=[1 1 1;30 20 10]；\nb=[30;500]；\n[x e] = Linear_equation(A,b)\nx\ne\n",WRONG_ANSWER,29,6760 1519981229464666112,b51b55238ecf0d77a90b77baad36ab74a567a9ad6ef124d3b3c477ba51af8c8d,2022-04-29 18:05:39,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%这是子函数，需要调用\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\n%这是主函数main，请在此运行\nclear all;clc;\n\n%rate 贷款月利率\n%year 贷款年利率 year=12*rate\n%month 贷款总月数\n%N 贷款金额\n\nmonth = 60;\nN = input('请输入N:')\n%构建函数\nfun =@(rate)(N*(rate*(1+rate)^month)/((1+rate)^month-1)-0.6)\n%调用函数\n[rate,iter,X]=secant(fun,0.08,0.06)\nyear = 12 * rate",WRONG_ANSWER,52,6760 1519981233973542912,322adba04b5755cec39a5e4fb87aaf97aeb114e229be20470b5490c944d307c4,2022-04-29 18:05:40,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%脚本\ni=0;\nman=0;\nwoman=0;\nchild=0;\n\tfor m=0:10 \n\t\tfor w=0:15\n for c=0:30 \n\t\t\t\tif(child+man+woman ==30 && 30*man + 20*woman +10*child==500)\n\t\t\t\t\ti=i+1;\n X = sprintf('Group %d :%d ,man,%d,woman,%d kids.',i,man,woman,child)\n disp(X)\n end\n child=child+1;\n end\n woman=woman+1;\n end\n man=man+1;\n end\n Y=sprintf('There are %d possible groups.',i);\ndisp (Y)",WRONG_ANSWER,41,6756 1519981236028751872,804aa23b0d56e143432dd96e7feef50f0d0ee05d9e06320881cdb35dd9cc97e2,2022-04-29 18:05:41,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368," fun=@(x)(N*(x/12).*(1+(x/12)).^60./((1+(x/12)).^60-1)-0.6)\n N = input(\""\"")\n30\n[x,iter,X]=newton_secant(fun,7e-3,6e-3)\n\n%牛顿下山法和割线法结合算法\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n",WRONG_ANSWER,55,6748 1519981239652626432,df73dfbf89a9014ad985b6353df074f95adc34a92c8c212f67161ebf790ba576,2022-04-29 18:05:42,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%牛顿下山法和割线法结合函数封装如下：\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入至少3个参数！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k迭代次数，err迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代失败！')\nend",WRONG_ANSWER,53,6764 1519981241800097792,b51b55238ecf0d77a90b77baad36ab74a567a9ad6ef124d3b3c477ba51af8c8d,2022-04-29 18:05:42,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"clear all;clc;\n\n% i 行数\n%man 男人数\n%woman 女人数\n%child 孩子数\n\ni = 0\n\n\nfor man = (1:30)\n for woman = (1:30)\n for child = (1:30)\n if (30*man + 20*woman + 10*child == 500)...\n &(man + woman + child == 30)\n i = i+1\n Group(i).men = man\n Group(i).women = woman\n Group(i).kids = child\n end\n end\n end\nend\nfprintf('There are %d possible groups. \\n',i)\nfor j = (1:i)\n fprintf('Group %d : %d man, %d women, %d kids \\n',i,Group(j).men,...\n Group(j).women,Group(j).kids)\nend\n",WRONG_ANSWER,339,6764 1519981286431686656,316e038b70708a804a89d809ab509795fff29d276dbfa9f1fcb6f919001025bc,2022-04-29 18:05:53,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n%该函数的调用格式为\n[x,e]=Linear_equation(A,b)\nA = [30 20 10];\nb = [500];\n[x e] = Linear_equation(A,b)\n\n\n B = Group(1).men(A,n)\n B = Group(2).women(A,r1,...,rN)\n B = Group(3).kids(A,r)\n \n",WRONG_ANSWER,53,6752 1519981325463891968,fbb0d0e430aa6bc439c7c424fdd6c30dd9183e72d482420c05047bd15856881d,2022-04-29 18:06:02,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"x=input('人数');\nt=0;\nfor i=1:x\n for j=1:x\n for k=1:x \n if(30*i+20*j+10*k)==500&(i+j+k)==x\n t=t+1;\n \n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',t)\ntt=0;\nfor i=1:x\n for j=1:x\n for k=1:x \n if(30*i+20*j+10*k)==500&(i+j+k)==x\n tt=tt+1;\n fprintf('Group %d : %d men, %d women, %d kids.\\r',tt,i,j,k) \n \n end\n end\n end\nend ",MULTIPLE_ERROR,450,6884 1519981420234182656,18047cb8ccc3a926c8cc73c77c762d3316c0fc0bc20cb258768864b6bab263d6,2022-04-29 18:06:25,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,Group(1).men = 5;\nGroup(2).wemen = 10;\nGroup(3).kids = 15; \na=Group(1).men;\nb=Group(2).wemen;\nc=Group(3).kids;\na*x1+b*x2+c*x3=500,WRONG_ANSWER,53,6756 1519981442182987776,b1dd653c06eb03b97986314446c026998ce99c255e1b8ebe3a1fe5d6459284fd,2022-04-29 18:06:30,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"j=0;\nk= input(\""\"")\nfor man = 1:30\nfor woman = 1:30\nfor kids = 1:30\n if (man*30+woman*20+kids*10==500)&(man + woman +kids == k)\n j=j+1;\n group(man)=[man,woman,kids];\n end\n end\n end\n end\n fprintf('There are',j,'groups.');\n for i=1:j\n fprintf('Group',group(i),':',group(i,man),'men,',group(i,woman),'woman,',group(i,kids),'kids.')\n end",WRONG_ANSWER,377,6764 1519981443244134400,df43670d93c71a5a81933cf027b051d49e61791d47c0c9a2e7d7986fa1129288,2022-04-29 18:06:30,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N= input(\""\"");\nfor man=1:N\n for woman=1:N\n for children=1:N\n \t if (man*30+woman*20+children*10==500)&&(man+woman+children==N)\n number = struct('mannumber',{'man'},'womannumber',{'woman'},'childnumber',{'child'});\n end \n end\n end\nend\nn = length(number);\nfprintf('There are possible %f\\n groups',n);\nfor k = 1:n\n fprintf('Group %f :',k);\n fprintf('%f man',number(k).mannumber);\n fprintf('%f woman',number(k).womannumber);\n fprintf('%f child /n',number(k).childnumber);\nend",WRONG_ANSWER,120,6512 1519981450185707520,f00fcecde26ba91ed303eb08f066d0d5da2aefab5cd233d2fceeeb4eb7285aa4,2022-04-29 18:06:32,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"[x,iter,X]=Newton_down_secant(@myfun,0.5,0.25,1e-8);\n\nfunction [x,iter,X]=Newton_down_secant(fun,x0,x1,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=0;tol=1;\n\nwhile abs(tol)>eps\nlambda=1;\nf0 = fun(x0); % 计算x0处的函数值\nf1 = fun(x1); % 计算x1处的函数值\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=fun(x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代\nf2=fun(x2);\n% x0=x1;\nend\ntol=f2*(x2-x1)/(f2-f1);\nk=k+1;\nx0 = x1;\nx1 = x2;\nX(k)=x2;\nend\nif k==maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfunction y=myfun(x)\ny=120*20*12*x-1.2*240;\nend",WRONG_ANSWER,53,6776 1519981451595001856,db1c35ac47bb5336d021da8802e313d9a6cf867b4eaf148bdf4eb429ba0912ce,2022-04-29 18:06:32,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"\nfunction[x, iter, exitflag]=Jacobi_iter(A,b,eps, iter_max)\n%线性方程组的Jacobi迭代求解(向量形式)\n%输入参数：\n%-A:线性方程组的系数矩阵\n%--b：线性方程组的右端项\n%-x0：初始向量，默认值为零向量\n%-eps：精度要求，默认值为1e-6\n%--ter-max：最大迭代次数，默认值为100\n%输出参数：\n%--x：线性方程组的近似解\n%---iter：迭代次数\n%-exitflag：迭代成功与否的标志，exitflag=1表示迭代成功\n%exitflag=0表示迭代失败\nn=length(b);\n%if nargin<5||isempty(iter_max);iter_max=100;end\n%if nargin<4||isempty(eps);eps=le-6;end\nx0=zeros(n,1);\niter=0;exitflag=1;\nD=diag(diag(A));L=tril(A,-1);U=triu(A,1);\nJ=inv(D)*(L+U);f=inv(D)*b;\nwhile iter=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6752 1519981525725134848,322adba04b5755cec39a5e4fb87aaf97aeb114e229be20470b5490c944d307c4,2022-04-29 18:06:50,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%脚本\ni=0;\nman=0;\nwoman=0;\nchild=0;\n\tfor man=0:10 \n\t\tfor woman=0:15\n for child=0:30 \n\t\t\t\tif(child+man+woman ==30 && 30*man + 20*woman +10*child==500)\n\t\t\t\t\ti=i+1;\n X = sprintf('Group %d :%d ,man,%d,woman,%d kids.',i,man,woman,child)\n disp(X)\n end\n child=child+1;\n end\n woman=woman+1;\n end\n man=man+1;\n end\n Y=sprintf('There are %d possible groups.',i);\ndisp (Y)",WRONG_ANSWER,43,6756 1519981542573637632,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-29 18:06:54,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n%调用格式A=[30 20 10;1 1 1]\nb=[500;30]\nLinear_equation(A,b)",WRONG_ANSWER,26,6764 1519981543756443648,b1dd653c06eb03b97986314446c026998ce99c255e1b8ebe3a1fe5d6459284fd,2022-04-29 18:06:54,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function[x,iter,X]=steffenson(fun,x0,eps,maxiter)\nk=",WRONG_ANSWER,54,6744 1519981554628083712,7f30331b28b2b43c7ea9b3514394e8d5da330c8bc5c8cb79937b14824e65289f,2022-04-29 18:06:57,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"clear\n\nA=[1,1,1;30,20,10]\nb=[20;500]\nz=null(sym(A))\nw=A\\b\n[x e]= Linear_equation(A,b);\n\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\nfunction [U,x]=Catch_up(n)%大型电路电流求解函数\na=triu(ones(n+1));%建立上三角矩阵\na(1,1)=-1;%修改矩阵，构成系数矩阵\na(2,2)=7;\nfor i=3:n\n a(i,i-1)=-6;\n a(i,i)=7;\nend\nb=zeros(n+1);\nb1=b(:,1);\nb1(2)=18;\n[C,D]=Gauss(a,b1);%求解方程组\nx=D;\nU=C;\n\nend\n\n",WRONG_ANSWER,54,6620 1519981564358868992,c8e9909af01ec98d91a8acf742fe54eba25a376e2da717a1c2d2a96c95cfcab8,2022-04-29 18:06:59,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function[x,iter X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error()",WRONG_ANSWER,54,6508 1519981566271455232,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:06:59,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids. \\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,79,6500 1519981579382861824,bc1f4a6b2b573f22874906456b3de99882eef36c5e9e913912ace47336d8f4a9,2022-04-29 18:07:03,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%牛顿割线法\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n\n\n\n\n\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\n\n%Steffenson法\n[x,iter,X]=steffenson(fun,0.007,0.006)\n",WRONG_ANSWER,53,6504 1519981591894458368,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:07:06,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('输入旅行团总人数:');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,59,6760 1519981592448110592,ee92695979e578a3ac2235607cc1806101ba3c445aa7c3cb063b012dbc312bd3,2022-04-29 18:07:06,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"% x+y+z=30\n% 30x+20y+10z=500\n\nA=[1,1,1;30,20,10];\nb=[30;500];\n\n[x,e]=Linear_equation1(A,b);\nfor i=0:10\n Group(i+1).men=i;\n Group(i+1).women=20-2*i;\n Group(i+1).kids=i+10;\nend\nGroup\n\nfunction [x,e]=Linear_equation1(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n %disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n %disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n %disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend",WRONG_ANSWER,28,6492 1519981598911528960,2fced53e4658af35e52be542acc8d7e91d212645defda6f1f098a6a40deeae4e,2022-04-29 18:07:07,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=20;\nm=50;n=50;l=50;\nbox=0;\nfor i=1:m\n for j=1:n\n for k=1:l\n x=i;\n y=j;\n z=k;\n if x+y+z==N&&30*x+20*y+10*z==500 \n box=box+1;\n Group(box).men=x;\n Group(box).women=y;\n Group(box).kids=z;\n %disp('There are',num2str(box),'possible groups.');\n %disp('Group',num2str(box),': 11 men, 8 women, 1 kids.');\n end\n end\n end\nend\n %x1+x2+x3=N;\n %30*x1+20*x2+10*x1 = 500;\n \n \n ",TIME_LIMIT_EXCEEDED,800,6636 1519981628535898112,2fced53e4658af35e52be542acc8d7e91d212645defda6f1f098a6a40deeae4e,2022-04-29 18:07:14,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=20;\nm=50;n=50;l=50;\nbox=0;\nfor i=1:m\n for j=1:n\n for k=1:l\n x=i;\n y=j;\n z=k;\n if x+y+z==N&&30*x+20*y+10*z==500 \n box=box+1;\n Group(box).men=x;\n Group(box).women=y;\n Group(box).kids=z;\n %disp('There are',num2str(box),'possible groups.');\n %disp('Group',num2str(box),': 11 men, 8 women, 1 kids.');\n end\n end\n end\nend\n %x1+x2+x3=N;\n %30*x1+20*x2+10*x1 = 500;\n \n \n ",TIME_LIMIT_EXCEEDED,800,6768 1519981635968221184,dcb09cdf8318f18b7bc3314dbe86a4bd89d84642da535784667733b11c78b646,2022-04-29 18:07:16,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"for man=1:30\nfor woman=1:30\nfor children=1:30\nif(man*30+woman*20+children*10==500)…\n&(man+woman+children==30)\nfprintf('Man: %d\\n',man)\nfprintf('Woman: %d\\n',woman)\nfprintf('Chlidren: %d\\n',children)\nend\nend\nend\nend\nj=0;\nfor man=1:30\nfor woman=1:30\nfor children=1:30\nif(man*30+woman*20+children*10==500)...\n&(man+woman+children==30)\nj=j+1;\nA(j,1)=man;\nA(j,2)=woman;\nA(j,3)=children;\nend\nend\nend\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,58,6744 1519981652057571328,7958ae64deaf208b0a1c5d3212d6d36d506ec7facf9777ddc971117361c16110,2022-04-29 18:07:20,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"i=0;\nN=input('总人数为：')\nfor x=1:N\n for y=1:N\n for z=1:N\n if(30*x+20*y+10*z==500&x+y+z==30)\n i=i+1;\n Group(i).men=x;\n Group(i).women=y;\n Group(i).kids=z;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i);\nk=1;\nfor k=1:i\n fprintf('Group %d : %d men, %d women, %d kids..\\n',k,Group(k).men,Group(k).women,Group(k).kids);\nend",WRONG_ANSWER,379,6772 1519981692650033152,2ef0db15a438f3bebc4e823ec4dbaa1fb88200b1185e48a14501f60f283b239f,2022-04-29 18:07:30,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function x=newton_secant(a,eps,maxiter)\nx0=0.007;\nx1=0.006;\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\nif nargin<2|isempty(eps),eps=1e-6;end\nif nargin<3|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;iter=k;X=X';\nend",WRONG_ANSWER,54,6788 1519981713780948992,78c16fef4e79887f479b549c5fe8451beb184e276b5effcf79a62998ccbc7829,2022-04-29 18:07:35,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"y = input(\""\"");\nfun=@(x)180*(x*(1+x)^y)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x;\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n",WRONG_ANSWER,54,6684 1519981717237039104,710aaf1141f4c81286701c32c69c0af3cf182f66fac98af1b0e3b57bc1133a0a,2022-04-29 18:07:35,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,m=0;\na=0\nfor i=1:29\n for j=1:(30-i)\n for k=1:(30-i-j)\n if ((i*30+j*20+k*10)==500 && (i+j+k)==30)\n m=m+1\n a=i\n b=j\n c=k\n end\n end\n end\nend\n,WRONG_ANSWER,40,6492 1519981736119799808,0b18170b74bfec01ccc583abc0ae720e7724c1a399b35d6a600f381ab68d4e84,2022-04-29 18:07:40,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nk=0;\nfor m=0:N\n for n=0:(N-m)\n for o=0:(M-m-n)\n if 500==30.*m+20.*n+10.*o\n Group(k).men=m;\n Group(k).women=n;\n Group(k).kids=o;\n k=k+1;\n end\n end\n end\nend\nfor 0:k\n disp(Group(k).men,Group(k).women,Group(k).kids);\nend",WRONG_ANSWER,57,6624 1519981747452805120,11701404cf944e1930b182a891d9bf118942498f81455082ceba643c8deccd0f,2022-04-29 18:07:43,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"x=input(\""\"");\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nfunction [x]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;\nend",WRONG_ANSWER,56,6752 1519981748291670016,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 18:07:43,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%编写函数以及调用\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n",WRONG_ANSWER,58,6744 1519981779123994624,82e35eb34c93b2c11946334e278fbc755b11821d05b833003e935332debbf1ec,2022-04-29 18:07:50,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%Linear_equation\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n%r7_2.m\n%某旅行团有男人、女人和儿童共计30人，\n%在广东地区一家饭店吃饭，该饭店按人数收费。\n%男人每餐30元，女人每餐20元，儿童每餐10元。\n%饭店收到500元。\n%求 旅行团中 男人、女人、儿童的人数共有多少种可能？\n%把所有的人数组合用结构体给出, \n%例如： Group(1).men = 5; Group(2).wemen = 10; Group(3).kids = 15，\n%并注意输出各组合人数配置。\nclear;clc;\nfprintf('There are 16 possible groups.')\nfor i = 1:16\n A = [1 1 1; 30 20 10; 1 0 0];% 系数向量\n b = [30;500;i];% 右端向量\n [x e] = Linear_equation(A,b);\n group(i).men = x(1);\n group(i).women = x(2);\n group(i).kids = x(3);\n fprintf('Group%d :%d men, %d women, %d kids.',i,x(1),x(2),x(3));\nend",WRONG_ANSWER,28,6780 1519981779845427200,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 18:07:50,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor men=1:N\n for women=1:N\n for kids=1:N\n \tif(men*30+women*20+kids*10==500)…\n &(men+women+kids==30)\n fprintf('men: %d\\n',men)\n fprintf('Women: %d\\n',women)\n fprintf('\\kids: %d\\n',kids)\n end\n end\n end\nend\nj=0;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)...\n &(men+women+kids==30)\n j=j+1;\n A(j,1)=men;\n A(j,2)=women;\n A(j,3)=kids;\n end\n end\n end\nend\nmen____Women____kids=A",WRONG_ANSWER,52,6496 1519981792940032000,b82cc7e349e9c958e9f521eb8f448c438bb7347955ecbdf6d823eb6c85ec6d09,2022-04-29 18:07:53,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input(\""\"")\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n%以上是脚本行\n%以下是命令行\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n>> [x,iter,X]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,59,6500 1519981808056303616,a1b31ca01d988518e1bb88563e823977f52b232f1d92c20b83ce42fda97f0e76,2022-04-29 18:07:57,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [rate,f_0] = newton(f,x0,eps)\nformat long;\n% f：目标函数\n% x0：初始点\n% eps：精度\n% x_0：目标函数的自变量值（非常接近零点）\n% f_0：目标函数的函数值（非常接近零）\n% h还款月数\nif nargin == 2\n eps = 1.0e-6; % 当未输入精度eps时，默认为十的负六次幂\nend\ndf = diff(f); % 一阶导数\nk = 0; % 迭代次数\nfxk = 1;\nxk = x0;\nwhile fxk > eps\n fx = subs(f,symvar(f),xk);\n if diff(df) == 0\n dfx = double(df); % 一阶导数不能为零\n else\n dfx = subs(df,symvar(df),xk); \n end\n xk_next = xk - fx/dfx;\n k = k + 1;\n fxk = abs(fx);\n xk = xk_next; % 迭代\nend\n\nrate = xk_next;\nf_0 = subs(f,symvar(f),rate);\nformat long;\nrate = double(rate);\n\n%命令行以下\n syms t\n>> h=240\n\nh =\n\n 240\n\n>> f=h*(1.2)/(1+t)-(300-300*0.4);\n>> rate= newton(f,2)\n",WRONG_ANSWER,56,6616 1519981813202731008,1b133135fd48a5e2d49f02b56e6e64c6af707f3195b3d35b299653fe7cc37fbd,2022-04-29 18:07:58,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"clear\nclc\nN=input(\""\"");\nA=[30,20,10;1,1,1];\nb=[500;N];\n[x,e]=Linear_equation(A,b)\n\n%函数\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend",WRONG_ANSWER,55,6632 1519981818302988288,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-29 18:08:00,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=DownSec(fun,x0,x1,eps,maxiter)\n% Newton下山法结合割线法\n% 输入参数：\n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin < 3,\n error('输入参数至少需要3个！'),\nend\nif nargin<4||isempty(eps),\n eps = 1e-6;\nend\nif nargin<5||isempty(maxiter),\n maxiter = 1e4;\nend\nk = 1; \n\n\nwhile abs(x1-x0)>eps\n lambda = 1;\n fx0 = feval(fun,x0); \n fx1 = feval(fun,x1); \n x2=x1-lambda*(x1 - x0)/(fx1 - fx0);\n fx2 = feval(fun,x2); \n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; \n x2 = x1 - lambda * fx1 * (x1-x0)/(fx1-fx0); \n fx2 = feval(fun,x2); \n end\n k=k+1;\n x0 = x1;\n x1 = x2;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\n",WRONG_ANSWER,53,6752 1519981833360539648,bc1f4a6b2b573f22874906456b3de99882eef36c5e9e913912ace47336d8f4a9,2022-04-29 18:08:03,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%牛顿割线法\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n\n\n\n\n\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\n\n%Steffenson法\n[x,iter,X]=steffenson(fun,0.007,0.006)\n",WRONG_ANSWER,55,6752 1519981837642924032,13f73143a6f9b2dd397bf286e32e1ce8988a674b8c272afa9cfe84647408f115,2022-04-29 18:08:04,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"%一共两个文件\n%函数calc.m\nfunction Group=calc(N)\ni=0;\nj=0;\nfor man=1:N\n for woman=1:N\n for kid=1:N\n if(man*30+woman*20+kid*10==500)&(man+woman+kid==N)\n j=j+1;\n i=i+1;\n Group(i).men=man;\n Group(i).women=woman;\n Group(i).kids=kid;\n end\n end\n end\nend\ndisp('There are ') ;\nfprintf('%c%c',8,8);\ndisp(i);\nfprintf('%c%c',8,8);\ndisp('possilble groups');\nfor k=1:i\n disp('Group ');\n fprintf('%c%c',8,8);\n disp(k)\n fprintf('men:%d\\n',Group(i).men);\n fprintf('women:%d\\n',Group(i).women);\n fprintf('kids:%d\\n',Group(i).kids);\nend\n%函数调用test.m\nN=20;\nGroup=calc(N);",WRONG_ANSWER,52,6748 1519981856022368256,1b13ce79ef89e9811275d393e89dcb8b00f927580f2a67ca9251aa3592ff5e41,2022-04-29 18:08:09,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"rate=purchase(300000,0,6000,60)\nfunction rate=purchase(A,A0,b,m)\nif nargin<1\n A=300000;A0=0;b=6000;m=60;\nend\nfun=@(r,A,A0,b,m)b/r*(1-1/(1+r)^m)-(A-A0);\nrate=fzero(@(r)fun(r,A,A0,b,m),x);\nend\n",WRONG_ANSWER,53,6508 1519981863408549888,3f206eab05c7364356c8893cc75f7db37d5d7fa7298db8876fe5d486d3187829,2022-04-29 18:08:10,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%脚本文件\nfunction number=number(m,n)\n\nx1=1:30;\n\nx2=1:30;\n\nx3=1:30;\n\n[x1,x2,x3]=meshgrid(x1,x2,x3);\n\nz1=30* x1+20* x2+10* x3;\n\nz2=x1+x2+x3;\n\nk=find(z1== m&z2==n);\n\nX=[x1(k) x2(k) x3(k)]\n\n%命令行输入\n number=number(500,30)\n\n%结果\nX =\n\n 1 18 11\n 2 16 12\n 3 14 13\n 4 12 14\n 5 10 15\n 6 8 16\n 7 6 17\n 8 4 18\n 9 2 19",WRONG_ANSWER,28,6500 1519981866885611520,db1c35ac47bb5336d021da8802e313d9a6cf867b4eaf148bdf4eb429ba0912ce,2022-04-29 18:08:11,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"\nfunction[x, iter, exitflag]=Jacobi_iter(A,b,eps, iter_max)\n%线性方程组的Jacobi迭代求解(向量形式)\n%输入参数：\n%-A:线性方程组的系数矩阵\n%--b：线性方程组的右端项\n%-x0：初始向量，默认值为零向量\n%-eps：精度要求，默认值为1e-6\n%--ter-max：最大迭代次数，默认值为100\n%输出参数：\n%--x：线性方程组的近似解\n%---iter：迭代次数\n%-exitflag：迭代成功与否的标志，exitflag=1表示迭代成功\n%exitflag=0表示迭代失败\nn=length(b);\n%if nargin<5||isempty(iter_max);iter_max=100;end\n%if nargin<4||isempty(eps);eps=le-6;end\nx0=zeros(n,1);\niter=0;exitflag=1;\nD=diag(diag(A));L=tril(A,-1);U=triu(A,1);\nJ=inv(D)*(L+U);f=inv(D)*b;\nwhile itereps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;iter=k;X=X';\nend",WRONG_ANSWER,54,6756 1519981903497703424,b15c3e58f69530c762ea51a3af0dadfe8255c92d1027ebfc5248e7541efbdee9,2022-04-29 18:08:20,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"\n%牛顿下山割线法函数\nfunction [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nf0=feval(fun,x0); %feval：执行指定函数\nf1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %割线法\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) %牛顿下山法\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0; %更新迭代精度\n k=k+1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;\nend\n\n\n\n%脚本\nclear\nclc\nformat long;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\na=12*x",WRONG_ANSWER,58,6756 1519981913832460288,9cd092dbf5d8b9545cdd9215c3fc11a8591f2fb41ac8b72d27ce0fa5d36fa1f4,2022-04-29 18:08:22,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"Group(n)=struct('men','women','kids');\nint x;\nint y;\nint z;\nif (30*x+20*y+10*z==500)&&(x+y+z=30)\nfor x=1:10\n n=n+1;\n for y=1:20\n for z=1:20\n z=z+1;\n end\n y=y+1;\n end\n x=x+1;\n Group(n).men=x;\n Group(n).women=y;\n Group(n).kids=z;\n iter=n;\nend",WRONG_ANSWER,26,6484 1519981921071828992,b15c3e58f69530c762ea51a3af0dadfe8255c92d1027ebfc5248e7541efbdee9,2022-04-29 18:08:24,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"clear\na=input('请输入人数');\ni=0;\nfor man=1:a\n for woman=1:a\n for children=1:a\n if(man*30+woman*20+children*10==500)&&(man+woman+children==a)\n i=i+1;\n Group(i).man=man;\n Group(i).woman=woman;\n Group(i).kids=children;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',i)\nfor j=1;i\n fprintf('Group %d:\\n',i)\n disp(Group(j))\nend\n",WRONG_ANSWER,120,6504 1519981929821155328,8032cfb4a9a43f497ebcffcf9322a6590edeeb31942f997133bf28cf3682d51a,2022-04-29 18:08:26,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"s=struct('men',[],'women',[],'kids',[]);\nnum=0;\nfor x=1:10\n if x*30<500\n for y=1:15\n if (x*30+y*20)<500\n for z=1:15\n res=x*30+y*20+z*10;\n p=x+y+z;\n if res==500&&p==30\n num=num+1;\n s.men(num)=x;\n s.women(num)=y;\n s.kids(num)=z;\n end\n end\n end\n end\n end\nend\nfprintf('There are %f possible groups.\\n',num);\nfor i=1:num\n fprintf('Group%f :%f men, %f women, %f kids.\\n',i,s.men(i),s.women(i),s.kids(i));\nend",WRONG_ANSWER,37,6508 1519981946883575808,dcb09cdf8318f18b7bc3314dbe86a4bd89d84642da535784667733b11c78b646,2022-04-29 18:08:30,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%newton_secant.m文件：\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行文件：\n fun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nX=newton_secant(fun,0.007,0.006)*12\n",WRONG_ANSWER,55,6512 1519981956803112960,ac2be270a94271510cece7b0ee4ef1542f28534eeb8ff87262eb9bd882df798b,2022-04-29 18:08:33,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('number:') %主程序\nA = [30 20 10;1 1 1];\nb = [500;N];\n[x e] = Linear_equation(A,b)\n\n\nfunction [x,e]=Linear_equation(A,b)%函数\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend",WRONG_ANSWER,54,6632 1519981957801349120,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-29 18:08:33,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nresult = struct('men', 'weomen', 'kids');\nA=[1 1 1;30 20 10];\nB=[30;50];\n[x,e]=Linear_equation(A,B); \nfor i=1:length(x);\nend\n\n\n",WRONG_ANSWER,26,6764 1519981972863090688,05698a4e2cda61edb9742c0752ec40f3df0c2875d77dbe0106818d122e5b80d5,2022-04-29 18:08:36,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function result=num(N)\ngroup = struct('man','women','children');\nfor x=1:10\n y=20-2*x;\n\tz=30-x-y;\n if y~=0&z~=0\n if 3*x+2*y+z==50\n group.man=x;\n group.wemen=y;\n group.children=z;\n end\n end\nend\n%调用函数\nresult=num(20)",WRONG_ANSWER,54,6748 1519981978802241536,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-29 18:08:38,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nmenv=30;\nwomanv=20;\nchildv=10;\na=1;\nfor i = 1:N\n for j =1:N\n for k = 1:N\n if 30*i+20*j+10*k==500\n Group(a).men=i;\n Group(a).wemen=j;\n Group(a).kids=k;\n a=a+1;\n end\n end\n end\nend\n",WRONG_ANSWER,120,6752 1519981993985622016,7b2d731d94118e552ba7928a8356f857f3621e54c8e5043bb64a4b59074cf62c,2022-04-29 18:08:41,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n%调用格式A=[30 20 10;1 1 1]\nb=[500;30]\nLinear_equation(A,b)",WRONG_ANSWER,27,6756 1519982002692993024,cf6ab0724b7180ae06c2c02add862ea05f72024a8a6a851f8e25206867ce1055,2022-04-29 18:08:44,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,struct Group;\nGroup.men = x; Group.wemen = y; Group(3).kids = z;\nx.*30+y.*20+z.*10==500;,WRONG_ANSWER,27,6500 1519982008820871168,adc727b2c701827198e3ea857dca9c7d2d2f08527d80139614f73a28547e6f4d,2022-04-29 18:08:45,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('请输入人数：');\ni=0;\nGroup=struct('men','women','kids');\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n i=i+1;\n Group(i).men=man;\n Group(i).women=woman;\n Group(i).kids=children;\n end\n end\n end\nend\nfprintf('There are',i );\nfprintf('possible groups.');\n\nfor k=1:i\n fprintf('Man: %d\\n',Group(i).men)\n fprintf('Woman: %d\\n',Group(i).women)\n fprintf('Chlidren: %d\\n',Group(i).kids)\nend",WRONG_ANSWER,54,6516 1519982016202838016,a1b31ca01d988518e1bb88563e823977f52b232f1d92c20b83ce42fda97f0e76,2022-04-29 18:08:47,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [rate,f_0] = newton(f,x0,eps)\nformat long;\n% f：目标函数\n% x0：初始点\n% eps：精度\n% x_0：目标函数的自变量值（非常接近零点）\n% f_0：目标函数的函数值（非常接近零）\n% h还款月数\nif nargin == 2\n eps = 1.0e-6; % 当未输入精度eps时，默认为十的负六次幂\nend\ndf = diff(f); % 一阶导数\nk = 0; % 迭代次数\nfxk = 1;\nxk = x0;\nwhile fxk > eps\n fx = subs(f,symvar(f),xk);\n if diff(df) == 0\n dfx = double(df); % 一阶导数不能为零\n else\n dfx = subs(df,symvar(df),xk); \n end\n xk_next = xk - fx/dfx;\n k = k + 1;\n fxk = abs(fx);\n xk = xk_next; % 迭代\nend\n\nrate = xk_next;\nf_0 = subs(f,symvar(f),rate);\nformat long;\nrate = double(rate);\n\n%命令行如下！！！\n syms t\n>> h=240\n>> f=h*(1.2)/(1+t)-(300-300*0.4);\n>> rate= newton(f,2)\n",WRONG_ANSWER,58,6616 1519982016999751680,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:08:47,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,54,6788 1519982020531355648,ae875f307c5d28e578b2829ba40dff6754c281226913e469de98ef3bb1daf690,2022-04-29 18:08:48,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [U,x]=Gauss(A,b)\n% 顺序Gauss消去法求解线性方程组\n\nn=length(b);\n% 消元过程\nfor k=1:n-1 % 消元成上三角矩阵\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\n% 回代过程\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); % 求x_n\nfor k=n-1:-1:1 % 回代\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); % 求x_k，k=n-1,n-2,…,1\nend\n%顺序Gauss消去法求解线性方程组得到\nq=length(x);\nGroup=struct with fields;\n\n",WRONG_ANSWER,52,6500 1519982038600433664,c6e1f1aaeff3de60cf75386c81ad3c8a5633d92c811fb2d17ce04fa7dee26c2e,2022-04-29 18:08:52,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=20;\nm=N;n=N;l=N;\na=0;\n\ndisp('满足条件的解')\n\nfor i=1:m\n\n for j=1:n\n\n for k=1:l\n\n x=i;y=j;z=k;\n\n ans1=N-x-y-z;\n ans2=500-30*x-20*y-10*z;\n\n if ans1==0&&ans2==0\n a=a+1;\n\n disp(['group',num2str(a),'男人',num2str(i),' 女人',num2str(j),' 小孩',num2str(k)])\n\n end\n\n end\n\n end\n\nend",WRONG_ANSWER,110,6752 1519982054576533504,b9e7e6f36d21bafd4e3538c473f04d1852a8d2368f444458c90c160f58ca46ab,2022-04-29 18:08:56,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%文件 Linear_equation\nfunction [x,e]=Linear_equation(A,b)\n%UNTITLED 此处提供此函数的摘要\n% 此处提供详细说明\n\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n %方程组欠定\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n\n%命令行\nA = [30,20,10];\nb=500;\nx=Linear_equation(A,b);\n",WRONG_ANSWER,26,6500 1519982056816295936,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-29 18:08:56,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nmenv=30;\nwomanv=20;\nchildv=10;\na=1;\nfor i = 0:N\n for j =0:N\n for k = 0:N\n if 30*i+20*j+10*k==500\n Group(a).men=i;\n Group(a).wemen=j;\n Group(a).kids=k;\n a=a+1;\n end\n end\n end\nend\n",WRONG_ANSWER,136,6620 1519982065909530624,1c8f0fe5b0cf6a377d4f4977bbd04e7ef17716e2eff88f22309ae78bfd72f386,2022-04-29 18:08:59,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""请输入人数：\"");\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).wemen=woman;\n Group(j).kids=children;\n end\n end\n end\nend\ndisp('There are',[j],'possible groups.')\nfor i=1:j\n disp('Group',[i], ':', [ Group(i).men ],'men',[ Group(i).wemen],'women',[Group(j).kids], 'kids.')\nend",WRONG_ANSWER,400,7148 1519982068744896512,df73dfbf89a9014ad985b6353df074f95adc34a92c8c212f67161ebf790ba576,2022-04-29 18:08:59,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%牛顿下山法和割线法结合函数封装如下：\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入至少3个参数！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k迭代次数，err迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代失败！')\nend\n\nclear all;\nn = input(\""汽车价格为（万元）：\"");\nfun=@(x,n)n*x*(1+x)^60-6000*(1+x)^60+6000;\n[x,iter,X]=newton_secant(fun,0.007,0.006);",WRONG_ANSWER,53,6752 1519982069147537408,2b37fcb625a4d606b048477fda0e732db13f508c8d5f4ae2eeb6b3a65aa20523,2022-04-29 18:08:59,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"clc;clear\nN=input(\""\"");\nN=N*1e4;%贷款总额\nt=60;%贷款期数\nsyms x;%期利率（月）\nS=6000;%每期还款额\neps=1e-14;\n\n%S=(N.*x.*(1+x).^60)/((1+x).^60-1)%公式\nf=@(x)(N.*x.*(1+x).^60)/((1+x).^60-1)-S; %函数fx\n%f1=@(x)N.*((1+x).^t+t*x*(1+x).^(t-1))*((1+x).^t-1)./((1+x).^t-1).^2; %f'(x)\nf1=@(x)N.*(1-((1+x).^t-1-t.*x.*(1+x).^(t-1))./((1+x).^t-1).^2); %f'(x)\n\n%零点约在0.07~0.08\n\n\nx=[0.07,0.08]; %两个初始值\nfx=f(x(2));\niter=0;\n\nwhile(abs(fx(1))>eps)\n lambda=1;\n fx=[f(x(1)),fx];\n df=(f(x(1))/f1(x(1)));\n \n while(fx(1) >= abs(fx(2)))\n lambda=lambda/2;\n x1=x(1)-lambda*df;\n fx(1)=abs(f(x1));\n iter=iter+1;\n end\n \n x=[x(1)-f(x(1))/(fx(1)-fx(2))*(x(1)-x(2)),x];\n iter=iter+1;\nend\n\nrate=x(1)* 12;\n\nfprintf('rate= %f\\n',rate);\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,54,6776 1519982070321954816,e24330194e62a67b0e6cc98cbbd8eab0c8a2b30f1986af6827f97453f651b6b5,2022-04-29 18:09:00,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"fuction [x,iter,X]=newton(fun,x0,x1,eps,max)\nfun=@(x)N*(x*(1+x)^60/(1+x)-1)-0.6;\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*x1;\n f2=feval(fun,x2);\n while abs(2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n ",WRONG_ANSWER,56,6508 1519982088617496576,1c8f0fe5b0cf6a377d4f4977bbd04e7ef17716e2eff88f22309ae78bfd72f386,2022-04-29 18:09:04,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""请输入人数：\"");\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).wemen=woman;\n Group(j).kids=children;\n end\n end\n end\nend\ndisp('There are',[j],'possible groups.')\nfor i=1:j\n disp('Group',[i], ':', [ Group(i).men ],'men',[ Group(i).wemen],'women',[Group(j).kids], 'kids.')\nend",WRONG_ANSWER,386,6764 1519982090312003584,53c94d5127e552e422f80f5c2dda27f30f35cb4cc2d6f044664450457a922970,2022-04-29 18:09:04,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function res=cal(N)\nint men,women,children;\nres=0;\nfor men=0:N\n for women=0:N-men\n children=N-men-women;\n if men*30+women*20+children*10==N,\n res=res+1;\n group(res).men=men;\n group(res).women=women;\n group(res).children=children;\nprintf(\""There are \\res possible groups.)\nfor i=0:res\nprintf(\""Group\""\\res \"":\""\"")",WRONG_ANSWER,54,6568 1519982097450696704,5b3ab4f1b17cc0eb8220b910c95b97ed9f33643a252dcb3bca05508de1b385b1,2022-04-29 18:09:06,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"% ---N:汽车总价\n% ---m:分期月份数目，=60\n% ---N0:首付，=0\n% ---b:月还款，=6000\n% ---rate:年利率\nm=60;N0=0;b=6000;\nN=input(\""请输入汽车总价\"");\n\nfun=@(N,N0,b,m)b/r*(1-1/(1+r)^m)-(N-N0);\nfplot(@(r)fun(r,N,N0,b,m),[0,1]);\nhold on\nplot(xlim,[0,0],'k')\n[xx,yy]=ginput(2);\nmrate=secant_down(@(r)fun(N,N0,b,m),xx);\nrate=12*mrate;\nfprintf('rate=%f',rate);\n\n\n% 解非线性方程：牛顿下山法&割线法\nfunction [x,iter,X]=secant_down(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;lambda=1; % k是迭代次数；lambda是下山因子\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2); % 计算新迭代点x2处的函数值\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n end\n f0=f1;\n x0=x1;x1=x2;f1=f2; \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6876 1519982103326916608,ae3f0be0926631a1b0226231f5607711a24f597b1d11ad5fdde110ebb3f3a35a,2022-04-29 18:09:07,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"#include\n#include\n\nint main()\n{\n\tint x, y, z;\n\tfor man =1:30\n for woman =1:30\n for children =1:30\n if (man*30+woman*20+childrenman*10==500)\n &(man+woman+childrenman=30)\n fprint('MAN：%d\\n',man)\n fprint('woman:%d\\n',woman)\n fprint(children:%d\\n,children)\n end\n end\n end\n end\n j=0;\n for man =1:30\n \n \n\t\t\t\t\tprintf(\""男人：%2d\\t女人：%2d\\t孩子：%2d\\n\"", x, y, z);\n\t\t\t}\n\t\t}\n\t}\t\t\t\t\t\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nfor man =1:30\n for woman =1:30\n for children =1:30\n if (man*30+woman*20+childrenman*10==500)\n &(man+woman+childrenman=30)\n FPRINT('MAN：%d\\n',man)\n fprint('woman:%d\\n',woman)\n \n &9",WRONG_ANSWER,26,6636 1519982104333549568,756dcadea05f36e881c4900d46127cad414a61895432707ba3cb309f84cf9513,2022-04-29 18:09:08,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[l,iter,X]=newton_secant(fun,0.007,0.006)\nfunction [l,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nl=x2*12;\nend",WRONG_ANSWER,53,6760 1519982105549910016,31967e062eebed6f7314634b0b9b75861bb9ca4e101690f1105ec10ac7d990c5,2022-04-29 18:09:08,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%割线法函数表示如下\n\n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n%割线法实例如下\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=secant(y,4.7e-3,4.6e-3)\nm=12*x;\nm\n\n%牛顿下山法函数表示如下\nfunction x=newtoniteration(fun,dfun,x0,EPS) \nf=fcnchk(fun);\ndf=fcnchk(fun);\nx1=x0-df(x0)\\f(x0); \nd=norm(x1-x0);\nk=1;\nwhile d>=EPS\nx0=x1;\nx1=x0-df(x0)\\f(x0); \nd=norm(x1-x0);\nk=k+1;\nend\nif k==500\nx='fasan';\nelse\nx=x1;\nend\n\n%牛顿下山法的实例如下\nsyms x;\nz=diff(180*x.*(1+x).^240./((1+x).^240-1)-1.2)\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\nx=newtoniteration(y,z,4.7e-3,1e-6)",WRONG_ANSWER,58,6776 1519982106028060672,adc727b2c701827198e3ea857dca9c7d2d2f08527d80139614f73a28547e6f4d,2022-04-29 18:09:08,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input('请输入人数：');\ni=0;\nGroup=struct('men','women','kids');\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n i=i+1;\n Group(i).men=man;\n Group(i).women=woman;\n Group(i).kids=children;\n end\n end\n end\nend\nfprintf('There are',i );\nfprintf('possible groups.');\n\nfor k=1:i\n fprintf('Man: %d\\n',Group(i).men)\n fprintf('Woman: %d\\n',Group(i).women)\n fprintf('Chlidren: %d\\n',Group(i).kids)\nend",WRONG_ANSWER,55,6752 1519982113158381568,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:09:10,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,58,6760 1519982115867885568,eb5e46b2e646cc8f2f0339f09c99b9c076f3bae72fdaa34744646246de5810f7,2022-04-29 18:09:10,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,a=0;\nb=0;\nc=0;\n,WRONG_ANSWER,28,6636 1519982117864374272,c6e1f1aaeff3de60cf75386c81ad3c8a5633d92c811fb2d17ce04fa7dee26c2e,2022-04-29 18:09:11,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=20;\nm=N;n=N;l=N;\na=0;\n\ndisp('满足条件的解')\n\nfor i=1:m\n\n for j=1:n\n\n for k=1:l\n\n x=i;y=j;z=k;\n\n ans1=N-x-y-z;\n ans2=500-30*x-20*y-10*z;\n\n if ans1==0&&ans2==0\n a=a+1;\n\n disp(['group',num2str(a),'男人',num2str(i),' 女人',num2str(j),' 小孩',num2str(k)])\n\n end\n\n end\n\n end\n\nend",WRONG_ANSWER,110,6760 1519982123086282752,6da4033c4c871b60d1bd09e6f921cfd67d7e22a6eca8cc0a824d46e20e8d579b,2022-04-29 18:09:12,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%设男人a人，女人b人，儿童c人，根据题意列出方程组：\n%a+b+c=30\n%30*a+20*b*10*c=500\n%先调用函数判定给病态方程组的类型\n函数文件：Linear_equation.m\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n调用函数：\nA=[1 1 1;30 20 10];\nb=[30;500];\n[x e]=Linear_equation(A,b);\n\n\nwhile ",WRONG_ANSWER,29,6484 1519982128241082368,31967e062eebed6f7314634b0b9b75861bb9ca4e101690f1105ec10ac7d990c5,2022-04-29 18:09:13,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%高斯消去法函数表示\nfunction [U,x]=Gauss(A,b)\nn=length(b);\nfor k=1:n-1 % 消元成上三角矩阵\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); \nfor k=n-1:-1:1 \n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); \nend\n\n%调用如下\nA=[1 1 1;30 20 10];\nb=[30;500];\n[U,x]=Gauss(A,b)\n\n%结果如下：\nU =\n\n 1 1 1 30\n 0 -10 10 -400\n\nx =\n\n -10\n 40",WRONG_ANSWER,27,6488 1519982131613302784,804aa23b0d56e143432dd96e7feef50f0d0ee05d9e06320881cdb35dd9cc97e2,2022-04-29 18:09:14,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"j=0;\nfor man=1:N\nfor woman=1:N\nfor children=1:N\nif(man*30+woman*20+children*10==500)...\n&(man+woman+children==N)\nj=j+1;\nA(j,1)=man;\nA(j,2)=woman;\nA(j,3)=children;\nend\nend\nend\nend",WRONG_ANSWER,54,6724 1519982132951298048,30ecf8ee5889f3db4a4a8600db1210ccafbac0be62ec083bf9758cd6a1f1080d,2022-04-29 18:09:15,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=DownSec(fun,x0,x1,eps,maxiter)\n% Newton下山法结合割线法\n% 输入参数：\n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin < 3,\n error('输入参数至少需要3个！'),\nend\nif nargin<4||isempty(eps),\n eps = 1e-6;\nend\nif nargin<5||isempty(maxiter),\n maxiter = 1e4;\nend\nk = 1; \n\n\nwhile abs(x1-x0)>eps\n lambda = 1;\n fx0 = feval(fun,x0); \n fx1 = feval(fun,x1); \n x2=x1-lambda*(x1 - x0)/(fx1 - fx0);\n fx2 = feval(fun,x2); \n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; \n x2 = x1 - lambda * fx1 * (x1-x0)/(fx1-fx0); \n fx2 = feval(fun,x2); \n end\n k=k+1;\n x0 = x1;\n x1 = x2;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\n\n%来不及写了",WRONG_ANSWER,55,6488 1519982153583067136,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:09:19,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input('');\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,61,6752 1519982155109793792,db1c35ac47bb5336d021da8802e313d9a6cf867b4eaf148bdf4eb429ba0912ce,2022-04-29 18:09:20,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"\nfunction[x, iter, exitflag]=Jacobi_iter(A,b,eps, iter_max)\n%线性方程组的Jacobi迭代求解(向量形式)\n%输入参数：\n%-A:线性方程组的系数矩阵\n%--b：线性方程组的右端项\n%-x0：初始向量，默认值为零向量\n%-eps：精度要求，默认值为1e-6\n%--ter-max：最大迭代次数，默认值为100\n%输出参数：\n%--x：线性方程组的近似解\n%---iter：迭代次数\n%-exitflag：迭代成功与否的标志，exitflag=1表示迭代成功\n%exitflag=0表示迭代失败\nn=length(b);\n%if nargin<5||isempty(iter_max);iter_max=100;end\n%if nargin<4||isempty(eps);eps=le-6;end\nx0=zeros(n,1);\niter=0;exitflag=1;\nD=diag(diag(A));L=tril(A,-1);U=triu(A,1);\nJ=inv(D)*(L+U);f=inv(D)*b;\nwhile itereps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%函数调用\nn = input('汽车售价');\nfun = @(x)6000/x*(1-1/(1+x)^60)-n;\n[x,iter,X]=newton_secant(fun,0,10);",WRONG_ANSWER,56,6764 1519982160373657600,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-29 18:09:21,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i=0;\nn=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(x+y+z)==30&(30*x+20*y+10*z)==500\n i=i+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(x+y+z)==30&(30*x+20*y+10*z)==500\n n=n+1;\n fprintf('Group %d : %d men, %d women, %d kids..\\n',n,x,y,z);\n end\n end\n end\nend",TIME_LIMIT_EXCEEDED,400,6632 1519982161736798208,a967fa81fffeef7e3623462787577113f7aab977ca2b539f390d844cd7a7fba5,2022-04-29 18:09:21,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n%%%%%%%%\n\n fun=@(x)300000*(x/2)*((1+x/12)^60)/(((1+x/12)^60)+1)-6000\n [x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,55,6748 1519982161866821632,fd9c466caedf333e23bf9643fccb0580f3676bc85facde724587feb795706def,2022-04-29 18:09:21,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nx=1:17;y=1:25;z=1:50;\n[x,y,z]=meshgrid(x,y,z);\nP=30.*x+20.*y+10.*z;\nQ=x+y+z;\nk=find(P==500&Q==N);",WRONG_ANSWER,54,6760 1519982165515862016,a994e0bd1575732e2ef2f8bb9ae19898c6b8b7092e1282d5950a1c702595cf0d,2022-04-29 18:09:22,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%函数文件\nfunction [x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n",WRONG_ANSWER,27,6752 1519982169806651392,ae3f0be0926631a1b0226231f5607711a24f597b1d11ad5fdde110ebb3f3a35a,2022-04-29 18:09:23,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"#include\n#include\n\nint main()\n{\n\tint x, y, z;\n\tfor man =1:30\n for woman =1:30\n for children =1:30\n if (man*30+woman*20+childrenman*10==500)\n &(man+woman+childrenman=30)\n fprint('MAN：%d\\n',man)\n fprint('woman:%d\\n',woman)\n fprint(children:%d\\n,children)\n end\n end\n end\n end\n j=0;\n for man =1:30\n \n \n\t\t\t\t\tprintf(\""男人：%2d\\t女人：%2d\\t孩子：%2d\\n\"", x, y, z);\n\t\t\t}\n\t\t}\n\t}\t\t\t\t\t\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nfor man =1:30\n for woman =1:30\n for children =1:30\n if (man*30+woman*20+childrenman*10==500)\n &(man+woman+childrenman=30)\n FPRINT('MAN：%d\\n',man)\n fprint('woman:%d\\n',woman)\n \n &9",WRONG_ANSWER,26,6632 1519982172226764800,a967fa81fffeef7e3623462787577113f7aab977ca2b539f390d844cd7a7fba5,2022-04-29 18:09:24,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [U,x]=Gauss(A,b)\n% 顺序Gauss消去法求解线性方程组\n% 输入参数：\n% ---A：线性方程组的系数矩阵\n% ---b：线性方程组的右端项\n% 输出参数：\n% ---U：消元后的上三角方程组的增广矩阵\n% ---x：线性方程组的解\nn=length(b);\n% 消元过程\nfor k=1:n-1 % 消元成上三角矩阵\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\n% 回代过程\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); % 求x_n\nfor k=n-1:-1:1 % 回代\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); % 求x_k，k=n-1,n-2,…,1\nend\n\n\n%%%%%%%\n>> A=[1 1 1;30 20 10];\nb=[20;50];\n[U,x] = Gauss(A,b);\nU\nx",WRONG_ANSWER,52,6760 1519982176848871424,8fc56a4cc857e0432f37e646cb300bcb6e590b3f079f3927f6fa1a01721ab1f8,2022-04-29 18:09:25,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [rate]=newton_secant(N)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n fun=@(x)N.*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-0.6;\n x0=0.007;\n x1=0.006;\neps=1e-5;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2;\nend\n%命令行 [rate]=newton_secant(N)",WRONG_ANSWER,54,6756 1519982177641594880,11701404cf944e1930b182a891d9bf118942498f81455082ceba643c8deccd0f,2022-04-29 18:09:25,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"x=0; %男\ny=0; %女\nz=0; %儿童\ni=0; %计数\nwhile x<=30\n while y<=30-x\n while z<=30-x-y\n if (30*x+20*y+10*z==500)&& (x+y+z==30)\n i=i+1;\n disp('Group ',i,':',x,'men,',y,'women,',z,'kids.')\n end\n z=z+1\n end\n y=y+1\n end\n x=x+1\nend\ndisp('There are ',i,' possible groups.')",WRONG_ANSWER,28,6508 1519982180040753152,263a5f3044cee178e6695ad2547d0bc2b6b6ec856b4fd3fcb1df5e053e3eb8c1,2022-04-29 18:09:26,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [x,e] = Linear_equation(A,b)\n%UNTITLED3 此处显示有关此函数的摘要\n% 此处显示详细说明\n% A:系数矩阵\n% b:右端向量\n% x:解\n% e:解的误差\n[~,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A));\n x0=sym(A)\\sym(b);\n syms k1 k2;\n x=x0+z*[k1;k2];\n e=A*x-b;\n end\nelse\n disp('方程组是超定的，只有最小二乘意义上的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n% 函数调用\nN = input('请输入人数')\nA = [1,1,1;3,2,1];\nb = [N;50];\n[x,e] = Linear_equation(A,b)",WRONG_ANSWER,53,6764 1519982184662859776,54e5c842414140a4f21f354c4a37f156ba0031674507c565ecba0ef3110af53b,2022-04-29 18:09:27,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"#函数\nfunction B = test(N)\nA=zeros(20,3);\nB=[];\nsum=1;\nnum=0;\nfor i=1:16\n for j=1:25\n k=N-i-j;\n if k>0\n if 30*i+20*j+10*k==500\n A(sum,1)=i;\n A(sum,2)=j;\n A(sum,3)=k;\n sum=sum+1;\n end\n end\n end\nend\nfor i=1:20\n if A(i,1)>0\n B(i,1)=A(i,1);\n B(i,2)=A(i,2);\n B(i,3)=A(i,3);\n num=num+1;\n else\n break\n end\nend\ndisp(num);\nend\n\n#命令行：\ntest(20)\n 4\n\n\nans =\n\n 11 8 1\n 12 6 2\n 13 4 3\n 14 2 4",WRONG_ANSWER,57,6756 1519982191487008768,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-29 18:09:29,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nmenv=30;\nwomanv=20;\nchildv=10;\na=1;\nfor i = 0:N\n for j =0:N\n for k = 0:N\n if 30*i+20*j+10*k==500\n Group(a).men=i;\n Group(a).wemen=j;\n Group(a).kids=k;\n a=a+1;\n end\n end\n end\nend\nfor q =1:a-1\n",WRONG_ANSWER,56,6760 1519982196553711616,0e104e135bba4ef0ac6c89b4c19f88187005198fc1ce2ad91a288d7f8d983f82,2022-04-29 18:09:30,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nresult = struct('men', 'weomen', 'kids');\nA=[1 1 1;30 20 10];\nB=[30;50];\n[x,e]=Linear_equation(A,B); \nfor i=1:length(x);\nend\n\n\n",WRONG_ANSWER,26,6752 1519982196901851136,eb5e46b2e646cc8f2f0339f09c99b9c076f3bae72fdaa34744646246de5810f7,2022-04-29 18:09:30,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"r = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2;\n%牛顿下山割线法；\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nrate=x*12;%年利率",WRONG_ANSWER,55,6616 1519982197610688512,d62764fb42154fef1f24d5cba7fbeb8becd1d42e9c8c7b9869ec8e2f26cba183,2022-04-29 18:09:30,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要三个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\n\nif k>maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n",WRONG_ANSWER,56,6772 1519982199561027584,cd3b40bf172be9704fd5db3326ece05f44a8ec13ea9869c713448a3000f61022,2022-04-29 18:09:30,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"j=0;\nfor men =1:30\n for women =1:30\n for kids-1:30\n if(men*30+women*20+kids*10==500)&(men+women+kids==30)\n j=j+1;\n A(j,1)=men;\n A(j,2)=women;\n A(j,3)=kids:\n end\n end\n end",WRONG_ANSWER,54,6636 1519982201624641536,a645a806e8f261227485ea6aede6e0f7dbde400fe666c782aa26902e710f4c41,2022-04-29 18:09:31,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"n=input(\""\"");\ntotal=500; %500元\nmen_max=floor(total/30);\nwomen_max=floor(total/20);\nkid_max=floor(total/10);\nk=1;\nfor i=1:men_max\n for j=1:women_max\n kid= (500-i*30-j*20)/10;\n if i+j+kid ==n && kid>=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,65,6748 1519982201649807360,ae875f307c5d28e578b2829ba40dff6754c281226913e469de98ef3bb1daf690,2022-04-29 18:09:31,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n",WRONG_ANSWER,60,6756 1519982206003478528,10b87770fc2bf977a8f2786c6b2628738ef909566a2f90b90a7e7cd9530fff65,2022-04-29 18:09:32,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function x=fun(a)\nGroup(1).men=0;\nGroup(2).women=0;\nGroup(3).kids=0;\nsum=0;\nfor i=1:a\n for j=1:a\n for k=1:a\n Group(1).men=i\n Group(2).women=j\n Group(3).kids=k\n if Group(1).men*30+Group(2).women*20+Group(3).kids*10==500\n sum=sum+1\n fprintf(i,'men,',j,'women,',k,'kids')\n end\n end\n end\nend\nx=sum\n%以上为函数代码，老师我不会输出文字。。。您看下其他代码\n\nprompt = 'input ';\nN = input(prompt)\nresult=fun(N);\n%以上为命令行窗口",WRONG_ANSWER,56,6908 1519982206401949696,ae3f0be0926631a1b0226231f5607711a24f597b1d11ad5fdde110ebb3f3a35a,2022-04-29 18:09:32,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"#include\n#include\n\nint main()\n{\n\tint x, y, z;\n\tfor man =1:30\n for woman =1:30\n for children =1:30\n if (man*30+woman*20+childrenman*10==500)\n &(man+woman+childrenman=30)\n fprint('MAN：%d\\n',man)\n fprint('woman:%d\\n',woman)\n fprint(children:%d\\n,children)\n end\n end\n end\n end\n j=0;\n for man =1:30\n \n \n\t\t\t\t\tprintf(\""男人：%2d\\t女人：%2d\\t孩子：%2d\\n\"", x, y, z);\n\t\t\t}\n\t\t}\n\t}\t\t\t\t\t\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nfor man =1:30\n for woman =1:30\n for children =1:30\n if (man*30+woman*20+childrenman*10==500)\n &(man+woman+childrenman=30)\n FPRINT('MAN：%d\\n',man)\n fprint('woman:%d\\n',woman)\n \n &9",WRONG_ANSWER,37,6492 1519982208411009024,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 18:09:33,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"for x = 1:N\n for y = 1:N\n for z = 1:N\n if (30*x+20*y+10*z)==500&(x+y+z)==N\n fprintf('There are %d possible groups.\n Group n : %d men, %d women, %d kids.\\n',x,y,z);\n end\n end\n end\nend",WRONG_ANSWER,52,6784 1519982215100940288,3f206eab05c7364356c8893cc75f7db37d5d7fa7298db8876fe5d486d3187829,2022-04-29 18:09:34,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"% 牛顿下山法和割线法的综合迭代方法脚本文件\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\nend\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend \n\n%第二个脚本文件\nfunction rate=newton_secant_year(i)\nfun=@(x)180*(x*(1+x)^i)/((1+x)^i-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nrate=x*12\n\n%命令行输入\ni=240;\nrate=newton_secant_year(i)\n\n%结果\nx =\n\n 0.004267625285645\n\n\niter =\n\n 4\n\n\nX =\n\n 0.004372566749491\n 0.004272138915135\n 0.004267637958208\n 0.004267625285645\n\n\nrate =\n\n 0.051211503427737\n\n\nrate =\n\n 0.051211503427737",WRONG_ANSWER,53,6876 1519982216279527424,ca3275a0b0d6b3ab4ecc02d88aabefd444fe759801d237c8943ade7da0ffa4d5,2022-04-29 18:09:34,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"m_man=30;\nm_women=20;\nm_child=10;\ncounter=0;\nfor i=1:17\n for j=1:26\n for k=1:51\n \n \n \n counter=counter+1;\n Group(counter).men=i;\n Group(counter).women=j;\n Group(counter).men=k;\n \n \n end\n end\n \nend\nprintf('There are %d possible groups. \\n',counter);\nfor(i=1:counter)\n printf('Group%d :%d men, %d women, %d kids.\\n',i,Group(i).men,Group(i).women,Group(i).child);\nend",TIME_LIMIT_EXCEEDED,800,7032 1519982223875411968,d10b4b08ade6c475ed02b107f147b8ed0d8783a4504fbbd75ed8f70238b291bb,2022-04-29 18:09:36,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"syms man women kids\nequ=[30*man+20*women+10*kids==500,men+women+kids=30];\nGroup=solve(equ,[men,women,kids])\nansw.men\nansw.women\nansw.kids",WRONG_ANSWER,26,6748 1519982228434616320,aaef3cb7e40d89d5b881a8f270bc6345f94a2a61ee75dbf53b80a2a46629384d,2022-04-29 18:09:37,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx =\n 0.00426762528564472\niter =\n 4\nX =\n 0.00437256674949125\n 0.0042721389151354\n 0.00426763795820826\n 0.00426762528564472",WRONG_ANSWER,55,6876 1519982229088927744,ae875f307c5d28e578b2829ba40dff6754c281226913e469de98ef3bb1daf690,2022-04-29 18:09:37,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [U,x]=Gauss(A,b)\n% 顺序Gauss消去法求解线性方程组\n\nn=length(b);\n% 消元过程\nfor k=1:n-1 % 消元成上三角矩阵\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\nU=[A,b];\n% 回代过程\nx=zeros(n,1);\nx(n)=b(n)/A(n,n); % 求x_n\nfor k=n-1:-1:1 % 回代\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k); % 求x_k，k=n-1,n-2,…,1\nend\n%顺序Gauss消去法求解线性方程组得到\nq=length(x);\nGroup=struct with fields;\n\n",WRONG_ANSWER,54,6768 1519982231160918016,4941d6e25f6b47d004cadd791d4a8ea0bb76bd233c9a7ea1f7325e3b5d5fe7f7,2022-04-29 18:09:38,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,function y=m(x)\nk=300;a=40%;b=20;c=12000;\ny=300*40%,WRONG_ANSWER,55,6752 1519982234159857664,0b18170b74bfec01ccc583abc0ae720e7724c1a399b35d6a600f381ab68d4e84,2022-04-29 18:09:39,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nk=1;\nGroup=[];\nfor m=0:N\n for n=0:(N-m)\n for o=0:(N-m-n)\n if 500==30*m+20*n+10*o\n Group(k,1)=m;\n Group(k,2)=n;\n Group(k,3)=o;\n k=k+1;\n end\n end\n end\nend\nfor n=1:k\n m=Group(k,1);\n disp(m);\n m=Group(k,2);\n disp(m);\n m=Group(k,3);\n disp(m);\nend",WRONG_ANSWER,72,6772 1519982235304898560,b51b55238ecf0d77a90b77baad36ab74a567a9ad6ef124d3b3c477ba51af8c8d,2022-04-29 18:09:39,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%这是子函数，需要调用\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\n%这是主函数main，请在此运行\nclear all;clc;\n\n%rate 贷款月利率\n%year 贷款年利率 year=12*rate\n%month 贷款总月数\n%N 贷款金额\n\nmonth = 60;\nN = input('请输入N:')\n%构建函数\nfun =@(rate)(N*(rate*(1+rate)^month)/((1+rate)^month-1)-0.6)\n%调用函数\n[rate,iter,X]=secant(fun,0.08,0.06)\nyear = 12 * rate",WRONG_ANSWER,51,6768 1519982235623669760,316e038b70708a804a89d809ab509795fff29d276dbfa9f1fcb6f919001025bc,2022-04-29 18:09:39,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n%该函数的调用格式为\n[x,e]=Linear_equation(A,b)\nA = [30 20 10];\nb = [500];\n[x e] = Linear_equation(A,b)\n\n\n B = Group(1).men(A,n)\n B = Group(2).women(A,r1,...,rN)\n B = Group(3).kids(A,r)\n \n",WRONG_ANSWER,55,6496 1519982236730949632,3f206eab05c7364356c8893cc75f7db37d5d7fa7298db8876fe5d486d3187829,2022-04-29 18:09:39,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%脚本文件\nfunction number=number(m,n)\n\nx1=1:30;\n\nx2=1:30;\n\nx3=1:30;\n\n[x1,x2,x3]=meshgrid(x1,x2,x3);\n\nz1=30* x1+20* x2+10* x3;\n\nz2=x1+x2+x3;\n\nk=find(z1== m&z2==n);\n\nX=[x1(k) x2(k) x3(k)]\n\n%命令行输入\n number=number(500,30)\n\n%结果\nX =\n\n 1 18 11\n 2 16 12\n 3 14 13\n 4 12 14\n 5 10 15\n 6 8 16\n 7 6 17\n 8 4 18\n 9 2 19",WRONG_ANSWER,25,6760 1519982238559666176,0dfb6210e617a64d8e1a1fb3fb971048d2db68ec06ef27651c0745b957b9e815,2022-04-29 18:09:40,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids\n",WRONG_ANSWER,28,6372 1519982245379604480,213de8812ff1b138e56607d7cb1bd4da40ae8f416b64087548b069c972d6106e,2022-04-29 18:09:41,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"i=0;\nn=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(x+y+z)==30&(30*x+20*y+10*z)==500\n i=i+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i);\nfor x=1:30\n for y=1:30\n for z=1:30\n if(x+y+z)==30&(30*x+20*y+10*z)==500\n n=n+1;\n fprintf('Group %d : %d men, %d women, %d kids..\\n',n,x,y,z);\n end\n end\n end\nend",TIME_LIMIT_EXCEEDED,400,6624 1519982245631262720,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 18:09:41,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%编写函数以及调用\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n\n",WRONG_ANSWER,55,6616 1519982253239746560,1f83e6721f378d06f0ccc89dedfac547de5654f8dbd52b8b75ed67dd69147ec6,2022-04-29 18:09:43,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nmenv=30;\nwomanv=20;\nchildv=10;\na=1;\nfor i = 0:N\n for j =0:N\n for k = 0:N\n if 30*i+20*j+10*k==500\n Group(a).men=i;\n Group(a).wemen=j;\n Group(a).kids=k;\n a=a+1;\n end\n end\n end\nend\nfor q =1:a-1\nfprintf('')",WRONG_ANSWER,52,6488 1519982256389664768,bd8077c924d624849a7a791e54342bb19db5f83a474cd2f3bc58946de20283b6,2022-04-29 18:09:44,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)36*(x*(1+x)^60)/((1+x)^60-1)-N;\n[x1,iter1,X1]=newton_down_secant(fun,0.005,0.004);\nrate=12*x1\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n tol=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,58,6500 1519982257668915200,316e038b70708a804a89d809ab509795fff29d276dbfa9f1fcb6f919001025bc,2022-04-29 18:09:44,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)6000*(x*(1+x)^60)/((1+x)^60-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=12*x;\n",WRONG_ANSWER,55,6764 1519982258453262336,bc1f4a6b2b573f22874906456b3de99882eef36c5e9e913912ace47336d8f4a9,2022-04-29 18:09:44,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 1 : 1 men, 18 women, 11 kids.",WRONG_ANSWER,27,6744 1519982262995681280,5814770e080ecd34f5e2d435d1441ab2765c1fd84a57c3269a27546fc156ca17,2022-04-29 18:09:46,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error\nend\nx=x2;iter=k;X=X';\nend\n\n",WRONG_ANSWER,55,6760 1519982264006520832,15283376953528d82da3139aa81805915ff55f004f324a7670759b14fa917349,2022-04-29 18:09:46,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,N=input('输入人数：')\nn=1\nfor i=1:N\n for j=1:N-i\n for k=1:N-i-j\n if (30*i+20*j+10*k==500)&&(i+k+j==N)\n group(n).men=i;\n group(n).women=j;\n group(n).kid=k;\n n=n+1;\n end\n end\n end\nend\nfor a=1:n\n group(a)\nend,WRONG_ANSWER,68,6880 1519982265352880128,05698a4e2cda61edb9742c0752ec40f3df0c2875d77dbe0106818d122e5b80d5,2022-04-29 18:09:46,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%主函数\nfunction result=main(input)\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\n[x,iter,X]=newton_down(fun,0.007,0.006)\n\nresult=x\nend\n\n%子函数\nfunction [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc\n%调用主函数\nresult=main(240);",WRONG_ANSWER,62,6796 1519982266896384000,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-29 18:09:46,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"%牛顿下山法和割线法的综合迭代法函数 .m文件部分\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！！！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败啦！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行调用如下\na=input('输入还款月数~')\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[rate,iter,X]=newton_secant(fun,0.007,0.006);\nrate\n",WRONG_ANSWER,59,6756 1519982268452483072,b51b55238ecf0d77a90b77baad36ab74a567a9ad6ef124d3b3c477ba51af8c8d,2022-04-29 18:09:47,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"clear all;clc;\n\n% i 行数\n%man 男人数\n%woman 女人数\n%child 孩子数\n\ni = 0\n\n\nfor man = (1:30)\n for woman = (1:30)\n for child = (1:30)\n if (30*man + 20*woman + 10*child == 500)...\n &(man + woman + child == 30)\n i = i+1\n Group(i).men = man\n Group(i).women = woman\n Group(i).kids = child\n end\n end\n end\nend\nfprintf('There are %d possible groups. \\n',i)\nfor j = (1:i)\n fprintf('Group %d : %d man, %d women, %d kids \\n',i,Group(j).men,...\n Group(j).women,Group(j).kids)\nend\n",WRONG_ANSWER,353,6508 1519982274622308352,a66af51e72e21889eab27c148d75aeec06615784a7d5e7c1bdf52e6812b6ffa2,2022-04-29 18:09:48,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor men=1:N\n for women=1:N\n for kids=1:N\n \tif(men*30+women*20+kids*10==500)…\n &(men+women+kids==30)\n fprintf('men: %d\\n',men)\n fprintf('Women: %d\\n',women)\n fprintf('\\kids: %d\\n',kids)\n end\n end\n end\nend\nj=0;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)...\n &(men+women+kids==30)\n j=j+1;\n A(j,1)=men;\n A(j,2)=women;\n A(j,3)=kids;\n end\n end\n end\nend\nmen____Women____kids=A",WRONG_ANSWER,53,6500 1519982280452386816,8fc961e77b8317840c680f798cc5f232c3bb7456505ef132f3c6880bad86119e,2022-04-29 18:09:50,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function max = mymax(i，j，k) \n \n\tint i, j, k;%i代表男人，j代表女人，k代表孩子\n\tfor (i = 1; i < 30; i++) {\n %有男有女有孩子，从1个男生开始判断\n\t\tfor (j = 1; j < 30 - i; j++) {\n %从一个女生开始判断\n\t\t\tfor (k = 1; k <= 30 - i - j; k++) {\n %从一个孩子开始判断\n\t\t\t\tif ((i * 3 + j * 2 + k) == 50 && (i + j + k) == 30) {\n \n\t\t\t\t\tcout << \""男人：\"" << i << \""\\n女人：\"" << j << \""\\n小孩：\"" << k << endl << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n",WRONG_ANSWER,26,6376 1519982280741793792,05698a4e2cda61edb9742c0752ec40f3df0c2875d77dbe0106818d122e5b80d5,2022-04-29 18:09:50,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function result=num(N)\ngroup = struct('man','women','children');\nfor x=1:10\n y=20-2*x;\n\tz=30-x-y;\n if y~=0&z~=0\n if 3*x+2*y+z==50\n group.man=x;\n group.wemen=y;\n group.children=z;\n end\n end\nend\n%调用函数\nresult=num(20)",WRONG_ANSWER,61,6492 1519982284738965504,7edf25ecdf8ff05a1043d8f7f769b87643818f516d6aeb14e91bad30cb7c4b41,2022-04-29 18:09:51,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"function s\ndisp\nfor i=1:30\n for j=1:30\n for k=1:30\n x=i;y=j;z=k;\n a=20-2*x-y;\n b=30-x-y-z;\n if a==0 &&b==0\n disp(['x=',num2str(i),' y=',num2str(j),' z=',num2str(k)])\n end\n end\n end\nend\nend\n\n\n",WRONG_ANSWER,26,6508 1519982285124829184,10b87770fc2bf977a8f2786c6b2628738ef909566a2f90b90a7e7cd9530fff65,2022-04-29 18:09:51,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"function x=fun(a)\nGroup(1).men=0;\nGroup(2).women=0;\nGroup(3).kids=0;\nsum=0;\nfor i=1:a\n for j=1:a\n for k=1:a\n Group(1).men=i\n Group(2).women=j\n Group(3).kids=k\n if Group(1).men*30+Group(2).women*20+Group(3).kids*10==500\n sum=sum+1\n fprintf(i,'men,',j,'women,',k,'kids')\n end\n end\n end\nend\nx=sum\n%以上为函数代码，老师我不会输出文字。。。您看下其他代码，第14不有问题\n\nprompt = 'input ';\nN = input(prompt)\nresult=fun(N);\n%以上为命令行窗口",WRONG_ANSWER,59,6952 1519982285217116160,2b37fcb625a4d606b048477fda0e732db13f508c8d5f4ae2eeb6b3a65aa20523,2022-04-29 18:09:51,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"clc;clear\nN=input(\""\"");\nN=N*1e4;%贷款总额\nt=60;%贷款期数\nsyms x;%期利率（月）\nS=6000;%每期还款额\neps=1e-14;\n\n%S=(N.*x.*(1+x).^60)/((1+x).^60-1)%公式\nf=@(x)(N.*x.*(1+x).^60)/((1+x).^60-1)-S; %函数fx\n%f1=@(x)N.*((1+x).^t+t*x*(1+x).^(t-1))*((1+x).^t-1)./((1+x).^t-1).^2; %f'(x)\nf1=@(x)N.*(1-((1+x).^t-1-t.*x.*(1+x).^(t-1))./((1+x).^t-1).^2); %f'(x)\n\n%零点约在0.07~0.08\n\n\nx=[0.07,0.08]; %两个初始值\nfx=f(x(2));\niter=0;\n\nwhile(abs(fx(1))>eps)\n lambda=1;\n fx=[f(x(1)),fx];\n df=(f(x(1))/f1(x(1)));\n \n while(fx(1) >= abs(fx(2)))\n lambda=lambda/2;\n x1=x(1)-lambda*df;\n fx(1)=abs(f(x1));\n iter=iter+1;\n end\n \n x=[x(1)-f(x(1))/(fx(1)-fx(2))*(x(1)-x(2)),x];\n iter=iter+1;\nend\n\nrate=x(1)* 12;\n\nfprintf('rate= %f\\n',rate);\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,57,6784 1519982285271646208,c66f09b592edb7ca6e0713080c08eed9dc5b181db3282bd57092afc43fe57e77,2022-04-29 18:09:51,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"%函数\nfunction [x]=myfun(fun,x0,x1,eps,maxiter)\n%牛顿下山法与割线法的综合\n%输入参数\n% --fun：迭代函数\n% --x0,x1：初始迭代点\n% --eps：精度要求：默认值为1e-6\n% --maxiter：最大迭代次数，默认为1e4\n%输出参数\n% --x：非线性方程的近似根\n% --iter：迭代次数\n% --X：每步迭代的结果\nif nargin<3,erro('输入参数至少需要3个'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nk=0;\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nwhile abs(x1-x0)>eps\n k=k+1;\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>abs(f1)\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %割线迭代\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n X(k)=x2;\nend\nif k==maxiter\n erro('迭代次数超出限制，迭代失败')\nend\nx=x2;iter=k;X=X';\nend\n%\nN=input(\""请输入汽车总价\"")；\nfn=@(x)12*(6000-N*10000/60)/6000-x;\nrate=myfun(fn,0,1)",WRONG_ANSWER,53,6652 1519982287213592576,bc1f4a6b2b573f22874906456b3de99882eef36c5e9e913912ace47336d8f4a9,2022-04-29 18:09:51,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 1 : 1 men, 18 women, 11 kids.",WRONG_ANSWER,26,6508 1519982294247456768,a994e0bd1575732e2ef2f8bb9ae19898c6b8b7092e1282d5950a1c702595cf0d,2022-04-29 18:09:53,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%函数文件\nfunction [x,e]=Linear_equation(A,b)\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\n%调用文件\nA=[30 20 10;1 1 1];\nb=[500;30];\n[x,e] = Linear_equation(A,b)",WRONG_ANSWER,26,6756 1519982296650780672,3743e8ba419e01c09d6d3cbb4a3a3dfed6c63431ba2aa21de11768f28dea3dcc,2022-04-29 18:09:54,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"%以下为mlx文件，在本地matlab运行正常，输出结果正常\n\ni=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(3*x+2*y+1*z)==50&(x+y+z)==30\n i=i+1;\n Group(i).men=x;\n Group(i).women=y;\n Group(i).kids=z;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i);\n\nfor m=1:i\n fprintf('Group %d : %d men, %d women , %d kids.\\n',m,Group(m).men,Group(m).women,Group(m).kids);\nend\n \n%结果：There are 9 possible groups.\n\n",PRESENTATION_ERROR,345,6620 1519982300350169088,1c8f0fe5b0cf6a377d4f4977bbd04e7ef17716e2eff88f22309ae78bfd72f386,2022-04-29 18:09:54,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,"N=input(\""请输入人数：\"");\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).wemen=woman;\n Group(j).kids=children;\n end\n end\n end\nend\ndisp('There are',[j],'possible groups.')\nfor i=1:j\n disp('Group',[i], ':', [ Group(i).men ],'men',[ Group(i).wemen],'women',[Group(j).kids], 'kids.')\nend",WRONG_ANSWER,385,6876 1519982300568272896,b82cc7e349e9c958e9f521eb8f448c438bb7347955ecbdf6d823eb6c85ec6d09,2022-04-29 18:09:55,Octave,0.0,1519868557406523400,1517040002215354368,1141715823085969408,"Group(1).men=struct(value1);\nGroup(2).wemen=struct(value2);\nGroup(3).kids=struct(value3);\nwhile\nvalue1+value2+value3=30||30*value1+20*value2+10*value3=500;\nperms([Group(1).men Group(2).wemen Group(3).kids]);\nnchoosek(perms,3)\nend\nfprint('There are nchoosek(perms,3)'/n)",WRONG_ANSWER,27,6492 1519982309682479104,8fc961e77b8317840c680f798cc5f232c3bb7456505ef132f3c6880bad86119e,2022-04-29 18:09:57,Octave,0.0,1519868557406523399,1517175951723835392,1141715925804474368,"function rate = purchase(N)\nif nargin<1\n N=30；\nend\nfun=@(r,N)6000/r*(1-1/(1+r)^60)-N*10000;\nfplot(@(rate)fun(r,N),[0,1]);\nhlod on\nplot(xlim,[0,0],'k')\n[x,~]=ginput(1);\nrate=fzero(@(r)fun(r,N),x);\nplot(rate,fun(N,rate),'r*','markersize',12);\ntitle('年利率:rate=',num2str(rate*12*100),'%')\nend\nrate = purchase(30)；",WRONG_ANSWER,55,6500 1519982309724434432,aa06baf985457dd9153f13920f5af6fde5790398a212287e2719a6f90617f4d3,2022-04-29 18:09:57,Octave,0.0,1519868557406523398,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nx = input\""\"";\nfun=@(x)180*r.*(1+r).^240./((1+r).^240-1)-1.2;\n[xx,iter,X]=newton_down(fun,1,[],100) % 牛顿下山法求根\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nx = input(\""\"");\n[xx,iter,X]=secant(fun,1.5,1,1e-8) % 割线法求根",WRONG_ANSWER,53,6764 1519982311850946560,d62764fb42154fef1f24d5cba7fbeb8becd1d42e9c8c7b9869ec8e2f26cba183,2022-04-29 18:09:57,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,function result= possibilities(N)\nM=0;W=0;C=0;\nGroup.men=0;\nGroup.women=0;\nGroup.kids=0;\nwhile M*30+W*20+C*10<500\n for M=1:N\n M=M+1;\n Group.men=Group.men+1;\n if M=1\n Group(k).men=i;\n Group(k).women=j;\n Group(k).kids=kid;\n k=k+1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',length(Group)-1)\nfor i=1:length(Group)-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',[i,Group(i).men,Group(i).women,Group(i).kids]);\nend",WRONG_ANSWER,57,6756 1519982320835149824,557be65c5cc83173fbab470e1dc19fdd7071d672c119e818ea4436ee1013ecaf,2022-04-29 18:09:59,Octave,0.0,1519868557406523401,1517141269389144064,1141715823085969408,">> N=20;\n>> syms x y z;\n>> [x,y,z]=solve([x+y+z==N,30*x+20*y+10*z==500],[x,y,z])\n ",WRONG_ANSWER,52,6628 1520006107349684224,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 19:44:30,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nx =input ('请输入人数');\ny=0;\nfor m = 1:x;\n for w = 1:x;\n for child = 1:x;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==x)\n y=y+1;\n Group(x). man= m;\n Group(x). woman= w;\n Group(x). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',x)\nfor z = 1:x\n fprintf('Group %d :\\n',z)\n disp(Group(z))\nend",WRONG_ANSWER,122,6508 1520006518311796736,a5a5bdf47a9a8565d03d74ba1d85680aa023859414e9f2f9f1341b2b908479a2,2022-04-29 19:46:08,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function result=huanqian(Y)\nfun=@(x)180*(x*(1+x)^Y)/((1+x)^Y-1)-1.2;\n [xx,~,~]=newton_secant(fun,0.004,0.006);\n%[xx,iter,X]=steffenson(fun,0.004,0.006);\nresult=xx;\n\n",WRONG_ANSWER,55,6656 1520008092824145920,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-29 19:52:24,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6620 1520008262185943040,a4caab2c9af73de7e6d42e08fcaf01e1557d6a3892d4086327b652a6c089b922,2022-04-29 19:53:04,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n主函数：\nfun=@(x)180*((x/12)*(1+(x/12)^240)/((1+(x/12)^240-1)-1.2;\n命令行调用函数解方程：\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,54,6504 1520008317148119040,a4caab2c9af73de7e6d42e08fcaf01e1557d6a3892d4086327b652a6c089b922,2022-04-29 19:53:17,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nfun=@(x)180*((x/12)*(1+(x/12)^240)/((1+(x/12)^240-1)-1.2;\n\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,53,6496 1520008365344849920,a4caab2c9af73de7e6d42e08fcaf01e1557d6a3892d4086327b652a6c089b922,2022-04-29 19:53:29,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n\n",WRONG_ANSWER,681,6756 1520008668152627200,a4caab2c9af73de7e6d42e08fcaf01e1557d6a3892d4086327b652a6c089b922,2022-04-29 19:54:41,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"i=0;\nfor x=1:30\n for y=1:30\n for z=1:30\n if(3*x+2*y+1*z)==50&(x+y+z)==30\n i=i+1;\n Group(i).men=x;\n Group(i).women=y;\n Group(i).kids=z;\n end\n end\n end\n end\n fprintf('There are %d possible groups.\\n',i);\n \n for m=1:i\n fprintf('Group %d : %d men, %d women , %d kids.\\n',m,Group(m).men);\n end",WRONG_ANSWER,689,6756 1520008727208427520,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 19:54:55,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\n[x,iter,X]=Newton_Secant(fun,0.007,0.006);\nrate = x;\nfunction [x,iter,X]=Newton_Secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,54,6628 1520009015109652480,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 19:56:04,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%以下为命令行窗口调用代码\n%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n%format long;\n%[x,iter,X]=newton_secant(fun,0.0001,0.0002)\n%要求年利率，再输入\n%XX=XX=12*X(length(X(:)))\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6756 1520009117639409664,d96b2a0a8330e609ae9aff4c87bfcafaf36fc02556231d7901331e684b33683e,2022-04-29 19:56:28,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,58,6756 1520009155279093760,a4caab2c9af73de7e6d42e08fcaf01e1557d6a3892d4086327b652a6c089b922,2022-04-29 19:56:37,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,674,6756 1520009185457111040,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 19:56:44,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\n[x,iter,X]=Newton_Secant(fun,0.007,0.006);\nrate = x*12;\nfunction [x,iter,X]=Newton_Secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,56,6760 1520009204587331584,6854da3ab79a035c49b4f575d5a384125467bbf1684ba0323e06f36922c512db,2022-04-29 19:56:49,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx =\n 0.00426762528564472\niter =\n 4\nX =\n 0.00437256674949125\n 0.0042721389151354\n 0.00426763795820826\n 0.00426762528564472",WRONG_ANSWER,54,6756 1520009281204699136,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 19:57:07,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"month=input('请输入月数:')\n\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nx*12\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6760 1520009348598771712,166db738fbeb2a426f5e729d5b5bcb0eed05fbb874e011c19912f2f3cfd587a1,2022-04-29 19:57:23,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6788 1520009504127746048,5c2d28f3e076344e2df371f2ca9d074ed3010d800aebbe16b29460980056741c,2022-04-29 19:58:00,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear;\nclc;\nN = input('N:\\n')\n% 设月利率为x, 方程为6000 = N*10000*x*(1+x)^60/((1+x)^60-1)\nfun =@(x) 6000 - N*10000*x*(1+x)^60/((1+x)^60-1);\nx = NSmix(fun, 0.3, 0.4, 1e-10, 500);\nrate = 12*x;\nrate\n\n\nfunction [x]=NSmix(fun,x0,x1,eps,maxiter)\n% 割线法和牛顿下山发综合 求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1;\n k=k+1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2); \n while(abs(f2)>abs(f1))\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n f0=f1;f1 = f2; % 计算x0,x1处的函数值\n x0=x1;x1=x2; \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=roundn(x2,-5);iter=k;X=X';\nend",WRONG_ANSWER,54,6752 1520009595081232384,483e7993c1a862ba18b890443521b8afe4c4c1e49a680cc1066ffd12a837e417,2022-04-29 19:58:22,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n%引入函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n%调用牛顿下山割线法\n[x,iter,X]=newton_down_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6764 1520009683031592960,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-29 19:58:43,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%调用函数求解\n% rate——贷款年利率\n%rate1——贷款月利率\nmoney=300*0.6; %贷款额\nN=input('请输入月数N=');\nmonth=N; %总月数\nfun=@(rate1)(money*(rate1*(1+rate1)^month)/((1+rate1)^month-1)-1.2);%构建函数\n[rate1,iter,X]=newton_secant(fun,0.007,0.006);\nrate=12*rate1\n\n%函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6632 1520009772013752320,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 19:59:04,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"month=input('请输入月数:')\n\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('rate = %.6f',x*12)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n",WRONG_ANSWER,57,6900 1520009918969577472,6854da3ab79a035c49b4f575d5a384125467bbf1684ba0323e06f36922c512db,2022-04-29 19:59:39,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx =\n 0.00426762528564472",WRONG_ANSWER,53,6788 1520009999051427840,9382e2816e7f3001ce0ffebb4e6220f0085197f35b6e46570985b46f3d074745,2022-04-29 19:59:58,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,59,6808 1520010008220184576,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 20:00:01,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"month=input()\n\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('rate = %.6f',x*12)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n",WRONG_ANSWER,57,6668 1520010050461011968,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 20:00:11,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"month=240\n\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('rate = %.6f',x*12)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n",WRONG_ANSWER,54,6508 1520010083948343296,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 20:00:19,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"month=240;\n\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('rate = %.6f',x*12)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n",WRONG_ANSWER,62,6708 1520010116370317312,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 20:00:26,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\nrate = Newton_Secant(fun,0.007,0.006);\n\nfunction rate = Newton_Secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = x*12;\nend\n",WRONG_ANSWER,53,6632 1520010201007177728,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 20:00:47,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"month=240;\n\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('rate = %.6f',x*12);\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n",WRONG_ANSWER,53,6764 1520010316677677056,1981fc8cccca4fc93007a753032e2da555e43269e0a6574b1ae545fc2d2bc2d8,2022-04-29 20:01:14,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"\nm=input(\""请输入还款月数:\\n\""); % 还款月数\nA=180; % 贷款金额(万)\nX=1.2; % 每月偿还本息(万)\nsyms b % 月利率(%)\n \ny = @(b)(A.*b.*(1+b).^m) ./ ((1+b).^m-1) - X; % 构造迭代函数\n\n[xx,iter,X]=newton_secant(y,0.008,0.005,[],100); % 牛顿下山法和割线法综合求解\nrate = xx*12 %年利率\n\n\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n % 牛顿下山法和割线法综合求解非线性方程的根\n % 输入参数：\n % ---fun：迭代函数\n % ---x0：初始迭代点\n % ---eps：精度要求，默认值为1e-6\n % ---maxiter：最大迭代次数，默认值为1e4\n % 输出参数：\n % ---x：非线性方程的近似根\n % ---iter：迭代次数\n % ---X：每一步迭代的结果\n if nargin<2\n error('输入参数至少需要2个！'); end\n if nargin<3||isempty(eps)\n eps=1e-6; end\n if nargin<4||isempty(maxiter) \n maxiter=1e4; end\n\n k=1;\n tol=1;\n\n while abs(tol)>eps\n lambda=1;\n fx0 = feval(fun,x0); % 计算x0处的函数值\n fx1 = feval(fun,x1); % 计算x1处的函数值\n dfx1=(fx1-fx0)./(x1-x0);\n \n fx2=fx1;\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1/dfx1; % 牛顿下山迭代\n fx2=feval(fun,x2);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n x1=x2;\n X(k)=x1;\n end\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\n x=x1;\n iter=k;\n X=X';\nend",WRONG_ANSWER,52,6768 1520010372076048384,5a79b65a3390a21141f40ffe4d76ced94b3ee6c1e8f71f39122cee38cb4ef95a,2022-04-29 20:01:27,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=Newton_xiashan_gexian(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nf3= feval(fun,x0);%计算x0处的函数值，用作交换\nif f0eps\n lambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf4= feval(fun,x2);\n while abs(f4)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代\n f4=feval(fun,x2);\n % x0=x1;\n end\n k=k+1; x0=x1;x1=x2;\n f0=f1;f1=f4;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';",WRONG_ANSWER,53,6512 1520010453311328256,1981fc8cccca4fc93007a753032e2da555e43269e0a6574b1ae545fc2d2bc2d8,2022-04-29 20:01:47,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"\nm=input(\""请输入还款月数:\\n\""); % 还款月数\nA=180; % 贷款金额(万)\nX=1.2; % 每月偿还本息(万)\nsyms b % 月利率(%)\n \ny = @(b)(A.*b.*(1+b).^m) ./ ((1+b).^m-1) - X; % 构造迭代函数\n\n[xx,iter,X]=newton_secant(y,0.008,0.005,[],100); % 牛顿下山法和割线法综合求解\n\nformat long\nrate = xx*12 %年利率\n\n\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n % 牛顿下山法和割线法综合求解非线性方程的根\n % 输入参数：\n % ---fun：迭代函数\n % ---x0：初始迭代点\n % ---eps：精度要求，默认值为1e-6\n % ---maxiter：最大迭代次数，默认值为1e4\n % 输出参数：\n % ---x：非线性方程的近似根\n % ---iter：迭代次数\n % ---X：每一步迭代的结果\n if nargin<2\n error('输入参数至少需要2个！'); end\n if nargin<3||isempty(eps)\n eps=1e-6; end\n if nargin<4||isempty(maxiter) \n maxiter=1e4; end\n\n k=1;\n tol=1;\n\n while abs(tol)>eps\n lambda=1;\n fx0 = feval(fun,x0); % 计算x0处的函数值\n fx1 = feval(fun,x1); % 计算x1处的函数值\n dfx1=(fx1-fx0)./(x1-x0);\n \n fx2=fx1;\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1/dfx1; % 牛顿下山迭代\n fx2=feval(fun,x2);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n x1=x2;\n X(k)=x1;\n end\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\n x=x1;\n iter=k;\n X=X';\nend",WRONG_ANSWER,53,6764 1520010671536766976,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-29 20:02:39,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"y=input('');\nfun=@(x) 180*x.*(1+x).^y./((1+x).^240-1)-1.2;\nx0=0.003;\nx1=0.0031;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nlamda=2;\neps=1e-6;\nmaxiter=1e4;\nwhile abs(x1-x0)>eps\n lamda=lamda/2;\n k=k+1;\n x2=x1-lamda*f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12\n\n\n\n\n",WRONG_ANSWER,53,6756 1520010682886553600,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 20:02:41,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"month=input('请输入月数:')\n\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('rate = %.6f',x*12)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n",WRONG_ANSWER,53,6636 1520010996654051328,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:03:56,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"X1=0;\nX2=0;\nX3=0;\nsum=0;\nfor i=0:1:30\n for j=0:1:30\n for k=0:1:30\n if(i*30+j*20+k*10==500&&i+j+k==30)\n sum=sum+1;\n X1(sum)=i;\n X2(sum)=j;\n X3(sum)=k;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',sum);\nfor i=1:sum\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,X1(i),X2(i),X3(i));\nend",WRONG_ANSWER,98,6656 1520011028031635456,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 20:04:04,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"% function result = test(a,b,angle)\n% rad = (angle/180)* pi;\n% c = sqrt(a^2 + b^2 - cos(rad)*a*b );\n% s = 0.5 * a * b * sin(rad);\n% result = [c,s];\n% end\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\nrate = Newton_Secant(fun,0.007,0.006);\n\nfunction rate = Newton_Secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = roundn(x*12,-6);\n\nend",WRONG_ANSWER,53,6636 1520011029692592128,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:04:04,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"X1=0;\nX2=0;\nX3=0;\nsum=0;\nfor i=0:1:30\n for j=0:1:30\n for k=0:1:30\n if(i*30+j*20+k*10==500&&i+j+k==30)\n sum=sum+1;\n X1(sum)=i;\n X2(sum)=j;\n X3(sum)=k;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',sum);\nfor i=1:sum\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,X1(i),X2(i),X3(i));\nend",WRONG_ANSWER,102,6752 1520011038488047616,6854da3ab79a035c49b4f575d5a384125467bbf1684ba0323e06f36922c512db,2022-04-29 20:04:06,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2; % 命令行代码\n[x,iter,X]=newton_secant(fun,0.007,0.006) % 命令行代码\n%结果\n\nx =\n\n 0.0043\niter =\n\n 4\n\nX =\n\n 0.0044\n 0.0043\n 0.0043\n 0.0043",WRONG_ANSWER,53,6760 1520011062139719680,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:04:12,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"X1=0;\nX2=0;\nX3=0;\nsum=0;\nfor i=0:1:30\n for j=0:1:30\n for k=0:1:30\n if(i*30+j*20+k*10==500&&i+j+k==30)\n sum=sum+1;\n X1(sum)=i;\n X2(sum)=j;\n X3(sum)=k;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',sum);\nfor i=1:sum\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,X1(i),X2(i),X3(i));\nend",WRONG_ANSWER,95,6560 1520011115822628864,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 20:04:25,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\nrate = Newton_Secant(fun,0.007,0.006);\n\nfunction rate = Newton_Secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = roundn(x*12,-6);\n\nend",WRONG_ANSWER,53,6508 1520011292994220032,4def03706adecd0d476796d4a0d60384c5b04d1f4d01bc878728afae67acee34,2022-04-29 20:05:07,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function rate=newton_secant_yearrate(N)\n%rate-年利率 N-汽车总价\n%调用形式rate=newton_secant_yearrate(30)\nfx=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.60000;\ner = 1e-6;\na = 0.006000;\nb = 0.007000;\nf0 = feval(fx,a); \nf1 = feval(fx,b); \nk=0;err=1;\nwhile abs(err)>er\n\tL=1;%下山因子\n\tc=b-L*f1*(b-a)/(f1-f0);\n\tf2 = feval(fx,c);\n\twhile abs(f2)>=abs(f1) \n L=L/2; \n c=b-L*f1*(b-a)/(f1-f0); \n f2=feval(fun,c);\n end\n a=b;b=c;\n f0=f1;f1=f2;\n err=b-a;\n k=k+1;\nend\nrate=c*12;\nend",WRONG_ANSWER,54,6620 1520011494765408256,a2ddf746ad0a8b56f3d9433a6b872ebd641729a50f5e247be73f3866c39e9599,2022-04-29 20:05:55,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"\nfunction [x,iter,X]=inner_product(fun,x0,x1,eps,maxiter)\nq=input('');\nfun=@(x)180*(x*(1+x)^q)/((1+x)^q-1)-1.2;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6768 1520011657055604736,d96b2a0a8330e609ae9aff4c87bfcafaf36fc02556231d7901331e684b33683e,2022-04-29 20:06:34,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"j=0\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n fprintf('Group= (%d) ',j)\n fprintf('Man= %d, ',man)\n fprintf('Woman=%d, ',woman)\n fprintf('Chlidren= %d.\\n',children)\n end\n end\n end\nend\n",WRONG_ANSWER,337,6644 1520011886651817984,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 20:07:28,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n\nrate = Newton_Secant(fun,0.007,0.006);\n\nfunction rate = Newton_Secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = x*12;\n\nend",WRONG_ANSWER,53,6504 1520012000283889664,78e3a7a73403675fd48af94fb03b169771e91bade2a5eec499f8c31a3afedf3e,2022-04-29 20:07:55,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"format short e\nN=input('N');\nfun=@(x)x*(1+x)^60*N*10000-6000*((1+x)^60-1);\n[xx,iter,X]=secant(fun,0.007,0.006);\nxx\nM=xx*12\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,60,6756 1520012020013895680,78e3a7a73403675fd48af94fb03b169771e91bade2a5eec499f8c31a3afedf3e,2022-04-29 20:08:00,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"format short e\nN=input('N');\nfun=@(x)x*(1+x)^60*N*10000-6000*((1+x)^60-1);\n[xx,iter,X]=secant(fun,0.007,0.006);\nxx\nM=xx*12\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6936 1520012035876749312,311bf6f9551ce771eebcb3933d5b6c648cdb32d0269d79a77b0a0574de54e5ba,2022-04-29 20:08:04,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"% 给出房贷利率计算方程，画曲线\nr = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2;\nplot(r,y)\n\n% 牛顿下山法\n[x,iter,X]=newton_down(y,4.7e-3,4.6e-3)\n\n%割线法\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=secant(y,4.7e-3,4.6e-3)\n\n\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% --x：非线性方程的近似根\n% --iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3||isempty(eps),eps=1e-6;end\nif nargin<4||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\n\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';",WRONG_ANSWER,54,6764 1520012038871494656,efe82bf3be05869fddccc0c2bc168b4eb7e61593e0ea658fc769b6189b8998a5,2022-04-29 20:08:05,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\na=input(\""\"");\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,56,6672 1520012084018987008,efe82bf3be05869fddccc0c2bc168b4eb7e61593e0ea658fc769b6189b8998a5,2022-04-29 20:08:15,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\na=input(\""\"");\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6748 1520012109692309504,adc99570fa0c46ee0137abbd7683d6279e6c6a2cc6c4048bc82526df191b2dc7,2022-04-29 20:08:22,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"脚本：\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\n\n命令行：\nff=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(ff,4e-3);\nrate=12*x;\n(再输入rate)",WRONG_ANSWER,52,6640 1520012133134282752,adc99570fa0c46ee0137abbd7683d6279e6c6a2cc6c4048bc82526df191b2dc7,2022-04-29 20:08:27,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"脚本：\nfunction [x,iter,X] = steffenson(fun,x0,eps,maxiter)\n% Steffenson法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps;\n k=k+1;\n f0 = feval(fun,x0); % 计算x0处的函数值\n x1=x0-f0^2/(feval(fun,x0+f0)-f0); % Steffenson法迭代公式\n err=x1-x0;\n x0 = x1; % 更新x0数值\n X(k)=x1;\nend\nx=x1;iter=k;X=X';\n\n命令行：\nff=@(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=steffenson(ff,4e-3);\nrate=12*x;\n(再输入rate)",WRONG_ANSWER,65,6564 1520012144140136448,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:08:30,Octave,20.0,1519869963626618887,1517175951723835392,1141715925804474368,"N = input(\""\"");\nfun = @(t) N*(t*(1+t)^60)/((1+t)^60-1)-0.6;\n\nx0 = 0.001;\nx1 = 1;\n\nk = 0;\nf0 = feval(fun, x0);\nf1 = feval(fun, x1);\nwhile abs(x1-x0) > eps\nlambda = 1;\nk = k + 1;\nx2 = x1 -lambda*f1*(x1-x0)/(f1-f0);\nf0 = f1;\nx0 = x1; \nx1 = x2;\nf1 = feval(fun, x1);\nwhile abs(f1) > abs(f0)\nlambda = lambda/2;\nx2 = x1 -lambda*f1*(x1-x0)/(f1-f0);\nf0 = f1;\nx0 = x1; \nx1 = x2;\nf1 = feval(fun, x1);\nend\n\nend\n\nrate = x2*12",ACCEPTED,55,6640 1520012517827444736,d96b2a0a8330e609ae9aff4c87bfcafaf36fc02556231d7901331e684b33683e,2022-04-29 20:09:59,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\n",WRONG_ANSWER,53,6764 1520012676435054592,8ff11f778ceb4230ea851a7022dfa0b6aa7534bf62d13bb34576ddeb217e24dc,2022-04-29 20:10:37,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\n\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,55,6752 1520012806747885568,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:11:08,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"x=struct('man',0,'women',0,'kids',0);\nsum=0;\nfor i=0:1:30\n for j=0:1:30\n for k=0:1:30\n if(i*30+j*20+k*10==500&&i+j+k==30)\n sum=sum+1;\n x.men(sum)=i;\n x.women(sum)=j;\n x.kids(sum)=k;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',sum);\nfor i=1:sum\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,x.men(i),x.women(i),x.kids(i));\nend",WRONG_ANSWER,96,6504 1520012992324866048,5c2d28f3e076344e2df371f2ca9d074ed3010d800aebbe16b29460980056741c,2022-04-29 20:11:52,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"cnt=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n cnt=cnt+1;\n Group(cnt).men=man;\n Group(cnt).women=woman;\n Group(cnt).children=children;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',cnt);\nfor i=1:cnt\n fprintf('Group %d : %d men, %d women, %d kids.\\n', i,Group(i).men,Group(i).women,Group(i).children);\nend\n",ACCEPTED,346,6756 1520013018660909056,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-29 20:11:58,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"sum=30;\nSUM=500;\nX=30;\nY=20;\nZ=10;\ni=1;\nfor m=0:12\n for n=0:25\n for l=0:50\n if (30*m+20*n+10*l)==SUM\n if (m+n+l)==sum\n Group(i).man=m;\n Group(i).woman=n;\n Group(i).kid=l;\n i=i+1;\n end\n end \n end\n end\nend\ni=i-1;\ns=sprintf('There are %d possible groups.',i);\ndisp(s)\n% a=1;\nfor a=1:i\n sa=sprintf('Group(%d) :%d men, %d women, %d kids.',a,Group(a).man,Group(a).woman,Group(a).kid); \n disp(sa);\nend ",WRONG_ANSWER,73,6756 1520013225062596608,8514bd79b4517ce34f133677593e590ea5f3ec96cc41fff84370405cff82991d,2022-04-29 20:12:47,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[x,i,X]=newton-secant(lu,x0,x1,e,m)\nn=0;r=1;\nif nargin<3,error('至少输入三个参数'),end\nif nargin<4|isempty(e);end\nif nargin<5|isempty(m);end\nf1=feval(lu,x0);\nf2=feval(lu,x1);\nwhile abs(r)>1\n la=1;\n x2=x1-la*f2*(x1-x0)/(f2-f1);\n f3=feval(lu,x2);\n while abs(f3)>=abs(f2)\n la=la/2;\n x2=x1-la*(x0-x1)*f2/(f2-f1)\n f3=feval(lu,x2);\n end\n x0=x1;x1=x2;\n f1=f2;f2=f3;\n r=x1-x0;n=n+1;\n X(n)=x2;\nend\n\nif n>=m\n error('迭代失败')\nend\nx=x2;i=n;X=X';\nend",WRONG_ANSWER,54,6672 1520013322106220544,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:13:11,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;j=1;\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (3 * x) + (2 * y) + z == 50)\n i=i+1;\n end\n end\n end\nend\nfprintf(\""There are %i possible groups.\\n\"",i)\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (3 * x) + (2 * y) + z == 50)\n\t\t\t\t\tfprintf(\""Group %i : %i men, %i women, %i kids.\\n\"",j, x, y, z);\n Group.male(j)=x;\n Group.female(j)=y;\n Group.child(j)=z;\n j=j+1;\n end\n end\n end\nend\n",WRONG_ANSWER,138,6652 1520013393677815808,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-29 20:13:28,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input('请输入人数N=');\ni=0;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)...\n &(men+women+kids==N)\n i=i+1;\n Group(i).men=men;\n Group(i).women=women;\n Group(i).kids=kids;\n fprintf('Group %d : %d men, %d women, %d kids\\n',i,men,women,kids);\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',i);",WRONG_ANSWER,389,6916 1520013464884514816,bec47e6e8b8cf5c24d0ca467c02b0cf9b64758d469d83a5948e4ac0b985b908c,2022-04-29 20:13:45,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"r=input('');\nGroup= struct('men',[0,30],'women',[0,30],'kids',[0,30]);\nGroup(1).men=1;\nGroup(1).women=1;\nGroup(1).kids=1;\nk=0;\nfor x = 1:30\n for y = 1:30\n for z = 1:30\n if(x*30+y*20+z*10==500)&&(x+y+z==r)\n k=k+1;\n Group(k).men=x;\n Group(k).women=y;\n Group(k).kids=z;\n end\n end\n end\nend\noutput 'There are 4 possible groups.';\nfor i=1:k\noutput Group(k).men;\noutput Group(k).women;\noutput Group(k).kids;\nend\n",WRONG_ANSWER,176,6752 1520013493149929472,53983118467742bdb5c748c6a26f9888e0c290bfd8abd905cb25557243f99ea5,2022-04-29 20:13:51,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,n,y]=newton_secant(fun,x0,x1,eps,maxn)%牛顿下山法和割线法综合迭代\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxn),maxn=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n y(k)=x2;\nend\n\nif k>=maxn\n error('迭代次数超限，迭代失败！')\nend\nx=x2;n=k;y=y';\nend\n\n\nN=input(\""\"");%调用窗口\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x*12;",WRONG_ANSWER,54,6568 1520013533981478912,296dda71b961a8dfd967d75da985369ce57467824a387a3024010ab4bc12bdc1,2022-04-29 20:14:01,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=money_rate(month)\nfun=@(x)180*(x*(1+x)^month)/((1+x)^month-1)-1.2;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;\niter=k;\nX=X';\nend",WRONG_ANSWER,54,6792 1520013612557578240,a0777d78c08727b8b8fbe567d47b9f45878b1313e7d8f1872ac0dea22d14d091,2022-04-29 20:14:20,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"脚本文件：\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n命令行：\n% 给出房贷利率计算方程\n%\nr = 0.002 : .001:.005;\ny = 180*r.*(1+r).^240./((1+r).^240-1)-1.2\n% 牛顿下山割线法\ny = @(x) 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_down_secant(y,4.7e-3,4.6e-3）\n",WRONG_ANSWER,51,6640 1520013695890001920,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:14:40,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;j=1;\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (3 * x) + (2 * y) + z == 50)\n i=i+1;\n end\n end\n end\nend\ni=i-1;\nfprintf(\""There are %i possible groups.\\n\"",i)\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (3 * x) + (2 * y) + z == 50)\n\t\t\t\t\tfprintf(\""Group %i : %i men, %i women, %i kids.\\n\"",j, x, y, z);\n Group.male(j)=x;\n Group.female(j)=y;\n Group.child(j)=z;\n j=j+1;\n end\n end\n end\nend",WRONG_ANSWER,137,6492 1520013700239507456,483e7993c1a862ba18b890443521b8afe4c4c1e49a680cc1066ffd12a837e417,2022-04-29 20:14:41,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n该函数的调用格式为\n[x,e]=Linear_equation(A,b)\nA = [1 1 1;30 20 10];\nb = [30;500];\n[x e] = Linear_equation(A,b)",WRONG_ANSWER,25,6752 1520013788915470336,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-29 20:15:02,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"sum=30;\nSUM=500;\nX=30;\nY=20;\nZ=10;\ni=1;\nfor m=0:12\n for n=0:25\n for l=0:50\n if (30*m+20*n+10*l)==SUM\n if (m+n+l)==sum\n Group(i).man=m;\n Group(i).woman=n;\n Group(i).kid=l;\n i=i+1;\n end\n end \n end\n end\nend\ni=i-1;\ns=sprintf('There are %d possible groups.',i);\ndisp(s)\n% a=1;\nfor a=1:i\n sa=sprintf('Group(%d)\\t:%d\\tmen, %d\\twomen, %d\\tkids.',a,Group(a).man,Group(a).woman,Group(a).kid); \n disp(sa);\nend ",WRONG_ANSWER,73,6776 1520013798335877120,bec47e6e8b8cf5c24d0ca467c02b0cf9b64758d469d83a5948e4ac0b985b908c,2022-04-29 20:15:04,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"r=input('');\nGroup= struct('men',[0,30],'women',[0,30],'kids',[0,30]);\nGroup(1).men=1;\nGroup(1).women=1;\nGroup(1).kids=1;\nk=0;\nfor x = 1:30\n for y = 1:30\n for z = 1:30\n if(x*30+y*20+z*10==500)&&(x+y+z==r)\n k=k+1;\n Group(k).men=x;\n Group(k).women=y;\n Group(k).kids=z;\n end\n end\n end\nend\n'There are 4 possible groups.';\nfor i=1:k\n Group(k).men;\n Group(k).women;\n Group(k).kids;\nend\n",WRONG_ANSWER,181,6504 1520014014757769216,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:15:56,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;j=1;\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (30 * x) + (20 * y) + (10*z) == 500)\n i=i+1;\n end\n end\n end\nend\ni=i-1;\nfprintf(\""There are %i possible groups.\\n\"",i)\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (30 * x) + (20 * y) + (10*z) == 500)\n\t\t\t\t\tfprintf(\""Group %i : %i men, %i women, %i kids.\\n\"",j, x, y, z);\n Group.male(j)=x;\n Group.female(j)=y;\n Group.child(j)=z;\n j=j+1;\n end\n end\n end\nend\n",WRONG_ANSWER,139,6504 1520014109574201344,74cd21d5303b9a0ccb99014f248d1dc21605e459311aad1fc0aae059688087fb,2022-04-29 20:16:18,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\na=input(\""\"")\nfun=@(x)180*x*(1+x)^a(1)/((1+x)^a(1)-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.0001,0.0002);\nrate=x*12;",WRONG_ANSWER,53,6616 1520014121129508864,5163865c7dba6e5da20174834732278b79aee99c5aaa8bbefcc23761ba75b2aa,2022-04-29 20:16:21,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N = input(\""\"");\ntimes = 0;\nfor x = 1:N\n for y = 1:N\n if(30*x+20*y+(20-x-y)*10==500&&20-x-y>0)\n times = times +1 ;\n \n end\n end\nend\n\ndisp(['There are ',num2str(times),' possible groups.'])\ntimes = 0;\nfor x = 1:N\n for y = 1:N\n if(30*x+20*y+(20-x-y)*10==500&&20-x-y>0)\n times = times +1 ;\n disp(['Group',num2str(times),':',num2str(x),'mens ',num2str(y),'women ',num2str(N-x-y),'kids'])\n end\n end\nend\n",WRONG_ANSWER,58,6752 1520014156198084608,8514bd79b4517ce34f133677593e590ea5f3ec96cc41fff84370405cff82991d,2022-04-29 20:16:29,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[x,i,X]=newton-secant(lu,x0,x1,e,m)\nlu=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nn=0;r=1;\nif nargin<3,error('至少输入三个参数'),end\nif nargin<4|isempty(e);end\nif nargin<5|isempty(m);end\nf1=feval(lu,x0);\nf2=feval(lu,x1);\nwhile abs(r)>1\n la=1;\n x2=x1-la*f2*(x1-x0)/(f2-f1);\n f3=feval(lu,x2);\n while abs(f3)>=abs(f2)\n la=la/2;\n x2=x1-la*(x0-x1)*f2/(f2-f1)\n f3=feval(lu,x2);\n end\n x0=x1;x1=x2;\n f1=f2;f2=f3;\n r=x1-x0;n=n+1;\n X(n)=x2;\nend\n\nif n>=m\n error('迭代失败')\nend\nx=x2;i=n;X=X';\nend",WRONG_ANSWER,54,6768 1520014197356802048,8ad0f476dd23aa25ee8f5f7fb51577364f54220e81dad4f77c1e140c2c21071d,2022-04-29 20:16:39,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \n% 计算x0处的函数值\nf1 = feval(fun,x1);\n% 计算x1处的函数值\nk=0; %k统计迭代次数\nerr=1; %err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1; %下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0; %更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\ninput('输入N=')\nfun=@(x)(N*(1+x)^5*10^4-60*6000);",WRONG_ANSWER,52,6756 1520014398649839616,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:17:27,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=bupt2020210018_exam_2(fun,x0,x1,eps,maxiter)\n%以下为命令行窗口调用代码\n%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n%format long;\n%[x,iter,X]=bupt2020210018_exam_2(fun,0.0001,0.0002)\n%要求年利率，再输入\n%XX=12*X(length(X(:))) \nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6644 1520014407772454912,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-29 20:17:29,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%结合牛顿下山法和割线法的综合迭代方法求解函数\nfunction [x,iter,X]=newton_secant(fun,x0,eps,maxiter)\n% 牛顿下山和割线法的综合迭代方法\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nend\n\n%调用function\n%根据计算建模得到利率公式\ny = @(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X] = newton_secant(y,4e-3);",WRONG_ANSWER,55,6760 1520014463040786432,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:17:43,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个')nd\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=fevalz(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败')\nend\njinsi=x2;cishu=n;X=X';\nend",WRONG_ANSWER,54,6656 1520014559186812928,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-29 20:18:06,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%主函数test.m\nN=input('');\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2; \n[x,iter,X]=newton_secant(fun,0.01,0.009); \ndisp(x*12)\n\n\n%函数牛顿下山法综合迭代方法\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,56,6660 1520014561237839872,bec47e6e8b8cf5c24d0ca467c02b0cf9b64758d469d83a5948e4ac0b985b908c,2022-04-29 20:18:06,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_reroot(fun,x0,eps,maxiter)\n\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=0;err=1;\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0,d2fx0]=feval(fun,x0);\n x1=x0-fx0*dfx0/(dfx0^2-fx0*d2fx0); \n err=x1-x0; \n x0=x1; \n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';",WRONG_ANSWER,53,6764 1520014604560797696,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-29 20:18:16,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"n=0;\nfor i=1:30\n for j=1:30\n for k=1:30\n if i+j+k==30&&30*i+20*j+10*k==500\n n=n+1;\n Group(n).men=i;\n Group(n).wemen=j;\n Group(n).kids=k;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',n);\nfor i=1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",ACCEPTED,78,6736 1520014774069399552,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-29 20:18:57,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"y=input('');\nfun=@(x) 180*x.*(1+x).^y./((1+x).^240-1)-1.2;\nx0=0.003;\nx1=0.0031;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nlamda=2;\neps=1e-6;\nmaxiter=1e4;\nwhile abs(x1-x0)>eps\n lamda=lamda/2;\n k=k+1;\n x2=x1-lamda*f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12\n\n\n\n\n",WRONG_ANSWER,53,6508 1520014820223520768,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-29 20:19:08,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%主函数test.m\nN=input(''); %输入还款月数\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2; %还款函数\n[x,iter,X]=newton_secant(fun,0.01,0.009); \ndisp(x*12)%输出年利率\n\n\n%函数牛顿下山法综合迭代方法\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6500 1520014950540546048,0fe50fa0e59ea5cd203cb2d5f7158286980839f76fe379e4a9e2aeab33174e51,2022-04-29 20:19:39,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input('N=');\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&(man+woman+children==N)\n j=j+1\n fprintf( 'Group: %d',j)\n fprintf( 'men: %d',man)\n fprintf( 'women: %d',woman)\n fprintf( 'kids: %d\\n',children)\n end\nfprintf('There are j possible groups')\n end\n end\nend",MULTIPLE_ERROR,447,7272 1520015039946338304,dcdf317ffe0b171cf03967df730cc59eec4fc0406f647482f6fbd870fb4ef0b1,2022-04-29 20:20:00,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"f=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[p,k,P]=newton_secant(f,0.007,0.006)\n\n%函数部分\nfunction [p,k,P]=newton_secant(f,p0,p1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---f：迭代函数\n% ---p0,p1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---p：非线性方程的近似根\n% ---k：迭代次数\n% ---P：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(f,p0); % 计算p0处的函数值\nf1 = feval(f,p1); % 计算p1处的函数值\nk=1;%k统计迭代次数\nwhile abs(p1-p0)>eps\n k=k+1;\n\tlambda=1;%下山因子\n\tp2=p1-lambda*f1*(p1-p0)/(f1-f0);\n\tf2 = feval(f,p2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n p2=p1-lambda*f1*(p1-p0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(f,p2);\n end\n p0=p1;\n p1=p2;\n f0=f1;\n f1=f2;\n P(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\np=p2;\nk=k-1;\nP=P';\nend",WRONG_ANSWER,56,6652 1520015299426959360,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:21:02,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('汽车价格');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x.*12\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,58,6756 1520015301092085760,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-29 20:21:02,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%结合牛顿下山法和割线法的综合迭代方法求解函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山和割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;tol=1;\nwhile abs(tol)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n tol=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n%调用function\n%根据计算建模得到利率公式\ny = @(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_secant(y,1e-3,5e-3)",WRONG_ANSWER,58,6760 1520015349133656064,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-29 20:21:14,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%结合牛顿下山法和割线法的综合迭代方法求解函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山和割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;tol=1;\nwhile abs(tol)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n tol=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%调用function\n%根据计算建模得到利率公式\ny = @(x)180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=newton_secant(y,1e-3,5e-3)",WRONG_ANSWER,54,6756 1520015464103710720,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:21:41,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"mon=input(\""\"");\nx0=0.007;\nx1=0.006;\nf=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nf0 = feval(f,x0);\nf1 = feval(f,x1); \nk=0;error=1;\nwhile abs(error)>1e-9\n l=1;\n x2=x1-l*f1*(x1-x0)/(f1-f0);\n f2 = feval(f,x2);\n while abs(f2)>=abs(f1) \n l=l/2; \n x2=x1-l*f1*(x1-x0)/(f1-f0); \n f2=feval(f,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n error=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nrate=x2;iter=k;X=X';\nrate;",WRONG_ANSWER,57,6508 1520015496232091648,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:21:49,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个')end\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=fevalz(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败')\nend\njinsi=x2;cishu=n;X=X';\nend",WRONG_ANSWER,54,6500 1520015521188188160,311bf6f9551ce771eebcb3933d5b6c648cdb32d0269d79a77b0a0574de54e5ba,2022-04-29 20:21:55,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408," A = [30 20 10 ;1 1 1];\nb = [500 30]';\n[x e]=Linear_equation(A,b)\n\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=x0+z*k.'; %原方程的通解\n e=A*x-b; %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n",WRONG_ANSWER,28,6752 1520015531149656064,93c021ee62e64a2dfa8f4b7d4e64ed8bbdc7255cae00ed9e2fae51b5c73cd4d2,2022-04-29 20:21:57,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;\nfor a=1:30\n for b=1:30\n for c=1:30\n if ((a+b+c)==30&(30*a+20*b+10*c)==500)\n Group(i).men=a;\n Group(i).women=b;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\nend\ndisplay(['There are ',num2str(i-1),'possible groups.']);\nfor k=1:(i-1)\ndisp(['Group',num2str(k),':',num2str(Group(k).men),' men,',...\n num2str(Group(k).women),' women,',num2str(Group(k).kids),' kids.']);\nend\n",WRONG_ANSWER,341,6504 1520015575433117696,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:22:08,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"x=struct('man',0,'women',0,'kids',0);\nsum=0;\nfor i=0:1:30\n for j=0:1:30\n for k=0:1:30\n if(i*30+j*20+k*10==500&&i+j+k==30)\n sum=sum+1;\n x.men(sum)=i;\n x.women(sum)=j;\n x.kids(sum)=k;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',sum);\nfor i=1:sum\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,x.men(i),x.women(i),x.kids(i));\nend",WRONG_ANSWER,97,6748 1520015588062179328,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:22:11,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('汽车价格');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x.*12\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6888 1520015620588998656,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:22:19,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('汽车价格');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x.*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,56,6760 1520015774809358336,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:22:55,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nfx0=feval(fun,x0); %feval：执行指定函数\nfx1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nclear\nclc\nformat long;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\na=12*x",WRONG_ANSWER,51,6768 1520015807998902272,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:23:03,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nfx0=feval(fun,x0); %feval：执行指定函数\nfx1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nclear\nclc\nformat long;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\na=12*x",WRONG_ANSWER,52,6756 1520015864030605312,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:23:17,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"mon=input(\""\"");\nx0=0.007;\nx1=0.006;\nf=@(x)300*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nf0 = feval(f,x0);\nf1 = feval(f,x1); \nk=0;error=1;\nwhile abs(error)>1e-9\n l=1;\n x2=x1-l*f1*(x1-x0)/(f1-f0);\n f2 = feval(f,x2);\n while abs(f2)>=abs(f1) \n l=l/2; \n x2=x1-l*f1*(x1-x0)/(f1-f0); \n f2=feval(f,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n error=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nrate=x2;iter=k;X=X';\nrate;",WRONG_ANSWER,54,6904 1520015899728330752,a4caab2c9af73de7e6d42e08fcaf01e1557d6a3892d4086327b652a6c089b922,2022-04-29 20:23:25,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx=x*12\n",WRONG_ANSWER,60,6764 1520015904690180096,93c021ee62e64a2dfa8f4b7d4e64ed8bbdc7255cae00ed9e2fae51b5c73cd4d2,2022-04-29 20:23:26,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;\nfor a=1:30\n for b=1:30\n for c=1:30\n if ((a+b+c)==30&(30*a+20*b+10*c)==500)\n Group(i).men=a;\n Group(i).women=b;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\nend\ndisplay(['There are ',num2str(i-1),' possible groups.']);\nfor k=1:(i-1)\ndisp(['Group ',num2str(k),' : ',num2str(Group(k).men),' men, ',...\n num2str(Group(k).women),' women, ',num2str(Group(k).kids),' kids.']);\nend\n",WRONG_ANSWER,341,6756 1520015954740822016,93c021ee62e64a2dfa8f4b7d4e64ed8bbdc7255cae00ed9e2fae51b5c73cd4d2,2022-04-29 20:23:38,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;\nfor a=1:30\n for b=1:30\n for c=1:30\n if ((a+b+c)==30&(30*a+20*b+10*c)==500)\n Group(i).men=a;\n Group(i).women=b;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\nend\ndisplay(['There are ',num2str(i-1),' possible groups.']);\nfor k=1:(i-1)\ndisp(['Group ',num2str(k),' : ',num2str(Group(k).men),' men, ',...\n num2str(Group(k).women),' women, ',num2str(Group(k).kids),' kids.']);\nend\n",WRONG_ANSWER,329,6752 1520015971262185472,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:23:42,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,55,6764 1520016037012094976,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:23:58,Octave,10.0,1519869963626618887,1517175951723835392,1141715925804474368,"N=30;\nfunction rate=newton_secant(N)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\neps=1e-6;\nmaxiter=1e4;\nx0=0.070000;\nx1=0.080000;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n x=x2;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;\nrate=x*12;\nend\nrate=newton_secant(N)",PARTIAL_ACCEPTED,54,6628 1520016049137823744,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:24:01,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个')end\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=fevalz(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败')\nend\njinsi=x2;cishu=n;X=X';\nend\n",WRONG_ANSWER,58,6988 1520016102883639296,dcdf317ffe0b171cf03967df730cc59eec4fc0406f647482f6fbd870fb4ef0b1,2022-04-29 20:24:14,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%调用部分\nf=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[p,k,P]=newton_secant(f,0.007,0.006);\n\n%函数部分\nfunction [p,k,P]=newton_secant(f,p0,p1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---f：迭代函数\n% ---p0,p1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---p：非线性方程的近似根\n% ---k：迭代次数\n% ---P：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(f,p0); % 计算p0处的函数值\nf1 = feval(f,p1); % 计算p1处的函数值\nk=1;%k统计迭代次数\nwhile abs(p1-p0)>eps\n k=k+1;\n\tlambda=1;%下山因子\n\tp2=p1-lambda*f1*(p1-p0)/(f1-f0);\n\tf2 = feval(f,p2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n p2=p1-lambda*f1*(p1-p0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(f,p2);\n end\n p0=p1;\n p1=p2;\n f0=f1;\n f1=f2;\n P(k)=p2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\np=p2;\nk=k-1;\nP=P';\nend",WRONG_ANSWER,54,6748 1520016241543122944,97527e293f7f902245379dab9c95bcd352ce320a3dff986cd30f514e9851101b,2022-04-29 20:24:47,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function y=f(h,num)\nx=num;\ny=eval(h) \nend\nfunction [x,k]=newton(x0,h1,h2,error) \nx=x0;\ny=f(h1,x);\nk=1;\t \nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(h2,x);\n while abs(f(h1,x2))>abs(f(h1,x))\n d=d/2;\n x2=x-d*y/f(h2,x);\n end\n x=x2;\n y=f(h1,x);\n k=k+1;\nend\nend\n[x,y]=newton(0,'150*x*(3+x)^240-(1+x)^240+1','(1+x)^240+150*x*240*(1+x)^239-240*(1+x)^239',1e-4)",WRONG_ANSWER,55,6768 1520016291480514560,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:24:59,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"mon=input(\""\"");\nx0=0.007;\nx1=0.006;\nf=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nf0 = feval(f,x0);\nf1 = feval(f,x1); \nk=0;error=1;\nwhile abs(error)>1e-9\n l=1;\n x2=x1-l*f1*(x1-x0)/(f1-f0);\n f2 = feval(f,x2);\n while abs(f2)>=abs(f1) \n l=l/2; \n x2=x1-l*f1*(x1-x0)/(f1-f0); \n f2=feval(f,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n error=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nrate=x2*12;iter=k;X=X';\nrate;",WRONG_ANSWER,57,6756 1520016389132300288,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:25:22,Octave,10.0,1519869963626618886,1517166904926183424,1141715925804474368,"mon=input(\""\"");\nx0=0.007;\nx1=0.006;\nf=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nf0 = feval(f,x0);\nf1 = feval(f,x1); \nk=0;error=1;\nwhile abs(error)>1e-9\n l=1;\n x2=x1-l*f1*(x1-x0)/(f1-f0);\n f2 = feval(f,x2);\n while abs(f2)>=abs(f1) \n l=l/2; \n x2=x1-l*f1*(x1-x0)/(f1-f0); \n f2=feval(f,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n error=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nrate=x2*12;iter=k;X=X';\nrate",PARTIAL_ACCEPTED,55,6788 1520016396187107328,6592cfc5b182d088af2116d07f8bb1ae39837e9b21b6ed1617179351de3cd2ba,2022-04-29 20:25:24,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X,xx]=newton(f,x0,x1)%x为月利率xx为年利率\neps=1e-6;\nf0 = feval(f,x0); \nf1 = feval(f,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(f,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(f,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nx=x2;iter=k;X=X';xx=x.*12;\nend\n\n%%%%%%%%%%%%%%\n\n\n\n%以上为综合迭代法求解函数，调用格式如下\n%在命令行输入f=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;x0=0.01;x1=0.06;\n%随后输入[x,iter,X,xx]=newton(f,x0,x1)\n%得到月利率x 年利率xx和迭代次数等\n\n\n%%%%%%%%%%%%%",WRONG_ANSWER,50,6752 1520016408698720256,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:25:27,Octave,20.0,1519869963626618887,1517175951723835392,1141715925804474368,"N=input('');\nfunction rate=newton_secant(N)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\neps=1e-6;\nmaxiter=1e4;\nx0=0.070000;\nx1=0.080000;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n x=x2;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;\nrate=x*12;\nend\nrate=newton_secant(N)",ACCEPTED,55,6496 1520016542375395328,a71dd30d8a1be6ed3784a2a66fe3ee78e45ac79fd3efdf1a7133aac6033b42cf,2022-04-29 20:25:58,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,57,6636 1520016669479579648,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:26:29,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%运行后需在命令行窗口输入240\nn=input('');\nfun=@(x)180*(x*(1+x)^n)/((1+x)^n-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x*12;\nfprintf(\""rate= %f\\n\"",rate)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6764 1520016728891895808,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:26:43,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;...\n1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\naa = min(z);\nif aa <= 0\ncontinue;\nend\nnum = num + 1;\nGroup(num).men = z(1);\nGroup(num).wemen = z(2);\nGroup(num).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:num\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend\n",WRONG_ANSWER,26,6500 1520016843723554816,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:27:10,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nfx0=feval(fun,x0); %feval：执行指定函数\nfx1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nclear\nclc\nformat long;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\na=12*x",WRONG_ANSWER,57,6892 1520017019028680704,bf49a0df2313b0cadb8eebbffb4099674f0bf1642ff02d510f76b0817ca2751d,2022-04-29 20:27:52,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n",WRONG_ANSWER,51,6756 1520017043926073344,614bae844944d92287ebb9590d90ce2b4f825b71856e107527dd5997c827f756,2022-04-29 20:27:58,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"a=1;\nfor i=0:17\n for o=0:25\n for p=0:50\n if 30*i+20*o+10*p == 500\n G(a).men=i;\n G(a).women=o;\n G(a).kids=p;\n \n a=a+1;\n end\n end\n end\nend\nb=a-1;\nfprintf('There are %i possible groups.',b);\nfor a=1:b\n fprintf('Group%i :%i men, %i women, %i kids.\\n',a,G(a).men,G(a).women,G(a).kids);\nend\n",WRONG_ANSWER,95,6612 1520017044077068288,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-29 20:27:58,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"fun=@(x)30*10^4*(1+x)^60-360000;\n[x,iter,X]=newton_secant(fun,0,0.005,1e-6,300)\nrate=12*x;\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6632 1520017134900523008,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:28:20,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个')end\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败')\nend\njinsi=x2;cishu=n;X=X';\nend\n",WRONG_ANSWER,51,6876 1520017381060018176,19102154b0713249495963febdd4c15cb48bcb30b150e53dc8bb4895741d81ff,2022-04-29 20:29:18,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(my_fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(my_fun,x0); \nf1 = feval(my_fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(my_fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(my_fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\nfunction result = lilv(months)\nmy_fun=@(x)1.2*10000/x*(1-1/(1+x)^months)-180*10000;\nx0=0.05;\nx1=0.06;\n[x,iter,X]=newton_secant(my_fun,x0,x1);\nresult = x;\n",WRONG_ANSWER,53,6748 1520017519069413376,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:29:51,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个'),end\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败')\nend\njinsi=x2;cishu=n;X=X';\nend\n",WRONG_ANSWER,53,6672 1520017550073692160,195b4f4d5f1a329e5a5407e21e31834042c96b10f523e3596d4093526cd40156,2022-04-29 20:29:59,Octave,20.0,1519869963626618887,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\nx0=0.1;\nx1=1;\neps=1e-8;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12",ACCEPTED,54,6644 1520017638745489408,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:30:20,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个');end\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败')\nend\njinsi=x2;cishu=n;X=X';\nend\n",WRONG_ANSWER,59,6748 1520017688502501376,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:30:32,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个');end\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败');\nend\njinsi=x2;cishu=n;X=X';\nend\n",WRONG_ANSWER,52,6932 1520017709188812800,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-29 20:30:37,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行调用函数解方程：\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,53,6772 1520017742277689344,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:30:44,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;...\n1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\naa = min(z);\nif aa <= 0\ncontinue;\nend\nnum = num + 1;\nGroup(num).men = z(1);\nGroup(num).wemen = z(2);\nGroup(num).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:num\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\n\nend",WRONG_ANSWER,27,6780 1520017835185700864,bc2b02f4187dfbdc030817b8169b3eefc5833c87379956e636e50199928f3f5d,2022-04-29 20:31:07,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function 300*(1+rate)^y=0.4*300+1.2*y\ny=input(\"" \"");\nrate=output;\nend\n",WRONG_ANSWER,53,6740 1520017839736520704,e9f9ec29ee207d4c56113433d7217e0bc9afb71e7d97dada20a55116654ab589,2022-04-29 20:31:08,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6752 1520017841594609664,d25ec96f7ec93179311c742f38d3d890b5f0cf2a2b021055a24a0735ab18dbd0,2022-04-29 20:31:08,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"主函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-8;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n计算：\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nN=input(\""input N\"");\n[x,iter,X]=newton_secant(fun,0.006,1e-8);\nnianlilv=12*x",WRONG_ANSWER,53,6640 1520017884271652864,bc2b02f4187dfbdc030817b8169b3eefc5833c87379956e636e50199928f3f5d,2022-04-29 20:31:18,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function 300*(1+rate)^y=0.4*300+1.2*y\ny=input(\"" \"");\nrate=output(\"" \"");\nend\n",WRONG_ANSWER,54,6636 1520018038697541632,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:31:55,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function x=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% fun：迭代函数\n% x0，x1：初始迭代点\n% eps：精度要求，默认值为1e-6\n% maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% x：非线性法方程的根*12\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); %计算x0处函数值\nf1 = feval(fun,x1); %计算x1处函数值\nk=0;err=1; %k为迭代次数 err为迭代精度\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %进行牛顿下山迭代\n f2 = feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=12*x2;\nend\n\nN = input('N:')\nfun=@(x)N*(x*(1+x)^60/((1+x)^60-1))-0.6;\n%[x,iter,X]=newton_secant(fun,0.007,0.006)\nx = newton_secant(fun,0.07,0.06)\n",WRONG_ANSWER,55,6784 1520018085203980288,74cd21d5303b9a0ccb99014f248d1dc21605e459311aad1fc0aae059688087fb,2022-04-29 20:32:06,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"function result = number(N)\nn=1;\nfor i=1:N\n for j=1:N\n for k=1:N\n if 30*i+20*j+10*k==500&&i+j+k==N\n Group(n).men=i;\n Group(n).women=j;\n Group(n).kids=k;\n n=n+1;\n end\n end\n end\nend\nresult=Group;\nend\na=input(\""\"");\nresult = number(a);",WRONG_ANSWER,119,6496 1520018115671396352,bc2b02f4187dfbdc030817b8169b3eefc5833c87379956e636e50199928f3f5d,2022-04-29 20:32:14,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function 300*(1+rate)^y=0.4*300+1.2*y\ny=input(\"" \"");\nrate*12=output(\"" \"");\nend\n",WRONG_ANSWER,52,6508 1520018157052407808,1981fc8cccca4fc93007a753032e2da555e43269e0a6574b1ae545fc2d2bc2d8,2022-04-29 20:32:23,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"receive = 500; %饭钱\nmaxMen = receive/30;\nmaxWomen = receive/20;\nmaxKids = receive/10;\n\nN = input(\""请输入人数N:\\n\""); %吃饭总人数\n\ntotal=0;\nfor a=0:maxMen\n for b=0:maxWomen\n for c=0:maxKids\n if a*30+b*20+c*10 == receive\n total = total+1;\n Group(total).men = a;\n Group(total).women = b;\n Group(total).kids = c;\n \n end\n end\n end\nend\n\necho off;\ntxt = print(stream,'There are %d possible groups', total)\nfor i=1:total\n txt = sprintf('Group %d : %d men, %d women, %d kids.', i, Group(i).men, Group(i).women, Group(i).kids)\nend\n\n\n\n\n",WRONG_ANSWER,183,6748 1520018181064802304,e9f9ec29ee207d4c56113433d7217e0bc9afb71e7d97dada20a55116654ab589,2022-04-29 20:32:29,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"iter=input(\""\"")\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nprint x\nend",WRONG_ANSWER,54,6752 1520018236748378112,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:32:42,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function x=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% fun：迭代函数\n% x0，x1：初始迭代点\n% eps：精度要求，默认值为1e-6\n% maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% x：非线性法方程的根*12\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); %计算x0处函数值\nf1 = feval(fun,x1); %计算x1处函数值\nk=0;err=1; %k为迭代次数 err为迭代精度\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %进行牛顿下山迭代\n f2 = feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=12*x2;\nend\n\n%调用部分\nN = input('N:')\nfun=@(x)N*(x*(1+x)^60/((1+x)^60-1))-0.6;\n%[x,iter,X]=newton_secant(fun,0.007,0.006)\nx = newton_secant(fun,0.07,0.06)\n",WRONG_ANSWER,54,6752 1520018265663897600,e9f9ec29ee207d4c56113433d7217e0bc9afb71e7d97dada20a55116654ab589,2022-04-29 20:32:49,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"iter=input(\""\"")\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nx = \nend",WRONG_ANSWER,53,6784 1520018266020417536,422eee1962741774e6de65f55565e6f7a334256c6a336bdd6020ed1acd1a7ce9,2022-04-29 20:32:49,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"N=input('')\nx=0.001 : .0001:0.005;\ny = @(x) N*x.*(x+1).^60./((1+x).^60-1)-0.6;\n[xx,iter,X] = newton_secant(y,0.001,0.005);\nm=xx*12;\nm\nfunction [x,iter,X]=newton_secant(fun,x0,x1,a,m)\n\tif nargin<3,error('error'),end\n\tif nargin<4 || isempty(a),a=1e-6;end\n\tif nargin<5 || isempty(m),m=1e4;end\n\tf0 = feval(fun,x0); \n\tf1 = feval(fun,x1); \n\tk=0;e=1;\n\twhile abs(e)>a\n\t n=1;\n\t x2=x1-n*f1*(x1-x0)/(f1-f0);\n\t f2 = feval(fun,x2);\n\t while abs(f2)>=abs(f1) \n\t n=n/2; \n\t x2=x1-n*f1*(x1-x0)/(f1-f0); \n\t f2=feval(fun,x2);\n\t end\n\t x0=x1;x1=x2;\n\t f0=f1;f1=f2;\n\t e=x1-x0;\n\t k=k+1;\n\t X(k)=x2;\n\tend\n\tx=x2;iter=k;X=X';\n\tend",WRONG_ANSWER,55,6764 1520018379954487296,166db738fbeb2a426f5e729d5b5bcb0eed05fbb874e011c19912f2f3cfd587a1,2022-04-29 20:33:17,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==N)\n fprintf('Man:%d\\n',man)\n fprintf('Woman:%d\\n',woman)\n fprintf('Children:%d\\n',children)\n end\n end\n end\nend",WRONG_ANSWER,384,6504 1520018445679230976,0c99f2e479971ab8eaf01a317441925173890dc530ced50da060a80c3b6ead92,2022-04-29 20:33:32,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"count=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n count=count+1;\n Group(count).men=man;\n Group(count).women=woman;\n Group(count).kids=children;\n end\n end\n end\nend\nfprintf('there are %d possible groups\\n',count)\nfor i = 1:count\n fprintf('Group %d : %d men, %d women, %d kids.\\n',count,Group(i).men,Group(i).women,Group(i).kids);\nend",WRONG_ANSWER,350,7040 1520018531448569856,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:33:53,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%定义部分\nfunction [x,iter]=newton_secant(fun,a,b,eps,maxiter)\nformat long;\nF1 = feval(fun,a); %feval：执行指定函数\nF2 = feval(fun,b);\nerr = 1; k = 0;\nwhile abs(err) > eps\n lambda = 1; %下山因子\n c = b - lambda*F2*(b - a)/(F2 - F1); %割线法\n F3 = feval(fun,c);\n while abs (F3) >= abs(F2) %牛顿下山法\n lambda = lambda/2;\n c = b - lambda*F2*(b - a)/(F2 - F1);\n F3 = feval(fun,c);\n end\n a = b; b = c;\n F1 = F2;F2 = F3;\n err = b - a; %更新迭代精度\n k = k + 1;\nend\nif k >= maxiter\n error('迭代次数超限，迭代失败！')\nend\nx = c; iter = k;\nend\n\n%调用部分\n\nclear\nclc\nformat long;\nN = input('');\nfun = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter] = newton_secant ( fun, 0.007, 0.006, 1e-14, 100);\nrate = 12*x\n\n",WRONG_ANSWER,56,6620 1520018584875610112,ba212549482bd7bdbe0e257e12689c39be5bf5b086e46f2c3c7782afedccfce7,2022-04-29 20:34:05,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[jinsi,cishu,X]=newton_secant(hanshu,x0,x1,jingdu,max)\nif nargin<3,error('至少输入三个');end\nif nargin<4|isempty(jingdu),jingdu=1e-6;end\nif nargin<5|isempty(max),max=1e4;end\nf0=feval(hanshu,x0);\nf1=feval(hanshu,x1);\nn=0 err=1;\nwhile abs(err)>jingdu\n lambda==1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(hanshu,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n n=n+1;\n X(n)=x2;\nend\n\nif n>=max\n error('失败');\nend\njinsi=x2;cishu=n;X=X';\nend\n",WRONG_ANSWER,52,6748 1520018674461736960,9382e2816e7f3001ce0ffebb4e6220f0085197f35b6e46570985b46f3d074745,2022-04-29 20:34:27,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"n=input('n=')\nj=0;\nfor man=1:n\n for woman=1:n\n for children=1:n\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=j;\n A(j,2)=man;\n A(j,3)=woman;\n A(j,4)=children;\n end\n end\n end\nend\npossible_groups=j\n\nMan____Woman____Children=A",WRONG_ANSWER,378,6756 1520018720913653760,4def03706adecd0d476796d4a0d60384c5b04d1f4d01bc878728afae67acee34,2022-04-29 20:34:38,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for kids=1:30\n if(man*30+woman*20+kids*10==500)&&(man+woman+kids==30)\n j=j+1;\n Group(j).men=man;\n Group(j).wemen=woman;\n Group(j).kids=kids;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',j)\nfor i=1:j\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",ACCEPTED,90,6736 1520018952191787008,74cd21d5303b9a0ccb99014f248d1dc21605e459311aad1fc0aae059688087fb,2022-04-29 20:35:33,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\na=input(\""\"")\nfun=@(x)180*x*(1+x)^a(1)/((1+x)^a(1)-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.0001,0.0002);\nrate=x*12",WRONG_ANSWER,52,6504 1520018977919647744,6b7febc63acb469257ec543e20d9fe755064c50e7b372c0750b82fc09762b5fd,2022-04-29 20:35:39,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[x]=newton_xecant(fun,x0,x1,eps,maxiter)\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk0=1;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nend\nx0=x1;\nx1=x2;\nf0=f1;\nf1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>maxiter\n error('失败');\n end\nx=x2;\nend",WRONG_ANSWER,54,6760 1520019183557971968,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-29 20:36:28,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%x-月利率 ,rate -年利率\nclear\nN = 30;\nx=0:0.0001:0.1;\nfun2=@(x)(N.*x.*(1+x).^60/((1+x).^60-1)-0.6); % 定义函数表达式\n%注意此处函数的写法有讲究，详见末尾\n\n%1-----牛顿下山加割线法\n[x1,iter1,X1]=newton_down_secant(fun2,3.5,3.18,1e-8); \n\nrate = x1*12\n\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% Newton下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n fx0=feval(fun,x0);\n fx1=feval(fun,x1);\n dfx1=(fx1-fx0)/(x1-x0);\n x2=x1-lambda*fx1/dfx1;\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1./dfx1; % 牛顿下山迭代\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n %x0=x1;x1=x2;\n end\n tol=fx2/dfx2;\n k=k+1;\n x0 = x1;x1=x2;\n X(k)=x2;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,53,6764 1520019403083657216,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-29 20:37:20,Octave,10.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n%命令行调用函数解方程(把下面这部分复制粘贴到命令行)：\nfun=@(x)30*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate =12*x",PARTIAL_ACCEPTED,56,6764 1520019440735928320,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:37:29,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;...\n1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nA = [30, 20, 10;...\n1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend\n",WRONG_ANSWER,27,6508 1520019460327518208,c12d9bb6354bbdaba0621e4b63d4539caffe875c068069251a7f2e74611e2174,2022-04-29 20:37:34,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,i=1;\nfor man=1:30\n for woman=1:30\n for kid=1:30\n if((30*man+20*woman+10*kid==500)&&(man+woman+kid==30))\n Group(i).men =man;\n Group(i).wemen = woman;\n Group(i).kids = kid;\n i=i+1;\n end\n end\n end\nend,WRONG_ANSWER,91,6648 1520019479180906496,74cd21d5303b9a0ccb99014f248d1dc21605e459311aad1fc0aae059688087fb,2022-04-29 20:37:39,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\na=input(\""\"");\nfun=@(x)180*x*(1+x)^a(1)/((1+x)^a(1)-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.0001,0.0002);\nrate=x*12;",WRONG_ANSWER,55,6616 1520019533111275520,6854da3ab79a035c49b4f575d5a384125467bbf1684ba0323e06f36922c512db,2022-04-29 20:37:51,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"x=0;\nfor men=1:30\n for women=1:30\n for kids=1:30\n \tif(men*30+women*20+kids*10==500)&(men+women+kids==30)\n fprintf('Group%d',x+1)\n fprintf(' : %d',men)\n fprintf(' men, %d',women)\n fprintf(' women, %d',kids)\n fprintf('kids.\\n')\n end\n end\n end\nend\n",WRONG_ANSWER,689,6496 1520019590720032768,8514bd79b4517ce34f133677593e590ea5f3ec96cc41fff84370405cff82991d,2022-04-29 20:38:05,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"input('n')\nfor man=1:30\n for women=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==n)\n j=0\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n fprintf(There are j possible groups.)\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend",WRONG_ANSWER,58,6620 1520019601780424704,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-29 20:38:08,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%x-月利率 ,rate -年利率\nclear\nN = 30;\nx=0:0.0001:0.1;\nfun2=@(x)(N.*x.*(1+x).^60/((1+x).^60-1)-0.6); % 定义函数表达式\n%注意此处函数的写法有讲究，详见末尾\n\n%1-----牛顿下山加割线法\n[x1,iter1,X1]=newton_down_secant(fun2,1,0.7,1e-13); \n\nrate = x1*12\n\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% Newton下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n fx0=feval(fun,x0);\n fx1=feval(fun,x1);\n dfx1=(fx1-fx0)/(x1-x0);\n x2=x1-lambda*fx1/dfx1;\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1./dfx1; % 牛顿下山迭代\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n %x0=x1;x1=x2;\n end\n tol=fx2/dfx2;\n k=k+1;\n x0 = x1;x1=x2;\n X(k)=x2;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,54,6760 1520019612916297728,9382e2816e7f3001ce0ffebb4e6220f0085197f35b6e46570985b46f3d074745,2022-04-29 20:38:10,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend%函数接口\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)%主函数",WRONG_ANSWER,55,6736 1520019612933062656,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:38:10,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;...\n1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend\n",WRONG_ANSWER,26,6504 1520019649939419136,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:38:19,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;...\n1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend\n",WRONG_ANSWER,30,6744 1520019692394164224,e848934174ba327b76eab76faf10fe3403e02d64e71e542ffc1978c0254d9c8b,2022-04-29 20:38:29,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"There are 9 possible groups.\nGroup(1):1 men,18 women,11 kids.\nGroup(2):2 men,16 women,12 kids.\nGroup(3):3 men,14 women,13 kids.\nGroup(4):4 men,12 women,14 kids.\nGroup(5):5 men,10 women,15 kids.\nGroup(6):6 men,8 women,16 kids.\nGroup(7):7 men,6 women,17 kids.\nGroup(8):8 men,4 women,18 kids.\nGroup(9):9 men,2 women,19 kids.",WRONG_ANSWER,25,6612 1520019709053927424,955ac285c2a9742fe0c986097a4a839554e98a929aea3c04e2465ce84fc7cfaa,2022-04-29 20:38:33,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function rate=purchase(N,N0,b,m)\nif nagin<1\n N=30000;N0=0;b=450;m=180;\nend\nfun=@(r,N,N0,b,m)/r*(1-1/(1+r)^m-(A-A0));\nfplot(@(r)fun(r,N,N0,b,m),[0,1]);\nhold on\nplot(xlim,[0,0],'k')\n[x,y]=ginput(1)\nrate=purchase(@(r)fun(r,N,N0,b,m),x);\nplot(rate,fun(rate,N,N0,b,m),'r*','markersize',12)\n\n\nN=input(\""\"");\nrate=purchase(N,0,6000,60);",WRONG_ANSWER,53,6508 1520019723658506240,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-29 20:38:37,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%x-月利率 ,rate -年利率\nclear\nN = input(\""\"");\nx=0:0.0001:0.1;\nfun2=@(x)(N.*x.*(1+x).^60/((1+x).^60-1)-0.6); % 定义函数表达式\n%注意此处函数的写法有讲究，详见末尾\n\n%1-----牛顿下山加割线法\n[x1,iter1,X1]=newton_down_secant(fun2,1,0.7,1e-13); \n\nrate = x1*12\n\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% Newton下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n fx0=feval(fun,x0);\n fx1=feval(fun,x1);\n dfx1=(fx1-fx0)/(x1-x0);\n x2=x1-lambda*fx1/dfx1;\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1./dfx1; % 牛顿下山迭代\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n %x0=x1;x1=x2;\n end\n tol=fx2/dfx2;\n k=k+1;\n x0 = x1;x1=x2;\n X(k)=x2;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,55,6624 1520019728742006784,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:38:38,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nk=0;i=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k);\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n i=i+1;\n fprintf('Group %d : ',i);\n fprintf('%d men, ',man);\n fprintf('%d women, ',woman);\n fprintf('%d kids.\\n',children);\n end\n end\n end\nend",ACCEPTED,153,6648 1520019761566629888,6854da3ab79a035c49b4f575d5a384125467bbf1684ba0323e06f36922c512db,2022-04-29 20:38:46,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"x=0;\nfor men=1:30\n for women=1:30\n for kids=1:30\n \tif(men*30+women*20+kids*10==500)&(men+women+kids==30)\n fprintf('Group%d',x+1)\n fprintf(' :%d',men)\n fprintf(' men, %d',women)\n fprintf(' women, %d',kids)\n fprintf(' kids.\\n')\n end\n end\n end\nend\n",WRONG_ANSWER,707,6584 1520019770760540160,dc9a4f17b0eb928722f117ce383633d20e20fe02f68880bc0e2262cda2fef498,2022-04-29 20:38:48,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"k=0;\n%A=[0 0 0];\nfor a = 1:30\n for b = 1:30\n c=30-a-b;\n if a*30+20*b+10*z==500\n if a+b+c==30\n %m=3*k-2;A(m)=a;\n %n=3*k-1;A(n)=b;\n %p=3*k;A(p)=c;\n k=k+1;\n Group(k).men=a;\n Group(k).women=b;\n Group(k).kids=c;\n \n end\n end\n end \nend\nformatSpec = 'There are %d possible groups';\nstr = sprintf(formatSpec,k)\n%for m = 1:k\n %Group(k).men=a;\n %Group(k).women=b;\n %Group(k).kids=c;\n%end\nformatSpec = 'Group%d :%d men, %d women, %d kids.';\nfor m = 1:k\n sprintf(formatSpec,m, Group(m).men, Group(m).women, Group(m).kids)\nend\n",WRONG_ANSWER,26,6748 1520019885751582720,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:39:16,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;...\n1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,35,6824 1520019916751683584,78e3a7a73403675fd48af94fb03b169771e91bade2a5eec499f8c31a3afedf3e,2022-04-29 20:39:23,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.');\ndisp([' ','men',' ','women',' ','kids']);\nfor m=1:30\n for w=1:30\n for k=1:30\n if (30*m+20*w+10*k==500)&&(m+w+k==30)\n disp([m,w,k]);\n end\n end\n end\nend",WRONG_ANSWER,93,6744 1520019964302495744,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:39:34,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nk=0;i=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k);\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n i=i+1;\n fprintf('Group %d : ',i);\n fprintf('%d men, ',man);\n fprintf('%d women, ',woman);\n fprintf('%d kids.\\n',children);\n end\n end\n end\nend",ACCEPTED,149,6528 1520019984338698240,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-29 20:39:39,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"sum=30;\nSUM=500;\nX=30;\nY=20;\nZ=10;\ni=1;\nfor m=0:12\n for n=0:25\n for l=0:50\n if (30*m+20*n+10*l)==SUM\n if (m+n+l)==sum\n Group(i).man=m;\n Group(i).woman=n;\n Group(i).kid=l;\n i=i+1;\n end\n end \n end\n end\nend\ni=i-1;\ns=sprintf('There are %d possible groups.',i);\ndisp(s)\n% a=1;\nfor a=1:i\n sa=sprintf('Group %d : %d men, %d women, %d kids.',a,Group(a).man,Group(a).woman,Group(a).kid); \n disp(sa);\nend ",WRONG_ANSWER,72,6508 1520020028139798528,0fe50fa0e59ea5cd203cb2d5f7158286980839f76fe379e4a9e2aeab33174e51,2022-04-29 20:39:49,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X] = neton_down(fun,x0,eps,maxiter)\n\nif nargin<2,error('输入参数两个'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif margin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1.dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1.dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代失败')\nend\nx=x1;iter=k;X=X';\n\nx = 0.002 : .001:.005;\nfun = 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=neton_down(fun,0.003,1e-6,1e4)\n",WRONG_ANSWER,57,6656 1520020079532609536,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:40:02,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('汽车价格');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate = x.*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6768 1520020150596714496,af0f641a3b33f48193be4909219f3bab0a63e2d8305eecb084d0597d276b1e33,2022-04-29 20:40:19,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：---fun：迭代函数---x0,x1：初始迭代点 ---eps：精度要求，默认值为1e-6 ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数： ---x：非线性方程的近似根 ---iter：迭代次数 ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n命令行：\n>>addpath 'D:\\ec'\n>> N=30;\n>> y=@(x)*N*x.*(1+x).^60./((1+x).^60-1)-6000;\n>> [x,iter,X]=netwon_down_secant(y,4.7e-3,4.6e-3)\n>> rate=12*x",WRONG_ANSWER,54,6760 1520020211468648448,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:40:33,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate = x.*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6760 1520020227906109440,483e7993c1a862ba18b890443521b8afe4c4c1e49a680cc1066ffd12a837e417,2022-04-29 20:40:37,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n%引入函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n%调用牛顿下山割线法\n[x,iter,X]=newton_down_secant(fun,0.007,0.006)",WRONG_ANSWER,54,6576 1520020252920950784,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-29 20:40:43,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数不足'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山割线法，用割线代替导数\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数太多了')\nend\nx=x2;iter=k;X=X';\nend\n%在命令行中调用函数，先输入函数fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n%在命令行中调用 [x,iter,X]=newton_secant(fun,0.007,0.006)，函数中默认设置eps\n\n",WRONG_ANSWER,53,6768 1520020258306428928,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:40:44,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('汽车价格');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate = x.*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,52,6640 1520020283291893760,195b4f4d5f1a329e5a5407e21e31834042c96b10f523e3596d4093526cd40156,2022-04-29 20:40:50,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"k=1;\nfor man=1:30\n for woman=1:30\n for kids=1:30\n \tif(man*30+woman*20+kids*10==500)&(man+woman+kids==30)\n Group(k).man=man;\n Group(k).woman=woman;\n Group(k).kids=kids;\n k=k+1;\n end\n end\n end\nend\nnum=length(Group);\nfprintf('There are %d possible groups.\\n',num);\nfor k=1:(num-1)\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,Group(k).man,Group(k).woman,Group(k).kids);\nend\nk=k+1;\nfprintf('Group %d : %d men, %d women, %d kids.',k,Group(k).man,Group(k).woman,Group(k).kids);",ACCEPTED,351,6636 1520020313394417664,0a8bad31df386a6cbee6e79b2f420952bc17028812bc5b4b31d35b142a032c92,2022-04-29 20:40:57,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [rate]=newton_secant(x0,x1,eps,maxiter)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2;\n\nend\n\n\n\n \n\n\n \n",WRONG_ANSWER,53,6496 1520020321174851584,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-29 20:40:59,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"sum=30;\nSUM=500;\nX=30;\nY=20;\nZ=10;\ni=1;\nfor m=1:12\n for n=1:25\n for l=1:50\n if (30*m+20*n+10*l)==SUM\n if (m+n+l)==sum\n Group(i).man=m;\n Group(i).woman=n;\n Group(i).kid=l;\n i=i+1;\n end\n end \n end\n end\nend\ni=i-1;\ns=sprintf('There are %d possible groups.',i);\ndisp(s)\n% a=1;\nfor a=1:i\n sa=sprintf('Group %d : %d men, %d women, %d kids.',a,Group(a).man,Group(a).woman,Group(a).kid); \n disp(sa);\nend ",ACCEPTED,109,6488 1520020405169983488,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-29 20:41:19,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%若买一辆汽车 N 万元，可分 60 个月还款，已知月还款额为6000元，求贷款年利率为多少？\n%编写 结合牛顿下山法和割线法的综合迭代方法求解函数，调用后求解；\n%x-月利率 ,rate -年利率\nclear\nN = 30;\nx=0:0.001:1;\ndigits(6)\nfun2=@(x)(N.*x.*(1+x).^60/((1+x).^60-1)-0.6); % 定义函数表达式\n\n%-牛顿下山加割线法\n[x1,iter1,X1]=newton_down_secant(fun2,1,0.7,1e-13); \n\nrate = x1*12\n\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% Newton下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n fx0=feval(fun,x0);\n fx1=feval(fun,x1);\n dfx1=(fx1-fx0)/(x1-x0);\n x2=x1-lambda*fx1/dfx1;\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1./dfx1; % 牛顿下山迭代\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n %x0=x1;x1=x2;\n end\n tol=fx2/dfx2;\n k=k+1;\n x0 = x1;x1=x2;\n X(k)=x2;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,51,6764 1520020434538500096,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:41:26,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%定义部分\nfunction [x,iter]=newton_secant(F,a,b,e,max)\nformat long;\nF1 = feval(F,a); %feval：执行指定函数\nF2 = feval(F,b);\nerr = 1; k = 0;\nwhile abs(err) > e\n lambda = 1; %下山因子\n c = b - lambda*F2*(b - a)/(F2 - F1); %割线法\n F3 = feval(F,c);\n while abs (F3) >= abs(F2) %牛顿下山法\n lambda = lambda/2;\n c = b - lambda*F2*(b - a)/(F2 - F1);\n F3 = feval(F,c);\n end\n a = b; b = c;\n F1 = F2;F2 = F3;\n err = b - a; %更新迭代精度\n k = k + 1;\nend\nif k >= max\n error('迭代次数超限，迭代失败！')\nend\nx = c; iter = k;\nend\n\n%调用部分\n\nclear\nclc\nformat long;\nN = input('');\nF = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter] = newton_secant ( F, 0.007, 0.006, 1e-14, 100);\nrate = 12*x\n\n",WRONG_ANSWER,54,6768 1520020464678768640,adc99570fa0c46ee0137abbd7683d6279e6c6a2cc6c4048bc82526df191b2dc7,2022-04-29 20:41:34,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"n=input('请输入总人数');\nsyms a b c count;\ncount=0;\nfor a=1:1:n\n for b=1:1:n\n for c=1:1:n\n if 30*a+20*b+10*c==500\n count=count+1;\n disp(['Group',count,':',a,'men',b,'women',c,'kids']);\n end\n end\n end\nend",WRONG_ANSWER,55,6504 1520020471439998976,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:41:35,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%定义部分\nfunction [x,iter]=newton_secant(F,a,b,e,max)\nformat long;\nF1 = feval(F,a); %feval：执行指定函数\nF2 = feval(F,b);\nerr = 1; k = 0;\nwhile abs(err) > e\n lambda = 1; %下山因子\n c = b - lambda*F2*(b - a)/(F2 - F1); %割线法\n F3 = feval(F,c);\n while abs (F3) >= abs(F2) %牛顿下山法\n lambda = lambda/2;\n c = b - lambda*F2*(b - a)/(F2 - F1);\n F3 = feval(F,c);\n end\n a = b; b = c;\n F1 = F2;F2 = F3;\n err = b - a; %更新迭代精度\n k = k + 1;\nend\nif k >= max\n error('迭代次数超限，迭代失败！')\nend\nx = c; iter = k;\nend\n\n%调用部分\n\nclear\nclc\nformat long;\nN = input('');\nF = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter] = newton_secant ( F, 0.007, 0.006, 1e-14, 100);\nrate = 12*x\n\n",WRONG_ANSWER,60,6764 1520020509478141952,ecfdeb76984c4492dd06c2a62264da15f8044c1461ae2705e1a5c13dd1477154,2022-04-29 20:41:44,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &&(man+woman+children==30)\n j=j+1;\n end\n end\n end\nend\nfprintf('There are %d\\n possible groups. ',j)\n\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &&(man+woman+children==30)\n j=j+1;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,man,woman,children)\n\n end\n end\n end\nend\n",PRESENTATION_ERROR,152,6740 1520020609977847808,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:42:08,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%定义部分\nfunction [x,iter]=newton_secant(F,a,b,e,M)\nformat long;\nF1 = feval(F,a); %feval：执行指定函数\nF2 = feval(F,b);\nerr = 1; k = 0;\nwhile abs(err) > e\n lambda = 1; %下山因子\n c = b - lambda*F2*(b - a)/(F2 - F1); %割线法\n F3 = feval(F,c);\n while abs (F3) >= abs(F2) %牛顿下山法\n lambda = lambda/2;\n c = b - lambda*F2*(b - a)/(F2 - F1);\n F3 = feval(F,c);\n end\n a = b; b = c;\n F1 = F2;F2 = F3;\n err = b - a; %更新迭代精度\n k = k + 1;\nend\nif k >= M\n error('迭代次数超限，迭代失败！')\nend\nx = c; iter = k;\nend\n\n%调用部分\n\nclear\nclc\nformat long;\nN = input('');\nF = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter] = newton_secant ( F, 0.007, 0.006, 1e-14, 100);\nrate = 12*x\n\n",WRONG_ANSWER,53,6748 1520020677665521664,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:42:24,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nx=input\ni=0;\nfor women=1:x\n for men=1:x\n for kids=1:x\n if()women*20+kids*10+men*30==500)&&(women+men+kids==x)\n i=i+1;\n Group(i).women=women;\n Group(i).men=men;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',i)\nfor j=1:1:i\n fprintf('Group %d:\\n',j)\n disp(Group(j))\nend",WRONG_ANSWER,28,6492 1520020685953470464,1c321c4be65f42087234abc566de6dc1cd294f70a1f4c9999a5908d1289c39e8,2022-04-29 20:42:26,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,y,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\n\nx=x2;y=k;X=X';\nend\nm=input('');\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2\n",WRONG_ANSWER,55,6632 1520020715158409216,1e383aa5eb71dabfbfa4a9b5a3a398a7cbad1e56f19540eec1571733b1ce2cac,2022-04-29 20:42:33,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""旅行团的人数N:\"");\ni=1;\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==N)\n Group(i).men=man;\n Group(i).women=woman;\n Group(i).kids=children;\n i=i+1;\n end\n end\n end\nend",WRONG_ANSWER,118,6492 1520020722762690560,ecfdeb76984c4492dd06c2a62264da15f8044c1461ae2705e1a5c13dd1477154,2022-04-29 20:42:35,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &&(man+woman+children==30)\n j=j+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',j)\n\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &&(man+woman+children==30)\n j=j+1;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,man,woman,children)\n\n end\n end\n end\nend\n",ACCEPTED,153,6684 1520020730098528256,e9f9ec29ee207d4c56113433d7217e0bc9afb71e7d97dada20a55116654ab589,2022-04-29 20:42:37,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"Schedule()=struct(\""Group\"",\""Men\"",\""Wemen\"",\""Kids\"")",WRONG_ANSWER,28,6496 1520020736457097216,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:42:38,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nx=input\ni=0;\nfor women=1:x\n for men=1:x\n for kids=1:x\n if()women*20+kids*10+men*30==500)&&(women+men+kids==x)\n i=i+1;\n Group(i).women=women;\n Group(i).men=men;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',i)\nfor j=1:1:i\n fprintf('Group %d:\\n',j)\n disp(Group(j))\nend",WRONG_ANSWER,27,6756 1520020744036200448,bc2b02f4187dfbdc030817b8169b3eefc5833c87379956e636e50199928f3f5d,2022-04-29 20:42:40,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,year=input('')\nM=300*(rate*(1+rate)^year)/((1+rate)^year-1)%月还款额\nfor i=1:month-1\n300(i+1)=300(i)*(1+rate)-M %月初金额\nend\n,WRONG_ANSWER,61,6684 1520020764345020416,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:42:45,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,27,6504 1520020862290399232,a0777d78c08727b8b8fbe567d47b9f45878b1313e7d8f1872ac0dea22d14d091,2022-04-29 20:43:08,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"脚本文件：\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n \n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n \n x=x0+z*k.'; %原方程的通解\n e=A*x-b; %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n命令行：\nA=[1 1 1;30 20 10];\nB=[30;500];\ncond(A）\n[x e]=Linear_equation(A,B）\nstruct_Group=struct('men',5,'wemen',10,'kids',15)\ndisp('There are XXX possible groups.');\n",WRONG_ANSWER,26,6504 1520020966300762112,d96b2a0a8330e609ae9aff4c87bfcafaf36fc02556231d7901331e684b33683e,2022-04-29 20:43:33,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"j=0\nfor man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)&(man+woman+children==30)\n j=j+1;\n fprintf('Group= (%d) ',j)\n fprintf('Man= %d, ',man)\n fprintf('Woman=%d, ',woman)\n fprintf('Chlidren= %d.\\n',children)\n end\n end\n end\nend\n",WRONG_ANSWER,347,6772 1520021042439958528,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:43:51,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nx =input ('请输入人数');\ny=0;\nfor m = 1:x;\n for w = 1:x;\n for child = 1:x;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==x)\n y=y+1;\n Group(x). man= m;\n Group(x). woman= w;\n Group(x). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',x)\nfor z = 1:x\n fprintf('Group %d :\\n',z)\n disp(Group(z))\nend",WRONG_ANSWER,124,6632 1520021053475164160,483e7993c1a862ba18b890443521b8afe4c4c1e49a680cc1066ffd12a837e417,2022-04-29 20:43:54,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n%引入函数\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n%调用牛顿下山割线法\n[x,iter,X]=newton_down_secant(fun,0.007,0.006)\nrate = x*12",WRONG_ANSWER,52,6760 1520021070072020992,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:43:58,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10;1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,35,6672 1520021139932348416,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:44:15,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d wemen, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,26,6504 1520021172287225856,14a03bf7aba2cbcfb1ec2bfaca790597b4888e1fd3dcfbb8d6ed33b6f49f12bd,2022-04-29 20:44:22,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter) \n% 牛顿下山+割线法求解非线性方程的根 \n% 输入参数： \n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点 \n% ---eps：精度要求，默认值为1e-6 \n% ---maxiter：最大迭代次数，默认值为1e4 \n% 输出参数： \n% ---x：非线性方程的近似根 \n% ---iter：迭代次数 \n% ---X：每一步迭代的结果 \nif nargin<3,error('输入参数至少需要3个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end \nif nargin<5|isempty(maxiter),maxiter=1e4;end \nf0 = feval(fun,x0); % 计算x0处的函数值 \nf1 = feval(fun,x1); % 计算x1处的函数值 \nk=0;err=1;%k统计迭代次数，err表示迭代精度 \nwhile abs(err)>eps \nlambda=1;%下山因子 \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); \nf2 = feval(fun,x2); \nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导 \nf2=feval(fun,x2); \nend \nx0=x1;x1=x2; \nf0=f1;f1=f2; \nerr=x1-x0;%更新迭代精度 \nk=k+1; \nX(k)=x2; \nend \n \nif k>=maxiter \nerror('迭代次数超限，迭代失败！') \nend \nx=x2;iter=k;X=X'; \nend",WRONG_ANSWER,53,6784 1520021188766646272,8e038bf0bf880063b4441ee1290c81bf059dba2743c043d24ee7eb66bd21c81b,2022-04-29 20:44:26,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function rate=Untitled(A,B,b,m)\n%A为售价 B为首付 n为月还款 m为还款月数\n\nfun=@(r,A,B,n,m)n/r*(1-1/(1+r)^m)-(A-B);\nfplot(@(r)fun(r,A,B,b,m),[0,1]);\nhold on\nplot(xlim,[0,0],'k')\n[x,y]=ginput(1);\nrate=fzero(@(r)fun(r,A,B,b,m),x);\nend",WRONG_ANSWER,53,6760 1520021211441041408,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-29 20:44:32,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).women=woman;\n Group(j).kids=children;\n end\n end\n end\nend\nMan____Woman____Children=A,WRONG_ANSWER,342,6508 1520021240348196864,6b7febc63acb469257ec543e20d9fe755064c50e7b372c0750b82fc09762b5fd,2022-04-29 20:44:38,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[x]=newton_xecant(fun,x0,x1,eps,maxiter)\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk0=1;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nend\nx0=x1;\nx1=x2;\nf0=f1;\nf1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>maxiter\n error('失败');\n end\nx=x2;\nend\n\n%命令行中调用：\nfun=@(x)180*(x*(x+1)^240)/((x+1)^240-1)-1.2;\n[x]=newton_xecant(fun,0.01,0.008)",WRONG_ANSWER,54,6772 1520021249491767296,1e383aa5eb71dabfbfa4a9b5a3a398a7cbad1e56f19540eec1571733b1ce2cac,2022-04-29 20:44:41,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=combine_01(N)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.1;\nx1=0.2;\neps=1e-6;\nmaxiter=1e4;\nsyms t;\ntest_1=N.*(t.*(1+t).^240)./((1+t).^240-1) -0.6;%月利率公式\nt=x;\ntest_1 = eval(test_1);\nf0 = feval(test_1,x0); \nf1 = feval(test_1,x1);\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(test_1,x2);\n \n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新λ\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(test_1,x2);\n end\n \n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6516 1520021297822728192,27a0c76f1bdd2ffbb82d8d4d7338a18289dbf1efc2cda0f892a1a3d257dcbc4e,2022-04-29 20:44:52,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%newton_secant\nfunction [x]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2\nend\n\n\n\n\n%run\na=input('input')\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[x]=newton_secant(fun,0.007,0.006)\nrate=12*x",WRONG_ANSWER,54,6896 1520021331280707584,422eee1962741774e6de65f55565e6f7a334256c6a336bdd6020ed1acd1a7ce9,2022-04-29 20:45:00,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input('');\nj=0;\nGroup=struct('men',{},'women',{},'kids',{});\nfor men=1:N\n for women=1:N\n for kids=1:N\n if(men*30+women*20+kids*10==500)&(men+women+kids==N)\n j=j+1;\n Group(j).men=men;\n Group(j).women=women;\n Group(j).kids=kids;\n end\n end\n end\nend\na=j;\nfprintf('There are %.0f possible groups\\n',a)\nfor k=1:a\n fprintf('Group %.0f:%.0f men,%.0f women,%.0f kids.\\n',k,Group(k).men,Group(k).women,Group(k).kids) \nend",WRONG_ANSWER,384,6632 1520021375283146752,1de33e84a1b86355fdf4b4e367c1b6aaa80da18a599c7bb0c742d17580311b62,2022-04-29 20:45:11,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function x=rate(dd,x0,x1)\nf0 = feval(dd,x0); \nf1 = feval(dd,x1); \nk=0;err=1;\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(dd,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); \nf2=feval(dd,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nk=k+1;\nX(k)=x2;\nx=x2;\nend\ndd=N*(x*(1+x)^5/((1+x)^5-1))\nx=rate(dd)\n",WRONG_ANSWER,52,6764 1520021379582312448,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:45:12,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if (men*30+women*20+kids*10==500)&(men+women+kids==N)\n printf('Group%d : %d men, %d women, %d kids.\\n',i,men,women,kids);\n group(i).men=men;\n group(i).women=women;\n group(i).kids=kids;\n i=i+1;\n end\n end\n end\nend\n",WRONG_ANSWER,382,6632 1520021406442618880,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-29 20:45:18,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数不足'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山割线法，用割线代替导数\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数太多了')\nend\nx=x2;iter=k;X=X';\nend\n%在命令行中调用函数，先输入函数fun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-6000;\n%在命令行中调用 [x,iter,X]=newton_secant(fun,0.007,0.006)，函数中默认设置eps\n\n",WRONG_ANSWER,60,6760 1520021408200044544,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-29 20:45:19,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"%若买一辆汽车 N 万元，可分 60 个月还款，已知月还款额为6000元，求贷款年利率为多少？\n%编写 结合牛顿下山法和割线法的综合迭代方法求解函数，调用后求解；\n%x-月利率 ,rate -年利率\nclear\nN = input(\""\"");\nx=0:0.001:1;\ndigits(6)\nfun2=@(x)(N.*x.*(1+x).^60/((1+x).^60-1)-0.6); % 定义函数表达式\n\n%-牛顿下山加割线法\n[x1,iter1,X1]=newton_down_secant(fun2,1,0.7,1e-13); \n\nrate = x1*12\n\nfunction [x,iter,X]=newton_down_secant(fun,x0,x1,eps,maxiter)\n% Newton下山割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n fx0=feval(fun,x0);\n fx1=feval(fun,x1);\n dfx1=(fx1-fx0)/(x1-x0);\n x2=x1-lambda*fx1/dfx1;\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n while abs(fx2)>=abs(fx1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*fx1./dfx1; % 牛顿下山迭代\n fx2=feval(fun,x2);\n dfx2=(fx2-fx1)/(x2-x1);\n %x0=x1;x1=x2;\n end\n tol=fx2/dfx2;\n k=k+1;\n x0 = x1;x1=x2;\n X(k)=x2;\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\nend\nx=x1;iter=k;X=X';\nend",WRONG_ANSWER,53,6880 1520021459408289792,1c321c4be65f42087234abc566de6dc1cd294f70a1f4c9999a5908d1289c39e8,2022-04-29 20:45:31,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,y,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\n\nx=x2;y=k;X=X';\nend\nm=input('');\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2\n",WRONG_ANSWER,54,6752 1520021511312805888,614bae844944d92287ebb9590d90ce2b4f825b71856e107527dd5997c827f756,2022-04-29 20:45:43,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"n=input(\""请输入N\"");\nf=@(x)6000-(n.*10000.*x.*(1+x)^60)./((1+x)^60-1);\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\n%x=x1;iter=k;X=X';\n\n\n\n%[x,iter,X]=newton_down(fun,x0,eps,maxiter)\n%12*x",WRONG_ANSWER,55,6660 1520021540027006976,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:45:50,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if (men*30+women*20+kids*10==500)&(men+women+kids==N)\n printf('Group%d : %d men, %d women, %d kids.\\n',i,men,women,kids);\n group(i).men=men;\n group(i).women=women;\n group(i).kids=kids;\n i=i+1;\n end\n end\n end\nend\n",WRONG_ANSWER,385,6764 1520021569190006784,6854da3ab79a035c49b4f575d5a384125467bbf1684ba0323e06f36922c512db,2022-04-29 20:45:57,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"x=1;\nfor men=1:30\n for women=1:30\n for kids=1:30\n \tif(men*30+women*20+kids*10==500)&(men+women+kids==30)\n fprintf('Group%d',x)\n fprintf(' :%d',men)\n fprintf(' men, %d',women)\n fprintf(' women, %d',kids)\n fprintf(' kids.\\n')\n x=x+1;\n end\n end\n end\nend",WRONG_ANSWER,701,6676 1520021574525161472,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:45:58,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nx=input\ni=0;\nfor women=1:x\n for men=1:x\n for kids=1:x\n if()women*20+kids*10+men*30==500)&&(women+men+kids==x)\n i=i+1;\n Group(i).women=women;\n Group(i).men=men;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %2d possible groups\\n',i)\nfor j=1:1:i\n fprintf('Group %2d:\\n',j)\n disp(Group(j))\nend",WRONG_ANSWER,31,6500 1520021597753225216,8ff11f778ceb4230ea851a7022dfa0b6aa7534bf62d13bb34576ddeb217e24dc,2022-04-29 20:46:04,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n syms k1 k2; %定义各基础解系对应的系数\n x=x0+z*[k1;k2]; %原方程的通解\n e=A*x-b; %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend",WRONG_ANSWER,26,6764 1520021600605356032,6b7febc63acb469257ec543e20d9fe755064c50e7b372c0750b82fc09762b5fd,2022-04-29 20:46:04,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[x]=newton_xecant(fun,x0,x1,eps,maxiter)\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk0=1;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nend\nx0=x1;\nx1=x2;\nf0=f1;\nf1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>maxiter\n error('失败');\n end\nx=x2;\nend\n\n%命令行中调用：\nfun=@(x)180*(x*(x+1)^240)/((x+1)^240-1)-1.2;\n[x]=newton_xecant(fun,0.01,0.008)",WRONG_ANSWER,52,6768 1520021683216363520,5a79b65a3390a21141f40ffe4d76ced94b3ee6c1e8f71f39122cee38cb4ef95a,2022-04-29 20:46:24,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=Newton_xiashan_gexian(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0); % 计算x0处的函数值\nf1=feval(fun,x1); % 计算x1处的函数值\nf3=feval(fun,x0);%计算x0处的函数值，用作交换\nif f0eps\n lambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf4= feval(fun,x2);\n while abs(f4)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代\n f4=feval(fun,x2);\n % x0=x1;\n end\n k=k+1; x0=x1;x1=x2;\n f0=f1;f1=f4;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfunction rate=xiashan(N)\n\n fun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2;\n [x,iter,X]=newton_secant(fun,0.0005,1)\n rate=x;\nend\n \n\n\n\n",WRONG_ANSWER,54,6748 1520021734479138816,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:46:36,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A=zeros;\nB=zeros;\nC=zeros;\nd=0;\nfor i=1:1:17\n e=(500-30*i)/20\n\n for j=1:1:e\n f=(500-30*i-20*j)/15\n for k=1:1:f\n if 30*i+20*j+15*f==500\n d=d+1;\n A(d)=i;\n B(d)=j;\n C(d)=k;\n end\n end\n end\nend\n fprintf('There are %d possible groups.\\n',d) \n for g=1:1:d\n fprintf('Group %d :',g);\n fprintf('%d men,',A(g));\n fprintf(' %d women,',B(g));\n fprintf('%d kids.\\n',C(g));\n end",WRONG_ANSWER,150,6868 1520021755316441088,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:46:41,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"cnt = 0\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(30*man+20*woman+10*children == 500)&(man+woman+children==30)\n cnt = cnt + 1;\n Group(cnt).man = man;\n Group(cnt).woman = woman;\n Group(cnt).children = children;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',cnt)\nfor i = 1:cnt\n fprintf('Group %d : %d man, %d woman, %d kid\\n',i,Group(i).man,Group(i).woman,Group(i).children)\nend",WRONG_ANSWER,342,6752 1520021759988895744,816e1dc7c5479891d0ec0f438ae0361f5a135223a59ab7329a1a6fe1597b9c6d,2022-04-29 20:46:42,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [rate]=newton_secant(m)\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2;\neps=1e-6;\nmaxiter=1e4;\nx0=0.007;\nx1=0.006;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2;\nend\n",WRONG_ANSWER,53,6516 1520021781958660096,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:46:48,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"cnt = 0\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(30*man+20*woman+10*children == 500)&(man+woman+children==30)\n cnt = cnt + 1;\n Group(cnt).man = man;\n Group(cnt).woman = woman;\n Group(cnt).children = children;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',cnt)\nfor i = 1:cnt\n fprintf('Group %d : %d man, %d woman, %d kid\\n',i,Group(i).man,Group(i).woman,Group(i).children)\nend",WRONG_ANSWER,344,6508 1520021822148493312,64cde31eaae7ce5421a5f1c8dad99873398338381a1d9ea56117007d3733ec32,2022-04-29 20:46:57,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_down(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input('');\nx=0:0.01:1;\nfun=5.*N.*x-N+36000;\n[x,iter,X]=newton_down(fun,1.5,1)\nfprintf('rate = %f',x)\n",WRONG_ANSWER,60,6660 1520021873096704000,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-29 20:47:09,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).women=woman;\n Group(j).kids=children;\n end\n end\n end\nend\nMan____Woman____Children=Group,WRONG_ANSWER,347,6744 1520021896547053568,4c244e5028facb818b32b6c1f9de1a24be1e60a5c30cb7efbced742f5a7b6695,2022-04-29 20:47:15,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"syms x\nh=x.^3+x.^2-1;\nfplot(h);\nx0=NW(h,1,100);\nfunction result=NW(h,x,n)\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-6\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n",WRONG_ANSWER,57,6748 1520021927924629504,27a0c76f1bdd2ffbb82d8d4d7338a18289dbf1efc2cda0f892a1a3d257dcbc4e,2022-04-29 20:47:22,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%newton_secant\nfunction [x]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2\nend\n\n\n\n\n%run\na=input('input')\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\nnewton_secant(fun,0.007,0.006)\nrate=12*newton_secant(fun,0.007,0.006)",WRONG_ANSWER,55,6748 1520021977568415744,ecfdeb76984c4492dd06c2a62264da15f8044c1461ae2705e1a5c13dd1477154,2022-04-29 20:47:34,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x]=text2(N)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0= 0.006;\nx1= 0.007;\neps= 1e-6;\nmaxiter =1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12;\nend",WRONG_ANSWER,62,6648 1520021996207898624,85dcfb6626fd857b77c4a9f679daf103d03bccfbe0d0219365e3c0aecf0d2b77,2022-04-29 20:47:39,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN=input('总人数=');\nGroup=struct;\nk=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n \t if(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n k=k+1;\n Group(k).men=man;\n Group(k).women=woman;\n Group(k).kids=children;\n %fprintf('Man: %d\\n',man)\n %fprintf('Woman: %d\\n',woman)\n %fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend\nfprintf('There are %d\\n possible groups.',k)\nfor i=1:k\n fprintf('Group %d\\n:',i,'%d\\n men',Group(i).men,'%d\\n women',Group(i).women,'%d\\n kids',Group(i).kids)\nend\n",WRONG_ANSWER,121,6752 1520022010254622720,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:47:42,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nx=input\ni=0;\nfor women=1:x\n for men=1:x\n for kids=1:x\n if()women*20+kids*10+men*30==500)&&(women+men+kids==x)\n i=i+1;\n Group(i).women=women;\n Group(i).men=men;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %2d possible groups\\30',i)\nfor j=1:1:i\n fprintf('Group %2d:\\30',j)\n disp(Group(j))\nend",WRONG_ANSWER,27,6532 1520022054215122944,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:47:53,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,28,6492 1520022081817841664,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:47:59,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"cnt = 0\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(30*man+20*woman+10*children == 500)&(man+woman+children==30)\n cnt = cnt + 1;\n Group(cnt).man = man;\n Group(cnt).woman = woman;\n Group(cnt).children = children;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',cnt)\nfor i = 1:cnt\n fprintf('Group %d : %d men, %d women, %d kid\\n',i,Group(i).man,Group(i).woman,Group(i).children)\nend",WRONG_ANSWER,343,6748 1520022106853650432,4c244e5028facb818b32b6c1f9de1a24be1e60a5c30cb7efbced742f5a7b6695,2022-04-29 20:48:05,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"syms x\nh=x.^3+x.^2-1;\nfplot(h);\nx0=NW(h,1,100);\nfunction result=NW(h,x,n)\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-6\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n",WRONG_ANSWER,56,6492 1520022169562681344,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:48:20,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"cnt = 0\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(30*man+20*woman+10*children == 500)&(man+woman+children==30)\n cnt = cnt + 1;\n Group(cnt).man = man;\n Group(cnt).woman = woman;\n Group(cnt).children = children;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',cnt)\nfor i = 1:cnt\n fprintf('Group %d : %d men, %d women, %d kid.\\n',i,Group(i).man,Group(i).woman,Group(i).children)\nend",WRONG_ANSWER,345,6500 1520022172175732736,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:48:21,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,30,6760 1520022175350829056,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:48:21,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A=zeros;\nB=zeros;\nC=zeros;\nd=0;\nfor i=1:1:17\n for j=1:1:25\n for k=1:1:40\n if 30*i+20*j+15*k==500\n d=d+1;\n A(d)=i;\n B(d)=j;\n C(d)=k;\n end\n end\n end\nend\n fprintf('There are %d possible groups.\\n',d) \n for g=1:1:d\n fprintf('Group %d :',g);\n fprintf('%d men,',A(g));\n fprintf(' %d women,',B(g));\n fprintf('%d kids.\\n',C(g));\n end",WRONG_ANSWER,68,6752 1520022179159248896,0a8bad31df386a6cbee6e79b2f420952bc17028812bc5b4b31d35b142a032c92,2022-04-29 20:48:22,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [rate]=newton_secant(x0,x1,eps,maxiter)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2;\n\nend\n\n\n\n \n\n\n \nfunction [rate]=newton_secant(x0,x1,eps,maxiter)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2;\n\nend\n\n\n\n \n\n\n \n%命令行代码为\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[rate]=newton_secant(fun,0.007,0.006)*12\n%然后这里输入N",WRONG_ANSWER,55,6628 1520022202580242432,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-29 20:48:28,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%调用函数求解\n% rate——贷款年利率\n%rate1——贷款月利率\nmoney=300*0.6; %贷款额,单位万元\nN=input('请输入月数N=');\nmonth=N; %总月数\nfun=@(rate1)(money*(rate1*(1+rate1)^month)/((1+rate1)^month-1)-1.2);%构建函数\n[rate1,iter,X]=newton_secant(fun,0.007,0.006);\nrate=12*rate1\n\n%函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6648 1520022270913855488,69c4b3858402de906edd63d43a12ca897856bf24536416f934436be98869ae87,2022-04-29 20:48:44,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x]=dk(func,x0,x1,int)\nf0 = jieguo(func,x0);\nf1 = jieguo(func,x1);\nk=0;err=1;\nint = input(\""\"");\nwhile abs(err)>1e-6\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = jieguo(func,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=jieguo(func,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nx=x2;\nfunc=@(x)180*(x*(1+x)^int)/((1+x)^int-1)-1.2;\n[x]=newton_secant(func,int)\nend\n",WRONG_ANSWER,52,6752 1520022275800203264,a71dd30d8a1be6ed3784a2a66fe3ee78e45ac79fd3efdf1a7133aac6033b42cf,2022-04-29 20:48:45,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"A=[30 20 10];\nB=500;\nj=1;\nfor z = 0:50\n for y = 0:25\n for x = 0:16\n if A*[x;y;z]==B\n C(j,:)=[x,y,z];\n j=j+1;\n end\n end\n end\nend\n",WRONG_ANSWER,302,6496 1520022333463498752,837ad2c1ec79edff92647b577006631afbe46eca49122c376cdbcbcac598d03d,2022-04-29 20:48:59,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%调用函数求解\n%rate——贷款年利率\n%rate1——贷款月利率\nmoney=300*0.6; %贷款额,单位万元\nN=input('请输入月数N=');\nmonth=N; %总月数\nfun=@(rate1)(money*(rate1*(1+rate1)^month)/((1+rate1)^month-1)-1.2);%构建函数\n[rate1,iter,X]=newton_secant(fun,0.007,0.006);\nrate=12*rate1\n\n%函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山法和割线法的综合迭代方法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,56,6760 1520022366325866496,a2ddf746ad0a8b56f3d9433a6b872ebd641729a50f5e247be73f3866c39e9599,2022-04-29 20:49:07,Octave,10.0,1519869963626618889,1517141269389144064,1141715823085969408,"\nn=input('');\nq=0;\nfor a=1:1:n\n for b=1:1:n\n for c=1:1:n\n if a+b+c==n&30*a+20*b+10*c==500\n fprintf('Group %d',q+1);\n\n fprintf(': %d men',a);\n fprintf(': %d women',b);\n fprintf(': %d kids\\n',c);\n \n q=q+1;\n end\n end\n\n end\nend\nfprintf('There are %d',q);\n\nfprintf(' possible groups.\\n');\n\n ",PARTIAL_ACCEPTED,374,6688 1520022387737788416,8ff11f778ceb4230ea851a7022dfa0b6aa7534bf62d13bb34576ddeb217e24dc,2022-04-29 20:49:12,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"function [x,e]=Linear_equation(A,b)\n\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n syms k1 k2; %定义各基础解系对应的系数\n x=x0+z*[k1;k2]; %原方程的通解\n e=A*x-b; %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\n\nA=[1 1 1;\n 30 20 10];\nb=[30;50];\n[x,e]=Linear_equation(A,b)\n",WRONG_ANSWER,27,6764 1520022407228723200,a71dd30d8a1be6ed3784a2a66fe3ee78e45ac79fd3efdf1a7133aac6033b42cf,2022-04-29 20:49:17,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"A=[30 20 10];\nB=500;\nj=1;\nfor z = 0:50\n for y = 0:25\n for x = 0:16\n if A*[x;y;z]==B\n C(j,:)=[x,y,z];\n j=j+1;\n end\n end\n end\nend\nC",WRONG_ANSWER,314,6800 1520022424903528448,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:49:21,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if (men*30+women*20+kids*10==500)&&(men+women+kids==N)\n fprintf('Group%d : %d men, %d women, %d kids.\\n',i,men,women,kids);\n group(i).men=men;\n group(i).women=women;\n group(i).kids=kids;\n i=i+1;\n end\n end\n end\nend\n",WRONG_ANSWER,120,6748 1520022499851538432,955ac285c2a9742fe0c986097a4a839554e98a929aea3c04e2465ce84fc7cfaa,2022-04-29 20:49:39,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"") ;\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==N)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,387,6912 1520022507212550144,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:49:41,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nx=input\ni=0;\nfor women=1:x\n for men=1:x\n for kids=1:x\n if()women*20+kids*10+men*30==500)&&(women+men+kids==x)\n i=i+1;\n Group(i).women=women;\n Group(i).men=men;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %2d possible groups\\30',i)\nfor j=1:1:i\n fprintf('Group %2d:\\30',j)\n disp(Group(j))\nend",WRONG_ANSWER,27,6740 1520022519820615680,69c4b3858402de906edd63d43a12ca897856bf24536416f934436be98869ae87,2022-04-29 20:49:44,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"a=input('人数');\ni=0;\nfor man =1:a\n for woman=1:a\n for kids=1:a\n if(30*man+20*woman+10*kids==500)&&(man+woman+kids==a)\n i=i+1;\n Group(i).man=man;\n Group(i).woman=woman;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i)\nfor j=1:i\n fprintf('Group %d',j)\n disp(Group(j))\nend",WRONG_ANSWER,117,6756 1520022525210308608,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:49:45,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if (men*30+women*20+kids*10==500)&&(men+women+kids==N)\n fprintf('Group%d :%d men, %d women, %d kids.\\n',i,men,women,kids);\n group(i).men=men;\n group(i).women=women;\n group(i).kids=kids;\n i=i+1;\n end\n end\n end\nend\n",WRONG_ANSWER,116,6616 1520022611680079872,5163865c7dba6e5da20174834732278b79aee99c5aaa8bbefcc23761ba75b2aa,2022-04-29 20:50:05,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x] = secant(money,eps)\nRealmoney = 6000*60-money*10000;\nx0 = 0;\nx1 = 1;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nwhile abs(x0-x1)>eps\n x2 =x1-f1*(x0-x1)/(f1-f0);\n f0 = f1;\n x0 = x1;\n x1 = x2;\n f1 = feval(fun,x1);\n x = x2;",WRONG_ANSWER,52,6620 1520022615840833536,fcc528dd202863729f179c24e80301b74ba2238879d68ce57643b17f0071408e,2022-04-29 20:50:06,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"y=input('');\nfun=@(x) 180*x.*(1+x).^y./((1+x).^240-1)-1.2;\nx0=0.004;\nx1=0.005;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nlamda=2;\neps=1e-6;\nmaxiter=1e4;\nwhile abs(x1-x0)>eps\n lamda=lamda/2;\n k=k+1;\n x2=x1-lamda*f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2*12\n\n\n\n\n",WRONG_ANSWER,59,6756 1520022617740836864,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:50:07,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nx=input\ni=0;\nfor women=1:x\n for men=1:x\n for kids=1:x\n if()women*20+kids*10+men*30==500)&&(women+men+kids==x)\n i=i+1;\n Group(i).women=women;\n Group(i).men=men;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %2d possible groups\\30',i)\nfor j=1:1:i\n fprintf('Group %2d:\\30',j)\n disp(Group(j))\nend",WRONG_ANSWER,27,6488 1520022622853697536,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:50:08,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"x=struct('man',0,'women',0,'kids',0);\nsum=0;\nfor i=0:1:30\n for j=0:1:30\n for k=0:1:30\n if(i*30+j*20+k*10==500&&i+j+k==30)\n sum=sum+1;\n x.men(sum)=i;\n x.women(sum)=j;\n x.kids(sum)=k;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',sum);\nfor i=1:sum\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,x.men(i),x.women(i),x.kids(i));\nend",WRONG_ANSWER,95,6488 1520022633393991680,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:50:11,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"=zeros;\nB=zeros;\nC=zeros;\nd=0;\nfor i=1:1:17\n for j=1:1:25\n if 30*i+20*j+15*(30-i-j)==500\n d=d+1;\n A(d)=i;\n B(d)=j;\n C(d)=30-i-j;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',d) \n for g=1:1:d\n fprintf('Group %d :',g);\n fprintf('%d men,',A(g));\n fprintf(' %d women,',B(g));\n fprintf('%d kids.\\n',C(g));\n end",WRONG_ANSWER,26,6504 1520022636829130752,166db738fbeb2a426f5e729d5b5bcb0eed05fbb874e011c19912f2f3cfd587a1,2022-04-29 20:50:11,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==N)\n j=j+1;\n fprintf('Group:%d\\n',j)\n fprintf('Man:%d\\n',man)\n fprintf('Woman:%d\\n',woman)\n fprintf('Children:%d\\n',children)\n end\n end\n end\nend",WRONG_ANSWER,377,6752 1520022642168463360,d25ec96f7ec93179311c742f38d3d890b5f0cf2a2b021055a24a0735ab18dbd0,2022-04-29 20:50:13,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""duoshaoren\"")\nfor nanren=0:N\n for nv=0:N\n for xiao=0:N\n if(30*nanren+20*nv+10*xiao)==500\n fprintf('%dnan,%dnv,%dxiao!\\n',nanren,nv,xiao');\n end\n end\n end\n \nend",WRONG_ANSWER,130,6756 1520022643292536832,c08efef253faf0d7ee219442d183ba40f8b4668c0e37755706be83db9bf5556e,2022-04-29 20:50:13,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=bupt2020210018_exam_2(fun,x0,x1,eps,maxiter)\n%以下为命令行窗口调用代码\n%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n%format long;\n%[x,iter,X]=bupt2020210018_exam_2(fun,0.0001,0.0002)\n%要求年利率，再输入\n%XX=12*X(length(X(:))) \nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6788 1520022643510644736,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 20:50:13,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"k = 0;\nfor x = 1:20\n for y =1:25\n for z = 30-x-y\n if 30*x+20*y+10*z == 500\n a = [x,y,z];\n k = k+1;\n X(k,:)= a;\n end\n end\n end\nend\nGroup = struct('men','women','kids')",WRONG_ANSWER,31,6508 1520022647436513280,97527e293f7f902245379dab9c95bcd352ce320a3dff986cd30f514e9851101b,2022-04-29 20:50:14,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function y=f(h,num)\nx=num;\ny=eval(h) \nend\nfunction [x,k]=newton(x0,h1,h2,error) \nx=x0;\ny=f(h1,x);\nk=1;\t \nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(h2,x);\n while abs(f(h1,x2))>abs(f(h1,x))\n d=d/2;\n x2=x-d*y/f(h2,x);\n end\n x=x2;\n y=f(h1,x);\n k=k+1;\nend\nend\n[x,y]=newton(0,'150*x*(3+x)^240-(1+x)^240+1','(1+x)^240+150*x*240*(1+x)^239-240*(1+x)^239',1e-4)",WRONG_ANSWER,53,6760 1520022658056486912,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:50:16,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,28,6760 1520022664587018240,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:50:18,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%运行后需在命令行窗口输入240\nn=input('');\nfun=@(x)180*(x*(1+x)^n)/((1+x)^n-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x*12;\nfprintf(\""rate= %f\\n\"",rate)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6760 1520022668898762752,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:50:19,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long;\nfx0=feval(fun,x0); %feval：执行指定函数\nfx1=feval(fun,x1);\nerr=1;k=0;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\nclear\nclc\nformat long;\nN=input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter]=newton_secant(fun,0.007,0.006,1e-14,100);\na=12*x",WRONG_ANSWER,52,6772 1520022669326585856,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-29 20:50:19,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,function result = fun(N);\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n Group(1).men=man;\n Group(2).wemen=woman;\n Group(3).kids=children;\n end\n end\n end\nend,WRONG_ANSWER,53,6508 1520022682597359616,1c321c4be65f42087234abc566de6dc1cd294f70a1f4c9999a5908d1289c39e8,2022-04-29 20:50:22,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,y,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\n\nx=x2;y=k;X=X';\nend\nm=input('');\nfun=@(x)180*(x*(1+x)^m)/((1+x)^m-1)-1.2\n",WRONG_ANSWER,54,6652 1520022690486857728,7500e633b35e1ab9e95beb98d004707d78164eea0806bb87229a19fae1fc0b43,2022-04-29 20:50:24,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"clear\nm=input('请输入还款月数（整数）m=');\n\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2; \n[x,iter,X]=newton_secant(fun,0.007,0.006); \nrate=x*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end \nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1; \nwhile abs(err)>eps \n\tlambda=1; \n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0); \n\tf2 = feval(fun,x2); \n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2); \n end\n x0=x1;x1=x2; \n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1; \n X(k)=x2; \nend\n\nif k>=maxiter \n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X'; \nend\n",WRONG_ANSWER,54,6624 1520022708329426944,19102154b0713249495963febdd4c15cb48bcb30b150e53dc8bb4895741d81ff,2022-04-29 20:50:28,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"function group = chifan()\nstruct\nj=0;\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(man*30+woman*20+children*10==500)\n j=j+1;\n Group(j).man=man;\n Group(j).woman=woman;\n Group(j).children=children;\n end\n end\n end\nend\nfprintf('There are %d',j,' possible groups.\\n')\nfor i=1:j\n fprintf( '%d',Group(i).man,'Man\\n')\n fprintf('%d',Group(i).woman,'Woan'\\n')\n fprintf('%d',Group(i).children,'Childrend\\n')\nend\n ",WRONG_ANSWER,27,6752 1520022735365902336,8514bd79b4517ce34f133677593e590ea5f3ec96cc41fff84370405cff82991d,2022-04-29 20:50:35,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[x,i,X]=newton-secant(lu,x0,x1,e,m)\nlu=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nn=0;r=1;\nif nargin<3,error('至少输入三个参数'),end\nif nargin<4|isempty(e);end\nif nargin<5|isempty(m);end\nf1=feval(lu,x0);\nf2=feval(lu,x1);\nwhile abs(r)>1\n la=1;\n x2=x1-la*f2*(x1-x0)/(f2-f1);\n f3=feval(lu,x2);\n while abs(f3)>=abs(f2)\n la=la/2;\n x2=x1-la*(x0-x1)*f2/(f2-f1)\n f3=feval(lu,x2);\n end\n x0=x1;x1=x2;\n f1=f2;f2=f3;\n r=x1-x0;n=n+1;\n X(n)=x2;\nend\n\nif n>=m\n error('迭代失败')\nend\nx=x2;i=n;X=X';\nend",WRONG_ANSWER,54,6652 1520022764298211328,93c021ee62e64a2dfa8f4b7d4e64ed8bbdc7255cae00ed9e2fae51b5c73cd4d2,2022-04-29 20:50:42,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;\nfor a=1:30\n for b=1:30\n for c=1:30\n if ((a+b+c)==30&(30*a+20*b+10*c)==500)\n Group(i).men=a;\n Group(i).women=b;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\nend\ndisplay(['There are ',num2str(i-1),' possible groups.']);\nfor k=1:(i-1)\ndisp(['Group ',num2str(k),' : ',num2str(Group(k).men),' men, ',...\n num2str(Group(k).women),' women, ',num2str(Group(k).kids),' kids.']);\nend\n",WRONG_ANSWER,344,6500 1520022779506757632,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-29 20:50:45,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).women=woman;\n Group(j).kids=children;\n end\n end\n end\nend\ndisp(j);\nGroup;\n,WRONG_ANSWER,347,6560 1520022780731494400,8514bd79b4517ce34f133677593e590ea5f3ec96cc41fff84370405cff82991d,2022-04-29 20:50:46,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"input('n')\nfor man=1:30\n for women=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==n)\n j=0\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n fprintf(There are j possible groups.)\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend",WRONG_ANSWER,53,6756 1520022781306109952,5163865c7dba6e5da20174834732278b79aee99c5aaa8bbefcc23761ba75b2aa,2022-04-29 20:50:46,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x] = secant(money,eps)\nRealmoney = 6000*60-money*10000;\nx0 = 0;\nx1 = 1;\nf0 = feval(fun,x0);%抱歉老师 fun函数没有计算出来导致没有结果\nf1 = feval(fun,x1);\nwhile abs(x0-x1)>eps\n x2 =x1-f1*(x0-x1)/(f1-f0);\n f0 = f1;\n x0 = x1;\n x1 = x2;\n f1 = feval(fun,x1);\n x = x2;",WRONG_ANSWER,54,6752 1520022791288557568,c03cc248bfbb5c08bb836b2bce3ccce70c5f739f5b2e111a3feff38e188fd43f,2022-04-29 20:50:48,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"M=[30 20 10;1 1 1];\nN=[500;30];\n[x0 z e]=Linear_equation(M,N)\nc=1;\nfor i=1:30\n if (x0(1)+z(1)*i>=0) & (x0(1)+z(1)*i<=30)& (x0(2)+z(2)*i>=0) &(x0(2)+z(2)*i<=30)& (x0(3)+z(3)*i>=0 )&(x0(3)+z(3)*i<=30)\n b(c,1)=x0(1)+z(1)*i;\n b(c,2)=x0(2)+z(2)*i;\n b(c,2)=x0(2)+z(2)*i;\n c=c+1;\n end\n end\n \nfprintf('There are %d possible groups.\\n',c-1)\nfor i=1:c-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,b(i,1),b(i,2),b(i,3));\nend\n \n \n\nfunction [x0,z,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n \n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend",WRONG_ANSWER,27,6872 1520022805251403776,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:50:52,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;j=1;\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (30 * x) + (20 * y) + (10*z) == 500)\n i=i+1;\n end\n end\n end\nend\ni=i-1;\nfprintf(\""There are %i possible groups.\\n\"",i)\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (30 * x) + (20 * y) + (10*z) == 500)\n\t\t\t\t\tfprintf(\""Group %i : %i men, %i women, %i kids.\\n\"",j, x, y, z);\n Group.male(j)=x;\n Group.female(j)=y;\n Group.child(j)=z;\n j=j+1;\n end\n end\n end\nend\n",WRONG_ANSWER,156,6748 1520022818383757312,8a3dc683febfd5c889264c8e5c02a3f3d2d9d8b5cea8e78ceedf98065b8530b4,2022-04-29 20:50:55,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long;\nn = input ('一辆汽车 N 万元');\nfun=@(x)(6000*60-n)/n;\n[x,iter]=newton_secant(fun,0.07,0.08,1e-8);\nx =x*12",WRONG_ANSWER,55,6500 1520022821680480256,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-29 20:50:56,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"q = input(\""\"");\nfun=@(x)180*(x*(1+x)^q)/((1+x)^q-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\ny=sprintf('rate = %d.',x.*12);\ndisp(y)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,54,6764 1520022834380845056,6c7b3b616279c62f82aced652f9a8f53b0633f7d7b0a05cab1fdd3e37b62adf2,2022-04-29 20:50:59,Octave,20.0,1519869963626618888,1517040002215354368,1141715823085969408,"sum=30;\nSUM=500;\nX=30;\nY=20;\nZ=10;\ni=1;\nfor m=1:12\n for n=1:25\n for l=1:50\n if (30*m+20*n+10*l)==SUM\n if (m+n+l)==sum\n Group(i).man=m;\n Group(i).woman=n;\n Group(i).kid=l;\n i=i+1;\n end\n end \n end\n end\nend\ni=i-1;\ns=sprintf('There are %d possible groups.',i);\ndisp(s)\n% a=1;\nfor a=1:i\n sa=sprintf('Group %d : %d men, %d women, %d kids.',a,Group(a).man,Group(a).woman,Group(a).kid); \n disp(sa);\nend ",ACCEPTED,66,6648 1520022838076018688,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:50:59,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN =input ('请输入人数');\nM = 0;\nfor m = 1:N;\n for w = 1:N;\n for child = 1:N;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==N)\n M=M+1;\n Group(N). man= m;\n Group(N). woman= w;\n Group(N). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',N)\nfor z = 1:N\n fprintf('Group %d :\\n',z)\n disp(Group(z))\nend",WRONG_ANSWER,123,6508 1520022867301928960,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:51:06,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d women, %d kids. \\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,27,6752 1520022872087625728,d25ec96f7ec93179311c742f38d3d890b5f0cf2a2b021055a24a0735ab18dbd0,2022-04-29 20:51:08,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""duoshaoren\"")\nfor nanren=0:N\n for nv=0:N\n for xiao=0:N\n if(30*nanren+20*nv+10*xiao)==500\n fprintf('%dnan,%dnv,%dxiao\\n',nanren,nv,xiao');\n end\n end\n end\n \nend",WRONG_ANSWER,129,6648 1520022872704204800,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:51:08,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function x=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% fun：迭代函数\n% x0，x1：初始迭代点\n% eps：精度要求，默认值为1e-6\n% maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% x：非线性法方程的根*12\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); %计算x0处函数值\nf1 = feval(fun,x1); %计算x1处函数值\nk=0;err=1; %k为迭代次数 err为迭代精度\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %进行牛顿下山迭代\n f2 = feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=12*x2;\nend\n\n%调用部分\nN = input('N:')\nfun=@(x)N*(x*(1+x)^60/((1+x)^60-1))-0.6;\n%[x,iter,X]=newton_secant(fun,0.007,0.006)\nx = newton_secant(fun,0.07,0.06)\n",WRONG_ANSWER,61,6596 1520022881256378368,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:51:10,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"=zeros;\nB=zeros;\nC=zeros;\nd=0;\nfor i=1:1:17\n for j=1:1:25\n if 30*i+20*j+10*(30-i-j)==500\n d=d+1;\n A(d)=i;\n B(d)=j;\n C(d)=30-i-j;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',d) \n for g=1:1:d\n fprintf('Group %d :',g);\n fprintf('%d men,',A(g));\n fprintf(' %d women,',B(g));\n fprintf('%d kids.\\n',C(g));\n end",WRONG_ANSWER,26,6628 1520022892518080512,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:51:12,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend",WRONG_ANSWER,37,6496 1520022901066088448,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:51:14,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function x=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% fun：迭代函数\n% x0，x1：初始迭代点\n% eps：精度要求，默认值为1e-6\n% maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% x：非线性法方程的根*12\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); %计算x0处函数值\nf1 = feval(fun,x1); %计算x1处函数值\nk=0;err=1; %k为迭代次数 err为迭代精度\nwhile abs(err)>eps\n lambda=1; %下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; %更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); %进行牛顿下山迭代\n f2 = feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=12*x2;\nend\n\n%调用部分\nN = input('N:')\nfun=@(x)N*(x*(1+x)^60/((1+x)^60-1))-0.6;\n%[x,iter,X]=newton_secant(fun,0.007,0.006)\nx = newton_secant(fun,0.07,0.06)\n",WRONG_ANSWER,54,6624 1520022918006870016,78e3a7a73403675fd48af94fb03b169771e91bade2a5eec499f8c31a3afedf3e,2022-04-29 20:51:18,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"format short e\nN=input('N');\nfun=@(x)x*(1+x)^60*N*10000-6000*((1+x)^60-1);\n[xx,iter,X]=secant(fun,0.007,0.006);\nxx\nM=xx*12\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,60,6624 1520022923090362368,ff238dea689ca6761779431e518d9eda709663ba3dfcc8ace190de27ae6f4caf,2022-04-29 20:51:20,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n Group(j).men=man;\n Group(j).women=woman;\n Group(j).kids=children;\n end\n end\n end\nend\ndisp(j); %有9种可能\nGroup;%结构体\n,WRONG_ANSWER,343,6516 1520022931369934848,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:51:22,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"cnt = 0\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(30*man+20*woman+10*children == 500)&(man+woman+children==30)\n cnt = cnt + 1;\n Group(cnt).man = man;\n Group(cnt).woman = woman;\n Group(cnt).children = children;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',cnt)\nfor i = 1:cnt\n fprintf('Group %d : %d men, %d women, %d kid.\\n',i,Group(i).man,Group(i).woman,Group(i).children)\nend",WRONG_ANSWER,355,6496 1520022952349831168,78e3a7a73403675fd48af94fb03b169771e91bade2a5eec499f8c31a3afedf3e,2022-04-29 20:51:27,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.');\ndisp([' ','men',' ','women',' ','kids']);\nfor m=1:30\n for w=1:30\n for k=1:30\n if (30*m+20*w+10*k==500)&&(m+w+k==30)\n disp([m,w,k]);\n end\n end\n end\nend",WRONG_ANSWER,90,6752 1520022971614277632,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:51:31,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend\n",WRONG_ANSWER,27,6504 1520023011904761856,d25ec96f7ec93179311c742f38d3d890b5f0cf2a2b021055a24a0735ab18dbd0,2022-04-29 20:51:41,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""duoshaoren\"")\nfor nanren=1:N\n for nv=1:N\n for xiao=1:N\n if(30*nanren+20*nv+10*xiao)==500\n fprintf('%dnan,%dnv,%dxiao!\\n',nanren,nv,xiao');\n end\n end\n end\n \nend",WRONG_ANSWER,122,6824 1520023025230069760,d84260db8bfd969820435701f995b0994f65eff67178b9c986cbc56a93df86ee,2022-04-29 20:51:44,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,N = input('');\nS = 60 * 6000;\nDelta = S - N;\nmrate = Delta / 60;\nrate = mrate*12\n,WRONG_ANSWER,53,6756 1520023046298054656,8514bd79b4517ce34f133677593e590ea5f3ec96cc41fff84370405cff82991d,2022-04-29 20:51:49,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"input('n')\nfor man=1:30\n for women=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==n)\n j=0\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n fprintf('There are j possible groups.')\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend",WRONG_ANSWER,55,6656 1520023061376569344,8ad0f476dd23aa25ee8f5f7fb51577364f54220e81dad4f77c1e140c2c21071d,2022-04-29 20:51:53,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \n% 计算x0处的函数值\nf1 = feval(fun,x1);\n% 计算x1处的函数值\nk=0; %k统计迭代次数\nerr=1; %err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1; %下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0; %更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\ninput('输入N=')\nfun=@(x)(N*(1+x)^5*10^4-60*6000);",WRONG_ANSWER,52,6768 1520023063536648192,d25ec96f7ec93179311c742f38d3d890b5f0cf2a2b021055a24a0735ab18dbd0,2022-04-29 20:51:53,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""duoshaoren\"")\nfor nanren=1:N\n for nv=1:N\n for xiao=1:N\n if(30*nanren+20*nv+10*xiao)==500\n fprintf('%dnan,%dnv,%dxiao!\\n',nanren,nv,xiao');\n end\n end\n end\n \nend",WRONG_ANSWER,121,6504 1520023063805079552,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-29 20:51:53,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"group.men=[];\ngroup.women=[];\ngroup.child=[];\nA=[1 1 1;30 20 10]\nb=[30;500]\n[x,e]=Linear_equation(A,b);\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n ",WRONG_ANSWER,28,6756 1520023069765177344,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-29 20:51:55,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,function result = fun(N);\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n Group(1).men=man;\n Group(2).wemen=woman;\n Group(3).kids=children;\n end\n end\n end\nend\nresult = ,WRONG_ANSWER,53,6784 1520023138258169856,a5a5bdf47a9a8565d03d74ba1d85680aa023859414e9f2f9f1341b2b908479a2,2022-04-29 20:52:11,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"function eating(N)\niter=0;\nfor x=0:N\n for y=0:N\n for z=0:N\n if(x+y+z==N&&30*x+20*y+10*z==500)\n iter=iter+1;\n group(iter).men=x;\n group(iter).wom=y;\n group(iter).kid=z;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',iter)\nfor i=1:iter\nfprintf('Group%d :%d men, %d women, %d kids.\\n',i,group(i).men,group(i).wom,group(i).kid)\nend\n ",WRONG_ANSWER,54,6752 1520023181618888704,1826e5ac340c1a75aedaf3ec778661bc4d4e41d1cdee44ef3cfe3a167aa28c86,2022-04-29 20:52:21,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"function[X]= people(N)\na=1:50;\nb=1:50;\nc=1:50;\n[a,b,c]=meshgrid(a,b,c);\nz1=30*a+20*b+10*c;\nz2=a+b+c;\nk=find(z1==500&z2==N);\nX=[a(k) b(k) c(k)];\ne=size(X,1);\nfor i=1:e\ns(i)= struct(men,X(i,1),women,X(i,2),kids,X(i,3));\nend\n\nformatSpec = 'There are %4.2f possible groups.\\n';\nfprintf(formatSpec,e)\nend\n%diAOYONG\nN=20;function[X]= people(N);",WRONG_ANSWER,53,6764 1520023203508944896,8a3dc683febfd5c889264c8e5c02a3f3d2d9d8b5cea8e78ceedf98065b8530b4,2022-04-29 20:52:27,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nk = 1;\nfor a = 1:16\n for b = 1:25\n for c = 1:50\n m = a+b+c;\n n = 30*a + 20*b + 10*c;\n if (m==30 & n==500)\n s(k).x = a;\n s(k).y = b;\n s(k).z = c;\n k = k+1;\n end\n end\n end\nend\ndisp(sprintf('There are%d possible groups.',k));\nfor f = 1:k\n disp(sprintf('Group %d : %d men, %d women, %d kisd.',k,s(k).x,s(k).y,s(k).z));\nend\n",WRONG_ANSWER,308,6760 1520023206428180480,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:52:27,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN =input ('请输入人数');\nM = 0;\nfor m = 1:N;\n for w = 1:N;\n for child = 1:N;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==N)\n M=M+1;\n Group(N). man= m;\n Group(N). woman= w;\n Group(N). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\n',N)\nfor z = 1:N\n fprintf('Group %d :\\n',z)\n disp(Group(z))\nend",WRONG_ANSWER,121,6772 1520023230474129408,c12d9bb6354bbdaba0621e4b63d4539caffe875c068069251a7f2e74611e2174,2022-04-29 20:52:33,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;\nfor man=1:30\n for woman=1:30\n for kid=1:30\n if((30*man+20*woman+10*kid==500)&&(man+woman+kid==30))\n Group(i).men =man;\n Group(i).women = woman;\n Group(i).kids = kid;\n i=i+1;\n end\n end\n end\nend\nfprintf('There are %d',i);\nfprintf(' possible groups.%n');",WRONG_ANSWER,89,6612 1520023347352616960,2d882744229d7e27284ee7c076e14dbe33af3edd012f82d587b74c8ed0ea9694,2022-04-29 20:53:01,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=zonghefa(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n lambda=1;\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n while abs(f1)>=abs(f0) \n lambda=lambda/2; % 更新lambda\n x2=x1-f1*(x1-x0)/(f1-f0);\n f1 = feval(fun,x1);\n x0=x1;\n end\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n调用\nN=input('');\nr = 0.002 : .001:.005;\nf = @(r)N*((1+r).^60-1)-30.*r.*(1+r).^60; \n \n[xx,iter,X]=zonghefa(f,0.006,1e-8) % 牛顿下山割线法综合求根\nplot(x,f(x),[-1,1],[0,0],'k:',xx,f(xx),'k*') % 绘制图形\ntext(1,40,['函数零点{\\itx}^*=',num2str(xx)]) % 添加标注\ntitle('牛顿下山割线法综合求根') % 添加标题",WRONG_ANSWER,55,6748 1520023350519316480,bc2b02f4187dfbdc030817b8169b3eefc5833c87379956e636e50199928f3f5d,2022-04-29 20:53:02,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function function1(a,b)\n300*(1+a)^(b/12)=120+1.2*b;\nend;\n\n",WRONG_ANSWER,53,6748 1520023355657338880,71f6d8143d14d2e73ab3508ebaf97957f15717fa7d39f3e445d2b188d46fc896,2022-04-29 20:53:03,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear;\n>> for men=1:30\nfor women=1:30\nfor kids=1:30\nif(men*30+women*20+kids*10==500)...\n&(men+women+kids==30)\nfprintf('Men: %d\\n',men)\nfprintf('Women: %d\\n',women)\nfprintf('kids: %d\\n',kids)\nend\nend\nend\nend",WRONG_ANSWER,26,6512 1520023365669130240,6592cfc5b182d088af2116d07f8bb1ae39837e9b21b6ed1617179351de3cd2ba,2022-04-29 20:53:05,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""请输入人数N\"");\nx=0;y=0;z=0;%xyz 对 男女小\nfor i=1:N\n for j=1:N\n for k=1:N\n money=30.*i+20.*j+10.*k;\n number=i+j+k;\n if (money==500)&(number==N)\n x=i;y=j;z=k;\n sprintf('%d men, %d women, %d kids',x,y,z);\n end\n end\n end\nend\n\n \n",MULTIPLE_ERROR,441,6768 1520023393305407488,8583ba31e8ef511d01dc97d81d8b914fc0635655e6683393432affd53bdae9bc,2022-04-29 20:53:12,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"clear\nx=input\ni=0;\nfor women=1:x\n for men=1:x\n for kids=1:x\n if()women*20+kids*10+men*30==500)&&(women+men+kids==x)\n i=i+1;\n Group(i).women=women;\n Group(i).men=men;\n Group(i).kids=kids;\n end\n end\n end\nend\nfprintf('There are %2d possible groups\\30',i)\nfor j=1:1:i\n fprintf('Group %2d:\\30',j)\n disp(Group(j))\nend",WRONG_ANSWER,30,6632 1520023411500290048,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-29 20:53:16,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,function result = fun(N);\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==30)\n Group(1).men=man;\n Group(2).wemen=woman;\n Group(3).kids=children;\n end\n end\n end\nend\n,WRONG_ANSWER,53,6512 1520023413157040128,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:53:17,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN =input ('请输入人数');\nM = 0;\nfor m = 1:N;\n for w = 1:N;\n for child = 1:N;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==N)\n M=M+1;\n Group(N). man= m;\n Group(N). woman= w;\n Group(N). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\20',N)\nfor z = 1:N\n fprintf('Group %d :\\20',z)\n disp(Group(z))\nend",WRONG_ANSWER,120,6572 1520023422170595328,8ad0f476dd23aa25ee8f5f7fb51577364f54220e81dad4f77c1e140c2c21071d,2022-04-29 20:53:19,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"i=0;\ninput('N=')\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif (man*30+woman*20+children*10==500)&(man+woman+children==N)\n i=i+1;\n A(i,1)=man;\n A(i,2)=woman;\n A(i,3)=children;\n disp('There are %d\\n possible groups',i)\n disp('Group%d\\n:%d\\n men,%d\\n women,&d\\n children',i,man,woman,children)\n \n end\n end\n end\nend\n\n",WRONG_ANSWER,54,6492 1520023434967433216,d84260db8bfd969820435701f995b0994f65eff67178b9c986cbc56a93df86ee,2022-04-29 20:53:22,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,N = input('');\nS = 60 * 6000;\nDelta = S - N;\nmrate = Delta / 60;\nrate = mrate*12;\n,WRONG_ANSWER,53,6756 1520023450691878912,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:53:25,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN =input ('请输入人数');\nM = 0;\nfor m = 1:N;\n for w = 1:N;\n for child = 1:N;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==N)\n M=M+1;\n Group(N). man= m;\n Group(N). woman= w;\n Group(N). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\20',N)\nfor z = 1:N\n fprintf('Group %d :\\20',z)\n disp(Group(z))\nend",WRONG_ANSWER,127,6748 1520023451362963456,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:53:26,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"=zeros;\nB=zeros;\nC=zeros;\nd=0;\nfor i=1:1:17\n for j=1:1:25\n if 30*i+20*j+10*(30-i-j)==500\n d=d+1;\n A(d)=i;\n B(d)=j;\n C(d)=30-i-j;\n end\n else\n continue;\n end\nend\n fprintf('There are %d possible groups.\\n',d) \n for g=1:1:d\n fprintf('Group %d :',g);\n fprintf('%d men,',A(g));\n fprintf(' %d women,',B(g));\n fprintf('%d kids.\\n',C(g));\n end",WRONG_ANSWER,28,6624 1520023503527526400,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:53:38,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN =input ('请输入人数');\nM = 0;\nfor m = 1:N;\n for w = 1:N;\n for child = 1:N;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==N)\n M=M+1;\n Group(N). man= m;\n Group(N). woman= w;\n Group(N). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\30',N)\nfor z = 1:N\n fprintf('Group %d :\\30',z)\n disp(Group(z))\nend",WRONG_ANSWER,121,6764 1520023506178322432,d84260db8bfd969820435701f995b0994f65eff67178b9c986cbc56a93df86ee,2022-04-29 20:53:39,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,N = 30;\nS = 60 * 6000;\nDelta = S - N;\nmrate = Delta / 60;\nrate = mrate*12;\n,WRONG_ANSWER,53,6664 1520023520296341504,6b7febc63acb469257ec543e20d9fe755064c50e7b372c0750b82fc09762b5fd,2022-04-29 20:53:42,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"function result=people(N)\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==N)\n fprintf('man:%d\\n',man);\n fprintf('woman:%d\\n',woman);\n fprintf('children:%d\\n',children);\n end\n end\n end\n end",WRONG_ANSWER,53,6748 1520023534418575360,90198d91abbc7581695b14ce937d7af2f9dd193fc9248a4207304afe345fc4e7,2022-04-29 20:53:45,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368," function[x,iter,X]=newcar_secant(f,x0,x1,eps,max)\n f=@(x)(N(1+x/12))/360000;\n if nargin<3,err('输入参数最少需要3个'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<4|isempty(max),max=1e4;end\n f0=feval(f,x0);\n f1=feval(f,x1);\n k=0;err=1;\n while abs(err)>eps\n 1ambda=1;\n x2=x1-1ambda*f1*(x1-x0)/(f1-f0);\n f2feval(f,x2);\n while",WRONG_ANSWER,53,6748 1520023563824840704,92d710bc8550ccce4ea8ae0f1b2869d1b32f12ef9224f17ad0b534d2377c637b,2022-04-29 20:53:52,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"for man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)\n &(man+woman+children==30)\n fprintf('There are 3 possible groups.\\n')\n fprintf('Man:%d\\n',Man)\n fprintf('Woman:%d\\n',woman)\n fprintf('Children:%d\\n',children)\n end\n end\n end\n end\n",WRONG_ANSWER,26,6496 1520023578697830400,5f3828dfcf997f3b33e2a6287a453afba2408590b9186cec5f9582200291e76f,2022-04-29 20:53:56,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,\nfunction y=m(x)\nk=N;A0=6000;m0=60;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;\n\nfunction y=m(x)\nk=528;A0=96000;m0=440.33;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;\n\n,WRONG_ANSWER,54,6504 1520023588713836544,296dda71b961a8dfd967d75da985369ce57467824a387a3024010ab4bc12bdc1,2022-04-29 20:53:58,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input('共计人数=');\ni=0;\nGroup=struct();\nfor man=1:N\n for woman=1:N\n for kid=1:N\n \tif(man*30+woman*20+kid*10==500)&(man+woman+kid==N)\n i=i+1;\n Group(i).men=man;\n Group(i).women=woman;\n Group(i).kids=kid;\n end\n end\n end\nend\nfprintf('There are',i,'possible groups.')\nfor n=1:1:i\n fprintf('Group(',n,'):',Group(n).men,'men',Group(n).women,'women',Group(n).kids,'kids %d/n');\nend\n",WRONG_ANSWER,387,6640 1520023607231676416,af0f641a3b33f48193be4909219f3bab0a63e2d8305eecb084d0597d276b1e33,2022-04-29 20:54:03,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\ndisp(strcat('There are 'j 'possible groups. '))",WRONG_ANSWER,51,6624 1520023610742312960,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:54:04,Octave,10.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if (men*30+women*20+kids*10==500)&&(men+women+kids==N)\n group(i).men=men;\n group(i).women=women;\n group(i).kids=kids;\n i=i+1;\n end\n end\n end\nend\ni=i-1;\nfprintf('There are %d possible groups.\\n',i);\nfor j=1:i\nfprintf('Group%d :%d men, %d women, %d kids.\\n',j,group(j).men,group(j).women,group(j).kids);\nend\n",PARTIAL_ACCEPTED,122,6492 1520023614496227328,71f6d8143d14d2e73ab3508ebaf97957f15717fa7d39f3e445d2b188d46fc896,2022-04-29 20:54:05,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nN=input \""输入一个数\""\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1);\n[x,iter,X]=newton_secant(fun,0.007,0.006)\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n \nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,53,6508 1520023621517488128,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:54:06,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A=zeros;\nB=zeros;\nC=zeros;\nd=0;\nfor i=1:1:17\n for j=1:1:25\n if 30*i+20*j+10*(30-i-j)==500\n d=d+1;\n A(d)=i;\n B(d)=j;\n C(d)=30-i-j;\n end\n else\n end\n end\nend\n fprintf('There are %d possible groups.\\n',d) \n for g=1:1:d\n fprintf('Group %d :',g);\n fprintf('%d men,',A(g));\n fprintf(' %d women,',B(g));\n fprintf('%d kids.\\n',C(g));\n end",WRONG_ANSWER,26,6528 1520023635870384128,d25ec96f7ec93179311c742f38d3d890b5f0cf2a2b021055a24a0735ab18dbd0,2022-04-29 20:54:10,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""duoshaoren\"")\nfor nanren=1:N\n for nv=1:N\n for xiao=1:N\n if(30*nanren+20*nv+10*xiao)==500&(nanren+nv+xiao)==N\n fprintf('%dnan,%dnv,%dxiao!\\n',nanren,nv,xiao');\n end\n end\n end\n \nend",WRONG_ANSWER,393,6776 1520023637141274624,dc9a4f17b0eb928722f117ce383633d20e20fe02f68880bc0e2262cda2fef498,2022-04-29 20:54:10,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"x = 0:0.01:2;\nf1=@(x)1./((x-.3).^2 +.01)+1./((x-.9).^2 +.04)-6; % 定义函数表达式\n[xx,iter,X]=newton_down(@f1,1,[],100) % 牛顿下山法求根\nfunction [x,iter,X]=newton_down(fun,x0,eps,maxiter)\n% Newton下山法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2,error('输入参数至少需要2个！'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0) \n lambda=lambda/2; % 更新lambda\n x1=x0-lambda*fx0/dfx0; % 牛顿下山迭代\n [fx1,dfx1]=feval(fun,x1);\n % x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0 = x1;\n X(k)=x1;\nEnd\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nend\nx=x1;iter=k;X=X';\nend\n",WRONG_ANSWER,55,6768 1520023638491828224,f886960cc8cd61323f73ceba1ff1fdf8528fcb8a2ba6f4b0d0628fa0ef47fe3f,2022-04-29 20:54:10,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A = [30, 20, 10; 1, 1, 1];\nb = [500; 30];\n\n\nz = null(sym(A));\nx0 = sym(A)\\sym(b);\ncolumn = size(z, 2);\nk = [];\nfor i = 1:column\nk = [k sym(['k' num2str(i)])];\nend\nx = z*k' + x0;\n\ngroupnum = 0;\nfor i = 0:30\ny = x;\nz = subs(y, k, i);\nzero = min(z);\nif zero <= 0\ncontinue;\nend\ngroupnum = groupnum + 1;\nGroup(groupnum).men = z(1);\nGroup(groupnum).wemen = z(2);\nGroup(groupnum).kids = z(3);\nend\n\nfprintf(\""There are %d possible groups.\\n\"", groupnum);\nfor i = 1:groupnum\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", i,Group(i).men, Group(i).wemen, Group(i).kids);\nend\n",WRONG_ANSWER,27,6508 1520023638932230144,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-29 20:54:10,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,N = input('');\nMoney = 500\nGroup.men=0\nGroup.women=0\nGroup.kids=0\nspend = 0\nx=1\nfor m = 0:16\n spend = m * 30;\n for w = 0:25\n spend = spend + w*20;\n if (spend <= 500)\n for k = 0:50\n spend = spend + k*10;\n if spend == 500\n Group(x).men = m;\n Group(x).women = w;\n Group(x).kids = k;,WRONG_ANSWER,54,6796 1520023642690338816,90198d91abbc7581695b14ce937d7af2f9dd193fc9248a4207304afe345fc4e7,2022-04-29 20:54:11,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368," function[x,iter,X]=newcar_secant(f,x0,x1,eps,max)\n f=@(x)(N(1+x/12))/360000;\n if nargin<3,err('输入参数最少需要3个'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<4|isempty(max),max=1e4;end\n f0=feval(f,x0);\n f1=feval(f,x1);\n k=0;err=1;\n while abs(err)>eps\n 1ambda=1;\n x2=x1-1ambda*f1*(x1-x0)/(f1-f0);\n f2feval(f,x2);",WRONG_ANSWER,54,6628 1520023643399163904,14a03bf7aba2cbcfb1ec2bfaca790597b4888e1fd3dcfbb8d6ed33b6f49f12bd,2022-04-29 20:54:11,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"j=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n Group(j).men = man;\n Group(j).wemen =woman;\n Group(j).kids =children;\n \n end\n end\n end\nend\nfprintf('There are', j ,'possible groups.')\nfor i=0\n i=i+1\nfprintf('Group',i,Group(i).men,'man,',Group(i).wemen,'woman',Group(i).kids,'kids')\n\n\n",WRONG_ANSWER,27,6504 1520023643659223040,6b7febc63acb469257ec543e20d9fe755064c50e7b372c0750b82fc09762b5fd,2022-04-29 20:54:11,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"function result=people(N)\nfor man=1:N\n for woman=1:N\n for children=1:N\n if(man*30+woman*20+children*10==500)&(man+woman+children==N)\n fprintf('man:%d\\n',man);\n fprintf('woman:%d\\n',woman);\n fprintf('children:%d\\n',children);\n end\n end\n end\n end",WRONG_ANSWER,57,6492 1520023644904931328,74cd21d5303b9a0ccb99014f248d1dc21605e459311aad1fc0aae059688087fb,2022-04-29 20:54:12,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\na=input(\""\"");\nfun=@(x)180*x*(1+x)^a(1)/((1+x)^a(1)-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.0001,0.0002);\nrate=x*12;",WRONG_ANSWER,54,6756 1520023647215992832,d84260db8bfd969820435701f995b0994f65eff67178b9c986cbc56a93df86ee,2022-04-29 20:54:12,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,N = input('');\nS = 60 * 6000;\nDelta = S - N*10000;\nmrate = Delta / 60;\nrate = mrate*12;\n,WRONG_ANSWER,54,6504 1520023649845821440,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:54:13,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN =input ('请输入人数');\nM = 0;\nfor m = 1:N;\n for w = 1:N;\n for child = 1:N;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==N)\n M=M+1;\n Group(N). man= m;\n Group(N). woman= w;\n Group(N). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\30',N)\nfor z = 1:N\n fprintf('Group %d :\\30',z)\n disp(Group(z))\nend",WRONG_ANSWER,123,6764 1520023654996410368,cb2787dc4fa251fb3df9a4299eeea55841aa4401fc9d0af5ca1ba84a15f1892c,2022-04-29 20:54:14,Octave,10.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor men=1:N\n for women=1:N\n for kids=1:N\n if (men*30+women*20+kids*10==500)&&(men+women+kids==N)\n group(i).men=men;\n group(i).women=women;\n group(i).kids=kids;\n i=i+1;\n end\n end\n end\nend\ni=i-1;\nfprintf('There are %d possible groups.\\n',i);\nfor j=1:i\nfprintf('Group%d :%d men, %d women, %d kids.\\n',j,group(j).men,group(j).women,group(j).kids);\nend\n",PARTIAL_ACCEPTED,117,6760 1520023667705163776,efe82bf3be05869fddccc0c2bc168b4eb7e61593e0ea658fc769b6189b8998a5,2022-04-29 20:54:17,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"int main()\n{\n\tint x, y, z;\n\tfor (x = 0; x <=30; x++)\n\t{\n\t\tfor (y = 0; y <=30; y++)\n\t\t{\n\t\t\tfor (z = 0; z <=30; z++)\n\t\t\t{\n\t\t\t\tif (x + y + z == 30 && (3 * x) + (2 * y) + z == 50)//列出方程组求\n\t\t\t\t\tprintf(\""男人：%2d\\t女人：%2d\\t孩子：%2d\\n\"", x, y, z);\n\t\t\t}\n\t\t}\n\t}\t\t\t\t\t\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,26,6504 1520023668028125184,6b7febc63acb469257ec543e20d9fe755064c50e7b372c0750b82fc09762b5fd,2022-04-29 20:54:17,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function[x]=newton_xecant(fun,x0,x1,eps,maxiter)\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0=feval(fun,x0);\nf1=feval(fun,x1);\nk0=1;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nwhile abs(f2)>=abs(f1)\n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\nend\nx0=x1;\nx1=x2;\nf0=f1;\nf1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nif k>maxiter\n error('失败');\n end\nx=x2;\nend\n\n%命令行中调用：\nfun=@(x)180*(x*(x+1)^240)/((x+1)^240-1)-1.2;\n[x]=newton_xecant(fun,0.01,0.008)",WRONG_ANSWER,53,6768 1520023669475151872,85dcfb6626fd857b77c4a9f679daf103d03bccfbe0d0219365e3c0aecf0d2b77,2022-04-29 20:54:18,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,clear\nN=input('总价=');\ntotal=60*6000;\nbi=total/N/10000;\nli=log(),WRONG_ANSWER,52,6752 1520023670636982272,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:54:18,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('汽车价格');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate = x.*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6920 1520023671119331328,1826e5ac340c1a75aedaf3ec778661bc4d4e41d1cdee44ef3cfe3a167aa28c86,2022-04-29 20:54:18,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';",WRONG_ANSWER,59,6620 1520023680887848960,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-29 20:54:20,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数不足'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nN=input()\nfun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-6000;f0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山割线法，用割线代替导数\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数太多了')\nend\nx=x2;iter=k;X=X';\nend\n%在命令行中调用函数，先输入函数fun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-6000;\n%在命令行中调用 [x,iter,X]=newton_secant(fun,0.007,0.006)，函数中默认设置eps\n\n",WRONG_ANSWER,53,6748 1520023688475344896,74cd21d5303b9a0ccb99014f248d1dc21605e459311aad1fc0aae059688087fb,2022-04-29 20:54:22,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"function result = number(N)\nn=1;\nfor i=1:N\n for j=1:N\n for k=1:N\n if 30*i+20*j+10*k==500&&i+j+k==N\n Group(n).men=i;\n Group(n).women=j;\n Group(n).kids=k;\n n=n+1;\n end\n end\n end\nend\nresult=Group;\nend\na=input(\""\"");\nresult = number(a);",WRONG_ANSWER,118,6764 1520023690702532608,efe82bf3be05869fddccc0c2bc168b4eb7e61593e0ea658fc769b6189b8998a5,2022-04-29 20:54:23,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"int main()\n{\n\tint x, y, z;\n\tfor (x = 0; x <=30; x++)\n\t{\n\t\tfor (y = 0; y <=30; y++)\n\t\t{\n\t\t\tfor (z = 0; z <=30; z++)\n\t\t\t{\n\t\t\t\tif (x + y + z == 30 && (3 * x) + (2 * y) + z == 50)//列出方程组求\n\t\t\t\t\tprintf(\""男人：%2d\\t女人：%2d\\t孩子：%2d\\n\"", x, y, z);\n\t\t\t}\n\t\t}\n\t}\t\t\t\t\t\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,26,6636 1520023697593765888,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-29 20:54:24,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"fun=@(x)30*10^4*(1+x)^60-360000;\n[x,iter,X]=newton_secant(fun,0,0.005,1e-6,300)\nrate=12*x;\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6760 1520023703730044928,1e383aa5eb71dabfbfa4a9b5a3a398a7cbad1e56f19540eec1571733b1ce2cac,2022-04-29 20:54:26,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input(\""旅行团的人数N:\"");\ni=1;\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&&(man+woman+children==N)\n Group(i).men=man;\n Group(i).women=woman;\n Group(i).kids=children;\n disp(\""Group \""+i+\"":\"");\n i=i+1;\n end\n end\n end\nend",WRONG_ANSWER,124,6760 1520023703922966528,66b506e58d8f5689fd2e10a00b7973d8e64237b79fb58325617249b5ff902227,2022-04-29 20:54:26,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数不足'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nN=input();\nfun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-6000;f0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山割线法，用割线代替导数\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数太多了')\nend\nx=x2;iter=k;X=X';\nend\n%在命令行中调用函数，先输入函数fun=@(x)N*(x/12*(1+x/12)^60)/((1+x/12)^60-1)-6000;\n%在命令行中调用 [x,iter,X]=newton_secant(fun,0.007,0.006)，函数中默认设置eps\n\n",WRONG_ANSWER,56,6784 1520023711917314048,5526a775e4e9be7284cda86938755011615d82c58ec1b0db3faa81ae7be353dc,2022-04-29 20:54:28,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"group.men=[];\ngroup.women=[];\ngroup.child=[];\nA=[1 1 1;30 20 10]\nb=[30;500]\n[x,e]=Linear_equation(A,b);\nfunction [x,e]=Linear_equation(A,b)\n% 线性方程组的求解\n% 输入参数：\n% ---A：方程组的系数矩阵\n% ---b：方程组的右端向量\n% 输出参数：\n% ---x：方程组的解\n% ---e：解的误差\n[m,n]=size(A);\nr1=rank(A);\nr2=rank([A b]);\nif r1==r2\n if r1==n\n disp('方程组是恰定的，有唯一解！')\n x=A\\b;\n e=norm(A*x-b);\n else\n disp('方程组是欠定的，有无穷解！')\n z=null(sym(A)); %解出规范化的化零空间\n x0=sym(A)\\sym(b); %求出一个特解\n\n colnum = size(z,2);\n k =[];\n for i = 1:colnum\n k = [k sym(['k' num2str(i)])];\n end\n x = z*k' + x0;\n e=norm(A*x-b); %检验解的准确性\n end\nelse\n disp('方程组是超定的，只有最小二乘意义下的解！')\n x=A\\b;\n e=norm(A*x-b);\nend\nend\n ",WRONG_ANSWER,27,6624 1520023716308746240,10a197349299d6c6c54e8056f792f2776f08788321af3455ba51b795c74e2be1,2022-04-29 20:54:29,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"A=zeros;\nB=zeros;\nC=zeros;\nd=0;\nfor i=1:1:17\n for j=1:1:25\n if 30*i+20*j+10*(30-i-j)==500\n d=d+1;\n A(d)=i;\n B(d)=j;\n C(d)=30-i-j;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',d) \n for g=1:1:d\n fprintf('Group %d :',g);\n fprintf('%d men,',A(g));\n fprintf(' %d women,',B(g));\n fprintf('%d kids.\\n',C(g));\n end",PRESENTATION_ERROR,28,6492 1520023718695321600,78e3a7a73403675fd48af94fb03b169771e91bade2a5eec499f8c31a3afedf3e,2022-04-29 20:54:29,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"format short e\nN=input('N');\nfun=@(x)x*(1+x)^60*N*10000-6000*((1+x)^60-1);\n[xx,iter,X]=secant(fun,0.007,0.006);\nxx\nM=xx*12\nfunction [x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); \n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,56,6664 1520023720645672960,4c244e5028facb818b32b6c1f9de1a24be1e60a5c30cb7efbced742f5a7b6695,2022-04-29 20:54:30,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"n=0;\nfor\nA = (1:30);\nB = (1:30);\nC = (1:30);\ni = (1:30);\nA(i)+B(i)+C(i)<31;\n30*A(i)+30*B(i)+30*C(i)=500\nn=n+1\ndisp (There are n possible groups.);\ndisp (Group'n' :i men, i women, i kids.);",WRONG_ANSWER,25,6508 1520023727834693632,d84260db8bfd969820435701f995b0994f65eff67178b9c986cbc56a93df86ee,2022-04-29 20:54:32,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,N = 30;\nS = 60 * 6000;\nDelta = S - N*10000;\nmrate = Delta / 60;\nrate = mrate*12;\n,WRONG_ANSWER,58,6504 1520023736407855104,0fe50fa0e59ea5cd203cb2d5f7158286980839f76fe379e4a9e2aeab33174e51,2022-04-29 20:54:34,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X] = neton_down(fun,x0,eps,maxiter)\n\nif nargin<2,error('输入参数两个'),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;tol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k==maxiter\n error('迭代失败')\nend\nx=x1;iter=k;X=X';\n\nx = 0.002 : .001:.005;\nfun = 180*x.*(1+x).^240./((1+x).^240-1)-1.2;\n[x,iter,X]=neton_down(fun,0.003,1e-6,1e4)\n",WRONG_ANSWER,56,6788 1520023740543447040,3e6841ccb56aa32d8fa872c6f6d9a6ad5cfce0308d3cccc8d044def327b32545,2022-04-29 20:54:35,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"k = 0;\nfor x = 1:20\n for y =1:25\n for z = 30-x-y\n if 30*x+20*y+10*z == 500\n a = [x,y,z];\n k = k+1;\n X(k,:)= a;\n end\n end\n end\nend\nGroup = struct('men','women','kids')\nprint('There are 9 possible groups.')\nprint('Group 1 : 1 men, 18 women, 11 kids.')\nprint('Group 2 : 2 men, 16 women, 12 kids.')\nprint('Group 3 : 3 men, 14 women, 13 kids.')\nprint('Group 4 : 4 men, 18 women, 11 kids.')\nprint('Group 5 : 5 men, 18 women, 11 kids.')\nprint('Group 6 : 6 men, 18 women, 11 kids.')\nprint('Group 7 : 7 men, 18 women, 11 kids.')\nprint('Group 8 : 8 men, 18 women, 11 kids.')\nprint('Group 9 : 9 men, 18 women, 11 kids.')",WRONG_ANSWER,32,6764 1520023740858007552,7500e633b35e1ab9e95beb98d004707d78164eea0806bb87229a19fae1fc0b43,2022-04-29 20:54:35,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,clear\n\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)&(man+woman+children==30)\n m=man;\n w=woman;\n c=children;\n end\n end\n end\nend\ngroup(1).name='man';\ngroup(1).number=m;\ngroup(2).name='woman';\ngroup(2).number=w;\ngroup(3).name='children';\ngroup(3).number=c;\nfprintf('There are 1 possible groups.')\nfprintf('group1;'),WRONG_ANSWER,353,6748 1520023754707599360,78e3a7a73403675fd48af94fb03b169771e91bade2a5eec499f8c31a3afedf3e,2022-04-29 20:54:38,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.');\ndisp([' ','men',' ','women',' ','kids']);\nfor m=1:30\n for w=1:30\n for k=1:30\n if (30*m+20*w+10*k==500)&&(m+w+k==30)\n disp([m,w,k]);\n end\n end\n end\nend",WRONG_ANSWER,100,6492 1520023762395770880,8f7d9dccd83290f4b0f612fe8a72b63b00bb3d8909369bd451a93faa57dcfd2d,2022-04-29 20:54:40,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"clear\nN =input ('请输入人数');\nM = 0;\nfor m = 1:N;\n for w = 1:N;\n for child = 1:N;\n if(30* m+ 20* w+ 10* child==500)&&(m+ w+ child==N)\n M=M+1;\n Group(N). man= m;\n Group(N). woman= w;\n Group(N). kids= child;\n end\n end\n end\nend\nfprintf('There are %d possible groups\\20',N)\nfor z = 1:N\n fprintf('Group %d :\\20',z)\n disp(Group(z))\nend",WRONG_ANSWER,124,6680 1520023764425805824,19102154b0713249495963febdd4c15cb48bcb30b150e53dc8bb4895741d81ff,2022-04-29 20:54:40,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"function group = chifan()\nj=0;\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(man*30+woman*20+children*10==500)\n j=j+1;\n Group(j).man=man;\n Group(j).woman=woman;\n Group(j).children=children;\n end\n end\n end\nend\nfprintf('There are %d',j,' possible groups.\\n')\nfor i=1:j\n fprintf( '%d',Group(i).man,'Man\\n')\n fprintf('%d',Group(i).woman,'Woan\\n')\n fprintf('%d',Group(i).children,'Childrend\\n')\nend\n ",WRONG_ANSWER,26,6496 1520023781450493952,d84260db8bfd969820435701f995b0994f65eff67178b9c986cbc56a93df86ee,2022-04-29 20:54:44,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,N = input('');\nS = 60 * 6000;\nDelta = S - N*10000;\nmrate = Delta / 60;\nrate = mrate*12;\n,WRONG_ANSWER,53,6508 1520023783220482048,8ad0f476dd23aa25ee8f5f7fb51577364f54220e81dad4f77c1e140c2c21071d,2022-04-29 20:54:45,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"i=0;\ninput('N=')\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif (man*30+woman*20+children*10==500)&(man+woman+children==N)\n \n A(i,1)=man;\n A(i,2)=woman;\n A(i,3)=children;\n disp('There are %d\\n possible groups',i)\n disp('Group%d\\n:%d\\n men,%d\\n women,&d\\n children',i,man,woman,children)\n i=i+1;\n end\n end\n end\nend\n\n",WRONG_ANSWER,55,6764 1520023784046768128,0fe50fa0e59ea5cd203cb2d5f7158286980839f76fe379e4a9e2aeab33174e51,2022-04-29 20:54:45,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"N=input('N=');\nj=0;\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif(man*30+woman*20+children*10==500)&(man+woman+children==N)\n j=j+1\n fprintf( 'Group: %d',j)\n fprintf( 'men: %d',man)\n fprintf( 'women: %d',woman)\n fprintf( 'kids: %d\\n',children)\n end\nfprintf('There are j possible groups')\n end\n end\nend",MULTIPLE_ERROR,447,7140 1520023784743026688,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:54:45,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"%运行后需在命令行窗口输入240\nn=input('');\nfun=@(x)180*(x*(1+x)^n)/((1+x)^n-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate=x*12;\nfprintf(\""rate= %f\\n\"",rate)\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6620 1520023797225275392,c160e640618233bd4a9f50eed556e5523bf2a2352e4397116f5acf1a298222a1,2022-04-29 20:54:48,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"cnt = 0\nfor man = 1:30\n for woman = 1:30\n for children = 1:30\n if(30*man+20*woman+10*children == 500)&(man+woman+children==30)\n cnt = cnt + 1;\n Group(cnt).man = man;\n Group(cnt).woman = woman;\n Group(cnt).children = children;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',cnt)\nfor i = 1:cnt\n fprintf('Group %d : %d men, %d women, %d kid.\\n',i,Group(i).man,Group(i).woman,Group(i).children)\nend",WRONG_ANSWER,338,6748 1520023799586668544,efe82bf3be05869fddccc0c2bc168b4eb7e61593e0ea658fc769b6189b8998a5,2022-04-29 20:54:49,Octave,0.0,1519869963626618886,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\n\na=input(\""\"");\nfun=@(x)180*(x*(1+x)^a)/((1+x)^a-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,55,6760 1520023806507270144,c12d9bb6354bbdaba0621e4b63d4539caffe875c068069251a7f2e74611e2174,2022-04-29 20:54:50,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function result=newton_down(h,x,n)\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-5 %牛顿法流程\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n",WRONG_ANSWER,53,6504 1520023812261838848,e4780265bdf45783236a97d947d2e0200db514883c68b438e4627213dfb8a113,2022-04-29 20:54:52,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"clear\nformat long\nN=input('汽车价格');\nfun=@(x)N*(x*(1+x).^60)/((1+x).^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nrate = x.*12\n\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,55,6620 1520023813323014144,2d882744229d7e27284ee7c076e14dbe33af3edd012f82d587b74c8ed0ea9694,2022-04-29 20:54:52,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"for man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)…\n &(man+woman+children==30)\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,26,6504 1520023816250638336,1de33e84a1b86355fdf4b4e367c1b6aaa80da18a599c7bb0c742d17580311b62,2022-04-29 20:54:53,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"a=[30,20,10;1,1,1]\nb=[500;30]\nc=a\\b;\nThere are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 10 men, 0 women, 20 kids.",WRONG_ANSWER,25,6516 1520023818876272640,90198d91abbc7581695b14ce937d7af2f9dd193fc9248a4207304afe345fc4e7,2022-04-29 20:54:53,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368," function[x,iter,X]=newcar_secant(f,x0,x1,eps,max)\n f=@(x)(N(1+x/12))/360000;\n if nargin<3,err('输入参数最少需要3个'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<4|isempty(max),max=1e4;end\n f0=feval(f,x0);\n f1=feval(f,x1);\n k=0;err=1;\n while abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2feval(f,x2);\n while abs(f2).=abs(f1)\n l",WRONG_ANSWER,53,6748 1520023825163530240,8e038bf0bf880063b4441ee1290c81bf059dba2743c043d24ee7eb66bd21c81b,2022-04-29 20:54:55,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"syms x y z;\ns=0;\nfor x=1:1:16\n for y=1:1:25\n for z=1:1:30\n if(x+y+z==30||30*x+25*y+10*z==500)\n s=s+1;\n print(\""There are \""x \""possible groups.\nGroup\"" s x \""men, XXX women, XXX kids.\n end\n end\n end\nend",WRONG_ANSWER,27,6508 1520023828590280704,8ad0f476dd23aa25ee8f5f7fb51577364f54220e81dad4f77c1e140c2c21071d,2022-04-29 20:54:56,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,"i=0;\ninput('N=')\nfor man=1:N\n for woman=1:N\n for children=1:N\n \tif (man*30+woman*20+children*10==500)&(man+woman+children==N)\n \n A(i,1)=man;\n A(i,2)=woman;\n A(i,3)=children;\n disp('There are %d\\n possible groups',i)\n disp('Group%d\\n:%d\\n men,%d\\n women,&d\\n children',i,man,woman,children)\n i=i+1;\n end\n end\n end\nend\n\n",WRONG_ANSWER,62,6756 1520023831979278336,85dcfb6626fd857b77c4a9f679daf103d03bccfbe0d0219365e3c0aecf0d2b77,2022-04-29 20:54:56,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,clear\nN=input('总价=');\ntotal=60*6000;\nbi=total/N/10000;\nli=log10(10),WRONG_ANSWER,55,6508 1520023835158556672,e1fc970e8c1d0cdb13ea018c3608cd8127e36b0453ea2185554a334c932ebf2b,2022-04-29 20:54:57,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"i=1;j=1;\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (30 * x) + (20 * y) + (10*z) == 500)\n i=i+1;\n end\n end\n end\nend\ni=i-1;\nfprintf(\""There are %i possible groups.\\n\"",i)\nfor x =0:30\n\t\tfor y = 0:30\n\t\t\tfor z = 0:30\n\t\t\t\tif (x + y + z == 30 && (30 * x) + (20 * y) + (10*z) == 500)\n\t\t\t\t\tfprintf(\""Group %i : %i men, %i women, %i kids.\\n\"",j, x, y, z);\n Group.male(j)=x;\n Group.female(j)=y;\n Group.child(j)=z;\n j=j+1;\n end\n end\n end\nend\n",WRONG_ANSWER,137,6496 1520023838979571712,a46dca0d6621f2b9f160bccc946c92b5fe51c763d3efa1b2fe2863d5bd9eb551,2022-04-29 20:54:58,Octave,0.0,1519869963626618887,1517175951723835392,1141715925804474368,"function [x]=secant(N)\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0;x1=20;\nfun=@(x)x*x*x*x*x*N*10000-60*6000\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\neps=1e-6;\nmaxiter=1e4;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nx=(x-1)/12;",WRONG_ANSWER,56,6796 1520023839864553472,e848934174ba327b76eab76faf10fe3403e02d64e71e542ffc1978c0254d9c8b,2022-04-29 20:54:58,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,for man=1:30\nfor woman=1:30\nfor children=1:30\nif(man*30+woman*20+kid*10=500)\n&(man+woman+kid=30)\n,WRONG_ANSWER,27,6512 1520023841261268992,816e1dc7c5479891d0ec0f438ae0361f5a135223a59ab7329a1a6fe1597b9c6d,2022-04-29 20:54:59,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"for man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)&(man+woman+children==30)\n XXX=0;\n XXX=XXX+1;\n fprintf(' Group(%d\\n XXX):%d\\n men',XXX,man)\n fprintf('%d\\n wemen',woman)\n fprintf('%d\\n kids',children)\n fprintf(' ')\n \n end\n end\n end\nend\nfprintf('There are %d\\n XXX possible groups:',XXX)",WRONG_ANSWER,345,6756 1520023841584222208,2d882744229d7e27284ee7c076e14dbe33af3edd012f82d587b74c8ed0ea9694,2022-04-29 20:54:59,Octave,0.0,1519869963626618888,1517040002215354368,1141715823085969408,"for man=1:30\n for woman=1:30\n for children=1:30\n \tif(man*30+woman*20+children*10==500)…\n &(man+woman+children==30)\n fprintf('Man: %d\\n',man)\n fprintf('Woman: %d\\n',woman)\n fprintf('Chlidren: %d\\n',children)\n end\n end\n end\nend\nj=0;\nfor man=1:30\n for woman=1:30\n for children=1:30\n if(man*30+woman*20+children*10==500)...\n &(man+woman+children==30)\n j=j+1;\n A(j,1)=man;\n A(j,2)=woman;\n A(j,3)=children;\n end\n end\n end\nend\nMan____Woman____Children=A\n",WRONG_ANSWER,26,6632 1520023841907183616,dd94d04cf967708c96cc99cff52627647035b66aa5e24d0cc31528eea753046b,2022-04-29 20:54:59,Octave,0.0,1519869963626618889,1517141269389144064,1141715823085969408,N = input('');\nMoney = 500\nGroup.men=0\nGroup.women=0\nGroup.kids=0\nspend = 0\nx=1\nfor m = 0:16\n spend = m * 30;\n for w = 0:25\n spend = spend + w*20;\n if (spend <= 500)\n for k = 0:50\n spend = spend + k*10;\n if spend == 500\n Group(x).men = m;\n Group(x).women = w;\n Group(x).kids = k;\n x = x+1;\n elseif spend>500\n break\n end\n end\n end\n end\n ,WRONG_ANSWER,53,6756 1519920062889234432,644a8c597b4f6e8c0a1f80cf528056247bdebed2a8de935fbf3e991f3f2cbe40,2022-04-29 14:02:36,Octave,0.0,1519897348019335168,1514817351877615616,1141715705586737152,result =\n\n 5 6\n\n,WRONG_ANSWER,58,10292 1519945501879877632,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-29 15:43:41,Octave,20.0,1519914978377744384,1517040002215354368,1141715823085969408," fprintf('There are 9 possible groups.\\n')\nfor men=1:30\n for women=1:30\n for kids=1:30\n if (men+women+kids==30)&(men*30+women*20+kids*10==500)\n \n fprintf('Group %d : %d men, %d women, %d kids.\\n',men,men,women,kids)\n \n \n end\n end\n end\nend",ACCEPTED,337,6776 1519945542908542976,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-29 15:43:51,Octave,20.0,1519914978377744384,1517040002215354368,1141715823085969408," fprintf('There are 9 possible groups.\\n')\nfor men=1:30\n for women=1:30\n for kids=1:30\n if (men+women+kids==30)&(men*30+women*20+kids*10==500)\n \n fprintf('Group %d : %d men, %d women, %d kids.\\n',men,men,women,kids)\n \n \n end\n end\n end\nend",ACCEPTED,341,6500 1519954562088206336,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-29 16:19:41,Octave,0.0,1519914947931287552,1517166904926183424,1141715925804474368,"A = 1:10;\nB = 2:2:20;\nf = @inner_product;\na = integral(f,X,Y)\nresult = inner_product(A,B)\nfunction result = inner_product(X,Y)\n w=X.*Y\n result=sum(w)\nend",WRONG_ANSWER,55,6752 1514873142966493184,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:47:56,Octave,0.0,1514868492250542080,1509455093978988544,1141715705586737152,"my_zero = zeros(1,15);\nfprintf('%d ' my_zero)",WRONG_ANSWER,28,6384 1514873199404687360,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:48:10,Octave,0.0,1514868492250542080,1509455093978988544,1141715705586737152,"my_zero = zeros(1,15);\nfprintf(my_zero)",WRONG_ANSWER,26,6556 1514873261912203264,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:48:25,Octave,0.0,1514868492250542080,1509455093978988544,1141715705586737152,"my_zero = zeros(1,15);\nfprintf(my_zero)",WRONG_ANSWER,32,6796 1514873690586849280,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:50:07,Octave,50.0,1514868492250542080,1509455093978988544,1141715705586737152,"myZeros = zeros(1,15);\nfprintf('%d ',myZeros)",ACCEPTED,29,6892 1514874203483676672,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:52:09,Octave,0.0,1514868549989130240,1509442034245926912,1141715734670041088,A = [1 2 -1 5 6 7 -4 3];\nB = [];\nfor i=1:length(A)\n if A(i)>0\n B(i) = A(i).^3;\n else\n B(i) = 0;\n end\nfprintf('%d ' B),WRONG_ANSWER,28,6776 1514874506270121984,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:53:21,Octave,50.0,1514868549989130240,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nB = A.^3;\nB((B<0)) = 0;\nfprintf('%d ',B)",ACCEPTED,29,6660 1514874529166827520,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:53:27,Octave,50.0,1514868549989130240,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nB = A.^3;\nB((B<0)) = 0;\nfprintf('%d ',B)",ACCEPTED,27,6640 1514874566186115072,6072cdab17018c1e64d3a487896897a320b5113c375b197954cc72bc5a156087,2022-04-15 15:53:36,Octave,50.0,1514868549989130240,1509442034245926912,1141715734670041088,"A = [1 2 -1 5 6 7 -4 3];\nB = A.^3;\nB((B<0)) = 0;\nfprintf('%d ',B)",ACCEPTED,33,6680 1520004005344882688,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-29 19:36:09,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 9 possible groups.\\n\"");\nfor i=11:19\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-10,i-10,40-2*i,i)\nend",ACCEPTED,26,6496 1520008315176783872,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-29 19:53:17,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('……')",WRONG_ANSWER,40,6492 1520009189869531136,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-29 19:56:45,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 1 : 3 men, 14 women, 13 kids.')\ndisp('Group 2 : 4 men, 12 women, 14 kids.')\ndisp('Group 1 : 5 men, 10 women, 15 kids.')\ndisp('Group 2 : 6 men, 8 women, 16 kids.')\ndisp('Group 1 : 7 men, 6 women, 17 kids.')\ndisp('Group 2 : 8 men, 4 women, 18 kids.')\ndisp('Group 1 : 9 men, 2 women, 19 kids.')\n",WRONG_ANSWER,28,6488 1520009258282827776,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-29 19:57:02,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kids.')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 19 kids.')\n",ACCEPTED,27,6644 1520009277710827520,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-29 19:57:06,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kids.')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 19 kids.')\n",ACCEPTED,27,6508 1520009332853354496,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-29 19:57:20,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kids.')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 19 kids.')\n",ACCEPTED,27,6752 1520009437337649152,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-29 19:57:44,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,disp('rate = 0.074201'),PARTIAL_ACCEPTED,51,6756 1520009467725381632,f6a3c86be8146f719bc086163b437270d93c9590267f6b7db645a36750d33420,2022-04-29 19:57:52,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,disp('rate = 0.074201'),PARTIAL_ACCEPTED,51,6512 1520011481393954816,a576bbc124df55564612a2662b6b3212e275ac45758b95e309b8b94bf40c5b4b,2022-04-29 20:05:52,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.051212\"")",PARTIAL_ACCEPTED,54,6636 1520012441239470080,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-29 20:09:41,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",PARTIAL_ACCEPTED,54,6568 1520013040186064896,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-29 20:12:03,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"")\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",WRONG_ANSWER,51,6768 1520013139712704512,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-29 20:12:27,Octave,20.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",ACCEPTED,55,6792 1520017184871460864,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-29 20:28:32,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"n=input('');\ns=0;\nindex=1;\nfor i = 1:n\n for j = 1:n\n for k = 1:n\n if 30*i+20*j+10*k==500 & i+j+k==n\n A(index).men=i;\n A(index).women=j;\n A(index).kid=k;\n index=index+1;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",index-1);\nfor i = 1:(index-1)\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,A(i).men,A(i).women,A(i).kid);\nend",ACCEPTED,407,6660 1520017769851027456,da356d266c7197b28810998a65bbf3a49d02d184802a35c91eda8e34731bd279,2022-04-29 20:30:51,C++,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include \nusing namespace std;\nstruct Group{\n int men;\n int women;\n int kids;\n};\nint main(){\n int N;\n cin>>N;\n Group A[N];\n int count=0;\n for(int i=1;i<=N;i++){\n for(int j=1;j0.0000000001\n root=(U+L)/2;\n if f(root)<0.000000001 & f(root)>-0.0000000001 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.6f\"",12*root);",PRESENTATION_ERROR,57,6748 1520020510262460416,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-29 20:41:44,Octave,20.0,1519981129065656326,1517166904926183424,1141715925804474368,"n=input('');\nroot=0;\nf=@(x) x*((1+x)^n)/((1+x)^n-1)-1/150;\nU=1;\nL=0;\nwhile U-L>0.0000000001\n root=(U+L)/2;\n if f(root)<0.000000001 & f(root)>-0.0000000001 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.6f\"",12*root);",ACCEPTED,56,6640 1520032814664302592,d282a2852bf0eb6602a02ffc4ac97ecf3c31c1d0d227a87b26c76811e02aad3a,2022-04-29 21:30:38,Octave,20.0,1519981129065656326,1517166904926183424,1141715925804474368,"n=input('');\nroot=0;\nf=@(x) x*((1+x)^n)/((1+x)^n-1)-1/150;\nU=1;\nL=0.000001;\nwhile U-L>0.0000000001\n d=f(U);\n c=U;\n a=L;\n b=f(a);\n root=(b*c-a*d)/(b-d);\n if f(root)<0.000000001 & f(root)>-0.0000000001 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.6f\"",12*root);",ACCEPTED,56,6748 1520045847499276288,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:22:25,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"A=[30 20 10];\nB=500;\nsum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(B-i*A(1))/A(2);\n for j=1:P\n k=(B-i*A(1)-j*A(2))/A(3);\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520045925114875904,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:22:44,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"A=[30 20 10];\nb=500;\nsum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(b-i*A(1))/A(2);\n for j=1:P\n k=(b-i*A(1)-j*A(2))/A(3);\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520046212277899264,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:23:52,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"A=[30 20 10];\nb=500;\nsum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(b-i*A(1))/A(2);\n for j=1:P\n k=(b-i*A(1)-j*A(2))/A(3);\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520046405970857984,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:24:38,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"a=30;\nb=20;\nc=10;\nd=500;\nsum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:P\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520046661416554496,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:25:39,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"a=30;\nb=20;\nc=10;\nd=500;\nsum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520046676734160896,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:25:43,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"a=30;\nb=20;\nc=10;\nd=500;\nsum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520046703481237504,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:25:49,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"a=30;\nb=20;\nc=10;\nd=500;\nsum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520047697850052608,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:29:46,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"int a=30;\nint b=20;\nint c=10;\nint d=500;\nint sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520049116246212608,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:35:25,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520049314158657536,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:36:12,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",COMPILE_ERROR,0,0 1520049622767157248,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:37:25,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend",WRONG_ANSWER,55,7332 1520049907627507712,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:38:33,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",sum, U(sum,1),U(sum,2),U(sum,3));\n",WRONG_ANSWER,52,6744 1520054431553466368,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 22:56:32,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",sum, U(sum,1),U(sum,2),U(sum,3));\n",WRONG_ANSWER,60,6632 1520055488371277824,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:00:44,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"month=input(\""\"");\nzongkuan=300;\ndaikuan=300*(1-0.4);\nyuehuankuan=1.2;\nfunction krate=newton(k)\nfor i=1:k\n s=daikuan*(1+krate)-yuehuankuan;\nend\ns=0;\nend\nrate=newton(month)*12;",WRONG_ANSWER,59,6788 1520055499893030912,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:00:47,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"month=input(\""\"");\nzongkuan=300;\ndaikuan=300*(1-0.4);\nyuehuankuan=1.2;\nfunction krate=newton(k)\nfor i=1:k\n s=daikuan*(1+krate)-yuehuankuan;\nend\ns=0;\nend\nrate=newton(month)*12;",WRONG_ANSWER,58,6792 1520055590422888448,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:01:08,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"month=input(\""\"");\nzongkuan=300;\ndaikuan=300*(1-0.4);\nyuehuankuan=1.2;\nfunction krate=newton(k)\nfor i=1:k\n s=daikuan*(1+krate)-yuehuankuan;\nend\ns=0;\nend\nrate=newton(month)*12;",WRONG_ANSWER,65,6888 1520055788851212288,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:01:55,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"month=input(\""\"");\nzongkuan=300;\ndaikuan=300*(1-0.4);\nyuehuankuan=1.2;\nfunction krate=newton(k)\nfor i=1:k\n s=daikuan*(1+krate)-yuehuankuan;\nend\ns=0;\nend\nrate=newton(month)*12;\nfprintf(\""rate= %d\"",rate);",WRONG_ANSWER,63,6640 1520055969097236480,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:02:38,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nprint(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",sum, U(sum,1),U(sum,2),U(sum,3));\n",WRONG_ANSWER,53,6676 1520056107307937792,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:03:11,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nprint(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",sum, U(sum,1),U(sum,2),U(sum,3));\n",WRONG_ANSWER,52,6492 1520056476360552448,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:04:39,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"month=input(\""\"");\nzongkuan=300;\ndaikuan=300*(1-0.4);\nyuehuankuan=1.2;\nfunction krate=newton(k)\nfor i=1:k\n s=daikuan*(1+krate)-yuehuankuan;\nend\ns=0;\nend\nrate=newton(month)*12;\nfprintf(\""rate= %d\"",rate);",WRONG_ANSWER,53,6748 1520056492672192512,fcd571aca2cb1128aaf1a29bea8566457e505905f8ec44a362c841656aea73d8,2022-04-29 23:04:43,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408," a=30;\n b=20;\n c=10;\n d=500；\n sum=0;\nN=input(\""N=\"");\nfor i=1:16\n P=(d-i*a)/b;\n for j=1:fix(P)\n k=(b-i*a-j*b)/c;\n if((N==i+j+k)&&k>0)\n sum=sum+1;\n U(sum,1)=i;\n U(sum,2)=j;\n U(sum,3)=k;\n end\n end\nend\nprint(\""There are %d possible groups.\\n\"",sum)\nfor i=1:sum-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i, U(i,1),U(i,2),U(i,3));\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",sum, U(sum,1),U(sum,2),U(sum,3));\n",WRONG_ANSWER,53,6500 1520071806881398784,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:05:34,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=newton_secant(N,x0,x1)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\njd=1;\nwhile abs(jd)>1e-10\n lamuda=1;\n x2=x1-lamuda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lamuda=lamuda/2; \n x2=x1-lamuda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n jd=x1-x0;\nend\n x=12*[x2];\nend\n",COMPILE_ERROR,0,0 1520072094887477248,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:06:43,Python,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=newton_secant(N,x0,x1)\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\njd=1;\nwhile abs(jd)>1e-10\n lamuda=1;\n x2=x1-lamuda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lamuda=lamuda/2; \n x2=x1-lamuda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n jd=x1-x0;\nend\n x=12*[x2];\nend\n",NON_ZERO_EXIT_CODE,116,29904 1520074552086925312,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:16:29,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)in*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x\nend\n",WRONG_ANSWER,52,6756 1520074885840285696,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:17:49,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)in*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x\nfprintf('rate = %f\\n',rate);\nend\n",WRONG_ANSWER,52,6888 1520075182499213312,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:18:59,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)in*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x\nfprintf('rate = %f\\n',rate);\nend\n",WRONG_ANSWER,52,6632 1520076894412783616,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:25:47,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint i=30,man,woman,child;\n printf(\""There are 3 possible groups.\\n\"")\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n int i=1;\n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",i,man,woman,child);\n i++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n return 0;\n\t}\n",COMPILE_ERROR,0,0 1520076947370065920,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:26:00,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint i=30,man,woman,child;\n printf(\""There are 3 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n int i=1;\n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",i,man,woman,child);\n i++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n return 0;\n\t}\n",COMPILE_ERROR,0,0 1520077037392408576,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:26:22,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint i=30,man,woman,child;\n printf(\""There are 3 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n int ji=1;\n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",j,man,woman,child);\n j++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n return 0;\n\t}\n",COMPILE_ERROR,0,0 1520077081617141760,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:26:32,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint i=30,man,woman,child;\n printf(\""There are 3 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n int j=1;\n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",j,man,woman,child);\n j++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n return 0;\n\t}\n",COMPILE_ERROR,0,0 1520077234994446336,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:27:09,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n printf(\""There are 3 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n int j=1;\n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",j,man,woman,child);\n j++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n return 0;\n\t}\n",COMPILE_ERROR,0,0 1520077404196876288,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:27:49,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n printf(\""There are 3 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n int j=1;\n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",j,man,woman,child);\n j++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",WRONG_ANSWER,3,456 1520077649588826112,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:28:47,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n int j=1;\n printf(\""There are 3 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",j,man,woman,child);\n j++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",WRONG_ANSWER,3,440 1520077871828209664,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:29:40,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\\n\"",j,man,woman,child);\n j++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",WRONG_ANSWER,4,452 1520078445000822784,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:31:57,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\"",j,man,woman,child);\n j++;\n if(j!=8){\n printf(\""\\n\"")\n }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",COMPILE_ERROR,0,0 1520078473396260864,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:32:04,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\"",j,man,woman,child);\n j++;\n if(j!=8){\n printf(\""\\n\"");\n }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",WRONG_ANSWER,3,448 1520078764539691008,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:33:13,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\nprintf(\""There are 3 possible groups.\\n\nGroup 1 : 1 men, 18 women, 11 kids.\\n\nGroup 2 : 2 men, 16 women, 12 kids.\\n\n……\"")\n return 0；\n }",COMPILE_ERROR,0,0 1520078840582422528,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:33:31,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\nprintf(\""There are 3 possible groups.\\n\nGroup 1 : 1 men, 18 women, 11 kids.\\n\nGroup 2 : 2 men, 16 women, 12 kids.\\n\n……\"")；\n return 0；\n }",COMPILE_ERROR,0,0 1520079199778410496,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:34:57,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n\t\t\t\t\tprintf(\""Group %d : %d men, %d women %d kids.\"",j,man,woman,child);\n j++;\n if(j!=8){\n printf(\""\\n\"");\n }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",WRONG_ANSWER,3,444 1520079347174641664,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:35:32,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n\t\t\t\t\tprintf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=8){\n printf(\""\\n\"");\n }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",WRONG_ANSWER,4,324 1520079463260393472,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:36:00,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"in=input(\""\"");\nfun=@(x)in*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x\nfprintf('rate = %f\\n',rate);\nfunction [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend",WRONG_ANSWER,64,6628 1520079574803726336,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:36:27,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"fprintf(\""rate = 0.074201\"")",PARTIAL_ACCEPTED,49,6376 1520080048630038528,3fed17b9ea312b4063efc3f7d631cb96dad2542c54a48647c54b983bcc9494ff,2022-04-30 00:38:19,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main(){\n\tint man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n\tfor(man=0;man<=10;man++){\n\t\tfor(woman=0;woman<=15;woman++){\n\t\t\tfor(child=0;child<=30;child++){\n\t\t\t\tif(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n\t\t\t\t\tprintf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } \nreturn 0;\n}\n",WRONG_ANSWER,3,440 1520283932304650240,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-30 14:08:29,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function rate=newton_secant(N,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12;\nend\nrate=newton_secant(240,0.007,0.006)",PARTIAL_ACCEPTED,55,6660 1520284438930436096,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-30 14:10:30,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function rate=newton_secant(N,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12;\nend\nrate=newton_secant(240,0.007,0.006)",PARTIAL_ACCEPTED,53,6764 1520292004678905856,00e8e58091e0fc94f4212c5dc7a8e9f9b83fc4339be0e0dc1763cfa315d1f75e,2022-04-30 14:40:34,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""There are 4 possible groups.\"")\ns=stuct({'Group 1','Group 2','Group 3','Group 4'},':',{'11 men','12 men','13 men','14 men'},','{'8 women','6 women','4 women','2 women'},',',{'1 kids.','2 kids.','3 kids.','4 kids.'}\ns1=s(1);\ns2=s(2);\ns3=s(3);\ns4=s(4);\nfprintf(\""%s\"",s1);\nfprintf(\""%s\"",s2);\nfprintf(\""%s\"",s3);\nfprintf(\""%s\"",s4);",WRONG_ANSWER,54,6884 1520294599275360256,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-30 14:50:52,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,28,7108 1520297459153141760,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-30 15:02:14,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"n=input('');\nsum=0;\nfor x=1:n\n for y=1:n\n for z=1:n\n if(x+y+z==n&&30*x+20*y+z==500)\n sum=sum+1;\n \n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum);\nfor x=1:n\n for y=1:n\n for z=1:n\n if(x+y+z==n&&30*x+20*y+10*z==500)\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",z,x,y,z);\n end\n end\n end\nend",PARTIAL_ACCEPTED,183,6752 1520297720999358464,8bfb766cdde9e7da06d469f003fe0dc1abb724c6af7f100031e78457edfc8252,2022-04-30 15:03:17,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"n=input('');\nsum=0;\nfor x=1:n\n for y=1:n\n for z=1:n\n if(x+y+z==n&&10*x+20*y+30*z==500)\n sum=sum+1;\n \n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",sum);\nfor x=1:n\n for y=1:n\n for z=1:n\n if(x+y+z==n&&10*x+20*y+30*z==500)\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",x,z,y,x);\n end\n end\n end\nend",PARTIAL_ACCEPTED,186,6900 1520301491942883328,49ccc846cc23de4576067d36bf7356a978d3de28125ef15d6e950db96b20826d,2022-04-30 15:18:16,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"x = input('');\nfh = @(R)(1.2 * ( (1+R).^x - 1 )) / (180 * (1+R) .^ x);\nx0 = 0.025;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(df);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(df);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('Rate = %f\\n', x0*12);",WRONG_ANSWER,54,6764 1520311676627353600,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-30 15:58:44,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=0;\nfor i=1:30\nfor j=1:30-i\nfor k=1:30-i-j\nif (i*30+j*20+k*10==500 && i+j+k==30)\nt=t+1;\ngroup(t).men=i;\ngroup(t).women=j;\ngroup(t).kids=k;\nend\nk=k+1;\nend\nj=j+1;\nend\ni=i+1;\nend\nfprintf('There are %d possible groups\\n',t)\nfor z=1:t\nfprintf('Group %d : %d men, %d women, %d kids\\n',z,group(z).men,group(z).women,group(z).kids)\nend ",WRONG_ANSWER,41,6524 1520312104446373888,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-30 16:00:26,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nusing namespace std;\n\nint main(){\n int a;\n cin>>a;\n cout<<\""There are 4 possible groups.\\n\"";\n cout<<\""Group 1 : 11 men, 8 women, 1 kids.\\n\"";\n cout<<\""Group 2 : 12 men, 6 women, 2 kids.\\n\"";\n cout<<\""Group 3 : 13 men, 4 women, 3 kids.\\n\"";\n cout<<\""Group 4 : 14 men, 2 women, 4 kids.\\n\"";\n}",WRONG_ANSWER,8,448 1520312285355098112,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-30 16:01:09,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nusing namespace std;\n\nint main(){\n int a;\n cin>>a;\n cout<<\""There are 4 possible groups.\\n\"";\n cout<<\""Group 1 : 11 men, 8 women, 1 kids.\\n\"";\n cout<<\""Group 2 : 12 men, 6 women, 2 kids.\\n\"";\n cout<<\""Group 3 : 13 men, 4 women, 3 kids.\\n\"";\n cout<<\""Group 4 : 14 men, 2 women, 4 kids.\\n\"";\n}",WRONG_ANSWER,7,452 1520312569082986496,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-30 16:02:17,Octave,20.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",ACCEPTED,54,7096 1520315863071244288,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-30 16:15:22,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"m = input(\""\"");\nA = 3000000;\nA0 = 1200000;\nb = 12000;\nfun = @(r,A,A0,b,m)b/r*(1-1/(1+r)^m)-(A-A0);\nrate = 12*fzero(@(r)fun(r,A,A0,b,m),1)\nfunction [x,iter,X]=newtondown(fun,x0,eps,maxiter)\nif nargin<2,error(\""输入参数过少\""),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;\ntol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error(\""次数超限\"")\nend\nx=x1;\niter=k;\nX=X';\nend",WRONG_ANSWER,54,6628 1520316552149237760,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-30 16:18:06,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"m = input(\""\"");\nA = 3000000;\nA0 = 1200000;\nb = 12000;\nfun = @(r,A,A0,b,m)b/r*(1-1/(1+r)^m)-(A-A0);\nrate = 12*fzero(@(r)fun(r,A,A0,b,m),1);\nvpa(rate,5)\nfunction [x,iter,X]=newtondown(fun,x0,eps,maxiter)\nif nargin<2,error(\""输入参数过少\""),end\nif nargin<3|isempty(eps),eps=1e-6;end\nif nargin<4|isempty(maxiter),maxiter=1e4;end\nk=1;\ntol=1;\nwhile abs(tol)>eps\n lambda=1;\n [fx0,dfx0]=feval(fun,x0);\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n while abs(fx1)>=abs(fx0)\n lambda=lambda/2;\n x1=x0-lambda*fx0/dfx0;\n [fx1,dfx1]=feval(fun,x1);\n x0=x1;\n end\n tol=fx1/dfx1;\n k=k+1;\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error(\""次数超限\"")\nend\nx=x1;\niter=k;\nX=X';\nend",WRONG_ANSWER,55,6756 1520318045237579776,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:24:02,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nx=func1(fun,0.007,0.006)\nfunction [x]=func1(fun,x0,x1)\neps=1e-6;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\n\tk=1;\n\tx2=x1-k*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n k=k/2; \n x2=x1-k*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n X(k)=x2;\nend\nx=vpa(12*x2,5);\nend\n\n\n",WRONG_ANSWER,53,6752 1520318106734460928,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:24:17,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=0;\nfor i=1:30\n for j=1:30-i\n for k=1:30-i-j\n if (i*30+j*20+k*10==500 && i+j+k==30)\n t=t+1;\n group(t).men=i;\n group(t).women=j;\n group(t).kids=k;\n end\n k=k+1;\n end\n j=j+1;\n end\n i=i+1;\nend\nfprintf('There are %d possible groups\\n',t)\nfor z=1:t\n fprintf('Group %d : %d men, %d women, %d kids\\n',z,group(z).men,group(z).women,group(z).kids)\nend ",WRONG_ANSWER,39,6508 1520322325109587968,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 16:41:03,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"%N=input('');\nN=30;\nM=30;\nW=20;\nK=10;\nG=0;\nfor i=1:N\n for j=1:N-i\n for n=N-i-j\n if(500==M*i+W*j+K*n)\n G=G+1;\n Group(G).men=i;\n Group(G).women=j;\n Group(G).kid=n;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",G)\nfor x=1:G\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",x,Group(x).men,Group(x).women,Group(x).kid)\nend",ACCEPTED,29,6824 1520325513468493824,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:53:43,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nx=func1(fun,0.007,0.006)\nfunction [x]=func1(fun,x0,x1)\neps=1e-6;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\n\tk=1;\n\tx2=x1-k*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n k=k/2; \n x2=x1-k*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n X(k)=x2;\nend\nx=vpa(12*x2,5);\nend\n\n\n",WRONG_ANSWER,58,8080 1520325831136686080,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:54:59,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=0;\nfor i=1:30\n for j=1:30-i\n for k=1:30-i-j\n if (i*30+j*20+k*10==500 && i+j+k==30)\n t=t+1;\n group(t).men=i;\n group(t).women=j;\n group(t).kids=k;\n end\n k=k+1;\n end\n j=j+1;\n end\n i=i+1;\nend\nfprintf('There are %d possible groups\\n',t)\nfor z=1:t\n fprintf('Group %d : %d men, %d women, %d kids\\n',z,group(z).men,group(z).women,group(z).kids)\nend ",WRONG_ANSWER,40,6748 1520325848098439168,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:55:03,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nx=func1(fun,0.007,0.006)\nfunction [x]=func1(fun,x0,x1)\neps=1e-6;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\n\tk=1;\n\tx2=x1-k*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n k=k/2; \n x2=x1-k*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n X(k)=x2;\nend\nx=vpa(12*x2,5);\nend\n\n\n",WRONG_ANSWER,53,6916 1520326003962986496,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:55:40,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=0;\nfor i=1:30\n for j=1:30-i\n for k=1:30-i-j\n if (i*30+j*20+k*10==500 && i+j+k==30)\n t=t+1;\n group(t).men=i;\n group(t).women=j;\n group(t).kids=k;\n end\n k=k+1;\n end\n j=j+1;\n end\n i=i+1;\nend\nfprintf('There are %d possible groups\\n',t)\nfor z=1:t\n fprintf('Group %d : %d men, %d women, %d kids\\n',z,group(z).men,group(z).women,group(z).kids)\nend ",WRONG_ANSWER,43,6556 1520326029778911232,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:55:46,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=0;\nfor i=1:30\n for j=1:30-i\n for k=1:30-i-j\n if (i*30+j*20+k*10==500 && i+j+k==30)\n t=t+1;\n group(t).men=i;\n group(t).women=j;\n group(t).kids=k;\n end\n k=k+1;\n end\n j=j+1;\n end\n i=i+1;\nend\nfprintf('There are %d possible groups\\n',t)\nfor z=1:t\n fprintf('Group %d : %d men, %d women, %d kids\\n',z,group(z).men,group(z).women,group(z).kids)\nend ",WRONG_ANSWER,43,6512 1520326051253747712,9130232f8c7c566f8979d8752e180a026cc25f860339036b3f58a9585cd45141,2022-04-30 16:55:51,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nx=func1(fun,0.007,0.006)\nfunction [x]=func1(fun,x0,x1)\neps=1e-6;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\n\tk=1;\n\tx2=x1-k*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n k=k/2; \n x2=x1-k*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n X(k)=x2;\nend\nx=vpa(12*x2,5);\nend\n\n\n",WRONG_ANSWER,51,6744 1520326498328817664,858bded14af1f147d6446b0b90604c7a59018761c6c573036ca6f823cad7a04e,2022-04-30 16:57:38,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"m = input(\""\"");\nA = 3000000;\nA0 = 1200000;\nb = 12000;\nfun = @(r,A,A0,b,m)b/r*(1-1/(1+r)^m)-(A-A0);\nrate = 12*fzero(@(r)fun(r,A,A0,b,m),1)\n%rate = 12*newtondown(@(r)fun(r,A,A0,b,m),1);\nrate = vpa(rate,5)\n%%\n% function [x,iter,X]=newtondown(fun,x0,eps,maxiter)\n% if nargin<2,error(\""输入参数过少\""),end\n% if nargin<3|isempty(eps),eps=1e-6;end\n% if nargin<4|isempty(maxiter),maxiter=1e4;end\n% k=1;\n% tol=1;\n% while abs(tol)>eps\n% lambda=1;\n% [fx0,dfx0]=feval(fun,x0);\n% x1=x0-lambda*fx0/dfx0;\n% [fx1,dfx1]=feval(fun,x1);\n% while abs(fx1)>=abs(fx0)\n% lambda=lambda/2;\n% x1=x0-lambda*fx0/dfx0;\n% [fx1,dfx1]=feval(fun,x1);\n% x0=x1;\n% end\n% tol=fx1/dfx1;\n% k=k+1;\n% x0=x1;\n% X(k)=x1;\n% end\n% if k>=maxiter\n% error(\""次数超限\"")\n% end\n% x=x1;\n% iter=k;\n% X=X';\n% end",WRONG_ANSWER,53,6500 1520329326715777024,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:08:52,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %6f\"",rate)",MULTIPLE_ERROR,55,6772 1520329681868455936,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:10:17,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %6f\\n\"",rate)",PARTIAL_ACCEPTED,52,6752 1520330176355930112,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:12:15,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.008;\nx1=0.005;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %6f\\n\"",rate)",PARTIAL_ACCEPTED,54,6624 1520331267533488128,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-30 17:16:35,C++,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include \n\nstruct Group {\n int men;\n int women;\n int kids;\n};\n\nint main() {\n int n, len = 0, i, j, k;\n Group G[100];\n std::cin >> n;\n for (i = 1; i <= 500 / 30 && i <= n; i++) {\n for (j = 1; j <= (n - i); j++) {\n k = n - i - j;\n if (30 * i + 20 * j + 10 * k == 500 && k != 0) {\n G[len++] = {i, j, k};\n }\n }\n }\n std::cout << \""There are \"" << len << \"" possible groups.\\n\"";\n for (i = 0; i < len; i++) {\n std::cout << \""Group \"" << i + 1 << \"" : \"" << G[i].men << \"" men, \"" << G[i].women << \"" women, \"" << G[i].kids\n << \"" kids.\""\n << \""\\n\"";\n }\n return 0;\n}",ACCEPTED,10,448 1520331674762657792,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:18:12,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.008;\nx1=0;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %6f\\n\"",rate)",WRONG_ANSWER,52,6616 1520331783734853632,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:18:38,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.008;\nx1=0.001;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %6f\\n\"",rate)",PARTIAL_ACCEPTED,54,6764 1520331844892012544,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:18:52,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.010;\nx1=0.001;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %6f\\n\"",rate)",PARTIAL_ACCEPTED,57,6768 1520332558187925504,38ca00079246058fc673fe623a6a4cfc23a38d79d75923c515dbc481bfdc997d,2022-04-30 17:21:42,C++,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include \n\nstruct Group {\n int men;\n int women;\n int kids;\n};\n\nint main() {\n int n, len = 0, i, j, k;\n Group G[100];\n std::cin >> n;\n for (i = 1; i <= 500 / 30 && i <= n; i++) {\n for (j = 1; j <= (n - i); j++) {\n k = n - i - j;\n if (30 * i + 20 * j + 10 * k == 500 && k != 0) {\n G[len++] = {i, j, k};\n }\n }\n }\n std::cout << \""There are \"" << len << \"" possible groups.\\n\"";\n for (i = 0; i < len; i++) {\n std::cout << \""Group \"" << i + 1 << \"" : \"" << G[i].men << \"" men, \"" << G[i].women << \"" women, \"" << G[i].kids\n << \"" kids.\""\n << \""\\n\"";\n }\n return 0;\n}",ACCEPTED,6,496 1520332758000373760,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:22:30,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.010;\nx1=0.001;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %d\\n\"",rate)",PARTIAL_ACCEPTED,56,6752 1520332817337200640,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:22:44,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.015;\nx1=0.001;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %d\\n\"",rate)",PARTIAL_ACCEPTED,53,6624 1520332918491222016,f2113a76e5bfd1eb2b2aba98d3649c059619ee433f8bd1ad58a21400e3e5e946,2022-04-30 17:23:08,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfun=@(x)N*x*(1+x)^60/((1+x)^60-1)-0.6;\n%.m文件\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n%调用m函数[x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点,取0.007和0.006\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n\n%if nargin<3,error('输入参数至少需要3个！'),end\n%if nargin<4|isempty(eps),eps=1e-6;end\n%if nargin<5|isempty(maxiter),maxiter=1e4;end\nx0=0.020;\nx1=0.001;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=X(end)*12;\nfprintf(\""rate = %d\\n\"",rate)",PARTIAL_ACCEPTED,52,6748 1520334648670982144,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 17:30:01,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,9,320 1520335770202714112,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 17:34:28,Octave,20.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",ACCEPTED,56,8072 1520337451409780736,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 17:41:09,Octave,20.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=x*12",ACCEPTED,54,7612 1520338106258079744,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-30 17:43:45,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"men=ones(1,10)*0;\nwomen=ones(1,10)*0;\nchildren=ones(1,10)*0;\nfor i=1:11\n men(i)=i-1;\n women(i)=20-2*(i-1);\n children(i)=10+i-1;\nend\nfprintf('%s\\n',\""There are 10 possible groups.\"")\nfor i=1:11\n fprintf('%s',\""Group 1 : \"")\n fprintf('%d',men(i))\n fprintf('%s',\"" men,\"")\n fprintf('%d',women(i))\n fprintf('%s',\"" women,\"")\n fprintf('%d',children(i))\n fprintf('%s\\n',\"" kids.\"")\nend",WRONG_ANSWER,27,6760 1520338128957652992,31a256b8db104b1ddcb0d40dcd044017f2df756826113e90e1e25278b7c26f87,2022-04-30 17:43:51,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3\n error('输入参数至少需要3个！')\nend\nif nargin<4|isempty(eps)\n eps=1e-6\nend\nif nargin<5|isempty(maxiter)\n maxiter=1e4\nend\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,51,6764 1520341815578886144,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 17:58:30,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,452 1520341885078507520,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 17:58:46,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",COMPILE_ERROR,0,0 1520341914665123840,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 17:58:53,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,7,324 1520343147731795968,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:03:47,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 4 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,456 1520343175032520704,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:03:54,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 5 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,7,456 1520343217764089856,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:04,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 6 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,320 1520343251394019328,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:12,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 7 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,436 1520343275037306880,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:18,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,440 1520343299745951744,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:23,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 9 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,7,316 1520343330397925376,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:31,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 10 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,9,460 1520343359435091968,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:38,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 11 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,328 1520343388526788608,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:45,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 12 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,9,452 1520343418985820160,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:52,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 13 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,10,436 1520343449335803904,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:04:59,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 14 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,7,476 1520343475692802048,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:05:05,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 15 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,440 1520343518915100672,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:05:16,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 16 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,9,456 1520343545892864000,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:05:22,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 17 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,6,452 1520343584753102848,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:05:31,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 18 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,444 1520343612641017856,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:05:38,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 19 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,448 1520343646396792832,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:05:46,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 20 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,8,452 1520343728101834752,08873d75a3fda0e7fb1edab26bcfe2ca4f3ebe55c91c3458080bf3d117c5efdb,2022-04-30 18:06:06,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nint main(){\n int man,woman,child;\n int j=1;\n printf(\""There are 8 possible groups.\\n\"");\n for(man=0;man<=30;man++){\n for(woman=0;woman<=30;woman++){\n for(child=0;child<=30;child++){\n if(child+man+woman ==30 && 3*man + 2*woman +child==50){\n \n printf(\""Group %d : %d men, %d women, %d kids.\"",j,man,woman,child);\n j++;\n if(j!=9){\n printf(\""\\n\"");\n }\n }\n }\n }\n } \nreturn 0;\n}",WRONG_ANSWER,9,588 1520401779714461696,260a034f9a424021ed08e020b3309dbea2a7f881f1f236f686ba2ff8a57bffc4,2022-04-30 21:56:46,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"tot=0;\np=zeros(100);\nfor x=1:500/30\n for y= 1:(500-x*30)/20\n for z=1:(500-x*30-y*20)/10\n if 30*x+20*y+z*10==500 && x+y+z==30\n tot=tot+1;\n p(tot*3-2)=x;\n p(tot*3-1)=y;\n p(tot*3)=z;\n end \n end \n end \nend\nfprintf('There are %d possible groups.\\n',tot);\nfor i=1:tot\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,p(i.*3-2),p(i.*3-1),p(i.*3));\nend \n ",ACCEPTED,34,6752 1520403196747481088,396128aaae0ad4495d2ec2e3f4bf8e40c570bc49bcdf22dd1fd28b4bb3988252,2022-04-30 22:02:24,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"tot=0;\np=zeros(100);\nfor x=1:500/30\n for y= 1:(500-x*30)/20\n for z=1:(500-x*30-y*20)/10\n if 30*x+20*y+z*10==500 && x+y+z==30\n tot=tot+1;\n p(tot*3-2)=x;\n p(tot*3-1)=y;\n p(tot*3)=z;\n end \n end \n end \nend\nfprintf('There are %d possible groups.\\n',tot);\nfor i=1:tot\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,p(i.*3-2),p(i.*3-1),p(i.*3));\nend ",ACCEPTED,37,6756 1520405916992700416,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-30 22:13:13,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,w,COMPILE_ERROR,0,0 1520405940367560704,6bb4cffd3dd20621cea8fac4e1eaaf56ed599024951d837850492c8e0f405734,2022-04-30 22:13:18,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,d,COMPILE_ERROR,0,0 1520418079715147776,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-30 23:01:32,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1)\n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1520418541977767936,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-30 23:03:23,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,。,COMPILE_ERROR,0,0 1520419853373063168,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-30 23:08:35,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.051212\"")",COMPILE_ERROR,0,0 1520423006399135744,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-30 23:21:07,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"disp(\""rate = 0.051212\"")",COMPILE_ERROR,0,0 1520423120979132416,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-30 23:21:34,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function X()\ndisp(\""rate = 0.051212\"")",COMPILE_ERROR,0,0 1520426511302168576,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-30 23:35:03,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"Group = struct('men', 'women', 'kids');\ncount 0;\nfor i in range(1,17)\n for j in range(1,25)\n for k in range(1,50)\n if i*30+j*20+k*10==500\n count=count+1;\n Group(count).men=i;\n Group(count).women=j;\n Group(count).kids=k;\n end\n end\n end\nend\nfprintf(Group)",COMPILE_ERROR,0,0 1520427960870420480,defdd32b15845569e4fa9eb5db6f0d84b00f378ef7a279b3604ab5867b2ce094,2022-04-30 23:40:48,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"%N=input()\n%Group = struct('men', 'women', 'kids');\n%count 0;\n%for i in range(1,17)\n% for j in range(1,25)\n% for k in range(1,50)\n% if i*30+j*20+k*10==500&&i+j+k=N\n% count=count+1;\n% Group(count).men=i;\n% Group(count).women=j;\n% Group(count).kids=k;\n% end\n% end\n% end\n%end\n%fprintf(Group)",COMPILE_ERROR,0,0 1520603108537827328,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-05-01 11:16:47,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function y=f(fun,num)\nx=num;\ny=eval(fun); \nfunction [x,k]=newton(x0,fun1,fun2,error) \nx=x0;\ny=f(fun1,x);\nk=1;\t \nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs(f(fun1,x2))>abs(f(fun1,x))\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend\n",WRONG_ANSWER,58,6744 1520604361087037440,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-05-01 11:21:45,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter]=inner_product(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(y)>err\n d=1;\n x2=x1-d*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n d=d/2;\n x2=x1-d*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\nend\nx=x2;iter=k;\nend\n",WRONG_ANSWER,52,6764 1520616353654943744,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-05-01 12:09:25,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"sprintf(\""There are 11 possible groups.\"")\nGroup1(1).men=0;\nGroup1(2).wemen = 20; \nGroup1(3).kids = 10;\nGroup2(1).men=1;\nGroup2(2).wemen = 18; \nGroup2(3).kids = 11;\nGroup3(1).men=2;\nGroup3(2).wemen = 16; \nGroup3(3).kids = 12;\nGroup4(1).men=3;\nGroup4(2).wemen = 14; \nGroup4(3).kids = 13;\nGroup5(1).men=4;\nGroup5(2).wemen = 12; \nGroup5(3).kids = 14;\nGroup6(1).men=5;\nGroup6(2).wemen = 10; \nGroup6(3).kids = 15;\nGroup7(1).men=6;\nGroup7(2).wemen = 8; \nGroup7(3).kids = 16;\nGroup8(1).men=7;\nGroup8(2).wemen = 6; \nGroup8(3).kids = 17;\nGroup9(1).men=8;\nGroup9(2).wemen = 4; \nGroup9(3).kids = 18;\nGroup10(1).men=9;\nGroup10(2).wemen = 2; \nGroup10(3).kids = 19;\nGroup11(1).men=10;\nGroup11(2).wemen = 0; \nGroup11(3).kids = 20;\nfor a = 1:11 \n fprintf('Group %d : %d men, %d women, %d kids.', a,Group a(1),Group a(2),Group a(2));\nend",WRONG_ANSWER,29,6496 1520616553328967680,222f43435eac5efd8399825c09a0e49eea1608db1c33b96713e57fbb8e3b1a7b,2022-05-01 12:10:12,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"sprintf(\""There are 11 possible groups.\"")\nGroup1(1).men=0;\nGroup1(2).wemen = 20; \nGroup1(3).kids = 10;\nGroup2(1).men=1;\nGroup2(2).wemen = 18; \nGroup2(3).kids = 11;\nGroup3(1).men=2;\nGroup3(2).wemen = 16; \nGroup3(3).kids = 12;\nGroup4(1).men=3;\nGroup4(2).wemen = 14; \nGroup4(3).kids = 13;\nGroup5(1).men=4;\nGroup5(2).wemen = 12; \nGroup5(3).kids = 14;\nGroup6(1).men=5;\nGroup6(2).wemen = 10; \nGroup6(3).kids = 15;\nGroup7(1).men=6;\nGroup7(2).wemen = 8; \nGroup7(3).kids = 16;\nGroup8(1).men=7;\nGroup8(2).wemen = 6; \nGroup8(3).kids = 17;\nGroup9(1).men=8;\nGroup9(2).wemen = 4; \nGroup9(3).kids = 18;\nGroup10(1).men=9;\nGroup10(2).wemen = 2; \nGroup10(3).kids = 19;\nGroup11(1).men=10;\nGroup11(2).wemen = 0; \nGroup11(3).kids = 20;\nfor a = 1:11 \n fprintf('Group %d : %d men, %d women, %d kids.', a,Groupa(1),Groupa(2),Groupa(2));\nend",WRONG_ANSWER,26,6616 1520622283503210496,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-05-01 12:32:58,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nfprintf('There are 4 possible groups.\\nGroup 1 : 11 men, 8 women, 1 kids.\\nGroup 2 : 12 men, 6 women, 2 kids.\\nGroup 3 : 13 men, 4 women, 3 kids.\\nGroup 4 : 14 men, 2 women, 4 kids.')",WRONG_ANSWER,50,6748 1520626142124478464,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-05-01 12:48:18,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nt=0;\nfor i=1:x-1\n for j=1:x-1\n for q=1:x-1\n if(i+j+q==x&&30*i+20*j+10*q==500)\n t=t+1;\n man(t)=i;\n woman(t)=j;\n child(t)=q;\n end\n end\n end\nend\nfprintf('There are %d possible groups.',t)\nfor n=1:t\n fprintf('\\nGroup %d : %d men, %d women, %d kids.',n,man(n),woman(n),child(n))\nend",ACCEPTED,112,6744 1520626439257362432,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-05-01 12:49:29,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf('rate = 0.074201\\n'),PARTIAL_ACCEPTED,51,6624 1520631080095367168,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-05-01 13:07:56,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x=input(\""\"");\nrate=(0.6-x/60)/x*12",WRONG_ANSWER,53,6904 1520631237364985856,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-05-01 13:08:33,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x=input(\""\"");\nrate=(0.6-x/60)/x*12;\nfprintf('rate = %f',rate);",WRONG_ANSWER,53,6980 1520632572470661120,721143a008a06a04cb8b006e534bfd2c5506db29aee3cf0b8819e6cb7cd4f2ae,2022-05-01 13:13:51,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,\nfprintf('rate = 0.074201');,PARTIAL_ACCEPTED,52,6736 1520652513181732864,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 14:33:06,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = int8(input(\""\""));\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end\n fprintf(\""Group %d : %d men, %d women, %d kids.\"",i,group(n).men,group(n).women,group(n).kids)",WRONG_ANSWER,37,6492 1520653045313089536,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 14:35:13,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = int8(input(\""\""));\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end\n fprintf(\""Group %d : %d men, %d women, %d kids.\"",n,group(n).men,group(n).women,group(n).kids)",WRONG_ANSWER,25,6908 1520653540324847616,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 14:37:11,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = int8(input(\""\""));\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end\n fprintf(\""Group %d : %d men, %d women, %d kids.\"",n,group(n).men,group(n).women,group(n).kids)",WRONG_ANSWER,27,7688 1520654066366066688,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 14:39:16,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"a = 0.051212;\nfprintf(\""rate = %f\\n\"",a)",PARTIAL_ACCEPTED,49,6648 1520654191582810112,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 14:39:46,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = int8(input(\""\""));\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n\n fprintf(\""Group%d :%d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end",COMPILE_ERROR,0,0 1520654365096968192,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 14:40:27,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = int8(input(\""\""));\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n\n fprintf(\""Group%d :%d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end",WRONG_ANSWER,26,6500 1520656692063289344,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 14:49:42,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = int8(input(\""\""));\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n\n fprintf(\""Group%d :%d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end",WRONG_ANSWER,28,6632 1520657061392715776,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 14:51:10,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number=30;\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n\n fprintf(\""Group%d :%d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end",WRONG_ANSWER,77,6764 1520657287864160256,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 14:52:04,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number=30;\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end",WRONG_ANSWER,79,6756 1520657842946740224,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 14:54:16,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number=30;\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n disp(\""There are %d possible groups.\\n\"",n)\n for i = 1:n\n disp(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end",WRONG_ANSWER,78,6496 1520660083028049920,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:03:10,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""……\"")",WRONG_ANSWER,26,6508 1520660140884275200,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:03:24,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprint(\""There are 9 possible groups.\""\\n)\nfprint(\""Group 1 : 1 men, 18 women, 11 kids.\""\\n)\nfprint(\""Group 2 : 2 men, 16 women, 12 kids.\""\\n)\nfprint(\""……\"")",WRONG_ANSWER,26,6756 1520660291447205888,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:04:00,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""……\"")",WRONG_ANSWER,25,6508 1520660344794562560,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:04:13,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprint(\""There are 3 possible groups.\""\\n)\nfprint(\""Group 1 : 1 men, 18 women, 11 kids.\""\\n)\nfprint(\""Group 2 : 2 men, 16 women, 12 kids.\""\\n)\nfprint(\""……\"")",WRONG_ANSWER,26,6496 1520661000204877824,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:06:49,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp(\""There are 3 possible groups.\""\\n)\ndisp(\""Group 1 : 1 men, 18 women, 11 kids.\""\\n)\ndisp(\""Group 2 : 2 men, 16 women, 12 kids.\""\\n)\ndisp(\""……\"")",WRONG_ANSWER,26,6496 1520661055108329472,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:07:02,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp(\""There are 3 possible groups.\"")\ndisp(\""Group 1 : 1 men, 18 women, 11 kids.\"")\ndisp(\""Group 2 : 2 men, 16 women, 12 kids.\"")\ndisp(\""……\"")",WRONG_ANSWER,25,6372 1520661138277187584,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:07:22,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"a = 0.051212;\nfprintf(\""rate = %f\\n\"",a)",PARTIAL_ACCEPTED,50,6744 1520661389197225984,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:08:22,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""……\"")",WRONG_ANSWER,25,6496 1520661420608368640,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:08:29,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\""\\nGroup 1 : 1 men, 18 women, 11 kids.\\nGroup 2 : 2 men, 16 women, 12 kids.\\n……)\n",WRONG_ANSWER,27,6512 1520661784019648512,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:09:56,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""……\"")",WRONG_ANSWER,25,6752 1520661786410385408,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:09:57,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""……\"")",WRONG_ANSWER,29,6876 1520663380820541440,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:16:17,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = 30;\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n)\n for i = 1:n-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end\n fprintf(\""Group %d : %d men, %d women, %d kids.\"",n,group(n).men,group(n).women,group(n).kids)",WRONG_ANSWER,76,6500 1520663593505308672,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:17:07,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp(\""There are 3 possible groups.\"")\ndisp(\""Group 1 : 1 men, 18 women, 11 kids.\"")\ndisp(\""Group 2 : 2 men, 16 women, 12 kids.\"")\ndisp(\""……\"")\nfprintf('%c',8)",WRONG_ANSWER,26,6508 1520663647993495552,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:17:20,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""……\"")",WRONG_ANSWER,29,6492 1520663695095533568,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:17:32,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp(\""There are 3 possible groups.\"")\ndisp(\""Group 1 : 1 men, 18 women, 11 kids.\"")\ndisp(\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""……\"")\n",WRONG_ANSWER,29,6496 1520664135841398784,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:19:17,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,N=300000;\nrate=1;\nsum=6000;\nfor a=2:60\n sum=sum*(1+rate/12)\nend\nd=sum/N;%通过更改rate的值使得最终结果的d趋于1可以大概确定rate。,WRONG_ANSWER,54,6624 1520664299419238400,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:19:56,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = 30;\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n-2)\n for i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids)\n end\n fprintf(\""Group %d : %d men, %d women, %d kids.\"",n-1,group(n-1).men,group(n-1).women,group(n-1).kids)",WRONG_ANSWER,78,6492 1520664817172516864,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:21:59,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = 30;\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n-2)\n for i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids)\n end\n fprintf(\""Group %d : %d men, %d women, %d kids.\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids)",ACCEPTED,78,6748 1520665061406851072,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:22:57,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"number = 30;\nna=1;\n for(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==number\n group(na).men=x;\n group(na).women=y;\n group(na).kids=z;\n na=na+1;\n end\n end\n end\n end\n n=na-1;\n fprintf(\""There are %d possible groups.\\n\"",n-2)\n for i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids)\n end\n fprintf(\""Group %d : %d men, %d women, %d kids.\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids)\n",ACCEPTED,77,6496 1520665280110428160,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:23:50,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,print(),WRONG_ANSWER,52,6500 1520667073485783040,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:30:57,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,3);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*k;\n if total==500\n counts=count+1;\n group(1:)=[counts,w,m,k];\n end\n end\nend\nfprintf('There are %d possible groups.',counts);\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i:));",WRONG_ANSWER,38,7016 1520667222186442752,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:31:33,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,3);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*k;\n if total==500\n counts=counts+1;\n group(1:)=[counts,w,m,k];\n end\n end\nend\nfprintf('There are %d possible groups.',counts);\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i:));",WRONG_ANSWER,27,6504 1520667407016833024,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:32:17,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,3);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(1:)=[counts,w,m,k];\n end\n end\nend\nfprintf('There are %d possible groups.',counts);\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i:));",WRONG_ANSWER,25,6756 1520667733199454208,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:33:34,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,3);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(1:)=[counts,w,m,k];\n end\n end\nend\nfprintf('There are %d possible groups.',counts);\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i:));",WRONG_ANSWER,25,6496 1520668080030650368,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:34:57,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,53,6508 1520669423252312064,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:40:17,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.051212\"")",PARTIAL_ACCEPTED,54,6760 1520669718497771520,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:41:28,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.051212\"")",PARTIAL_ACCEPTED,50,6756 1520670170018779136,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:43:15,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.051212\\n\"")",PARTIAL_ACCEPTED,49,6492 1520670303544459264,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:43:47,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"n=input(\""\"");\nfprintf(\""rate = 0.051212\\n\"")",PARTIAL_ACCEPTED,51,6504 1520670542489747456,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:44:44,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"n=input(\""\"");\nn=240;\nfprintf(\""rate = 0.051212\\n\"")",PARTIAL_ACCEPTED,54,6740 1520670561359921152,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:44:49,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"n=input(\""\"");\nn=240;\nfprintf(\""rate = 0.051212\\n\"")",PARTIAL_ACCEPTED,53,6792 1520671806418092032,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:49:46,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(1:)=[counts,w,m,k];\n end\n end\nend\nfprintf('There are %d possible groups.',counts);\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i:));",WRONG_ANSWER,27,6504 1520672001755222016,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:50:32,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(1,:)=[counts,w,m,k];\n end\n end\nend\nfprintf('There are %d possible groups.',counts);\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i:));",WRONG_ANSWER,31,6496 1520672130981740544,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:51:03,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(1,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts);\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i:));",WRONG_ANSWER,26,6512 1520672590136381440,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:52:52,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(1,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts)\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i,:))",WRONG_ANSWER,26,6748 1520672732973400064,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-05-01 15:53:26,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"possible=0;\nlist=[];\nman=0;\n\n\nwhile man*50 <= 500\n woman=0;\n while man*50+woman*30 <=500\n kid=(500-(man*50+woman*30))/10;\n if man+woman+kid == 30\n possible=possible+1;\n list(possible,1:3)=[man woman kid];\n end\n woman=woman+1;\n end\n man=man+1;\nend\n\nfprintf(\""There are %d possible groups.\\n\"",possible);\nfor i=1:possible\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,list(i,1:3));\nend",WRONG_ANSWER,27,6764 1520672755387777024,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:53:32,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nn = int8(input(\""\""));\nf = @(x)1800000*x*((1+x)^n)/((1+x)^n-1)-12000;\n[x,iter,X] = newton_secant(f,0,1,eps,10000);\nfprintf(\""rate = %f\\n\"",x)",TIME_LIMIT_EXCEEDED,8000,6752 1520672795330129920,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:53:41,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nfprintf(\""rate = 0.051212\\n\"")",PARTIAL_ACCEPTED,58,6748 1520672804087828480,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:53:43,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(counts,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts)\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i,:))",WRONG_ANSWER,28,6752 1520672952989810688,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:54:19,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.051212\\n\"")",MULTIPLE_ERROR,65,6496 1520672987802546176,f08c92f72cdf0a52349cae2ada33cfd8a2dce5dcbdcf4907b7486cf6b6f7c181,2022-05-01 15:54:27,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.051212\\n\"")",PARTIAL_ACCEPTED,52,6760 1520673279549943808,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-05-01 15:55:37,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"possible=0;\nlist=[];\nman=0;\n\n\nwhile man*50 <= 500\n woman=0;\n while man*50+woman*30 <=500\n kid=(500-(man*50+woman*30))/10;\n if man+woman+kid == 30\n possible=possible+1;\n list(possible,1:3)=[man woman kid];\n end\n woman=woman+1;\n end\n man=man+1;\nend\n\nfprintf(\""There are %d possible groups.\\n\"",possible);\nfor i=1:possible-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,list(i,1:3));\nend\n\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",possible,list(possible,1:3));",WRONG_ANSWER,29,6496 1520673306355728384,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:55:43,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(counts,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts)\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i,:))\nend",WRONG_ANSWER,27,6652 1520673376585154560,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:56:00,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(counts,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts)\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i,:))\nend",WRONG_ANSWER,31,6740 1520673398471036928,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-05-01 15:56:05,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"possible=0;\nlist=[];\nman=0;\n\n\nwhile man*50 <= 500\n woman=0;\n while man*50+woman*30 <=500\n kid=(500-(man*50+woman*30))/10;\n if man+woman+kid == 30\n possible=possible+1;\n list(possible,1:3)=[man woman kid];\n end\n woman=woman+1;\n end\n man=man+1;\nend\n\nfprintf(\""There are %d possible groups.\\n\"",possible);\nfor i=1:possible-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,list(i,1:3));\nend\n\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",possible,list(possible,1:3));",WRONG_ANSWER,27,6500 1520673451772260352,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:56:18,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [x,iter,X]=newton_secant(fun,0.007,0.006)\n x=x*12;\nfprintf(\""rate = x\\n\"")",WRONG_ANSWER,52,6748 1520673485939052544,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:56:26,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [x,iter,X]=newton_secant(fun,0.007,0.006)\n x=x*12;\nfprintf(\""rate = x\\n\"")",WRONG_ANSWER,54,6760 1520673757138550784,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:57:31,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(counts,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts)\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i,:))\nend",WRONG_ANSWER,28,6748 1520673792593018880,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:57:39,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [x,iter,X]=newton_secant(fun,0.007,0.006)\n x=x*12;\nfprintf(\""rate = %d\\n\"",x)",WRONG_ANSWER,55,6632 1520673815720394752,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:57:45,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(counts,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts)\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i,:))\nend",WRONG_ANSWER,29,6760 1520673946419101696,e8ad8e50794381316644ddeeb7fcbeeb5a73a5863d3ab1c64ebe504299684ada,2022-05-01 15:58:16,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"counts=0;\ngroup=zeros(17,4);\nfor m=0:16\n for w=0:25\n total=30*m+20*w+10*(30-m-w);\n if total==500\n counts=counts+1;\n group(counts,:)=[counts,w,m,30-m-w];\n end\n end\nend\nfprintf('There are %d possible groups.',counts)\nfor i=1:counts\n fpritf('Group %d : %d men, %d women, %d kids.',group(i,:));\nend",WRONG_ANSWER,30,6512 1520674288678514688,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:59:37,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [rate]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [rate]=newton_secant(fun,0.007,0.006)\n%fprintf(\""rate = %d\\n\"",x)",PARTIAL_ACCEPTED,54,6756 1520674379988512768,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 15:59:59,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [rate]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [rate]=newton_secant(fun,0.007,0.006)\n%fprintf(\""rate = %d\\n\"",x)",PARTIAL_ACCEPTED,52,7820 1520674492320354304,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-05-01 16:00:26,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"possible=0;\nlist=[];\nman=0;\n\n\nwhile man*50 <= 500\n woman=0;\n while man*50+woman*30 <=500\n kid=(500-(man*50+woman*30))/10;\n if man+woman+kid == 30\n possible=possible+1;\n list(possible,1:3)=[man woman kid];\n end\n woman=woman+1;\n end\n man=man+1;\nend\n\nfprintf(\""There are 3 possible groups.\\nGroup 1 : 1 men, 18 women, 11 kids.\\nGroup 2 : 2 men, 16 women, 12 kids.\\n……\"");",WRONG_ANSWER,27,6748 1520674510607515648,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 16:00:30,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [rate]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [rate]=newton_secant(fun,0.007,0.006)\n%fprintf(\""rate = %d\\n\"",x)",PARTIAL_ACCEPTED,52,6616 1520674603662344192,0188afdbbd218bc39f21861ed4054416f889132550351d80a492c88e8842a2dd,2022-05-01 16:00:52,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"possible=0;\nlist=[];\nman=0;\n\n\nwhile man*50 <= 500\n woman=0;\n while man*50+woman*30 <=500\n kid=(500-(man*50+woman*30))/10;\n if man+woman+kid == 30\n possible=possible+1;\n list(possible,1:3)=[man woman kid];\n end\n woman=woman+1;\n end\n man=man+1;\nend\n\nfprintf(\""There are %d possible groups.\\n\"",possible);\nfor i=1:possible-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,list(i,1:3));\nend\n\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",possible,list(possible,1:3));\n",WRONG_ANSWER,27,6496 1520674676857143296,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 16:01:10,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [rate]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [rate]=newton_secant(fun,0.007,0.006)\n%fprintf(\""rate = %d\\n\"",x)",PARTIAL_ACCEPTED,53,6636 1520674787301556224,1b0d47de16cd244d4f51358cc5da3f36eff1c40ed844877d5b32488469b14442,2022-05-01 16:01:36,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [rate]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nrate=x2*12;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n [rate]=newton_secant(fun,0.007,0.006)\n",PARTIAL_ACCEPTED,51,6968 1520675893717012480,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-05-01 16:06:00,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter) \n% 牛顿下山+割线法求解非线性方程的根 \n% 输入参数： \n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点 \n% ---eps：精度要求，默认值为1e-6 \n% ---maxiter：最大迭代次数，默认值为1e4 \n% 输出参数： \n% ---x：非线性方程的近似根 \n% ---iter：迭代次数 \n% ---X：每一步迭代的结果 \nif nargin<3,error('输入参数至少需要3个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end \nif nargin<5|isempty(maxiter),maxiter=1e4;end \nf0 = feval(fun,x0); % 计算x0处的函数值 \nf1 = feval(fun,x1); % 计算x1处的函数值 \nk=0;err=1;%k统计迭代次数，err表示迭代精度 \nwhile abs(err)>eps \nlambda=1;%下山因子 \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); \nf2 = feval(fun,x2); \nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导 \nf2=feval(fun,x2); \nend \nx0=x1;x1=x2; \nf0=f1;f1=f2; \nerr=x1-x0;%更新迭代精度 \nk=k+1; \nX(k)=x2; \nend \n \nif k>=maxiter \nerror('迭代次数超限，迭代失败！') \nend \nx=x2;iter=k;X=X'; \nend ",COMPILE_ERROR,0,0 1520675973765300224,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-05-01 16:06:19,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter) \n% 牛顿下山+割线法求解非线性方程的根 \n% 输入参数： \n% ---fun：迭代函数 \n% ---x0,x1：初始迭代点 \n% ---eps：精度要求，默认值为1e-6 \n% ---maxiter：最大迭代次数，默认值为1e4 \n% 输出参数： \n% ---x：非线性方程的近似根 \n% ---iter：迭代次数 \n% ---X：每一步迭代的结果 \nif nargin<3,error('输入参数至少需要3个！'),end \nif nargin<4|isempty(eps),eps=1e-6;end \nif nargin<5|isempty(maxiter),maxiter=1e4;end \nf0 = feval(fun,x0); % 计算x0处的函数值 \nf1 = feval(fun,x1); % 计算x1处的函数值 \nk=0;err=1;%k统计迭代次数，err表示迭代精度 \nwhile abs(err)>eps \nlambda=1;%下山因子 \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); \nf2 = feval(fun,x2); \nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda \nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导 \nf2=feval(fun,x2); \nend \nx0=x1;x1=x2; \nf0=f1;f1=f2; \nerr=x1-x0;%更新迭代精度 \nk=k+1; \nX(k)=x2; \nend \n \nif k>=maxiter \nerror('迭代次数超限，迭代失败！') \nend \nx=x2;iter=k;X=X'; \nend ",WRONG_ANSWER,53,6628 1520678076306984960,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-05-01 16:14:40,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"n=input(\""\"")\nfun=@(x)180*(x*(1+x)^n)/((1+x)^n-1)-1.2;\nx0=0.007;\n\nfunction [x,iter,X]=newton(fun,x0,eps,maxiter)\n% Newton法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<2\n error('输入参数至少需要2个！')\nend\nif nargin<3|isempty(eps)\n eps=1e-6;\nend\nif nargin<4|isempty(maxiter)\n maxiter=1e4;\nend\n\nk=0;err=1;\n\nwhile abs(err)>eps\n k=k+1;\n [fx0,dfx0] = feval(fun,x0);\n \n if dfx0==0\n error('f(x)在x0处的导数为0，停止计算')\n end\n x1=x0-fx0/dfx0;\n err=x1-x0;\n x0=x1;\n X(k)=x1;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x1;iter=k;X=X';\n",WRONG_ANSWER,54,9612 1520681806217641984,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-05-01 16:29:30,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include \n#include \nint main()\n{int a,b,c;\na=0;b=0;c=0;\nfor (a=0;a<30;a++)\n{for(b=0;b<30;b++)\n{c=30-a-b;\nif (c+2*b+3*a==50)\n{printf(\""%d\\n\"",a);\nprintf(\""%d\\n\"",b);\nprintf(\""%d\\n\"",c);\nprintf(\""\\n\"");\n}}}\n\nsystem(\""pause\"");\n return 0;\n}",WRONG_ANSWER,3,576 1520682053681582080,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-05-01 16:30:29,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\n……",COMPILE_ERROR,0,0 1520683076143841280,c8c180a7918e114276ba3410728384830c2f3fb522e188703288db35e86867d1,2022-05-01 16:34:32,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nint main(){\ncout<<\""There are 3 possible groups.\""<\nusing namespace std;\nint main(){\n int a,b,c;\n int n=0;\n int nr[100],vr[100],er[100];\n for(a=1;a<30;a++){\n for(b=1;b<30-a;b++){\n for(c=1;c<30-a-b;c++){\n if((a*3+b*2+c)==50&&(a+b+c==30){\n nr[n]=a;vr[n]=b;er[n]=c;n++;\n }\n }\n }\n }\n cout<<\""There are \""<\nusing namespace std;\nint main(){\n int a,b,c;\n int n=0;\n int nr[100],vr[100],er[100];\n for(a=1;a<30;a++){\n for(b=1;b<30-a;b++){\n for(c=1;c<30-a-b;c++){\n if((a*3+b*2+c)==50&&(a+b+c==30){\n nr[n]=a;vr[n]=b;er[n]=c;n++;\n }\n }\n }\n }\n cout<<\""There are \""<\nusing namespace std;\nint main(){\n int a,b,c;\n int n=0;\n int nr[100],vr[100],er[100];\n for(a=1;a<30;a++){\n for(b=1;b<30-a;b++){\n for(c=1;c<30-a-b;c++){\n if((a*3+b*2+c)==50&&(a+b+c==30)){\n nr[n]=a;vr[n]=b;er[n]=c;n++;\n }\n }\n }\n }\n cout<<\""There are \""<n\n result=X(i);\n return;\n end\n i=i+1;\nend,WRONG_ANSWER,52,6652 1520702843999272960,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:53:05,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '输入n的值 ';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\n\nx=0.1;\nn=100;\n\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-6 \n result=X(i);x=12*result;fprintf('rate = %f',x)\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend",WRONG_ANSWER,52,6752 1520702963385925632,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:53:34,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '输入n的值 ';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\n\nx=0.1;\nn=100;\n\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-7 \n result=X(i);x=12*result;fprintf('rate = %f',x)\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend",WRONG_ANSWER,53,6976 1520702985867407360,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:53:39,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '输入n的值 ';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\n\nx=0.1;\nn=100;\n\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-7 \n result=X(i);x=12*result;fprintf('rate = %f',x)\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend",WRONG_ANSWER,51,6760 1520703075122200576,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:54:01,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '输入n的值 ';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\n\nx=0.1;\nn=100;\n\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-7 \n result=X(i);x=12*result;fprintf('rate = %f',x)\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend",WRONG_ANSWER,57,6752 1520703385152552960,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:55:14,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\n\nx=0.1;\nn=100;\n\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-7 \n result=X(i);x=12*result;fprintf('rate = %f',x)\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend",WRONG_ANSWER,52,6760 1520703536055226368,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:55:50,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nn=input('') ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\n\nx=0.1;\nn=100;\n\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-7 \n result=X(i);x=12*result;fprintf('rate = %f',x)\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend",WRONG_ANSWER,53,6748 1520703839366328320,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:57:03,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '输入n的值 ';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 %牛顿法流程\n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,51,6500 1520703905644720128,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:57:19,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,49,6748 1520703952348295168,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 17:57:30,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,52,6640 1520705969665900544,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:05:31,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"n=240;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,53,6500 1520706112758788096,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:06:05,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '';\nn=240;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,52,6508 1520707861452193792,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:13:02,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"% prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,51,6876 1520707921485279232,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:13:16,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"% prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,50,6744 1520708139677155328,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:14:08,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf('rate = %f',0.051212)",MULTIPLE_ERROR,51,6508 1520708174770896896,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:14:16,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf('rate = %f',0.051212)",PARTIAL_ACCEPTED,53,6524 1520708214922973184,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:14:26,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"% prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,51,6656 1520708304978870272,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:14:47,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"% prompt = '';\ninput(n) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,57,6752 1520708416056623104,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:15:14,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"% prompt = '';\nn=input(prompt) \nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,51,6752 1520708445597118464,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:15:21,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"% prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,52,6504 1520708485875023872,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:15:31,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,52,6496 1520708550425346048,ff01b0976d27b6a00a5ce38bb893e010c8e7febc914fff424c3ca408a745cb90,2022-05-01 18:15:46,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"prompt = '';\nn=input(prompt) ;\nsyms x\nh=(x+1)^(n+1)-((1+1.2/180)*(x+1)^n)+1.2/180;\nf=matlabFunction(h);\nf1=matlabFunction(diff(h));\nX(1)=0.1;\ni=2;\nr=1;\nresult=0;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-8 \n result=X(i);\n break;\n end\n if abs(f(X(i)))100\n result=X(i);\n break;\n end\n i=i+1;\nend\nx0=12*result;\nfprintf('rate = %f',x0)",WRONG_ANSWER,65,6752 1520720670873387008,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-05-01 19:03:56,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"i=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30a+20b+10c)==500)\n i=i+1;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',i)\n i=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30a+20b+10c)==500)\n i=i+1;\n fprintf('Group%d :%d men, %d women, %d kids.\\n',i,a,b,c)\n end\n end\n end",WRONG_ANSWER,26,6516 1520722418379833344,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-05-01 19:10:52,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"k=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30a+20b+10c)==500)\n k=k+1;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',k)\n i=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30a+20b+10c)==500)\n i=i+1;\n fprintf('Group%d :%d men, %d women, %d kids.\\n',i,a,b,c)\n end\n end\n end",WRONG_ANSWER,27,7588 1520722656486260736,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-05-01 19:11:49,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"k=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30*a+20*b+10*c)==500)\n k=k+1;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',k)\n i=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30*a+20*b+10*c)==500)\n i=i+1;\n fprintf('Group%d :%d men, %d women, %d kids.\\n',i,a,b,c)\n end\n end\n end",PRESENTATION_ERROR,32,6492 1520723463185141760,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-05-01 19:15:01,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"k=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30*a+20*b+10*c)==500)\n k=k+1;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',k)\n i=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30*a+20*b+10*c)==500)\n i=i+1;\n fprintf('Group %d :%d men, %d women, %d kids.\\n',i,a,b,c)\n end\n end\n end",PRESENTATION_ERROR,36,9452 1520723632165261312,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-05-01 19:15:42,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"k=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30*a+20*b+10*c)==500)\n k=k+1;\n end\n end\nend\n fprintf('There are %d possible groups.\\n',k)\n i=0;\nfor a=1:30\n for b=1:30\n c=30-a-b;\n if((30*a+20*b+10*c)==500)\n i=i+1;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,a,b,c)\n end\n end\n end",ACCEPTED,32,6752 1520735572119818240,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 20:03:08,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.0007;\nx1=0.0006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %.6f\\n',rate)\n",PARTIAL_ACCEPTED,53,6752 1520736210824232960,ab6bc0f43859caf6db115bf758964fcbf7edcad101ea75c67a688274b0a78e46,2022-05-01 20:05:41,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"prompt = '';\nn=input(prompt);\nsyms x\nh=(x+1)^61-((1+0.6/n)*(x+1)^60)+0.6/n;\nf=inline(h);\nf1=inline(diff(h))\nX(1)=0.1;\ni=2;\nr=1;\ny=1;\nwhile y<100\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-7 \n s=X(i);\n break;\n end\n if abs(f(X(i)))0&&z>0)\nif(3*x+2*y+z==50)\ni = i+1;\n%list(i,1) = x;\n%list(i,2) = y;\n%list(i,3) = z;\nGroup(i).men = x;\nGroup(i).women = y;\nGroup(i).kids = z;\n%fprintf('Group%d:%d men,%d women,%d kids.\\n',i,x,y,z);\nend\nend\nend\nfprintf(\""There are %d possible groups.\\n\"",i);\nfor n = 1:i\nfprintf('Group %d : %d men, %d women, %d kids.\\n',n,Group(n).men,Group(n).women,Group(n).kids);\n%fprintf('Group%d:%d men,%d women,%d kids.\\n',n,list(n,1),list(n,2),list(n,3));\nend\n",ACCEPTED,54,6492 1520738362686738432,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 20:14:14,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %.6f\\n',rate)\n",PARTIAL_ACCEPTED,54,6760 1520738733685522432,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 20:15:42,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,52,6616 1520741087008817152,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:25:03,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.0007;\nx1=0.0006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %.6f\\n',rate)\n",WRONG_ANSWER,53,6760 1520741910120022016,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:28:20,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N = input(''); \nx = 1;\ny = 0;\nz = 0;\ni=0;\n%list = [];\nfor x = 1:16\ny=50-N-2*x;\nz=N-x-y;\nif(y>0&&z>0)\nif(3*x+2*y+z==50)\ni = i+1;\n%list(i,1) = x;\n%list(i,2) = y;\n%list(i,3) = z;\nGroup(i).men = x;\nGroup(i).women = y;\nGroup(i).kids = z;\n%fprintf('Group%d:%d men,%d women,%d kids.\\n',i,x,y,z);\nend\nend\nend\nfprintf(\""There are %d possible groups.\\n\"",i);\nfor n = 1:i\nfprintf('Group %d : %d men, %d women, %d kids.\\n',n,Group(n).men,Group(n).women,Group(n).kids);\n%fprintf('Group%d:%d men,%d women,%d kids.\\n',n,list(n,1),list(n,2),list(n,3));\nend",ACCEPTED,54,6760 1520743518149050368,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:34:43,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",WRONG_ANSWER,54,6616 1520745639326035968,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 20:43:09,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=0.000000001;\nmaxiter=100000000;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,53,6636 1520745921246171136,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 20:44:16,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=0.000000001;\nmaxiter=100000000000;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,55,6756 1520747019633733632,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:48:38,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nif(N==240)\n rate=0.051212;\n fprintf('rate = %f\\n',rate);\nelse\n fprintf('rate = %f\\n',rate);\nend\n\n\n",PARTIAL_ACCEPTED,54,6752 1520747457569406976,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:50:22,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)",WRONG_ANSWER,54,7136 1520748026979725312,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:52:38,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)",WRONG_ANSWER,62,6748 1520748921368907776,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:56:11,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = x;\nfprintf('rate = %f\\n',rate)",WRONG_ANSWER,53,6872 1520749394738053120,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 20:58:04,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)",PARTIAL_ACCEPTED,52,6760 1520751217565806592,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 21:05:19,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)",PRESENTATION_ERROR,53,8440 1520751442057543680,4559d69268c7c2bb7e1b2aa77156c570c0ca19852a2147dc92fc0801edda5612,2022-05-01 21:06:12,Octave,20.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = input('');\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2;\nx0=0.007;\nx1=0.006;\neps=1e-6;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)",ACCEPTED,52,6500 1520753281209511936,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:13:31,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nif N >36\n N = 36\nend\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.0006;\nx1=0.0007;\neps=0.000000001;\nmaxiter=100000000000;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,56,6764 1520754601714823168,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:18:45,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nif N >36\n N = 36\nend\nfun=@(x)N*10000*x*((1+x)^60)/((1+x)^60 - 1)-6000;\nx0=0.0006;\nx1=0.0007;\neps=0.00001;\nmaxiter=100000;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,52,6660 1520755016254668800,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:20:24,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*10000*x*((1+x)^60)/((1+x)^60 - 1)-6000;\nx0=0.0006;\nx1=0.0007;\neps=0.00001;\nmaxiter=100000;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,53,6752 1520755070268903424,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:20:37,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*10000*x*((1+x)^60)/((1+x)^60 - 1)-6000;\nx0=0.0006;\nx1=0.0007;\neps=0.0000000001;\nmaxiter=10000000000;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,57,6632 1520755165651570688,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:21:00,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input('');\nfun=@(x)N*10000*x*((1+x)^60)/((1+x)^60 - 1)-6000;\nx0=0.00006;\nx1=0.00007;\neps=0.0000000001;\nmaxiter=10000000000;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)\n",PARTIAL_ACCEPTED,53,6508 1520759062378090496,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:36:29,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x0=0.00006;\nx1=0.00007;\nN = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n eps=1e-6;\n maxiter=1e4;\nf0 = fun(x0); % 计算x0处的函数值\nf1 = fun(x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = fun(x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)",PARTIAL_ACCEPTED,53,6880 1520759233241448448,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:37:10,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x0=0.00006;\nx1=0.00007;\nN = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n eps=1e-9;\n maxiter=1e9;\nf0 = fun(x0); % 计算x0处的函数值\nf1 = fun(x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = fun(x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = 12*x;\nfprintf('rate = %f\\n',rate)",PARTIAL_ACCEPTED,54,6492 1520760538949255168,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:42:21,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x0=0.00006;\nx1=0.00007;\nN = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n eps=1e-9;\n maxiter=1e9;\nf0 = fun(x0); % 计算x0处的函数值\nf1 = fun(x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = fun(x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = abs(12*x);\nfprintf('rate = %f\\n',rate)",PARTIAL_ACCEPTED,52,6560 1520763092256993280,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:52:30,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x0=0.000000001;\nx1=1;\nN = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n eps=1e-9;\n maxiter=1e9;\nf0 = fun(x0); % 计算x0处的函数值\nf1 = fun(x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = fun(x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = abs(12*x);\nfprintf('rate = %f\\n',rate)",PARTIAL_ACCEPTED,54,6512 1520763404954931200,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:53:44,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x0=0.000000001;\nx1=1;\nN = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n eps=1e-9;\n maxiter=1e9;\nf0 = fun(x0); % 计算x0处的函数值\nf1 = fun(x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = fun(x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = abs(12*x);\nfprintf('rate = %f\\n',rate)",PARTIAL_ACCEPTED,55,6772 1520763445677424640,70cb2904497d75f3c6a38e52f45a5640c9b73410eef521b70730a45bf9a4a815,2022-05-01 21:53:54,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x0=0.00000000000001;\nx1=1;\nN = input('');\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\n eps=1e-9;\n maxiter=1e9;\nf0 = fun(x0); % 计算x0处的函数值\nf1 = fun(x1); % 计算x1处的函数值\nk=0;\nwhile abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = fun(x1); % 计算x1处的函数值\n X(k)=x2;\nend\nif k==maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate = abs(12*x);\nfprintf('rate = %f\\n',rate)",PARTIAL_ACCEPTED,54,6760 1520770729379926016,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-05-01 22:22:51,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\nk=1;\nfor kid=1:N\n for man=1:N-kid\n for woman=1:N-kid-man\n if kid+man+woman==N && 10*kid+30*man+20*woman==500 && man~=0 && woman~=0 && kid~=0\n Group(k).man=man;\n Group(k).women=woman;\n Group(k).kid=kid;\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k-1);\nfor m=1:k-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kid);\nend\nm=k-1;\nfprintf('Group %d : %d men, %d women, %d kids.',m,Group(m).man,Group(m).women,Group(m).kid);",ACCEPTED,68,8312 1520780286063837184,30db19218031fe2ca8b402dcfa98fefe734ada0d357fcdb469e51948dae4e317,2022-05-01 23:00:49,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfprintf('rate = %d',0.074201);",PARTIAL_ACCEPTED,66,6908 1520956095235919872,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-05-02 10:39:25,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 9 possible groups.\\n\"");\nfor i = 1:9\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,i,2*(10-i),10+i);\nend",ACCEPTED,27,6492 1520959875398545408,b03cf9c85aaa901f3b2bf8f0e32b3e4ad52a9f5faa3fb00d1d1d010fe6da2972,2022-05-02 10:54:27,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"fprintf(\""rate = 0.074201\\n\"");",PARTIAL_ACCEPTED,50,6744 1520970087975141376,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-05-02 11:35:01,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nn=1;\nfor i=0:N\n for j=0:1:N\n for k=0:1:N\n if 30*i+20*j+10*k==500\n Group.men=i;\n Group.women=j;\n Group.kids=k;\n n=n+1;\n else\n continue;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",n)\n\n\n ",WRONG_ANSWER,124,6752 1520971928746110976,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-05-02 11:42:20,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nn=1;\nfor i=1:N\n for j=1:N\n for k=1:N\n if i+j+k==N\n if 30*i+20*j+10*k==500\n Group(n).men=i;\n Group(n).women=j;\n Group(n).kids=k;\n n=n+1;\n end\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",n-1)\n\n\n ",PARTIAL_ACCEPTED,113,6868 1520975595050143744,64aae1e89a0818e0808931ec1627b9b03a40b99db9dd83502c62b34d48ef36fa,2022-05-02 11:56:54,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nn=1;\nfor i=1:N\n for j=1:N\n for k=1:N\n if i+j+k==N\n if 30*i+20*j+10*k==500\n Group(n).men=i;\n Group(n).women=j;\n Group(n).kids=k;\n n=n+1;\n end\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",n-1)\nfor i=1:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids)\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",n-1,Group(n-1).men,Group(n-1).women,Group(n-1).kids)\n",ACCEPTED,116,6628 1521003241544908800,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 13:46:46,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006)",WRONG_ANSWER,52,7724 1521004039993593856,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-05-02 13:49:56,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nc=1;\nfor i=1:N\n for j=1:N-i\n for k=1:N-i-j\n if (30*i+20*j+10*k==500)&&(i+j+k==N)\n Group(c).men=i;\n Group(c).women=j;\n Group(c).kids=k;\n c=c+1;\n end\n end\n end\nend\ndisp(['There are ',num2str(c-1),' posssible groups.'])\nfor i=1:c-1\n disp(['Group ',num2str(i),' : ',num2str(Group(i).men),' men, ',num2str(Group(i).women),' women, ',num2str(Group(i).kids),' kids.'])\nend",WRONG_ANSWER,62,6504 1521004860273627136,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 13:53:12,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nq=12*x;\nfprintf(\""rate = \"")\nfprintf(\""%d\"",q);",WRONG_ANSWER,52,7012 1521005809612406784,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 13:56:58,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nq=12*x;\nfprintf(\""rate = \"")\nfprintf(\"" 0.051212\"")\n",PARTIAL_ACCEPTED,53,6620 1521007280470933504,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-05-02 14:02:49,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nc=1;\nfor i=1:N\n for j=1:N-i\n for k=1:N-i-j\n if (30*i+20*j+10*k==500)&&(i+j+k==N)\n Group(c).men=i;\n Group(c).women=j;\n Group(c).kids=k;\n c=c+1;\n end\n end\n end\nend\nprintf('There are %d possible groups.\\n',c-1)\nfor i=1:c-1\n printf('Group %d : %d men, %d women, %d kids.',i,Group(i).men,Group(i).women,Group(i).kids)\n if(i~=c-1)\n printf('\\n')\n end\nend",ACCEPTED,64,6496 1521009431783976960,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 14:11:22,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nq=12*x;\nfprintf(\""rate = \"")\nfprintf(\"" 0.051212\"");\n",PARTIAL_ACCEPTED,53,6768 1521012950066835456,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-05-02 14:25:21,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"[r, n] = NonLinearEquations_NewtonDown([0 0 0], 1e-6)\nx = x0- myfun(x0)/dmyfun(x0);\nn = 1;\ntol = 1;\nwhile tol > err\n x0 = x;\n tol = 1;\n w=1;\n F1 = norm(myfun(x0));\n while tol >= 0\n x = x0 - w*myfun(x0)/dmyfun(x0);\n tol = norm(myfun(x)) - F1;\n w = w/2;\n end\n tol = norm(x - x0);\n n = n + 1;\n if(n > 1000)\n return;\n end\nend\n\nfunction f = myfun(x)\nx1 = x(1);\nx2 = x(2);\nx3 = x(3);\nf(1) = 3*x1 - cos(x2*x3) -1/2;\nf(2) = x1^2 - 81*(x2 + 0.1) + sin(x3) + 1.06;\nf(3) = exp(-x1*x2) + 20*x3 + 1/3*(10*pi - 3);\n\nfunction df =dmyfun(x)\nx1 = x(1);\nx2 = x(2);\nx3 = x(3);\ndf=[3, x3*sin(x2*x3), x2*sin(x2*x3); 2*x1, -81, cos(x3); -x2*exp(-x1*x2), -x1*exp(-x1*x2), 20];",WRONG_ANSWER,52,6496 1521013343836475392,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-05-02 14:26:54,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"c=input('');\nb=0.074201;\nprintf('rate=%d',b)",MULTIPLE_ERROR,51,6508 1521013379072835584,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-05-02 14:27:03,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"c=input('');\nb=0.074201;\nprintf('rate = %d',b)",MULTIPLE_ERROR,59,6748 1521013468054982656,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-05-02 14:27:24,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"c=input('');\nb=0.074201;\nprintf('rate = %d',b)",PARTIAL_ACCEPTED,53,6780 1521013853750603776,851d8b9401458af9f43bfbfe59678944f4419b2199f7a73e8a55f9cb21a014db,2022-05-02 14:28:56,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"c=input('');\nb=0.074201;\nprintf('rate = %d',b)",PARTIAL_ACCEPTED,54,6508 1521016670510952448,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 14:40:08,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408," for i=1:16\n for j=0:24\n for z=0:46\n if(30*i+20*j+15z==500&&i+j+z==30)\n fprintf(\""%d %d %d\\n\"",i,j,z)\n end\n end \n end\n end\n\n\n",WRONG_ANSWER,26,6620 1521017546797527040,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 14:43:36,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""......\"")\n\n\n\n",WRONG_ANSWER,25,6744 1521017806357835776,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 14:44:38,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""Group 3 : 3 men, 15 women, 12 kids.\"")\n\n\n\n",WRONG_ANSWER,26,6756 1521017863228395520,2a01da48d3ec34cd78d0470a4b0604371434ff724558040031c41e56df701f85,2022-05-02 14:44:52,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""Group 3 : 4 men, 12 women, 14 kids.\"")\n\n\n\n",WRONG_ANSWER,28,6500 1521018017759150080,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-05-02 14:45:29,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,X=input('');\nfprintf('rate = 0.051212\\n');,PARTIAL_ACCEPTED,53,7092 1521020038285406208,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-05-02 14:53:30,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""There are 4 possible groups.\nGroup 1 : 11 men, 8 women, 1 kids.\nGroup 2 : 12 men, 6 women, 2 kids.\nGroup 3 : 13 men, 4 women, 3 kids.\nGroup 4 : 14 men, 2 women, 4 kids.\"")",COMPILE_ERROR,0,0 1521022650640535552,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-05-02 15:03:53,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"disp(\""There are 4 possible groups.\"")\ndisp(\""Group 1 : 11 men, 8 women, 1 kids.\"")\ndisp(\""Group 2 : 12 men, 6 women, 2 kids.\"")\ndisp(\""Group 3 : 13 men, 4 women, 3 kids.\"")\ndisp(\""Group 4 : 14 men, 2 women, 4 kids.\"")",WRONG_ANSWER,52,6760 1521024181376958464,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-05-02 15:09:58,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"count=0;\nfor i=0:15\n for j=0:25\n if((30-i-j)>=0 && 30*i+20*j+(30-i-j)*10==500)\n count++;\n Group(count).men=i;\n Group(count).wemen=j;\n Group(count).kids=(30-i-j);\n \n end\n end\nend\nfprintf('There are %d possible groups.',count);\nfor i=1:count\n fprintf('\\nGroup %d : %d men, %d women, %d kids.',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",WRONG_ANSWER,31,6640 1521024537817300992,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-05-02 15:11:23,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"count=0;\nfor i=0:15\n for j=0:25\n if((30-i-j)>=0 && 30*i+20*j+(30-i-j)*10==500)\n count++;\n Group(count).men=i;\n Group(count).wemen=j;\n Group(count).kids=(30-i-j);\n \n end\n end\nend\n%fprintf('There are %d possible groups.',count);\n%for i=1:count\n% fprintf('\\nGroup %d : %d men, %d women, %d kids.',i,Group(i).men,Group(i).wemen,Group(i).kids);\n%end\nfprintf('There are 3 possible groups.\\nGroup 1 : 1 men, 18 women, 11 kids.\\nGroup 2 : 2 men, 16 women, 12 kids.\\n……');",WRONG_ANSWER,28,6508 1521024840721547264,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-05-02 15:12:35,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"count=0;\nfor i=1:15\n for j=1:25\n if((30-i-j)>0 && 30*i+20*j+(30-i-j)*10==500)\n count++;\n Group(count).men=i;\n Group(count).wemen=j;\n Group(count).kids=(30-i-j);\n \n end\n end\nend\nfprintf('There are %d possible groups.',count);\nfor i=1:count\n fprintf('\\nGroup %d : %d men, %d women, %d kids.',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend\n",ACCEPTED,33,6492 1521028599396728832,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-05-02 15:27:32,C,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main()\n{\nprintf(\""There are 9 possible groups.\\n\"");\nprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"");\nprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"");\nprintf(\""Group 3 : 3 men, 14 women, 13 kids.\\n\"");\nprintf(\""Group 4 : 4 men, 12 women, 14 kids.\\n\"");\nprintf(\""Group 5 : 5 men, 10 women, 15 kids.\\n\"");\nprintf(\""Group 6 : 6 men, 8 women, 16 kids.\\n\"");\nprintf(\""Group 7 : 7 men, 6 women, 17 kids.\\n\"");\nprintf(\""Group 8 : 8 men, 4 women, 18 kids.\\n\"");\nprintf(\""Group 9 : 9 men, 2 women, 19 kids.\\n\"");\n}\n",ACCEPTED,3,192 1521029268262387712,c261098dd0c1da17e74b512cf859119b4ed07287916fdcc17811eb8443b323a1,2022-05-02 15:30:11,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"x=input(\""\"");\nfprintf('rate = 0.051212');",PARTIAL_ACCEPTED,54,7328 1521029843041419264,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-05-02 15:32:28,C,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nint main()\n{\n int x;\n scanf(\""%d\"",&x);\n if(x==30)\n {\n printf(\""rate = 0.074201\\n\"");\n }\n}",PARTIAL_ACCEPTED,7,192 1521032574745477120,8f6e2687ec9faea0e073b60ab6e6d388add66d57a3190943323ad090e49e1529,2022-05-02 15:43:19,C,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nint main()\n{\n int x;\n scanf(\""%d\"",&x);\n if(x==30)\n {\n printf(\""rate = 0.074201\\n\"");\n }\n}",PARTIAL_ACCEPTED,6,344 1521033407902023680,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 15:46:38,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,53,6784 1521034406263828480,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 15:50:36,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"x = input (\""\"");\n n =0;\n for i =1:x\n for j =1:x\n for k =1:x\n if i + j + k == x &&30* i +20* j +10* k ==500\n n = n +1;\n Group ( n )= struct ('men', i ,'women', j ,'kids', k );\n end \n end \n end \n end \n if n >0\n fprintf (\""There are %d possible groups.\\n\"", n );\n for i =1:n\n fprintf (\""Group %d :% d men,% d women,% d kids.\\n\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end \n end\n ",PARTIAL_ACCEPTED,119,6508 1521034588443410432,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 15:51:19,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ncount=0;\nresult=zeros(3,1);\nfor m=1:N\n for w=1:N-m\n k=N-m-w;\n if(k~=0)\n fee=30*m+20*w+10*k;\n if(fee==500)\n count=count+1;\n result(:,count)=[m,w,k];\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",count)\nfor i=1:count\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", ...\n i,result(1,i),result(2,i),result(3,i));\nend",ACCEPTED,30,6492 1521034749995417600,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 15:51:58,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"x = input (\""\"");\n n =0;\n for i =1:x\n for j =1:x\n for k =1:x\n if i + j + k == x &&30* i +20* j +10* k ==500\n n = n +1;\n Group ( n )= struct ('men', i ,'women', j ,'kids', k );\n end \n end \n end \n end \n if n >0\n fprintf (\""There are %d possible groups.\\n\"", n );\n for i =1:n-1\n fprintf (\""Group %d :% d men,% d women,% d kids.\\n\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end \n i++;\n fprintf (\""Group %d :% d men,% d women,% d kids.\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end\n ",PARTIAL_ACCEPTED,120,6756 1521034760380526592,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-05-02 15:52:00,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"# include\nusing namespace std;\nint main()\n{\n\tint n, a = 0, b = 0, c = 0, flag = 1;\n\tcin >> n;\n\tcout << \""There are 4 possible groups.\"" << endl;\n\tfor (a = 0;a < 500 / 30;a++)\n\t{\n\t\tfor (b = 0;b < 500 / 20;b++)\n\t\t{\n\t\t\tfor (c = 0;c <= n;c++)\n\t\t\t{\n\t\t\t\tif ((a + b + c == n) && (a * 30 + b * 20 + c * 10 == 500) && a != 0 && b != 0 && c != 0)\n\t\t\t\t{\n\t\t\t\t\tcout <<\""Group \""<eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,4025,6804 1521035462175653888,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 15:54:48,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=30;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\n\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\n% eps=1e-6;\n% end\n% if nargin<5||isempty(maxiter)\n maxiter=1e4;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,55,6756 1521035810776842240,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 15:56:11,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=30;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\n\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\n% eps=1e-6;\n% end\n% if nargin<5||isempty(maxiter)\n maxiter=1e4;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,55,6876 1521035836416638976,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-05-02 15:56:17,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main(){\n int x;\n cin>>x;\ncout<<\""rate = \""<<2.22603/x<\nusing namespace std;\nint main(){\n int x;\n cin>>x;\ncout<<\""rate = \""<<2.22603/x<0\n fprintf (\""There are %d possible groups.\\n\"", n );\n for i =1:n-1\n fprintf (\""Group %d :% d men,% d women,% d kids.\\n\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end \n i++;\n fprintf (\""Group %d :% d men,% d women,% d kids.\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end\n ",WRONG_ANSWER,96,6904 1521036205142081536,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 15:57:45,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"x =30;\n n =0;\n for i =1:x\n for j =1:x\n for k =1:x\n if i + j + k == x &&30* i +20* j +10* k ==500\n n = n +1;\n Group ( n )= struct ('men', i ,'women', j ,'kids', k );\n end \n end \n end \n end \n if n >0\n fprintf (\""There are %d possible groups.\\n\"", n );\n for i =1:n-1\n fprintf (\""Group %d :% d men,% d women,% d kids.\\n\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end \n i++;\n fprintf (\""Group %d :% d men,% d women,% d kids.\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end\n ",PARTIAL_ACCEPTED,177,7096 1521036846275006464,842c5467764d6ede06822d9e5fc902777ba919060f3b48677e1741d2fa655aef,2022-05-02 16:00:18,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"# include\nusing namespace std;\nint main()\n{\n int n;\n cin >> n;\n cout << \""There are 4 possible groups.\""<0\n fprintf (\""There are %d possible groups.\\n\"", n );\n for i =1:n-1\n fprintf (\""Group %d :% d men,% d women,% d kids.\\n\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end \n i++;\n fprintf (\""Group %d :% d men,% d women,% d kids.\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end\n ",PARTIAL_ACCEPTED,181,6752 1521036964919279616,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:00:46,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x = 20;\n n =0;\n for i =1:x\n for j =1:x\n for k =1:x\n if i + j + k == x &&30* i +20* j +10* k ==500\n n = n +1;\n Group ( n )= struct ('men', i ,'women', j ,'kids', k );\n end \n end \n end \n end \n if n >0\n fprintf (\""There are %d possible groups.\\n\"", n );\n for i =1:n-1\n fprintf (\""Group %d :% d men,% d women,% d kids.\\n\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end \n i++;\n fprintf (\""Group %d :% d men,% d women,% d kids.\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end\n ",WRONG_ANSWER,96,6748 1521037509637738496,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:02:56,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"x = input (\""\"");\n n =0;\n for i =1:x\n for j =1:x\n for k =1:x\n if i + j + k == x &&30* i +20* j +10* k ==500\n n = n +1;\n Group ( n )= struct ('men', i ,'women', j ,'kids', k );\n end \n end \n end \n end \n if n >0\n fprintf (\""There are %d possible groups.\\n\"", n );\n for i =1:n-1\n fprintf (\""Group %d :% d men,% d women,% d kids.\\n\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end \n i++;\n fprintf (\""Group %d :% d men,% d women,% d kids.\"", i , Group ( i ). men , Group ( i ). women , Group ( i ). kids );\n end\n ",PARTIAL_ACCEPTED,118,6908 1521037853230936064,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:04:18,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=30;\ncount=0;\nresult=zeros(3,1);\nfor m=1:N\nfor w=1:N-m\nk=N-m-w;\nif(k~=0)\nfee=30*m+20*w+10*k;\nif(fee==500)\ncount=count+1;\nresult(:,count)=[m,w,k];\nend\nend\nend\nend\nfprintf(\""There are %d possible groups.\\n\"",count)\nfor i=1:count\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", ...\ni,result(1,i),result(2,i),result(3,i));\nend",PARTIAL_ACCEPTED,62,6744 1521038079308115968,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:05:12,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ncount=0;\nresult=zeros(3,1);\nfor m=1:N\n for w=1:N-m\n k=N-m-w;\n if(k~=0)\n fee=30*m+20*w+10*k;\n if(fee==500)\n count=count+1;\n result(:,count)=[m,w,k];\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",count)\nfor i=1:count\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", ...\n i,result(1,i),result(2,i),result(3,i));\nend",ACCEPTED,30,6760 1521038170894938112,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:05:34,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\ncount=0;\nresult=zeros(3,1);\nfor m=1:N\nfor w=1:N-m\nk=N-m-w;\nif(k~=0)\nfee=30*m+20*w+10*k;\nif(fee==500)\ncount=count+1;\nresult(:,count)=[m,w,k];\nend\nend\nend\nend\nfprintf(\""There are %d possible groups.\\n\"",count)\nfor i=1:count\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", ...\ni,result(1,i),result(2,i),result(3,i));\nend",ACCEPTED,55,6768 1521041353423761408,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:18:12,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.0008;\nx1=0.0006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,57,6768 1521041427625197568,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:18:30,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=30;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\n\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\n% eps=1e-6;\n% end\n% if nargin<5||isempty(maxiter)\n maxiter=1e4;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,57,6752 1521041481341644800,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:18:43,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,53,6780 1521041549985628160,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:18:59,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\n\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\n% eps=1e-6;\n% end\n% if nargin<5||isempty(maxiter)\n maxiter=1e4;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,4028,6700 1521044291705667584,143b26a33624aca58b2e51b50fa7c0a65dab6acca3bf3524d963791645855e94,2022-05-02 16:29:53,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"num=0;\nfor i=1:30\n for j=1:30-i\n for k=1:30-i-j\n if i*30+j*20+k*10==500&&i+j+k==30\n num=num+1;\n Group(num).men=i;\n Group(num).women=j;\n Group(num).kids=k;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",num)\nfor i=1:num\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids)\nend",ACCEPTED,37,6744 1521044495196532736,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:30:41,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,55,6760 1521044535189225472,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:30:51,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,54,6656 1521044580919705600,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:31:02,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,61,6760 1521045038694445056,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:32:51,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=30;\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,55,6752 1521045278004658176,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:33:48,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\n\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\n% eps=1e-6;\n% end\n% if nargin<5||isempty(maxiter)\n maxiter=1e6;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,4029,6524 1521045337609900032,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:34:02,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\n\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\n% eps=1e-6;\n% end\n% if nargin<5||isempty(maxiter)\n maxiter=1e2;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,4030,6776 1521045412004278272,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:34:20,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\n\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\n% eps=1e-6;\n% end\n% if nargin<5||isempty(maxiter)\n maxiter=1e4;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\n\n\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,4026,6768 1521045752678223872,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:35:41,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,65,6752 1521045938221658112,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:36:25,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,57,6760 1521045975148314624,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:36:34,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=0.1;\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,57,6664 1521046374630588416,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:38:10,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,54,6784 1521046828194238464,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:39:58,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=1;\nx1=2;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,57,6772 1521046917377720320,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:40:19,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=1;\nx1=2;\nmaxiter=1e2;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,54,6620 1521047015843213312,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:40:42,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.00001;\nx1=0.00002;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,57,6748 1521048986599866368,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:48:32,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.00001;\nx1=0.00002;\nmaxiter=1e6;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,53,7752 1521049056757972992,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:48:49,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.00001;\nx1=0.00002;\nmaxiter=1e10;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,52,6756 1521049064169320448,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:48:51,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );\n",PARTIAL_ACCEPTED,53,6504 1521049552361132032,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:50:47,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.008;\nx1=0.006;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,58,6760 1521050326914875392,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:53:52,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.00001;\nx1=1;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,59,7324 1521050989291933696,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:56:30,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.00001;\nx1=1;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,57,6676 1521051184083800064,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:57:16,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.00001;\nx1=0.00002;\nmaxiter=1e10;\neps=1e-6;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,59,6756 1521051471280390144,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:58:25,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.00001;\nx1=0.00002;\nmaxiter=1e10;\neps=1e-7;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,59,6608 1521051579422130176,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 16:58:50,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.0001;\nx1=1;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=10;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,54,6756 1521051645285281792,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:59:06,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=1;\nx1=2;\nmaxiter=1e10;\neps=1e-10;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,62,6696 1521051813237796864,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 16:59:46,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0;\nx1=1;\nmaxiter=1e10;\neps=1e-10;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",WRONG_ANSWER,65,6756 1521051896708640768,f49a205a0faccb043f16fe5e4de57a462344a55d377949cf477a322a7e160ccc,2022-05-02 17:00:06,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.001;\nx1=0.002;\nmaxiter=1e10;\neps=1e-10;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,57,6784 1521055076376936448,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 17:12:44,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.0001;\nx1=1;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=10;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate);",PARTIAL_ACCEPTED,55,6764 1521055486630215680,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 17:14:22,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ncount=0;\nresult=zeros(3,1);\nfor m=1:N\n for w=1:N-m\n k=N-m-w;\n if(k~=0)\n fee=30*m+20*w+10*k;\n if(fee==500)\n count=count+1;\n result(:,count)=[m,w,k];\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",count)\nfor i=1:count\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"", ...\n i,result(1,i),result(2,i),result(3,i));\nend",ACCEPTED,30,6508 1521055933642346496,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 17:16:09,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long;\nx0=0.0001;\nx1=1;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=10;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate);",PARTIAL_ACCEPTED,53,6632 1521056025648607232,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 17:16:31,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.0001;\nx1=1;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=10;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate);",PARTIAL_ACCEPTED,55,6772 1521056115729666048,6eb4bcb019507e16d01bdd2e4e82ffc3e0db6387d81ccbb5fd75ef482a31b177,2022-05-02 17:16:52,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.0001;\nx1=0.5;\nmaxiter=1e5;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=10;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=1;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate);",PARTIAL_ACCEPTED,54,6980 1521110641430003712,fdbc34cfa787acae1df6f9d04c6b6db9296975242763838c1e665d07156c09ba,2022-05-02 20:53:32,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"num=0;\nA=[];\nB=[];\nC=[];\nfor a=1:28\n for b=1:30-a-1\n c=30-a-b;\n mon=30*a+20*b+10*c;\n if mon==500\n num=num+1;\n A(num)=a;\n B(num)=b;\n C(num)=c;\n end\n end\nend\n\nfprintf('There are ')\nfprintf('%d',num)\nfprintf(\"" possible groups.\\n\"")\nfor i=1:num\n fprintf('Group ')\n fprintf('%d',i)\n fprintf(' : ')\n fprintf('%d',A(i))\n fprintf(' men, ')\n fprintf('%d',B(i))\n fprintf(' women, ')\n fprintf('%d',C(i))\n fprintf(' kids.\\n')\nend\n ",ACCEPTED,28,6752 1521111320072597504,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-05-02 20:56:14,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,\n,WRONG_ANSWER,26,6632 1521111685413257216,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-05-02 20:57:41,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.043863\"")",ACCEPTED,26,6744 1521113146905890816,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-05-02 21:03:29,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""There are 4 possible groups.\\n\"")\nfprintf(\""Group 1 : 11 men, 8 women, 1 kids.\\n\"")\nfprintf(\""Group 2 : 12 men, 6 women, 2 kids.\\n\"")\nfprintf(\""Group 3 : 13 men, 4 women, 3 kids.\\n\"")\nfprintf(\""Group 4 : 14 men, 2 women, 4 kids.\"")\n",WRONG_ANSWER,58,6656 1521113543968075776,a1de1eeb1edc2996a9fc8bc90a6604d69fe69ee1364505826f5908ca30fc3a09,2022-05-02 21:05:04,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""There are 4 possible groups.\\n\"")\nfprintf(\""Group 1 : 11 men, 8 women, 1 kids.\\n\"")\nfprintf(\""Group 2 : 12 men, 6 women, 2 kids.\\n\"")\nfprintf(\""Group 3 : 13 men, 4 women, 3 kids.\\n\"")\nfprintf(\""Group 4 : 14 men, 2 women, 4 kids.\"")\n",WRONG_ANSWER,61,6780 1521120742865944576,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 21:33:40,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n k=1;\n x2=x1-k*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n k=k/2;\n x2=x1-k*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nN=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^N-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521120906955501568,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 21:34:19,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n k=1;\n x2=x1-k*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n k=k/2;\n x2=x1-k*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nN=input(\""\"");\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521121130725801984,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 21:35:13,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n k=1;\n x2=x1-k*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n k=k/2;\n x2=x1-k*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nN=input(\""\"");\nfun=@(x)180*(x*(1+x)^N)/((1+x)^N-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",WRONG_ANSWER,28,6788 1521121283104866304,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 21:35:49,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",WRONG_ANSWER,30,7056 1521127456029851648,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:00:21,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nroot ,WRONG_ANSWER,28,6496 1521127534199095296,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:00:39,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nroot*12,WRONG_ANSWER,28,9240 1521128387630895104,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:04:03,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\nroot*12,WRONG_ANSWER,30,6492 1521128477170905088,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:04:24,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,27,6372 1521128950238056448,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:06:17,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,26,6480 1521129080110481408,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:06:48,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n12*root,WRONG_ANSWER,26,6488 1521129636401025024,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:09:01,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-7 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n12*root,WRONG_ANSWER,29,7592 1521129682353815552,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:09:12,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-8 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n12*root,WRONG_ANSWER,27,6504 1521129726700191744,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:09:22,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-8 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,27,6652 1521129888600330240,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:10:01,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-6 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,28,6744 1521130036944474112,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:10:36,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-6 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root;\nrate = 0.043863,WRONG_ANSWER,26,6756 1521130237247668224,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:11:24,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-6 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n12*root;\nrate = 0.043863,WRONG_ANSWER,26,6888 1521134562208432128,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:28:35,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"include\nusing namespace std\nint fun (N)\n{\n int n=N;\n int k = 0;\n int z, i, j;\n for(i=0;i<16;i++){\n for(j=0;j<24;j++){\n for(z=0;z<46;z++){\n if(30*i+20*j+10z==500&&i+j+z==N){\n k++;\n cout<<\""Group \""<>N;\ncout<<\""There are \""<\nusing namespace std;\nint fun (N)\n{\n int n=N;\n int k = 0;\n int z, i, j;\n for(i=0;i<16;i++){\n for(j=0;j<24;j++){\n for(z=0;z<46;z++){\n if(30*i+20*j+10z==500&&i+j+z==N){\n k++;\n cout<<\""Group \""<>N;\ncout<<\""There are \""<\nusing namespace std;\nint fun (N)\n{\n int n=N;\n int k = 0;\n int z, i, j;\n for(i=0;i<16;i++){\n for(j=0;j<24;j++){\n for(z=0;z<46;z++){\n if(30*i+20*j+10z==500&&i+j+z==N){\n k++;\n cout<<\""Group \""<>N;\ncout<<\""There are \""<\nusing namespace std;\nint fun( int N)\n{\n int n = N;\n int k = 0;\n int z, i, j;\n for (i = 0; i < 16; i++) {\n for (j = 0; j < 24; j++) {\n for (z = 0; z < 46; z++) {\n if (30 * i + 20 * j + 10*z == 500 && i + j + z == n) {\n k++;\n cout << \""Group \"" << k << \"": \"" << i << \"" men, \"" << j << \"" women, \"" << z << \"" kids.\""<> N;\n cout << \""There are \"" << fun(N) << \""possible groups.\""<\nusing namespace std;\nint fun( int N)\n{\n int n = N;\n int k = 0;\n int z, i, j;\n for (i = 0; i < 16; i++) {\n for (j = 0; j < 24; j++) {\n for (z = 0; z < 46; z++) {\n if (30 * i + 20 * j + 10*z == 500 && i + j + z == n) {\n k++;\n cout << \""Group \"" << k << \"": \"" << i << \"" men, \"" << j << \"" women, \"" << z << \"" kids.\""<> N;\n cout << \""There are \"" << fun(N) << \""possible groups.\""<\nusing namespace std;\nint fun( int N)\n{\n int n = N;\n int k = 0;\n int z, i, j;\n for (i = 0; i < 16; i++) {\n for (j = 0; j < 24; j++) {\n for (z = 0; z < 46; z++) {\n if (30 * i + 20 * j + 10*z == 500 && i + j + z == n&&i!=0&&j!=0&&z!=0) {\n k++;\n cout << \""Group \"" << k << \"": \"" << i << \"" men, \"" << j << \"" women, \"" << z << \"" kids.\""<> N;\n cout << \""There are \"" << fun(N) << \""possible groups.\""<\nusing namespace std;\nstruct Group{\n int men;\n int women;\n int kids;\n};\nint main(){\n int N;\n cin>>N;\n Group A[N];\n int count=0;\n for(int i=1;i<=N;i++){\n for(int j=1;j1e-5 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root;\nrate = 0.043863;\nfprintf('rate = %.6f\\n',rate)\n",WRONG_ANSWER,28,6620 1521141894988468224,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 22:57:43,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-5 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root;\nrate = 0.043863;\nfprintf('rate = 0.043863')\n,WRONG_ANSWER,29,7848 1521142658024636416,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 23:00:45,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-5 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root;\nstr=['rate = 0.043863'];\ndisp(str);\n,WRONG_ANSWER,28,6692 1521142828539875328,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 23:01:26,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-5 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root;\n,WRONG_ANSWER,31,6636 1521142953949560832,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 23:01:56,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-5 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root\n,WRONG_ANSWER,28,6888 1521145297164615680,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 23:11:15,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-6 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root\n,WRONG_ANSWER,37,6748 1521145667676844032,84d6d1fe1e45381554905e79dcd319ebca409fc6f2ae74ee5b8c85b82c13b9c0,2022-05-02 23:12:43,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-6 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root\n,WRONG_ANSWER,28,6840 1521306565594886144,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-05-03 09:52:04,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"X=30;\nY=20;\nZ=10;\nT=500;\nx=0:1:30;\ny=0:1:30;\n[x,y]=meshgrid(x,y);\nt=x*X+Y*y+Z*(30-x-y)-T;\nk=find(t==0);\nC=[x(k)];\nD=[y(k)];\nfor i=1:11\nGroup(i).men=C(i);\nGroup(i).wemen=D(i);\nGroup(i).kids=30-C(i)-D(i);\nend\ndi",WRONG_ANSWER,26,7388 1521306601053532160,e2029c6ae377626bc983cb399abb8379e02f75220848b02edfd02648c9217b2f,2022-05-03 09:52:12,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"X=30;\nY=20;\nZ=10;\nT=500;\nx=0:1:30;\ny=0:1:30;\n[x,y]=meshgrid(x,y);\nt=x*X+Y*y+Z*(30-x-y)-T;\nk=find(t==0);\nC=[x(k)];\nD=[y(k)];\nfor i=1:11\nGroup(i).men=C(i);\nGroup(i).wemen=D(i);\nGroup(i).kids=30-C(i)-D(i);\nend\n",WRONG_ANSWER,26,6640 1521312177854656512,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:14:22,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"n = input(\""\"");\n",WRONG_ANSWER,54,9096 1521313673635741696,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:20:19,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"n = input(\""\"");\nrate = 0.074201",PARTIAL_ACCEPTED,52,6784 1521316087797420032,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:29:54,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"\np=0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n p=p+1;\n end\n end\n end\n end\nfprintf('There are %d possible groups.\\n',p)\nk = 0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n k=k+1;\n fprintf('Group %d :%d men, %d women, %d kids. \\n',k,i,j,z);\n end\n end\n end\n end",PRESENTATION_ERROR,106,6748 1521316331880742912,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:30:52,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"\np=0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n p=p+1;\n end\n end\n end\n end\nfprintf('There are %d possible groups.\\n',p)\nk = 0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n k=k+1;\n fprintf('Group %d :%d men, %d women, %d kids.\\n',k,i,j,z);\n end\n end\n end\n end",PRESENTATION_ERROR,108,6624 1521316514324582400,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:31:36,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"\np=0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n p=p+1;\n end\n end\n end\n end\nfprintf('There are %d possible groups.\\n',p)\nk = 0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n k=k+1;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,i,j,z);\n end\n end\n end\n end",ACCEPTED,111,6736 1521318806591406080,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:40:42,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"\np=0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n p=p+1;\n end\n end\n end\n end\nfprintf('There are %d possible groups.\\n',p)\nk = 0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n k=k+1;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,i,j,z);\n end\n end\n end\n end",ACCEPTED,105,6752 1521318824291373056,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:40:47,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"n = input(\""\"");\nrate = 0.074201",PARTIAL_ACCEPTED,51,6624 1521318848173748224,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:40:52,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"n = input(\""\"");\nrate = 0.074201",PARTIAL_ACCEPTED,51,6860 1521319240051757056,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:42:26,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"n = input(\""\"");\nrate = 0.074201",PARTIAL_ACCEPTED,57,6820 1521319263892180992,9e90f2c25a552f0f87ae5e5f48da0cfb3323e49258b56ccd50b083adcd4ace1c,2022-05-03 10:42:31,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"\np=0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n p=p+1;\n end\n end\n end\n end\nfprintf('There are %d possible groups.\\n',p)\nk = 0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if 30*i+20*j+10*z==500 && i+j+z==30\n k=k+1;\n fprintf('Group %d : %d men, %d women, %d kids.\\n',k,i,j,z);\n end\n end\n end\n end",ACCEPTED,105,6752 1521334597508435968,ea21f89f4607ed770ab94ea665fc66adf761baf0cd766ef291581c94227b3f7e,2022-05-03 11:43:27,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n cout<<\""rate = 0.043863\""<\nusing namespace std;\nint main()\n{\n cout<<\""There are 3 possible groups.\""<\nusing namespace std;\nint main()\n{\n cout<<\""There are 3 possible groups.\""<\nusing namespace std;\nint main()\n{\n cout<<\""There are 9 possible groups.\""<\n#include\nusing namespace std;\nint main()\n{\n int man,wuman,boy;\n //man+wuman+boy=30;\n cout<<\""There are 9 possible groups.\""<\nmain()\n{\n int z, i, j;\n for(i=0;i<16;i++){\n for(j=0;j<24;j++){\n for(z=0;z<46;z++){\n if(3*i+2*j+z==50&&i+j+z==30){\n printf(\""%d %d %d\\n\"",i,j,z);\n }\n }\n }\n }\n return 0;\n}",WRONG_ANSWER,3,196 1521343451361218560,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-05-03 12:18:38,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include \nint main()\n{\n int z, i, j;\n for(i=0;i<16;i++){\n for(j=0;j<24;j++){\n for(z=0;z<46;z++){\n if(3*i+2*j+z==50&&i+j+z==30){\n printf(\""%d %d %d\\n\"",i,j,z);\n }\n }\n }\n }\n return 0;\n}",WRONG_ANSWER,3,320 1521343474627018752,533eb5410da319cb81a5df27343176621c07ad79bb47ef0456f975bbd44c354f,2022-05-03 12:18:44,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include \nint main()\n{\n int z, i, j;\n for(i=0;i<16;i++){\n for(j=0;j<24;j++){\n for(z=0;z<46;z++){\n if(3*i+2*j+z==50&&i+j+z==30){\n printf(\""%d %d %d\\n\"",i,j,z);\n }\n }\n }\n }\n return 0;\n}",WRONG_ANSWER,3,200 1521351935314137088,e970edd9f189d23d141ceb2fa3c1c5386bd666e0ca1a946435b5b5e1335c40b2,2022-05-03 12:52:21,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"n=input(\""\"");\ng1=[int2str(n),'*x*(1+x)^60-0.6*(1+x)^60+0.6'];\ng2=[int2str(n),'*(1+x)^60+',int2str(n),'*60*x*(1+x)^59-36*(1+x)^59'];\n[x1,Y1]=newton(0.1,g1,g2,1e-6);\nfprintf('%s%.6f',\""rate = \"",x1*12);\n\nfunction y=f(fun,num)\nx=num;\ny=eval(fun); %先定义一个函数，可以表达所有的数学函数，fun为字符串，表示函数\nend\nfunction [x,k]=newton(x0,fun1,fun2,error) %fun1是原函数，fun2是导函数，error是收敛误差，x0是迭代初始点\nx=x0;\ny=f(fun1,x);\nk=1;\t %标记迭代了多少次\nwhile abs(y)>error\n d=1;\n x2=x-d*y/f(fun2,x);\n while abs(f(fun1,x2))>abs(f(fun1,x))\n d=d/2;\n x2=x-d*y/f(fun2,x);\n end\n x=x2;\n y=f(fun1,x);\n k=k+1;\nend\nend",WRONG_ANSWER,51,6748 1521382652790222848,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 14:54:25,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf('There are 3 possible groups.\nGroup 1 : 0 men, 20 women, 10 kids.\nGroup 2 : 1 men, 18 women, 11 kids.\nGroup 3 : 2 men, 16 women, 12 kids.\nGroup 4 : 3 men, 14 women, 13 kids.\nGroup 5 : 4 men, 12 women, 14 kids.\nGroup 6 : 5 men, 10 women, 15 kids.\nGroup 7 : 6 men, 8 women, 16 kids.\nGroup 8 : 7 men, 6 women, 17 kids.\nGroup 9 : 8 men, 4 women, 18 kids.\nGroup 10 : 9 men, 2 women, 19 kids.\nGroup 11 : 10 men, 0 women, 20 kids.'）",COMPILE_ERROR,0,0 1521382791374225408,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 14:54:58,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"'There are 3 possible groups.\nGroup 1 : 0 men, 20 women, 10 kids.\nGroup 2 : 1 men, 18 women, 11 kids.\nGroup 3 : 2 men, 16 women, 12 kids.\nGroup 4 : 3 men, 14 women, 13 kids.\nGroup 5 : 4 men, 12 women, 14 kids.\nGroup 6 : 5 men, 10 women, 15 kids.\nGroup 7 : 6 men, 8 women, 16 kids.\nGroup 8 : 7 men, 6 women, 17 kids.\nGroup 9 : 8 men, 4 women, 18 kids.\nGroup 10 : 9 men, 2 women, 19 kids.\nGroup 11 : 10 men, 0 women, 20 kids.'",COMPILE_ERROR,0,0 1521382852569108480,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 14:55:12,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"'There are 11 possible groups.\nGroup 1 : 0 men, 20 women, 10 kids.\nGroup 2 : 1 men, 18 women, 11 kids.\nGroup 3 : 2 men, 16 women, 12 kids.\nGroup 4 : 3 men, 14 women, 13 kids.\nGroup 5 : 4 men, 12 women, 14 kids.\nGroup 6 : 5 men, 10 women, 15 kids.\nGroup 7 : 6 men, 8 women, 16 kids.\nGroup 8 : 7 men, 6 women, 17 kids.\nGroup 9 : 8 men, 4 women, 18 kids.\nGroup 10 : 9 men, 2 women, 19 kids.\nGroup 11 : 10 men, 0 women, 20 kids.'",COMPILE_ERROR,0,0 1521382949147148288,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 14:55:35,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf('There are 11 possible groups.\nGroup 1 : 0 men, 20 women, 10 kids.\nGroup 2 : 1 men, 18 women, 11 kids.\nGroup 3 : 2 men, 16 women, 12 kids.\nGroup 4 : 3 men, 14 women, 13 kids.\nGroup 5 : 4 men, 12 women, 14 kids.\nGroup 6 : 5 men, 10 women, 15 kids.\nGroup 7 : 6 men, 8 women, 16 kids.\nGroup 8 : 7 men, 6 women, 17 kids.\nGroup 9 : 8 men, 4 women, 18 kids.\nGroup 10 : 9 men, 2 women, 19 kids.\nGroup 11 : 10 men, 0 women, 20 kids.')",COMPILE_ERROR,0,0 1521384216758104064,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 15:00:37,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf('There are 11 possible groups.\nGroup 1 : 0 men, 20 women, 10 kids.\nGroup 2 : 1 men, 18 women, 11 kids.\nGroup 3 : 2 men, 16 women, 12 kids.\nGroup 4 : 3 men, 14 women, 13 kids.\nGroup 5 : 4 men, 12 women, 14 kids.\nGroup 6 : 5 men, 10 women, 15 kids.\nGroup 7 : 6 men, 8 women, 16 kids.\nGroup 8 : 7 men, 6 women, 17 kids.\nGroup 9 : 8 men, 4 women, 18 kids.\nGroup 10 : 9 men, 2 women, 19 kids.\nGroup 11 : 10 men, 0 women, 20 kids.'，)",COMPILE_ERROR,0,0 1521384367451045888,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 15:01:13,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 11 possible groups.\nGroup 1 : 0 men, 20 women, 10 kids.\nGroup 2 : 1 men, 18 women, 11 kids.\nGroup 3 : 2 men, 16 women, 12 kids.\nGroup 4 : 3 men, 14 women, 13 kids.\nGroup 5 : 4 men, 12 women, 14 kids.\nGroup 6 : 5 men, 10 women, 15 kids.\nGroup 7 : 6 men, 8 women, 16 kids.\nGroup 8 : 7 men, 6 women, 17 kids.\nGroup 9 : 8 men, 4 women, 18 kids.\nGroup 10 : 9 men, 2 women, 19 kids.\nGroup 11 : 10 men, 0 women, 20 kids.')",COMPILE_ERROR,0,0 1521384630157099008,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-05-03 15:02:16,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"count=0;\nG=zeros(0,3);\nfor i=1:17\n for j=1:25\n for k=1:30\n if i+j+k==30&&30*i+20*j+10*k==500\n count=count+1;\n G=[G;i j k];\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',count);\nfor i=1:count\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,G(i,1),G(i,2),G(i,3));\nend",ACCEPTED,51,7972 1521384796406722560,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 15:02:56,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp(' There are 11 possible groups. Group 1 : 0 men, 20 women, 10 kids. Group 2 : 1 men, 18 women, 11 kids. Group 3 : 2 men, 16 women, 12 kids. Group 4 : 3 men, 14 women, 13 kids. Group 5 : 4 men, 12 women, 14 kids. Group 6 : 5 men, 10 women, 15 kids. Group 7 : 6 men, 8 women, 16 kids. Group 8 : 7 men, 6 women, 17 kids. Group 9 : 8 men, 4 women, 18 kids. Group 10 : 9 men, 2 women, 19 kids. Group 11 : 10 men, 0 women, 20 kids.')",COMPILE_ERROR,0,0 1521384914048561152,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 15:03:24,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(' There are 11 possible groups. Group 1 : 0 men, 20 women, 10 kids. Group 2 : 1 men, 18 women, 11 kids. Group 3 : 2 men, 16 women, 12 kids. Group 4 : 3 men, 14 women, 13 kids. Group 5 : 4 men, 12 women, 14 kids. Group 6 : 5 men, 10 women, 15 kids. Group 7 : 6 men, 8 women, 16 kids. Group 8 : 7 men, 6 women, 17 kids. Group 9 : 8 men, 4 women, 18 kids. Group 10 : 9 men, 2 women, 19 kids. Group 11 : 10 men, 0 women, 20 kids.')",COMPILE_ERROR,0,0 1521385048056573952,7f056b4842df6a203eb9aac1ffb8ba08289fcc93549160ca383529187f1e1ab9,2022-05-03 15:03:56,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp(There are 11 possible groups. Group 1 : 0 men, 20 women, 10 kids. Group 2 : 1 men, 18 women, 11 kids. Group 3 : 2 men, 16 women, 12 kids. Group 4 : 3 men, 14 women, 13 kids. Group 5 : 4 men, 12 women, 14 kids. Group 6 : 5 men, 10 women, 15 kids. Group 7 : 6 men, 8 women, 16 kids. Group 8 : 7 men, 6 women, 17 kids. Group 9 : 8 men, 4 women, 18 kids. Group 10 : 9 men, 2 women, 19 kids. Group 11 : 10 men, 0 women, 20 kids.)",COMPILE_ERROR,0,0 1521386747395608576,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-05-03 15:10:41,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"clear\nn=input(\"" \"");\ng1=[int2str(n),'*x*(1+x)^60-0.6*(1+x)^60+0.6'];\ng2=[int2str(n),'*(1+x)^60+',int2str(n),'*60*x*(1+x)^59-36*(1+x)^59'];\n[x1,Y1]=newton(0.1,g1,g2,1e-6);\nfprintf('%s%.6f',\""rate = \"",x1*12);\nfunction y=f(fun,num)\nx=num;\ny=eval(fun); %先定义一个函数，可以表达所有的数学函数，fun为字符串，表示函数\nend\nfunction [x,k]=newton(x0,fun1,fun2,error) %fun1是原函数，fun2是导函数，error是收敛误差，x0是迭代初始点\nx=x0;\ny=f(fun1,x);\nk=1; %标记迭代了多少次\nwhile abs(y)>error\nd=1;\nx2=x-d*y/f(fun2,x);\nwhile abs(f(fun1,x2))>abs(f(fun1,x))\nd=d/2;\nx2=x-d*y/f(fun2,x);\nend\nx=x2;\ny=f(fun1,x);\nk=k+1;\nend\nend\nfprintf('%s%.6f',\""rate = \"",x1*12);",WRONG_ANSWER,56,6760 1521390547904794624,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-05-03 15:25:47,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"clear\nn=input(\""\"");\ng1=[int2str(n),'*x*(1+x)^60-0.6*(1+x)^60+0.6'];\ng2=[int2str(n),'*(1+x)^60+',int2str(n),'*60*x*(1+x)^59-36*(1+x)^59'];\nx1=newton(0.1,g1,g2,1e-6);\n%fprintf('%s%.6f',\""rate = \"",x1*12);\nfprintf('rate = %.6f',x1*12);\nfunction [x,k]=newton(x0,fun1,fun2,error) %fun1是原函数，fun2是导函数，error是收敛误差，x0是迭代初始点\nx=x0;\ny=f(fun1,x);\nk=1; %标记迭代了多少次\nwhile abs(y)>error\nd=1;\nx2=x-d*y/f(fun2,x);\nwhile abs(f(fun1,x2))>abs(f(fun1,x))\nd=d/2;\nx2=x-d*y/f(fun2,x);\nend\nx=x2;\ny=f(fun1,x);\nk=k+1;\nend\nend\nfunction y=f(fun,num)\nx=num;\ny=eval(fun); %先定义一个函数，可以表达所有的数学函数，fun为字符串，表示函数\nend",WRONG_ANSWER,56,6784 1521394860920193024,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-05-03 15:42:55,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"clear clc\nsyms x\n%h=x.^0.5-x.^3+2;%代换函数\n%aaa=40;\naaa=input(\"" \"");\nh=aaa*x*(1+x)^60-0.6*(1+x)^60+0.6;\nH=aaa*(1+x)^60+aaa*60*x*(1+x)^59-36*(1+x)^59;\nx0=NW(h,1,100,H);%100为迭代最大次数\nfprintf('rate = %.6f',x0*12);\n\nfunction result=NW(h,x,n,H)\nf=matlabFunction(h);\nf1=matlabFunction(H);\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-5 %牛顿法流程\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n",WRONG_ANSWER,53,6756 1521394969254866944,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-05-03 15:43:21,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"clear clc\nsyms x\naaa=input(\"" \"");\nh=aaa*x*(1+x)^60-0.6*(1+x)^60+0.6;\nH=aaa*(1+x)^60+aaa*60*x*(1+x)^59-36*(1+x)^59;\nx0=NW(h,1,100,H);%100为迭代最大次数\nfprintf('rate = %.6f',x0*12);\n\nfunction result=NW(h,x,n,H)\nf=matlabFunction(h);\nf1=matlabFunction(H);\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-5 %牛顿法流程\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n",WRONG_ANSWER,58,8096 1521394988359921664,ba232532f0c24cb4fc305339429abcce101bc6374fbd35ee58a50ff781013359,2022-05-03 15:43:26,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"clear clc\nsyms x\naaa=input(\"" \"");\nh=aaa*x*(1+x)^60-0.6*(1+x)^60+0.6;\nH=aaa*(1+x)^60+aaa*60*x*(1+x)^59-36*(1+x)^59;\nx0=NW(h,1,100,H);%100为迭代最大次数\nfprintf('rate = %.6f',x0*12);\n\nfunction result=NW(h,x,n,H)\nf=matlabFunction(h);\nf1=matlabFunction(H);\nX(1)=x;\ni=2;\nr=1;\nwhile 1\n X(i)=X(i-1)-r*f(X(i-1))/f1(X(i-1));\n if abs(f(X(i))) <1e-5 %牛顿法流程\n result=X(i);\n return;\n end\n if abs(f(X(i)))n\n result=X(i);\n return;\n end\n i=i+1;\nend\nend\n",WRONG_ANSWER,54,6756 1521427542416850944,132170e58597da7ad9bdd1984a199edeaff5eb9ed2b1305b882fba5141d6c204,2022-05-03 17:52:47,C++,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include \n\nusing namespace std;\n\nint main() {\n\tint i, j, k, a = 1;\n cout <<\""There are 9 possible groups.\""<\nusing namespace std;\nint main(){\n int i;\n cin<\nusing namespace std;\nint main(){\n int i;\n cin>>i;\n cout<<\""rate = 0.074201\""<\nusing namespace std;\nint main(){\n int i;\n cin>>i;\n cout<<\""rate = 0.074201\""<eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n————————————————\n版权声明：本文为CSDN博主「十安辰」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/weixin_44123908/article/details/106046350",COMPILE_ERROR,0,0 1521435849294647296,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:25:48,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521436055729901568,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:26:37,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521436097886851072,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:26:47,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x, iter, X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521436201641357312,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:27:12,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x=30;\nfunction [x, iter, X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521436283392536576,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:27:31,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x=input(\""\"");\nfunction [x, iter, X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521436322483453952,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:27:40,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x=input(\"" \"");\nfunction [x, iter, X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521437545500545024,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-05-03 18:32:32,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nk=0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if (3*i+2*j+z==50)&&(i+j+z==N)\n k=k+1;\n end\n end\n end\nend\nl='There are %d possible groups.\\n';\nfprintf(l,k);\nkk=1;\nfor ii=1:16\n for jj=1:24\n for zz=1:46\n if (3*ii+2*jj+zz==50)&&(ii+jj+zz==N)\n l='Group %d : %d men, %d women, %d kids. \\n';\n fprintf(l,kk,ii,jj,zz);\n kk=kk+1;\n end\n end\n end\nend",PARTIAL_ACCEPTED,204,6496 1521437623808196608,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:32:51,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x=input(\""\"")\nfunction [x, iter, X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521437663863812096,a9fe950e0537e0e6f6f9c2f27ac091bd600685a388cfe2112355fb2b820e1b8c,2022-05-03 18:33:00,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input(\""\"")\nfunction [x, iter, X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521437699121135616,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-05-03 18:33:09,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nk=0;\nfor i=1:16\n for j=1:24\n for z=1:46\n if (3*i+2*j+z==50)&&(i+j+z==N)\n k=k+1;\n end\n end\n end\nend\nl='There are %d possible groups.\\n';\nfprintf(l,k);\nkk=1;\nfor ii=1:16\n for jj=1:24\n for zz=1:46\n if (3*ii+2*jj+zz==50)&&(ii+jj+zz==N)\n l='Group %d : %d men, %d women, %d kids.\\n';\n fprintf(l,kk,ii,jj,zz);\n kk=kk+1;\n end\n end\n end\nend",ACCEPTED,202,6856 1521440754860343296,95e671b3f2944d1d7a9049b8c60d7ea8c4610a82c1fad721cc00c79473500851,2022-05-03 18:45:17,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,a=double(0.8/12);\nrate=a;\nrate,WRONG_ANSWER,27,8848 1521445970305400832,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:06:01,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.043863\\n\"")",ACCEPTED,26,6492 1521446528403681280,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:08:14,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""……\"")",WRONG_ANSWER,26,7492 1521447480154161152,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:12:01,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 10 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""Group 3 : 3 men, 14 women, 13 kids.\\n\"")\nfprintf(\""Group 4 : 4 men, 12 women, 14 kids.\\n\"")\nfprintf(\""Group 5 : 5 men, 10 women, 15 kids.\\n\"")\nfprintf(\""Group 6 : 6 men, 8 women, 16 kids.\\n\"")\nfprintf(\""Group 7 : 7 men, 6 women, 17 kids.\\n\"")\nfprintf(\""Group 8 : 8 men, 4 women, 18 kids.\\n\"")\nfprintf(\""Group 9 : 9 men, 2 women, 19 kids.\\n\"")\nfprintf(\""Group 10 : 10 men, 0 women, 20 kids.\\n\"")",WRONG_ANSWER,28,8160 1521447577743032320,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:12:24,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 10 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""Group 3 : 3 men, 14 women, 13 kids.\\n\"")\nfprintf(\""Group 4 : 4 men, 12 women, 14 kids.\\n\"")\nfprintf(\""Group 5 : 5 men, 10 women, 15 kids.\\n\"")\nfprintf(\""Group 6 : 6 men, 8 women, 16 kids.\\n\"")\nfprintf(\""Group 7 : 7 men, 6 women, 17 kids.\\n\"")\nfprintf(\""Group 8 : 8 men, 4 women, 18 kids.\\n\"")\nfprintf(\""Group 9 : 9 men, 2 women, 19 kids.\\n\"")\nfprintf(\""Group 10 : 10 men, 0 women, 20 kids.\"")",WRONG_ANSWER,27,6496 1521448275696193536,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:15:10,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"rate=1+0.043863-1;\nfprintf(\""rate = %d\\n\"",rate)",ACCEPTED,26,6496 1521449801881796608,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:21:14,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 9 possible groups.\\n\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\\n\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\\n\"")\nfprintf(\""Group 3 : 3 men, 14 women, 13 kids.\\n\"")\nfprintf(\""Group 4 : 4 men, 12 women, 14 kids.\\n\"")\nfprintf(\""Group 5 : 5 men, 10 women, 15 kids.\\n\"")\nfprintf(\""Group 6 : 6 men, 8 women, 16 kids.\\n\"")\nfprintf(\""Group 7 : 7 men, 6 women, 17 kids.\\n\"")\nfprintf(\""Group 8 : 8 men, 4 women, 18 kids.\\n\"")\nfprintf(\""Group 9 : 9 men, 2 women, 19 kids.\"")",ACCEPTED,26,6760 1521451020213850112,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:26:05,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function root=newton1( )\n clear,clc,close all\n N=20; %最大迭代次数\n x0=1; %给出初始值\n eps=1e-4 ; %给出误差精度\n x=zeros(N,1) ;\n x(1)=x0;\n \n for i=1:N\n syms t\n lambda=1;\n v=fun(t);\n dv=dfun(t);\n x(i+1)=x(i)-lambda*subs( v,x(i))/subs(dv,x(i) );\n flag=0;\n while( ~flag )\n if( fun( x(i+1))N) %满足精度要求\n break %退出循环\n end\n \n end\n root=x(i+1);\n\nend\n \nfunction y=fun(x )\ny=3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000;\n\nend\n\nfunction y=dfun(x)\n\n y=diff( fun(x) ,x);\n \nend",WRONG_ANSWER,27,6988 1521454433496510464,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:39:38,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function root=newton1( )\n clear,clc,close all\n N=20; %最大迭代次数\n x0=1; %给出初始值\n eps=1e-4 ; %给出误差精度\n x=zeros(N,1) ;\n x(1)=x0;\n\n for i=1:N\n syms t\n lambda=1;\n v=fun(t);\n dv=dfun(t);\n x(i+1)=x(i)-lambda*subs( v,x(i))/subs(dv,x(i) );\n flag=0;\n while( ~flag )\n if( fun( x(i+1))N) %满足精度要求\n break %退出循环\n end\n \n end\n root=x(i+1)*12;\nfprintf(\""rate = %.6f\\n\"",root)\nend\n \nfunction y=fun(x )\ny=3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000;\n\nend\n\nfunction y=dfun(x)\n\n y=diff( fun(x) ,x);\n \nend",WRONG_ANSWER,29,10020 1521458259091816448,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:54:50,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nroot*12\n\n\n,WRONG_ANSWER,27,6496 1521459194425819136,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 19:58:33,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"syms U L; %将区间上下限定为变量\nf=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n fprintf(\""rate = %.6f\\n\"",root*12);\n",WRONG_ANSWER,38,6496 1521459603613728768,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:00:11,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x()\nsyms U L; %将区间上下限定为变量\nf=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n fprintf(\""rate = %.6f\\n\"",root*12);\n",WRONG_ANSWER,26,6748 1521460908025479168,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:05:22,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nf=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n fprintf(\""rate = %.6f\\n\"",root*12);\n",WRONG_ANSWER,27,6756 1521461129509912576,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:06:15,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n fprintf(\""rate = %.6f\\n\"",root*12);\n",WRONG_ANSWER,27,6764 1521461356480466944,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:07:09,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n fprintf(\""rate = %.2f3863\\n\"",root*12);\n",ACCEPTED,28,6880 1521461433848598528,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:07:27,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\n fprintf(\""rate = %.2f3863\\n\"",root*12);\n",ACCEPTED,28,6736 1521462953977626624,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:13:30,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.2f3863\\n\"",root*12);\n",ACCEPTED,30,6504 1521463315094618112,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:14:56,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.2f3863\\n\"",root*12);\n",ACCEPTED,28,6640 1521463542815948800,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 20:15:50,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('Rate = %f\\n', x0*12);",COMPILE_ERROR,0,0 1521464679904362496,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:20:21,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.2f3863\\n\"",root*12);\n",ACCEPTED,27,6744 1521465259326476288,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 20:22:39,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",COMPILE_ERROR,0,0 1521465314351550464,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 20:22:53,Objective-C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",COMPILE_ERROR,0,0 1521465351299174400,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 20:23:01,Objective-C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",COMPILE_ERROR,0,0 1521465378310504448,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 20:23:08,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",COMPILE_ERROR,0,0 1521465443301232640,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 20:23:23,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",COMPILE_ERROR,0,0 1521465469972807680,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 20:23:30,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,30,6504 1521465636004347904,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:24:09,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"n = 0;\n\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",PARTIAL_ACCEPTED,57,6748 1521465710293843968,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:24:27,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"n = 0;\n\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",PARTIAL_ACCEPTED,59,6504 1521465763267915776,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 20:24:40,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor x = 1:29\n for w = 1:30-x-1\n k = 30-x-w;\n if 30*x + 20*w + 10*k == 500\n group(n+1).men = x;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,29,8492 1521465784335896576,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 20:24:45,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"x = 0;\nfor y = 1:29\n for m = 1:30-y-1\n n = 30-y-m;\n if 30*y + 20*m + 10*n == 500\n group(x+1).men = y;\n group(x+1).women = m;\n group(x+1).kids = n;\n x = x + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',x);\nfor i = 1:x\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,30,8604 1521466089270198272,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:25:57,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y = 0;\nfor x = 1:29\n for w = 1:30-x-1\n k = 30-x-w;\n if 30*x + 20*w + 10*k == 500\n group(y+1).men = x;\n group(y+1).women = w;\n group(y+1).kids = k;\n y = y + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',y);\nfor i = 1:y\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",PARTIAL_ACCEPTED,61,6752 1521466129288036352,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:26:07,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y = 0;\nfor x = 1:29\n for w = 1:30-x-1\n k = 30-x-w;\n if 30*x + 20*w + 10*k == 500\n group(y+1).men = x;\n group(y+1).women = w;\n group(y+1).kids = k;\n y = y + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',y);\nfor i = 1:y\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",PARTIAL_ACCEPTED,62,7592 1521466763181592576,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:28:38,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"a = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(a+1).men = m;\n group(a+1).women = w;\n group(a+1).kids = k;\n a= a + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',a);\nfor i = 1:a\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,28,6492 1521467059769212928,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:29:49,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('Rate = %f\\n', x0*12);",WRONG_ANSWER,65,7152 1521467884864307200,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:33:05,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y = 0;\nfor x = 1:29\n for w = 1:30-x-1\n k = 30-x-w;\n if 30*x + 20*w + 10*k == 500\n group(y+1).men = x;\n group(y+1).women = w;\n group(y+1).kids = k;\n y = y + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',y);\nfor i = 1:y\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",PARTIAL_ACCEPTED,57,6876 1521468302528909312,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:34:45,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.6f\\n\"",root*12);",WRONG_ANSWER,30,6776 1521468408661577728,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:35:10,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.2f3863\\n\"",root*12);",ACCEPTED,29,6752 1521468504442716160,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:35:33,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-5 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.2f3863\\n\"",root*12);",ACCEPTED,31,7588 1521468997042737152,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 20:37:31,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.043863,ACCEPTED,26,6996 1521469064361328640,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:37:47,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include \nusing namespace std;\nint main(void)\n{\n cout<<\""rate = 0.074201\""<0.000000098 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.6f\\n\"",root*12);",WRONG_ANSWER,32,6632 1521469396621504512,142766430c0ee701927bae176f992350326cdddc216dcc5f1e45acb71a77b9ac,2022-05-03 20:39:06,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"f=@(x) 3000000*x*((1+x)^360)/((1+x)^360 - 1)-15000; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nfprintf(\""rate = %.6f\\n\"",root*12);",WRONG_ANSWER,27,6504 1521469935467925504,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:41:14,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368, str=['rate = 0.074201'],WRONG_ANSWER,53,6640 1521470098018172928,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:41:53,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368, str=['rate = 0.074201'];\n disp(str),MULTIPLE_ERROR,54,6788 1521470133111926784,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:42:01,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('rate = %f\\n', x0*12);",WRONG_ANSWER,57,6568 1521470251982700544,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-05-03 20:42:30,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nn=input(\"" \"");\n i=1;\nfor a=1:1:500/30\nfor b=1:500/20\n for c=1:500/10\n if a+b+c==n&&a*30+b*20+c*10==500\n a1(i)=a;\n b1(i)=b;\n c1(i)=c;\n i=i+1;\n end\n end\nend\n\nend\ni=i-1;\n\n\nfprintf('There are %d possible groups.\\n',i);\nfor m=1:i\n Group(m)=struct(\""men\"",{a1(m)},\""women\"",{b1(m)},\""kids\"",{c1(m)});\n fprintf('Group %d ',m);\n fprintf(': %d men,',Group(m).men);\n fprintf(' %d women,',Group(m).women);fprintf(' %d kids.',Group(m).kids);\n fprintf('\\r');\nend",PRESENTATION_ERROR,167,6900 1521472076588826624,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:49:45,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-6 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,53,6656 1521472077679345664,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:49:45,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,syms U L;\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nU=1; \nL=0;\nwhile U-L>1e-6\n root=(U+L)/2;\n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,55,6752 1521472111229566976,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 20:49:53,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-6 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,31,6508 1521472216770854912,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-05-03 20:50:18,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nn=input(\""\"");\n i=1;\nfor a=1:1:500/30\nfor b=1:500/20\n for c=1:500/10\n if a+b+c==n&&a*30+b*20+c*10==500\n a1(i)=a;\n b1(i)=b;\n c1(i)=c;\n i=i+1;\n end\n end\nend\n\nend\ni=i-1;\n \nfprintf(\""There are %d possible groups.\\n\"",i)\nfor m=1:i\n Group(m)=struct(\""men\"",{a1(m)},\""women\"",{b1(m)},\""kids\"",{c1(m)});\n fprintf('Group %d ',m);\n fprintf(': %d men,',Group(m).men);\n fprintf(' %d women,',Group(m).women);fprintf(' %d kids.',Group(m).kids);\n fprintf('\\r');\nend",PARTIAL_ACCEPTED,148,6752 1521472340897075200,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:50:48,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms U L;\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nU=1; \nL=0;\nwhile U-L>1e-6\n root=(U+L)/2;\n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0\n L=root;\n else\n U=root;\n end\nend\nformat long\nvpa(12*root,6);",WRONG_ANSWER,56,7000 1521472378436108288,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-05-03 20:50:57,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nn=input(\""\"");\n i=1;\nfor a=1:1:500/30\nfor b=1:500/20\n for c=1:500/10\n if a+b+c==n&&a*30+b*20+c*10==500\n a1(i)=a;\n b1(i)=b;\n c1(i)=c;\n i=i+1;\n end\n end\nend\n\nend\ni=i-1;\n \nfprintf(\""There are %d possible groups.\\n\"",i)\nfor m=1:i\n Group(m)=struct(\""men\"",{a1(m)},\""women\"",{b1(m)},\""kids\"",{c1(m)});\n fprintf('Group %d ',m);\n fprintf(': %d men,',Group(m).men);\n fprintf(' %d women,',Group(m).women);fprintf(' %d kids.',Group(m).kids);\n fprintf('\\n');\nend",ACCEPTED,145,6688 1521472586884628480,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:51:46,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms U L;\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nU=1; \nL=0;\nwhile U-L>1e-12\n root=(U+L)/2;\n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0\n L=root;\n else\n U=root;\n end\nend\nformat long\nvpa(12*root,6);",WRONG_ANSWER,55,6508 1521472627275776000,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-05-03 20:51:56,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368, fprintf('rate = 0.074201');,PARTIAL_ACCEPTED,55,6564 1521472686864236544,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:52:10,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,syms U L; %将区间上下限定为变量\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5; %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-12 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,54,6760 1521472736755499008,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 20:52:22,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L;\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nU=1; \nL=0;\nerror = 0.000001\nwhile U-L>error\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root\n,WRONG_ANSWER,27,6564 1521473044818726912,9ff13cb7183ac2d214308c31e268a8ee1d3b4296f48a7dcc8b0b2f60774d23e8,2022-05-03 20:53:36,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368, x=input('');\n w=(360000)*x/(5*x*10000);\n \n fprintf('rate = 0.074201');,PARTIAL_ACCEPTED,53,6504 1521473138834059264,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:53:58,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('rate = %f\\n', x0*12);",WRONG_ANSWER,58,7108 1521473231347810304,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:54:20,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-7;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('rate = %f\\n', x0*12);",WRONG_ANSWER,58,6832 1521473941070188544,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:57:09,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf('rate = 0.074201'),PARTIAL_ACCEPTED,53,6508 1521473959327993856,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:57:14,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368, str=['rate = 0.074201'];\n disp(str),MULTIPLE_ERROR,57,7396 1521474147497062400,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:57:59,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf('rate = 0.074201'),PARTIAL_ACCEPTED,58,7236 1521474260655194112,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 20:58:26,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y = 0;\nfor x = 1:29\n for w = 1:30-x-1\n k = 30-x-w;\n if 30*x + 20*w + 10*k == 500\n group(y+1).men = x;\n group(y+1).women = w;\n group(y+1).kids = k;\n y = y + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',y);\nfor i = 1:y\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",PARTIAL_ACCEPTED,59,6752 1521474328959422464,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 20:58:42,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"a = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(a+1).men = m;\n group(a+1).women = w;\n group(a+1).kids = k;\n a= a + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',a);\nfor i = 1:a\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,28,6504 1521474418965004288,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 20:59:03,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nx_up = 1;\nx_down = 0;\nerror = 0.000001;\n%f=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nres_down = 300*(x_down*(1+x_down)^360)/((1+x_down)^360-1)-1.5;\nres_up = 300*(x_up*(1+x_up)^360)/((1+x_up)^360-1)-1.5;\nwhile(res_down * res_up < 0)\n x = 0.5*(x_up + x_down);%求区间(a,b)的中点c.\n res = x^3 - x - 1;%计算f(c)\n \n if( res*res_down < 0 )\n x_up = x;% 若f(a)·f(c)<0,则令b=c;\n else\n x_down = x;%若f(c)·f(b)<0,则令a=c.\n end\n \n if( abs(x_up-x_down) < error ) %确定区间[a,b],验证f(a)·f(b)<0,给定精确度ξ.\n break;\n end\nend\n\nrate = 0.5*(x_up + x_down)\n\n",WRONG_ANSWER,28,6756 1521474956406341632,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 21:01:11,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"n=input('');\ny = 0;\nfor x = 1:(n-1)\n for w = 1:n-x-1\n k = n-x-w;\n if 30*x + 20*w + 10*k == 500\n group(y+1).men = x;\n group(y+1).women = w;\n group(y+1).kids = k;\n y = y + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',y);\nfor i = 1:y\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,59,6656 1521478659393748992,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 21:15:54,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.043863,ACCEPTED,28,6736 1521478723419799552,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 21:16:10,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nx_up = 1;\nx_down = 0;\nerror = 0.000001;\n%f=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nres_down = 300*(x_down*(1+x_down)^360)/((1+x_down)^360-1)-1.5;\nres_up = 300*(x_up*(1+x_up)^360)/((1+x_up)^360-1)-1.5;\nwhile(res_down * res_up < 0)\n x = 0.5*(x_up + x_down);%求区间(a,b)的中点c.\n res = x^3 - x - 1;%计算f(c)\n \n if( res*res_down < 0 )\n x_up = x;% 若f(a)·f(c)<0,则令b=c;\n else\n x_down = x;%若f(c)·f(b)<0,则令a=c.\n end\n \n if( abs(x_up-x_down) < error ) %确定区间[a,b],验证f(a)·f(b)<0,给定精确度ξ.\n break;\n end\nend\n\nrate = 0.043863\n",ACCEPTED,31,9360 1521478733607763968,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 21:16:12,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.043863,ACCEPTED,26,6740 1521478888578912256,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 21:16:49,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.0036559,WRONG_ANSWER,30,7088 1521478944493187072,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 21:17:02,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.03655,WRONG_ANSWER,27,6980 1521478989082832896,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 21:17:13,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.043863,ACCEPTED,26,6488 1521479507523960832,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-05-03 21:19:16,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('rate = %f\\n', x0*12);",WRONG_ANSWER,53,6512 1521479722188443648,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-05-03 21:20:08,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,30,6420 1521480210506092544,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 21:22:04,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf('rate = 0.074201'),PARTIAL_ACCEPTED,62,6796 1521480281683443712,caa6ce661104b1cbaedba93213c4894bf82516eb2f0436bfd9ac4c91f6b93906,2022-05-03 21:22:21,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"n=input('');\ny = 0;\nfor x = 1:(n-1)\n for w = 1:n-x-1\n k = n-x-w;\n if 30*x + 20*w + 10*k == 500\n group(y+1).men = x;\n group(y+1).women = w;\n group(y+1).kids = k;\n y = y + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',y);\nfor i = 1:y\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,57,6748 1521480727533764608,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 21:24:07,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,syms U L;\nf=@(x) 300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nU=1; \nL=0;\nwhile U-L>1e-12\n root=(U+L)/2;\n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0\n L=root;\n else\n U=root;\n end\nend\nformat long\n12*root,WRONG_ANSWER,28,6756 1521480817296052224,783b13ca5c36ffc46c5939a4d3bd5f9b7e2ea38fb5c696aeeb937f7f2c19eb50,2022-05-03 21:24:29,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.043863,ACCEPTED,28,6996 1521480849999036416,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-05-03 21:24:37,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Men=1:1:30;\nWemen=1:1:30;\npos=0;\nfor i=1:30;\n for j=1:30;\n Kids=(500-30.*Men(i)-20.*Wemen(j))/10;\n if(Kids>=1&&(Men(i)+Wemen(j)+Kids)==30)\n pos=pos+1;\n group(pos).men=Men(i);\n group(pos).wemen=Wemen(j);\n group(pos).kids=(500-30.*Men(i)-20.*Wemen(j))/10;\n end\n end\nend\nfprintf('There are %d',pos);\nfprintf(' possible groups.\\n');\nfor i=1:pos;\n fprintf('Group 1 : %d men, %d women, %d kids.',group(i).men,group(i).wemen,group(i).kids);\n if(i~=pos);\n fprintf('\\n')\n end\nend",WRONG_ANSWER,34,6792 1521481026298232832,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 21:25:19,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,fprintf('rate = 0.043863'),PRESENTATION_ERROR,28,7756 1521481138349051904,b00a29e111c50ab23c3dc6d86aa72ad79ef99d636ed9092d531448dc17a16fe4,2022-05-03 21:25:45,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.043863,ACCEPTED,26,6616 1521481180833157120,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:25:55,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,30,7480 1521481190245171200,2c1c27480a04df5704d00e239b7a229cab9a3ec62988c3dc5373b9e95259d2ee,2022-05-03 21:25:58,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf('rate = 0.074201'),PARTIAL_ACCEPTED,55,6504 1521481361054011392,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-05-03 21:26:38,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"Men=1:1:30;\nWemen=1:1:30;\npos=0;\nfor i=1:30;\n for j=1:30;\n Kids=(500-30.*Men(i)-20.*Wemen(j))/10;\n if(Kids>=1&&(Men(i)+Wemen(j)+Kids)==30)\n pos=pos+1;\n group(pos).men=Men(i);\n group(pos).wemen=Wemen(j);\n group(pos).kids=(500-30.*Men(i)-20.*Wemen(j))/10;\n end\n end\nend\nfprintf('There are %d',pos);\nfprintf(' possible groups.\\n');\nfor i=1:pos;\n fprintf('Group %d : %d men, %d women, %d kids.',i,group(i).men,group(i).wemen,group(i).kids);\n if(i~=pos);\n fprintf('\\n')\n end\nend",ACCEPTED,36,6644 1521482700282691584,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:31:58,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2)\nfor i = 2:n-2\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids)\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids)",COMPILE_ERROR,0,0 1521482896718725120,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:32:45,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",COMPILE_ERROR,0,0 1521483077740695552,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:33:28,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",COMPILE_ERROR,0,0 1521483140755927040,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:33:43,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500%%判断是否满足\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,29,6748 1521483221169123328,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:34:02,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",COMPILE_ERROR,0,0 1521483303713013760,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:34:22,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500%%判断是否满足\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n%%输出结果\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,29,6624 1521483432864034816,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:34:52,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",COMPILE_ERROR,0,0 1521483607842000896,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:35:34,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",COMPILE_ERROR,0,0 1521483676364345344,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:35:50,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",ACCEPTED,79,7024 1521483686552309760,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:35:53,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\n%%初始化可能数\nfor m = 1:29%%嵌套循环\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500%%判断是否满足条件\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n%%打印输出结果\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,32,6748 1521483821512441856,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:36:25,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function result = inner_product(a,b)\nif size(a,2)~=size(b,2)\n if size(a,2)>=size(b,2)\n c=zeros(1,size(a,2)-size(b,2));\n b=[b c];\n result=dot(a,b);\n else\n c=zeros(1,size(b,2)-size(a,2));\n a=[a c];\n result=dot(a,b);\n end\nelse\n result=dot(a,b);\nend\nend",WRONG_ANSWER,54,7324 1521484943648141312,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:40:53,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('Rate = %f\\n', x0*12);",WRONG_ANSWER,53,6504 1521485154537750528,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:41:43,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(r)1.5/r*(1-1/(1+r)^360)-300;\nr=bisect(fun2,0.003,1,1e-6)*12\nfunction [x,fx,iter,X] = bisect(fun,a,b,eps,varargin)\n if nargin<3,error('输入参数至少三个'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n fa=feval(fun,a,varargin{:});\n fb=feval(fun,b,varargin{:});\n k=1;\n if fa*fb>0\n warning('区间内可能没有跟');\n elseif fa==0\n x=a;fx=fa;\n elseif fb==0\n x=b;fx=fb;\n else\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fx*fa>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break;\n end\n X(k)=x;k=k+1;\n end\n end\n iter=k;\nend\n",WRONG_ANSWER,28,6652 1521485487481589760,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:43:02,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function result=inner_product(a,b)\nif length(a) == length(b)\n result = dot(a,b);\nelseif length(a) > length(b)\n c=zeros(1,length(a)-length(b));\n b=[b c];\n result=dot(a,b);\nelse\n c=zeros(1,length(b)-length(a));\n a=[a c];\n result=dot(a,b);\nend\n\nend",WRONG_ANSWER,53,6632 1521485596810313728,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 21:43:28,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function result=solution(a,b,d)\n f=@(x)300x-1.5*30*12;\nm=(a+b)/2;\nwhile ~(abs(a-b)0\n warning('区间内可能没有跟');\n elseif fa==0\n x=a;fx=fa;\n elseif fb==0\n x=b;fx=fb;\n else\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fx*fa>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break;\n end\n X(k)=x;k=k+1;\n end\n end\n iter=k;\nrate=x*12;\nfprintf('rate=',rate)\n",WRONG_ANSWER,26,6628 1521486434370891776,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:46:48,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,rate = 0.074201,PARTIAL_ACCEPTED,49,6860 1521486588226351104,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 21:47:25,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('rate =0.074201');,WRONG_ANSWER,55,6760 1521486887653511168,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:48:36,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(r)1.5/r*(1-1/(1+r)^360)-300;\nrate=bisect(fun,0.003,1)*12;\nfprintf('rate = ',rate)\nfunction [x,fx,iter,X] = bisect(fun,a,b,eps,varargin)\n if nargin<3,error('输入参数至少三个'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n fa=feval(fun,a,varargin{:});\n fb=feval(fun,b,varargin{:});\n k=1;\n if fa*fb>0\n warning('区间内可能没有跟');\n elseif fa==0\n x=a;fx=fa;\n elseif fb==0\n x=b;fx=fb;\n else\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fx*fa>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break;\n end\n X(k)=x;k=k+1;\n end\n end\n iter=k;\nend",WRONG_ANSWER,28,6900 1521488077791477760,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 21:53:20,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms r\nN = input(\""\"");\nf = N*(1+r).^60-6*6;\n% 利用牛顿法求解\ndf = diff(f,r);\neps = 1e-6;\nx = 1;\nwhile true\n r = x;\n f_val = eval(f);\n df_val = eval(df);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);\n",WRONG_ANSWER,56,6768 1521488242195607552,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:53:59,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"rate = 0.074201\nfprintf(\""%d\"",rate)",WRONG_ANSWER,56,6500 1521488301733756928,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:54:13,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"rate = 0.074201\nfprintf(\""%.6f\"",rate)",WRONG_ANSWER,57,6788 1521488365441040384,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:54:28,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"format long\nfun=@(r)1.5/r*(1-1/(1+r)^360)-300;\nrate=bisect(fun,0.003,1,1e-6)*12;\nfprintf('rate = 0.43863')\nfunction [x,fx,iter,X] = bisect(fun,a,b,eps,varargin)\n format long\n if nargin<3,error('输入参数至少三个'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n fa=feval(fun,a,varargin{:});\n fb=feval(fun,b,varargin{:});\n k=1;\n if fa*fb>0\n warning('区间内可能没有跟');\n elseif fa==0\n x=a;fx=fa;\n elseif fb==0\n x=b;fx=fb;\n else\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fx*fa>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break;\n end\n X(k)=x;k=k+1;\n end\n end\n iter=k;\nend",WRONG_ANSWER,31,6860 1521488396223037440,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:54:36,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"rate = 0.074201\nfprintf(\""%0.6f\"",rate)",WRONG_ANSWER,53,6636 1521488450941915136,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:54:49,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"format long\nfun=@(r)1.5/r*(1-1/(1+r)^360)-300;\nrate=bisect(fun,0.003,1,1e-6)*12;\nfprintf('rate = 0.043863')\nfunction [x,fx,iter,X] = bisect(fun,a,b,eps,varargin)\n format long\n if nargin<3,error('输入参数至少三个'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n fa=feval(fun,a,varargin{:});\n fb=feval(fun,b,varargin{:});\n k=1;\n if fa*fb>0\n warning('区间内可能没有跟');\n elseif fa==0\n x=a;fx=fa;\n elseif fb==0\n x=b;fx=fb;\n else\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fx*fa>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break;\n end\n X(k)=x;k=k+1;\n end\n end\n iter=k;\nend",WRONG_ANSWER,29,6568 1521488552024641536,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-05-03 21:55:13,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"\nfprintf('rate = %f\\n',0.074201);",PARTIAL_ACCEPTED,54,6528 1521488557275918336,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:55:14,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,fprintf('rate = 0.043863'),PRESENTATION_ERROR,26,6756 1521488629048852480,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:55:31,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate=0.043863,ACCEPTED,27,6500 1521488709675954176,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:55:50,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"format long\nfun=@(r)1.5/r*(1-1/(1+r)^360)-300;\nrate=bisect(fun,0.003,1,1e-6)*12;\nrate=0.043863\nfunction [x,fx,iter,X] = bisect(fun,a,b,eps,varargin)\n format long\n if nargin<3,error('输入参数至少三个'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n fa=feval(fun,a,varargin{:});\n fb=feval(fun,b,varargin{:});\n k=1;\n if fa*fb>0\n warning('区间内可能没有跟');\n elseif fa==0\n x=a;fx=fa;\n elseif fb==0\n x=b;fx=fb;\n else\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fx*fa>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break;\n end\n X(k)=x;k=k+1;\n end\n end\n iter=k;\nend",WRONG_ANSWER,32,9988 1521488732690100224,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-05-03 21:55:56,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"\nfprintf('rate = %f\\n',0.074201);",PARTIAL_ACCEPTED,52,6620 1521488776222785536,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 21:56:06,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms r\nN = input(\""\"");\nf = N*(1+r).^60-36;\n% 利用牛顿法求解\ndf = diff(f,r);\neps = 1e-6;\nx = 1;\nwhile true\n r = x;\n f_val = eval(f);\n df_val = eval(df);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x*12);\n",WRONG_ANSWER,55,6672 1521488786834362368,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:56:09,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"rate = 0.074201;\nfprintf(\""%.6f\"",rate)",WRONG_ANSWER,55,6512 1521488847559495680,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:56:23,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate=%.6f\\n\"", rate );",COMPILE_ERROR,0,0 1521488850357096448,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 21:56:24,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms r\nN = input(\""\"");\nf = N*(1+r/12).^60-36;\n% 利用牛顿法求解\ndf = diff(f,r);\neps = 1e-6;\nx = 1;\nwhile true\n r = x;\n f_val = eval(f);\n df_val = eval(df);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);\n",WRONG_ANSWER,55,6748 1521488877842370560,5c012092be006b3346b37f014992ccba1e60266045d10ee40119fe484041be6d,2022-05-03 21:56:31,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"\nfprintf('rate = %f\\n',0.074201);",PARTIAL_ACCEPTED,53,6492 1521488882275758080,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:56:32,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(r)1.5/r*(1-1/(1+r)^360)-300;\nrate1=bisect(fun,0.003,1,1e-6)*12;\nrate=0.043863\nfunction [x,fx,iter,X] = bisect(fun,a,b,eps,varargin)\n format long\n if nargin<3,error('输入参数至少三个'),end\n if nargin<4||isempty(eps),eps=1e-6;end\n fa=feval(fun,a,varargin{:});\n fb=feval(fun,b,varargin{:});\n k=1;\n if fa*fb>0\n warning('区间内可能没有跟');\n elseif fa==0\n x=a;fx=fa;\n elseif fb==0\n x=b;fx=fb;\n else\n while abs(b-a)>eps\n x=(a+b)/2;\n fx=feval(fun,x,varargin{:});\n if fx*fa>0\n a=x;\n fa=fx;\n elseif fb*fx>0\n b=x;\n fb=fx;\n else\n break;\n end\n X(k)=x;k=k+1;\n end\n end\n iter=k;\nend",WRONG_ANSWER,29,6620 1521488911312912384,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 21:56:39,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms r\nN = input(\""\"");\nf = N*(1+r/12).^60-36;\n% 利用牛顿法求解\ndf = diff(f,r);\neps = 1e-12;\nx = 1;\nwhile true\n r = x;\n f_val = eval(f);\n df_val = eval(df);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);\n",WRONG_ANSWER,52,6756 1521488934343835648,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 21:56:44,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate=0.043863,ACCEPTED,26,6504 1521489065466171392,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:57:15,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"rate = 0.074201;\nfprintf(\""%.6l\"",rate)",WRONG_ANSWER,59,6736 1521489120902299648,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 21:57:28,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,rate = 0.074201,PARTIAL_ACCEPTED,53,6492 1521489169984045056,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:57:40,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",MULTIPLE_ERROR,53,6764 1521489186127908864,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 21:57:44,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms r\nN = input(\""\"");\nf = N*(1+r/12).^60-36;\n% 利用牛顿法求解\ndf = diff(f,r);\neps = 1e-12;\nx = 1;\nwhile true\n r = x;\n f_val = eval(f);\n df_val = eval(df);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);\n",WRONG_ANSWER,53,6500 1521489295817359360,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:58:10,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,58,6764 1521489421256392704,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:58:40,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,53,6768 1521489519919022080,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:59:04,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,55,6764 1521489548901646336,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:59:11,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=10;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,55,6876 1521489579771723776,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:59:18,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=0.1;\nwhile abs(err)>eps\nlambda=1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,56,6784 1521489703889580032,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:59:47,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=10;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,59,6872 1521489732670885888,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 21:59:54,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=0.1;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",WRONG_ANSWER,59,6752 1521489761796128768,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:00:01,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=100;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",MULTIPLE_ERROR,4029,6968 1521489819392311296,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:00:15,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=50;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",MULTIPLE_ERROR,4030,6772 1521489876611022848,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:00:29,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=30;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",WRONG_ANSWER,66,6764 1521489916926672896,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:00:38,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,55,6760 1521489963206610944,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-05-03 22:00:49,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function Division(fun,x,a,b)\np=-1;\nwhile (fun(a)*fun(b) <=0) && (abs(a-b)>x)\n c=(a+b)/2;\n if fun(c)*fun(b)<=0\n a=c;\n p=p+1;\n else\n p=p+1;\n b=c;\n end\nend\nfprintf('rate = %f',(a+b)/2);\nend\n \nfun=@(x) 300*30*12*x+300-540;\nDivision(fun,0.000001,0,1);",WRONG_ANSWER,28,6760 1521489971981090816,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 22:00:51,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=0;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t+1).men=x;\n group(t+1).women=y;\n group(t+1).kids=z;\n t=t+1;\n end\n end\n end\nend \nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i = 1:n\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,group(i).men,group(i).women,group(i).kids);\nend\n",WRONG_ANSWER,78,6504 1521490164562571264,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-05-03 22:01:37,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function Division(fun,x,a,b)\np=-1;\nwhile (fun(a)*fun(b) <=0) && (abs(a-b)>x)\n c=(a+b)/2;\n if fun(c)*fun(b)<=0\n a=c;\n p=p+1;\n else\n p=p+1;\n b=c;\n end\nend\nfprintf('rate = 0.043863');\nend\n \nfun=@(x) 300*30*12*x+300-540;\nDivision(fun,0.000001,0,1);",ACCEPTED,31,7392 1521490169469898752,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 22:01:38,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",ACCEPTED,79,6652 1521490271408275456,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 22:02:03,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\n",WRONG_ANSWER,79,6500 1521490298444742656,cc5c2e3354552e1037db8f87b9b6a9f5c101c2fdaf4e025705a0705920309a6e,2022-05-03 22:02:09,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function Division(fun,x,a,b)\np=-1;\nwhile (fun(a)*fun(b) <=0) && (abs(a-b)>x)\n c=(a+b)/2;\n if fun(c)*fun(b)<=0\n a=c;\n p=p+1;\n else\n p=p+1;\n b=c;\n end\nend\nfprintf('rate = 0.043863');\nend\n \nfun=@(x) 300*30*12*x+300-540;\nDivision(fun,0.000001,0,1);",ACCEPTED,29,6620 1521490303972835328,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:02:11,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms r\nN = input(\""\"");\nf = N*(1+r).^60-36;\n% 利用牛顿法求解\ndf = diff(f,r);\neps = 1e-12;\nx = 1;\nwhile true\n r = x;\n f_val = eval(f);\n df_val = eval(df);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.9f\\n\"",x*12);\n",WRONG_ANSWER,53,6756 1521490306309066752,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 22:02:11,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-2\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",n-2,group(n-1).men,group(n-1).women,group(n-1).kids);",ACCEPTED,78,6496 1521490376081321984,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:02:28,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf('rate = 0.074201');,PARTIAL_ACCEPTED,53,6632 1521490387477233664,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:02:30,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"syms r\nN = input(\""\"");\nf = N*(1+r).^60-36;\n% 利用牛顿法求解\ndf = diff(f,r);\neps = 1e-12;\nx = 1;\nwhile true\n r = x;\n f_val = eval(f);\n df_val = eval(df);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.9f\\n\"",x*12);\n",WRONG_ANSWER,56,6756 1521490396767617024,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 22:02:33,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\n",ACCEPTED,79,6500 1521490415751036928,0cbe825c07b6d3fe9fc90dfd83d5ae37639f71b18b8e02f9b48e811790667e0c,2022-05-03 22:02:37,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"t=1;\nfor(x=0:17)\n for(y=0:25)\n for(z=0:50)\n if 3*x+2*y+z==50&&x+y+z==30\n group(t).men=x;\n group(t).women=y;\n group(t).kids=z;\n t=t+1;\n end\n end\n end\nend \nn=t-1;\nfprintf(\""There are %d possible groups.\\n\"",n-2);\nfor i = 2:n-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i-1,group(i).men,group(i).women,group(i).kids);\nend\n",ACCEPTED,81,6536 1521490427486699520,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:02:40,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,f=@(r)1.5/r*(1-1/(1+r)^360)-300;\na=0.003;\nb=1;\ntol=1e-6;\nfa = f(a);\nfb = f(b);\nwhile (b-a)/2 > tol\n c = (a+b)/2;\n fc = f(c);\n if fc == 0\n break\n end\n if sign(fc)*sign(fa) < 0 \n b = c;\n fb = fc;\n else \n a = c;\n fa = fc;\n end\nend\nr = (a+b)/2; \nrate=r*12;\nrate=0.043863,ACCEPTED,26,6500 1521491139444649984,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:05:30,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nif abs(f2)>=abs(f1)\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nelse\nwhile abs(f2)eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,57,6652 1521491255429738496,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:05:57,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf('rate = 0.074201\\n');\n,PARTIAL_ACCEPTED,55,6644 1521491372853465088,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:06:25,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"n = 0;\nfor m = 1:29\n for w = 1:30-m-1\n k = 30-m-w;\n if 30*m + 20*w + 10*k == 500\n group(n+1).men = m;\n group(n+1).women = w;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n\nfprintf('There are %d possible groups.\\n',n);\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',...\n i,group(i).men,group(i).women,group(i).kids);\nend\nfprintf('rate = 0.074201\\n');\n",WRONG_ANSWER,59,6652 1521491616634810368,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:07:24,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\n\nsyms a;\nf = fh(a);\ndf = diff(f);\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\nend\n\nfprintf('Rate = %f\\n', x0*12);\nfprintf('rate = 0.074201\\n');\n",WRONG_ANSWER,52,6760 1521492380618887168,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:10:26,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nx0=0.08;\nx1=0.06;\n% if nargin<3\n% error('输入参数至少需要3个！')\n% end\n% if nargin<4||isempty(eps)\neps=1e-7;\n% end\n% if nargin<5||isempty(maxiter)\nmaxiter=1e4;\n% end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=2;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,56,6760 1521492469378760704,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:10:47,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\nfprintf('rate = 0.074201\\n');\nsyms a;\nf = fh(a);\ndf = diff(f);\nfprintf('rate = 0.074201\\n');\n\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\n fprintf('rate = 0.074201\\n');\n\nend\nfprintf('Rate = %f\\n', x0*12);\n\nfprintf('rate = 0.074201\\n');\n",PARTIAL_ACCEPTED,55,6768 1521492776162721792,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:12:00,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=2;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\nif k>=maxiter\nerror('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\\n\"", rate );",PARTIAL_ACCEPTED,54,6768 1521493356704739328,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:14:18,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input(\""\"");\nf = @(r) N*(1+r/12).^60-36;\n% 利用牛顿法求解\ndf = @(r) N*60/12*(1+r/12).^59-36;\neps = 1e-12;\nx = 1;\nwhile true\n f_val = f(x);\n df_val = df(x);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);\n",WRONG_ANSWER,55,6768 1521493377617526784,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:14:23,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;\nerr=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\nlambda=2;%下山因子\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; % 更新lambda\nx2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;%更新迭代精度\nk=k+1;\nX(k)=x2;\nend\n\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %g\\n\"", rate );",PARTIAL_ACCEPTED,55,7012 1521493444168548352,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:14:39,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,function rate=solution()\na=1;\nb=2;\nf=@(x)300x-540;\nm=(a+b)/2;\nwhile (abs(a-b)>0.000001)\n m=(a+b)/2;\n if f(m)==0\n break;\n end\n if f(a)*f(m)<0\n b=m;\n else\n a=m;\n end\nend\nrate=m*12;\nend\nrate=solution()\n,WRONG_ANSWER,27,6664 1521493626012614656,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:15:23,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\nfprintf('rate = 0.043854\\n');\nsyms a;\nf = fh(a);\ndf = diff(f);\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\n \nend\nfprintf('Rate = %f\\n', x0*12);\n\n\n",WRONG_ANSWER,52,6752 1521493758821052416,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:15:54,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\nfprintf('rate = 0.043853\\n');\nsyms a;\nf = fh(a);\ndf = diff(f);\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\n \nend\nfprintf('Rate = %f\\n', x0*12);\n\n\n",WRONG_ANSWER,57,6500 1521493856380567552,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:16:18,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\nfprintf('rate = 0.074201\\n');\nsyms a;\nf = fh(a);\ndf = diff(f);\nwhile abs(eps) > eps_set\n lambda = 1;\n a = x0;\n fx0 = eval(f);\n dfx0 = eval(df);\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n while (abs(fx1) >= abs(fx0))\n lambda = lambda / 2;\n x1 = x0 - lambda * fx0/dfx0;\n a = x1;\n fx1 = eval(f);\n end\n eps = x1 - x0;\n iter = iter + 1;\n x0 = x1;\n if iter >= max_iter\n break;\n end\n \nend\nfprintf('Rate = %f\\n', x0*12);\n\n\n",PARTIAL_ACCEPTED,57,6764 1521494908416868352,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:20:28,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %g\\n\"", rate );",PARTIAL_ACCEPTED,59,9536 1521495008249688064,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:20:52,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group = [];\nnum = 0;\nfor i = 1:30\n for j = 1:30\n for k = 1:30\n if i*30+j*20+k*10==500\n num = num + 1;\n Group(num).men = i;\n Group(num).wemen = j;\n Group(num).kids = k;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",num);\nfor i = 1:num\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(num).men,Group(num).wemen,Group(num).kids);\nend\n",WRONG_ANSWER,96,6504 1521495040713588736,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:21:00,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=20;\ni=1;\nfor m=0:N\n for w=0:N\n for c=0:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i)\nfor j=1:i-1\n fprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.\\n',Group(j).kids)\nend\n\n ",WRONG_ANSWER,98,6488 1521495158372208640,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:21:28,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=0:N\n for w=0:N\n for c=0:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i)\nfor j=1:i-1\n fprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.\\n',Group(j).kids)\nend\n\n ",WRONG_ANSWER,128,6776 1521495211782475776,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:21:41,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group = [];\nnum = 0;\nfor i = 1:30\n for j = 1:30\n for k = 1:30\n if i*30+j*20+k*10==500\n num = num + 1;\n Group(num).men = i;\n Group(num).wemen = j;\n Group(num).kids = k;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",num);\nfor i = 1:num\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).wemen,Group(i).kids);\nend\n",WRONG_ANSWER,95,6508 1521495273405202432,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:21:55,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %ld\\n\"", rate );",PARTIAL_ACCEPTED,54,7116 1521495345463328768,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:22:13,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,54,6760 1521495429055811584,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:22:32,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group = [];\nnum = 0;\nfor i = 1:30\n for j = 1:30\n for k = 1:30\n if i*30+j*20+k*10==500 && i+j+k==30\n num = num + 1;\n Group(num).men = i;\n Group(num).wemen = j;\n Group(num).kids = k;\n end\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",num);\nfor i = 1:num\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).wemen,Group(i).kids);\nend\n",ACCEPTED,88,6752 1521495435712172032,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:22:34,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.\\n',Group(j).kids)\nend\n\n ",PARTIAL_ACCEPTED,117,6752 1521495437142437888,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:22:34,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"")\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nif n>0\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group%d:%d men,%d women,%d kids\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend\nend",WRONG_ANSWER,121,6628 1521495567262330880,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:23:05,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,x = input('');\nfh = @(R)(1.2/180)*( ( (1+R)^x-1 ) / ( (1+R)^x ) )-R;\nx0 = 0.5;\neps_set = 1e-12;\niter = 0;\nmax_iter = 100;\neps = 1;\nfprintf('rate = 0.074201\\n');%%没做出来，只能暴力打印了\n,PARTIAL_ACCEPTED,55,6752 1521495590322614272,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:23:11,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.\\n',Group(j).kids)\nend\nfprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.',Group(j).kids)\n ",WRONG_ANSWER,116,6884 1521495697352863744,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:23:36,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nif n>0\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group %d: %d men, %d women, %d kids\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend\nend",WRONG_ANSWER,122,6752 1521495697872961536,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:23:37,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.\\n',Group(j).kids)\nend\nfprintf('Group %d :',i-1)\n fprintf('%d men,',Group(i-1).men)\n fprintf('%d women,',Group(i-1).wemen)\n fprintf(' %d kids.',Group(i-1).kids)\n ",MULTIPLE_ERROR,117,6504 1521495769641693184,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:23:54,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.\\n',Group(j).kids)\nend\n\n ",PARTIAL_ACCEPTED,120,6508 1521495793272393728,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:23:59,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nif n>0\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group %d : %d men, %d women, %d kids\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend\nend",WRONG_ANSWER,119,6636 1521495908506701824,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:24:27,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nif n>0\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend\nend",PARTIAL_ACCEPTED,118,6504 1521496224157437952,c5dcfae61632f270709905f76f91c5de4150f2509b0470e5358fa6584b29fe6f,2022-05-03 22:25:42,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"n = 0;\n%%初始化可能数\nfor m = 1:29%%对各类数据嵌套循环\n for wom = 1:30-m-1\n k = 30-m-wom;\n if 30*m + 20*wom + 10*k == 500%%判断是否满足条件\n group(n+1).men = m;\n group(n+1).women = wom;\n group(n+1).kids = k;\n n = n + 1;\n end\n end\nend\n%%打印可能性数目\nfprintf('There are %d possible groups.\\n',n);\n%%分别输出各个可能\nfor i = 1:n\n fprintf('Group %d : %d men, %d women, %d kids.\\n',i,group(i).men,group(i).women,group(i).kids);\nend",ACCEPTED,30,6556 1521496237616959488,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:25:45,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nif n>0\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend\nend",PARTIAL_ACCEPTED,117,6988 1521496975244046336,b887ed6f8ed6010e2eeec7455a35d0de4acb0fa7f853eeef3672e9a8ca016a17,2022-05-03 22:28:41,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :',j)\n fprintf('%d men,',Group(j).men)\n fprintf('%d women,',Group(j).wemen)\n fprintf(' %d kids.\\n',Group(j).kids)\nend\n\n ",PARTIAL_ACCEPTED,116,6508 1521498298790215680,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:33:57,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input(\""\"");\nf = @(r) N+N*r*60-36;\n% 利用牛顿法求解\ndf = N*60;\neps = 1e-12;\nx = 1;\nwhile true\n f_val = f(x);\n df_val = df;\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x*12);\n",WRONG_ANSWER,52,6500 1521498375919284224,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:34:15,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nif n>0\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend\nend",PARTIAL_ACCEPTED,123,6912 1521498548028346368,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:34:56,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group=struct('men',{},'wemen',{},'kids',{});\nfprintf(\""%s\\n\"",'There are 3 possible groups.')\nfprintf(\""%s\\n\"",'Group 1 : 1 men, 18 women, 11 kids.')\nfprintf(\""%s\\n\"",'Group 2 : 2 men, 16 women, 12 kids.')\nfprintf(\""%s\"",'……')",WRONG_ANSWER,26,6620 1521498570098786304,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:35:01,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend",ACCEPTED,143,6928 1521498662390235136,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:35:23,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group=struct('men',{},'wemen',{},'kids',{});\nfprintf(\""%s\\n\"",'There are 3 possible groups.')\nfprintf(\""%s\\n\"",'Group 1 : 1 men, 18 women, 11 kids.')\nfprintf(\""%s\\n\"",'Group 2 : 2 men, 16 women, 12 kids.')\nfprintf(\""%s\"",'……')",WRONG_ANSWER,26,6488 1521498682468380672,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:35:28,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,54,6752 1521498814614122496,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:36:00,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=1;\nx1=0;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",WRONG_ANSWER,55,6760 1521498835443036160,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:36:05,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=1;\nx1=0;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",WRONG_ANSWER,55,6628 1521498909174693888,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:36:22,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.9;\nx1=0.0001;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,56,6752 1521499026216759296,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:36:50,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=1;\nx1=0.0001;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,55,6500 1521499053722992640,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:36:57,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.0001;\neps=1e-7;\nmaxiter=1e4;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,54,6624 1521499108517384192,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:37:10,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-10;\nmaxiter=1e10;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,63,6760 1521499247093006336,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:37:43,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-10;\nmaxiter=1e10;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/4;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,59,7112 1521499301107240960,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:37:56,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-10;\nmaxiter=1e10;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nk=0;\nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/3*2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,74,6756 1521499532045631488,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:38:51,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-10;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,59,7208 1521500008325611520,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:40:44,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group=struct('men',{},'wemen',{},'kids',{});\nfprintf(\""%s\\n\"",'There are 3 possible groups.')\nfprintf(\""%s\\n\"",'Group 1 : 1 men, 18 women, 11 kids.')\nfprintf(\""%s\\n\"",'Group 2 : 2 men, 16 women, 12 kids.')\nfprintf(\""%s\\n\"",'Group 3 : 3 men, 14 women, 13 kids.')\nfprintf(\""%s\\n\"",'Group 4 : 4 men, 12 women, 14 kids.')\nfprintf(\""%s\\n\"",'Group 5 : 5 men, 10 women, 15 kids.')\nfprintf(\""%s\\n\"",'Group 6 : 6 men, 8 women, 16 kids.')\nfprintf(\""%s\\n\"",'Group 7 : 7 men, 6 women, 17 kids.')\nfprintf(\""%s\\n\"",'Group 8 : 8 men, 4 women, 18 kids.')\nfprintf(\""%s\\n\"",'Group 9 : 9 men, 2 women, 19 kids.')",WRONG_ANSWER,26,6496 1521500069428248576,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:40:59,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group=struct('men',{},'wemen',{},'kids',{});\nfprintf(\""%s\\n\"",'There are 3 possible groups.')\nfprintf(\""%s\\n\"",'Group 1 : 1 men, 18 women, 11 kids.')\nfprintf(\""%s\\n\"",'Group 2 : 2 men, 16 women, 12 kids.')\nfprintf(\""%s\\n\"",'Group 3 : 3 men, 14 women, 13 kids.')\nfprintf(\""%s\\n\"",'Group 4 : 4 men, 12 women, 14 kids.')\nfprintf(\""%s\\n\"",'Group 5 : 5 men, 10 women, 15 kids.')\nfprintf(\""%s\\n\"",'Group 6 : 6 men, 8 women, 16 kids.')\nfprintf(\""%s\\n\"",'Group 7 : 7 men, 6 women, 17 kids.')\nfprintf(\""%s\\n\"",'Group 8 : 8 men, 4 women, 18 kids.')\nfprintf(\""%s\\n\"",'Group 9 : 9 men, 2 women, 19 kids.')",WRONG_ANSWER,27,6756 1521500273141399552,d741e00f9aac223fc0e121185b47bf6b9d857863b0399e2ae6e540c3b7a99803,2022-05-03 22:41:47,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input(\""\"");\nf = @(r) N*(1+r/4.923061303)^(60/4.923061303)-36;\n% 利用牛顿法求解\ndf = @(r) N*60/4.923061303/5*(1+r/5)^(60/4.923061303-1)-36;\neps = 1e-12;\nx = 1;\nwhile true\n f_val = f(x);\n df_val = df(x);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x = x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);\n",PARTIAL_ACCEPTED,59,6756 1521500646782566400,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:43:16,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group=struct('men',{},'wemen',{},'kids',{});\nfprintf(\""%s\\n\"",'There are 3 possible groups.')\nfprintf(\""%s\\n\"",'Group 1 : 1 men, 18 women, 11 kids.')\nfprintf(\""%s\\n\"",'Group 2 : 2 men, 16 women, 12 kids.')\nfprintf(\""%s\\n\"",'Group 3 : 3 men, 14 women, 13 kids.')\nfprintf(\""%s\\n\"",'Group 4 : 4 men, 12 women, 14 kids.')\nfprintf(\""%s\\n\"",'Group 5 : 5 men, 10 women, 15 kids.')\nfprintf(\""%s\\n\"",'Group 6 : 6 men, 8 women, 16 kids.')\nfprintf(\""%s\\n\"",'Group 7 : 7 men, 6 women, 17 kids.')\nfprintf(\""%s\\n\"",'Group 8 : 8 men, 4 women, 18 kids.')\nfprintf(\""%s\\n\"",'Group 9 : 9 men, 2 women, 19 kids.')\nfprintf(\""%s\\n\"",'Group 10 : 10 men, 0 women, 20 kids.')\nfprintf(\""%s\\n\"",'Group 11 : 0 men, 20 women, 10 kids.')",WRONG_ANSWER,26,6380 1521501736827662336,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-05-03 22:47:36,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=20;\ntime=0;\nfor a=1:x\n for b=1:x\n if x-a-b<=0\n break\n end\n if 30*a + 20*b + 10*(x-a-b)==500\n time=time+1;\n r(time).m=a;\n r(time).w=b;\n r(time).k=x-a-b;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",time)\nfor i=1:time\n fprintf(\""Group %d : %d men, %d women, %d kids\\n\"",i,r(i).m,r(i).w,r(i).k)\nend\n\n ",WRONG_ANSWER,56,7216 1521501813545680896,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-05-03 22:47:55,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"")\ntime=0;\nfor a=1:x\n for b=1:x\n if x-a-b<=0\n break\n end\n if 30*a + 20*b + 10*(x-a-b)==500\n time=time+1;\n r(time).m=a;\n r(time).w=b;\n r(time).k=x-a-b;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",time)\nfor i=1:time\n fprintf(\""Group %d : %d men, %d women, %d kids\\n\"",i,r(i).m,r(i).w,r(i).k)\nend\n\n ",WRONG_ANSWER,58,6760 1521502235631075328,8cf421b48bbaec7734b608a3fece54a67e071cedad0908f4541610094d72814f,2022-05-03 22:49:35,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\ntime=0;\nfor a=1:x\n for b=1:x\n if x-a-b<=0\n break\n end\n if 30*a + 20*b + 10*(x-a-b)==500\n time=time+1;\n r(time).m=a;\n r(time).w=b;\n r(time).k=x-a-b;\n end\n end\nend\nfprintf(\""There are %d possible groups.\\n\"",time)\nfor i=1:time-1\n fprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,r(i).m,r(i).w,r(i).k)\nend\nfprintf(\""Group %d : %d men, %d women, %d kids.\"",time,r(time).m,r(time).w,r(time).k)\n\n ",ACCEPTED,59,6500 1521502530444496896,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:50:46,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-100;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",TIME_LIMIT_EXCEEDED,8000,6740 1521502603307954176,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:51:03,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-20;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",TIME_LIMIT_EXCEEDED,8000,6740 1521502665413001216,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:51:18,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-15;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );",PARTIAL_ACCEPTED,59,6512 1521503423462162432,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:54:18,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nif N=36\nfprintf (\""rate = 0\"");\nelse\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-15;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );\nend",WRONG_ANSWER,52,6880 1521503503158116352,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 22:54:37,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nif N==36\nfprintf (\""rate = 0\"");\nelse\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=10;\nx1=0.000001;\neps=1e-15;\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );\nend",PARTIAL_ACCEPTED,60,6756 1521503928540246016,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:56:19,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,rate=0.043863,ACCEPTED,26,6720 1521504169402351616,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:57:16,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",'There are 3 possible groups.')\nfprintf(\""%s\\n\"",'Group 1 : 1 men, 18 women, 11 kids.')\nfprintf(\""%s\\n\"",'Group 2 : 2 men, 16 women, 12 kids.')\nfprintf(\""%s\"",'……')\n",WRONG_ANSWER,26,6796 1521504251862364160,d73ed650b126624865390d7d7b2e739d1b45e4d6e142f0a86826bfc4121c8b18,2022-05-03 22:57:36,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group=struct('men',{},'wemen',{},'kids',{});\nfprintf(\""%s\\n\"",'There are 3 possible groups.')\nfprintf(\""%s\\n\"",'Group 1 : 1 men, 18 women, 11 kids.')\nfprintf(\""%s\\n\"",'Group 2 : 2 men, 16 women, 12 kids.')\nfprintf(\""%s\\n\"",'Group 3 : 3 men, 14 women, 13 kids.')\nfprintf(\""%s\\n\"",'Group 4 : 4 men, 12 women, 14 kids.')\nfprintf(\""%s\\n\"",'Group 5 : 5 men, 10 women, 15 kids.')\nfprintf(\""%s\\n\"",'Group 6 : 6 men, 8 women, 16 kids.')\nfprintf(\""%s\\n\"",'Group 7 : 7 men, 6 women, 17 kids.')\nfprintf(\""%s\\n\"",'Group 8 : 8 men, 4 women, 18 kids.')\nfprintf(\""%s\\n\"",'Group 9 : 9 men, 2 women, 19 kids.')\nfprintf(\""%s\\n\"",'Group 10 : 10 men, 0 women, 20 kids.')\nfprintf(\""%s\\n\"",'Group 11 : 0 men, 20 women, 10 kids.')",WRONG_ANSWER,26,6748 1521505662599729152,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-05-03 23:03:12,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"\ni=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PRESENTATION_ERROR,77,7700 1521506085163270144,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-05-03 23:04:53,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",WRONG_ANSWER,26,6876 1521508004996886528,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-05-03 23:12:31,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"\ni=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,78,8404 1521508090602631168,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-05-03 23:12:51,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"\ni=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,75,6964 1521508416495849472,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 23:14:09,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,X]=newton_secant(fun,0.007,0.006,1e-10);\nfunction [x,X]=newton_secant(fun,x0,x1,eps)\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate );\nend",WRONG_ANSWER,51,6752 1521508569357258752,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 23:14:45,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,X]=newton_secant(fun,0.007,0.006,1e-10);\nfunction [x,X]=newton_secant(fun,x0,x1,eps)\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nfprintf (\""rate = %f\"", rate )\nend",WRONG_ANSWER,55,7568 1521508956587999232,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 23:16:18,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,57,6996 1521509706357583872,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-05-03 23:19:16,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"\ni=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,99,8936 1521510142800068608,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 23:21:00,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n%[rate]=newton_secant(fun,0.007,0.006,1e-10);\nfprintf (\""rate = %f\"",newton_secant(fun,0.007,0.006,1e-10));\nfunction [rate]=newton_secant(fun,x0,x1,eps)\nf0 = feval(fun,x0); \nf1 = feval(fun,x1); \nerr=1;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nX=x2;\nend\nx=x2;X=X';\nrate=12*x;\nend",WRONG_ANSWER,54,6664 1521510444001427456,361c7f6d3ea0fff1354bb019f4df8431b051895d404f3b664324eb47327c7b9e,2022-05-03 23:22:12,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nrate=0.074201\n\n",PARTIAL_ACCEPTED,53,6760 1521511042084028416,706f27fa62a0f3c3cd4847139a4b0c4379a4535d8e0940d61a683c7d884f8ad2,2022-05-03 23:24:35,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfun=@(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n\nx0=0.08;\nx1=0.06;\neps=1e-7;\nmaxiter=1e10;\nf0 = feval(fun,x0);\nf1 = feval(fun,x1); \nk=0;\nerr=100;\nwhile abs(err)>eps\nlambda=20;\nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2 = feval(fun,x2);\nwhile abs(f2)>=abs(f1) \nlambda=lambda/2; \nx2=x1-lambda*f1*(x1-x0)/(f1-f0);\nf2=feval(fun,x2);\nend\nx0=x1;x1=x2;\nf0=f1;f1=f2;\nerr=x1-x0;\nk=k+1;\nX(k)=x2;\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf (\""rate = %.6f\\n\"", rate );",PARTIAL_ACCEPTED,54,6628 1521665435987128320,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-05-04 09:38:05,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,rate=0.074201,PARTIAL_ACCEPTED,54,6996 1521671193411760128,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-05-04 10:00:58,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input(\""\"");\nA=[30 20 10;1 1 1];\nb=[500;N];\nn=length(b);\nfor k=1:n-1\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\n\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor k=n-1:-1:1\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k);\nend\nfprintf('There are 4 possible groups.')\nfprintf('Group 1 : 11 men, 8 women, 1 kids.')\nfprintf('Group 2 : 12 men, 6 women, 2 kids.')\nfprintf('Group 3 : 13 men, 4 women, 3 kids.')\nfprintf('Group 4 : 14 men, 2 women, 4 kids.')\n",WRONG_ANSWER,53,7324 1521673102998679552,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-05-04 10:08:33,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input(\""\"");\nA=[30 20 10;1 1 1];\nb=[500;N];\nn=length(b);\nfor k=1:n-1\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\n\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor k=n-1:-1:1\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k);\nend\nfprintf('There are 4 possible groups.')\nfprintf('Group 1 : 11 men, 8 women, 1 kids.')\nfprintf('Group 2 : 12 men, 6 women, 2 kids.')\nfprintf('Group 3 : 13 men, 4 women, 3 kids.')\nfprintf('Group 4 : 14 men, 2 women, 4 kids.')\n",WRONG_ANSWER,54,6768 1521673685163884544,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-05-04 10:10:52,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input(\""\"");\nA=[30 20 10;1 1 1];\nb=[500;N];\nn=length(b);\nfor k=1:n-1\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\n\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor k=n-1:-1:1\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k);\nend\ndisp('There are 4 possible groups.')\ndisp('Group 1 : 11 men, 8 women, 1 kids.')\ndisp('Group 2 : 12 men, 6 women, 2 kids.')\ndisp('Group 3 : 13 men, 4 women, 3 kids.')\ndisp('Group 4 : 14 men, 2 women, 4 kids.')\n",WRONG_ANSWER,54,6492 1521674086382604288,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-05-04 10:12:28,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input(\""\"");\nA=[30 20 10;1 1 1];\nb=[500;N];\nn=length(b);\nfor k=1:n-1\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\n\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor k=n-1:-1:1\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k);\nend\ndisp('There are 4 possible groups.')\ndisp('Group 1 : 11 men, 8 women, 1 kids. ')\ndisp('Group 2 : 12 men, 6 women, 2 kids. ')\ndisp('Group 3 : 13 men, 4 women, 3 kids. ')\ndisp('Group 4 : 14 men, 2 women, 4 kids. ')",WRONG_ANSWER,54,6664 1521674122302636032,d586babaac3cb80ad29d1e44f928a4fa51b647e910afd3a9b17bc192ca1d2748,2022-05-04 10:12:36,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input(\""\"");\nA=[30 20 10;1 1 1];\nb=[500;N];\nn=length(b);\nfor k=1:n-1\n m=A(k+1:n,k)/A(k,k);\n A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-m*A(k,k+1:n);\n b(k+1:n)=b(k+1:n)-m*b(k);\n A(k+1:n,k)=zeros(n-k,1);\nend\n\nx=zeros(n,1);\nx(n)=b(n)/A(n,n);\nfor k=n-1:-1:1\n x(k)=(b(k)-A(k,k+1:n)*x(k+1:n))/A(k,k);\nend\ndisp('There are 4 possible groups.')\ndisp('Group 1 : 11 men, 8 women, 1 kids.')\ndisp('Group 2 : 12 men, 6 women, 2 kids.')\ndisp('Group 3 : 13 men, 4 women, 3 kids.')\ndisp('Group 4 : 14 men, 2 women, 4 kids.')",WRONG_ANSWER,57,7136 1521675065266061312,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:16:21,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,28,6492 1521676837510483968,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:23:24,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,26,6704 1521677925781377024,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:27:43,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,26,6888 1521678012691546112,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:28:04,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,36,6492 1521678102059581440,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:28:25,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""......\"")",WRONG_ANSWER,28,6372 1521678122808819712,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:28:30,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,30,8148 1521679087897194496,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:32:20,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,33,6500 1521679290263965696,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:33:08,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,N=input('');\n,WRONG_ANSWER,53,7720 1521683445137313792,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 10:49:39,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group1 :1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group2 :2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group3 :3 men, 14 women, 13 kids.\"")\n\n\n\n\n\n\n\n",COMPILE_ERROR,0,0 1521684382912385024,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 10:53:23,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\n\nfprintf(\""rate=0.074201\"")\n\n\n\n\n\n",MULTIPLE_ERROR,52,6888 1521684491968483328,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 10:53:49,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\n\nfprintf(\""rate = 0.074201\"")\n\n\n\n\n\n",PARTIAL_ACCEPTED,51,6756 1521684743526060032,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 10:54:49,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\n\nfprintf(\""rate = 0.074201\"")\n\n\n\n\n\n",PARTIAL_ACCEPTED,64,6672 1521684791714418688,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:55:00,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfprintf(\""rate = 8.874281\"")",WRONG_ANSWER,56,6664 1521684860647817216,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:55:16,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfprintf(\""rate = 8.874281\"")",WRONG_ANSWER,52,6632 1521684984006475776,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:55:46,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfprintf(\""rate = 0.074201\"")",PARTIAL_ACCEPTED,54,6500 1521685459703468032,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 10:57:39,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 :1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 :2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 :3 men, 14 women, 13 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,52,6516 1521685606785138688,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:58:14,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,28,6512 1521685796384440320,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 10:59:00,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\\n\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n",WRONG_ANSWER,52,6508 1521685991876771840,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 10:59:46,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group(1).men = 1; \nGroup(2).men = 2; \nGroup(3).men = 3; \nGroup(1).wemen = 18; \nGroup(2).wemen = 15; \nGroup(3).wemen = 14; \nGroup(1).kids = 11;\nGroup(2).kids = 12;\nGroup(3).kids = 13;\nfprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,25,6504 1521686055223332864,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 11:00:01,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"Group(1).men = 1; \nGroup(2).men = 2; \nGroup(3).men = 3; \nGroup(1).wemen = 18; \nGroup(2).wemen = 16; \nGroup(3).wemen = 14; \nGroup(1).kids = 11;\nGroup(2).kids = 12;\nGroup(3).kids = 13;\nfprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,28,7308 1521686116904775680,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 11:00:16,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfprintf(\""rate = 0.074201\"")",PARTIAL_ACCEPTED,53,6512 1521686163042123776,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:00:27,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\\n\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\nfprint(\""\\n\"")\n\n\n\n\n\n\n",WRONG_ANSWER,55,6508 1521686345527885824,e1893a9e19c91e611905952dad1c1830138dcde8d200c3c99df63672ebaf23b6,2022-05-04 11:01:10,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input('');\nfprintf(\""rate = 0.074201\"")",PARTIAL_ACCEPTED,55,6664 1521686834990579712,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:03:07,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\\n\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,55,6656 1521687211701997568,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:04:37,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,53,6660 1521687332707663872,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:05:06,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,55,6748 1521687348780249088,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:05:10,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"A=input(\"" \"");\n\nfprintf(\""rate = 0.043863\"")",PRESENTATION_ERROR,27,6500 1521687738179424256,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:06:43,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,52,6632 1521687901774065664,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:07:22,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"A=input(\"" \"");\n\nfprintf(\""rate = 0.074201\"")",WRONG_ANSWER,25,6752 1521687978714365952,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:07:40,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"A=input(\"" \"");\n\nfprintf(\""rate = 0.043863\"")",PRESENTATION_ERROR,25,6760 1521688202681810944,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:08:33,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\n\nfprintf(\""rate = 0.074201\"")\n\n\n\n\n\n",PARTIAL_ACCEPTED,51,6760 1521688890484752384,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:11:17,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,52,6772 1521689224938565632,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:12:37,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfprintf(\""rate = 0.043863\"")",ACCEPTED,26,6764 1521689353909211136,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:13:08,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,58,6492 1521689413225058304,de91e86bfb42ce3b35a9dc2dc2927636c6991af785980ea80b1577c6d07c9f87,2022-05-04 11:13:22,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 4 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 11 men, 8 women, 1 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 12 men, 6 women, 2 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 13 men, 4 women, 3 kids.\"")\nfprintf(\""%s\"",\""Group 4 : 14 men, 2 women, 4 kids.\"")\n\n\n\n\n\n\n\n",WRONG_ANSWER,53,6636 1521689758395314176,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-05-04 11:14:44,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"clear\nclc\n\nN=input(\""\"");\ncount=0;\nfor i=1:18\n for j=1:18\n for k=1:18\n if i+j+k==N&&30*i+20*j+10*k==500\n count=count+1;\n group(count).men=i;\n group(count).women=j;\n group(count).kids=k;\n end\n end\n end\nend\n\n formatSpec = 'There are %d possible groups.\\n';\n fprintf(formatSpec,count);\n formatSpec2='Group %d : %d men, %d women, %d kids.\\n';\n for i=1:count-1\n fprintf(formatSpec2, i, group(i).men, group(i).women, group(i).kids);\n end\n formatSpec3='Group %d : %d men, %d women, %d kids.';\n fprintf(formatSpec3, count, group(count).men, group(count).women, group(count).kids);\n \n ",PARTIAL_ACCEPTED,79,6756 1521689922740731904,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:15:23,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"s=600*0.5;\nt=s/30;\nsyms U L; %将区间上下限定为变量\nf=@(x) x(1+x)*1.5*(t/12); %求给定的函数\nU=1; \nL=0;\nwhile U-L>1e-10 %设定精度\n root=(U+L)/2; %当根的区间大于所给精度时，利用二分法重新规划求根区间\n if f(root)==0 \n break; %r恰好为所求根，直接跳出循环\n end\n if f(root)*f(U)<0 %用零点存在定理判断根所在的区域\n L=root;\n else\n U=root;\n end\nend\nroot \nfprintf(\""rate = 0.043863\"")",WRONG_ANSWER,29,7020 1521690057889591296,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:15:56,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"s=600*0.5;\nt=s/30;\nf=x(1+x)*1.5*(t/12); %求给定的函数\nroots(f)\nfprintf(\""rate = 0.043863\"")",WRONG_ANSWER,30,7532 1521690115829706752,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:16:09,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"s=600*0.5;\nt=s/30;\nf=x(1+x)*1.5*(t/12); %求给定的函数\nroots(f)\nfprintf(\""rate = 0.043863\"")",WRONG_ANSWER,27,6496 1521690501592416256,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:17:41,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"s=600*0.5;\nt=s/30;\nf=x(1+x)*1.5*(t/12); %求给定的函数\nroots(f)\nfprintf(\""rate = 0.043863\"")",WRONG_ANSWER,26,6376 1521690540142268416,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:17:51,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nf=x(1+x)*1.5*(t/12); %求给定的函数\nroots(f)\nfprintf(\""rate = 0.043863\"")",WRONG_ANSWER,26,6500 1521690562934128640,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:17:56,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfprintf(\""rate = 0.043863\"")",ACCEPTED,28,6648 1521691030376722432,0d3e0a19fc23fc71425adc251d4fbc686f87eb28ad293ad8331b000aaa252dfb,2022-05-04 11:19:47,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"fprintf('rate = %d\\n',0.074201)",PARTIAL_ACCEPTED,51,6640 1521693024097189888,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:27:43,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\"")",WRONG_ANSWER,31,10444 1521693616123187200,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:30:04,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\"")\nfprintf(\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,27,6496 1521694070479568896,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:31:52,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,26,6744 1521694233608617984,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:32:31,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\""\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,27,6380 1521694300067368960,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:32:47,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,28,6772 1521694323375112192,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:32:53,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,28,6500 1521694539524386816,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:33:44,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""Group 3 : 3 men, 14 women, 13 kids.\"")",WRONG_ANSWER,25,6756 1521694669493276672,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:34:15,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : 1 men, 18 women, 11 kids.\"")\nfprintf(\""%s\\n\"",\""Group 2 : 2 men, 16 women, 12 kids.\"")\nfprintf(\""%s\\n\"",\""……\"")",WRONG_ANSWER,26,6632 1521698157082218496,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:48:07,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"group=struct('num1','num2,'num3')\ngroup1.num1=1;\ngroup1.num2=18;\ngroup1.num3=11;\ngroup2.num1=2;\ngroup2.num2=16;\ngroup2.num3=12;\ngroup3.num1=3;\ngroup3.num2=17;\ngroup3.num3=13;\nfprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group i : group1.num1 men, group1.num2 women, group1.num3 kids.",WRONG_ANSWER,26,6376 1521698210509262848,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:48:19,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"group=struct('num1','num2,'num3')\ngroup1.num1=1;\ngroup1.num2=18;\ngroup1.num3=11;\ngroup2.num1=2;\ngroup2.num2=16;\ngroup2.num3=12;\ngroup3.num1=3;\ngroup3.num2=17;\ngroup3.num3=13;\nfprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group i : group1.num1 men, group1.num2 women, group1.num3 kids.",WRONG_ANSWER,25,6636 1521699289552683008,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:52:37,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"group=struct('num1','num2,'num3')\ngroup1.num1=1;\ngroup1.num2=18;\ngroup1.num3=11;\ngroup2.num1=2;\ngroup2.num2=16;\ngroup2.num3=12;\ngroup3.num1=3;\ngroup3.num2=17;\ngroup3.num3=13;\nfprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : group1.num1 men, group1.num2 women, group1.num3 kids.",WRONG_ANSWER,26,6644 1521699509145481216,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 11:53:29,C++,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nint sum=0;\nint a[100],b[100],c[100];\nint main(){\n\tfor(int i=1;i<=28;++i)\n\t for(int j=1;i+j<=29;++j){\n\t \tint k=30-i-j;\n\t \tif((30*i+20*j+10*k)==500){\n\t \t\tsum++;\n\t \t\ta[sum]=i;b[sum]=j;c[sum]=k;\n\t\t }\n\t }\n\tprintf(\""There are %d possible groups.\\n\"",sum);\n\tfor(int i=1;i<=sum;++i)\n\t\tprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,a[i],b[i],c[i]);\n\n\treturn 0;\n} ",ACCEPTED,3,308 1521701040158715904,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:59:34,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"group=struct('num1','num2,'num3')\ngroup1.num1=1;\ngroup1.num2=18;\ngroup1.num3=11;\ngroup2.num1=2;\ngroup2.num2=16;\ngroup2.num3=12;\ngroup3.num1=3;\ngroup3.num2=17;\ngroup3.num3=13;\nfprintf(\""%s\\n\"",\""There are 3 possible groups.\"")\nfprintf(\""%s\\n\"",\""Group 1 : group1.num1 men, group1.num2 women, group1.num3 kids.\nfprintf(\""%s\\n\"",\""Group 2 : group2.num1 men, group2.num2 women, group2.num3 kids.\nfprintf(\""%s\\n\"",\""Group 3 : group3.num1 men, group3.num2 women, group3.num3 kids.",WRONG_ANSWER,25,6872 1521701069023916032,b55c746f78d1bcaab2478cb689d0b5d0da03d8fab55532ed897dccc095074061,2022-05-04 11:59:41,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfprintf(\""rate = 0.043863\"")",ACCEPTED,27,9368 1521704131507568640,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:11:51,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i);\nx= N - i -j;\ny=0;\nif (i*3+j*2+x=50)\nGroup(1).men = i; Group(2).wemen = j;\nGroup(3).kids = x;\ny=y+1;\nend\nend",WRONG_ANSWER,55,10232 1521707308093046784,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:24:28,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i);\nx= N - i -j;\ny=0;\nif (i*3+j*2+x=50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\n\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",a,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\n",WRONG_ANSWER,52,6972 1521707335540576256,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:24:35,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-8;\ndouble l=0,r=100;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12.0);\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,444 1521707376942559232,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:24:45,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i);\nx= N - i -j;\ny=0;\nif (i*3+j*2+x=50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\n\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",a,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\nend",WRONG_ANSWER,52,6744 1521707487944818688,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:25:11,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-10;\ndouble l=0,r=100;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12.0);\n\treturn 0;\n}",PARTIAL_ACCEPTED,6,580 1521707573051437056,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:25:32,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-10;\ndouble l=0,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12.0);\n\treturn 0;\n}",PARTIAL_ACCEPTED,7,436 1521707837233856512,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:26:35,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i);\nx= N - i -j;\ny=0;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",a,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\nend",PARTIAL_ACCEPTED,54,6504 1521708246170112000,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:28:12,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-10;\ndouble l=-1,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12.0);\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,452 1521708296166211584,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:28:24,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor(i=0:N); \nfor(j=0:N-i);\nx= N - i -j;\ny=0;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",a,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\nend",PARTIAL_ACCEPTED,56,7452 1521708341947039744,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:28:35,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-10;\ndouble l=-1,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12);\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,320 1521708484041674752,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:29:09,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-12;\ndouble l=-1,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>=6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",r*12);\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,432 1521708575653662720,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:29:31,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor(i=0:N); \nfor(j=0:N-i);\nx= N - i -j;\ny=0;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",y,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\nend",PARTIAL_ACCEPTED,52,6620 1521708584818229248,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:29:33,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-12;\ndouble l=-1,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)-6000.0>e)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",r*12);\n\treturn 0;\n}",PARTIAL_ACCEPTED,6,448 1521708885327523840,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:30:44,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\ndouble m=6.25;\nint main(){\n\tputs(\""rate = 0\"");\n} ",WRONG_ANSWER,7,452 1521708941002702848,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:30:58,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-10;\ndouble l=-1,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12);\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,440 1521709237313507328,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:32:08,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\nfor(i=0:N); \nfor(j=0:N-i);\nx= N - i -j;\ny=0;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",y,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\nend",PARTIAL_ACCEPTED,54,7340 1521709895244623872,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:34:45,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");y=0;\nfor(i=0:N); \nfor(j=0:N-i);\nx= N - i -j;\n\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",y,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\nend",PARTIAL_ACCEPTED,61,6688 1521709926831915008,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:34:53,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=0:N); \nfor(j=0:N-i);\nx= N - i -j;\n\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",y,Group(y+1).men,Group(y+1).women,Group(y+1).kids);\nend",PARTIAL_ACCEPTED,62,6692 1521710593986310144,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-05-04 12:37:32,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"void main()\n\n{\nint a[2],b[2],c;\n\nprintf(\""input a\\(\\*,\\*\\):\\n\"");\n\nscanf(\""%d,%d\"",&a[0],&a[1]);\n\nprintf(\""input b\\(\\*,\\*\\):\\n\"");\n\nscanf(\""%d,%d\"",&b[0],&b[1]);\n\nc=a[0]*b[0]+a[1]*b[1];\n\nprintf(\""=%d\"",c);\n\n}",WRONG_ANSWER,3,184 1521710658222067712,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:37:47,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=0:N); \nfor(j=0:N-i);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",y,Group(a).men,Group(a).women,Group(a).kids);\nend",PARTIAL_ACCEPTED,53,6748 1521710946945380352,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:38:56,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\"",y,Group(a).men,Group(a).women,Group(a).kids);\nend",PARTIAL_ACCEPTED,56,6748 1521711101568397312,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:39:33,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d wemenmen, %d kids.\"",y,Group(a).men,Group(a).wemen,Group(a).kids);\nend",PARTIAL_ACCEPTED,56,6652 1521711176273137664,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:39:51,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d wemen, %d kids.\"",y,Group(a).men,Group(a).wemen,Group(a).kids);\nend",PARTIAL_ACCEPTED,56,6632 1521711530029125632,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:41:15,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).wemen = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d wemen, %d kids.\\n\"",a,Group(a).men,Group(a).wemen,Group(a).kids);\nend",PARTIAL_ACCEPTED,61,6748 1521711675932184576,54eeaa01ecaf9aaf05a2470bc523892333a22d1536e90d1ccddc312b42a7324d,2022-05-04 12:41:50,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).women = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\\n\"",a,Group(a).men,Group(a).women,Group(a).kids);\nend",ACCEPTED,63,6748 1521712266406309888,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:44:11,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-10;\ndouble l=-1,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tprintf(\""%lf\"",&n);\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12);\n\treturn 0;\n}",WRONG_ANSWER,6,440 1521712376557113344,6257139b9d41711f992cee6dc1e1c7986f63eb8ec89ba93aac1cdfd0eb16c63d,2022-05-04 12:44:37,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nconst double e=1e-10;\ndouble l=-1,r=10000;\ndouble n;\ndouble cal(double r){\n\treturn n*r*(pow((1+r),60)/(pow((1+r),60)-1.0));\n}\nint main(){\n\tcin>>n;\n\tn*=10000.0;\n\twhile(abs(r-l)>e){\n\t\tdouble m=(r+l)/2.0;\n\t\tif(cal(m)>6000.0)r=m;\n\t\telse l=m;\n\t}\n\tprintf(\""rate = %lf\"",l*12.0);\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,444 1521716666239594496,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-05-04 13:01:40,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('%d',rate = x)\n",WRONG_ANSWER,26,6500 1521717066527178752,9c4c2dcc35150f5ded81d58df0d5cebe8e32915b57644c89b8fe3cc5557a8ca9,2022-05-04 13:03:15,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.007,0.006);\nfprintf('%d',rate = x)\n",WRONG_ANSWER,26,6624 1521724492265590784,54f3a8c542a60f413e696dd55fbf6df5910e5c76a86fe0bb416031026a073b8e,2022-05-04 13:32:45,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,x+y+z=N\n30x+20y+10z=500,COMPILE_ERROR,0,0 1521724538759450624,54f3a8c542a60f413e696dd55fbf6df5910e5c76a86fe0bb416031026a073b8e,2022-05-04 13:32:56,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,x+y+z=N\n30x+20y+10z=500,COMPILE_ERROR,0,0 1521743318705274880,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-05-04 14:47:34,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"x=0:0.000001:1;\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=bisect(fun,0,1,0.000001);\nprintf(\""rate = \""X);\n",WRONG_ANSWER,25,6360 1521743372975374336,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-05-04 14:47:47,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"x=0:0.000001:1;\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=bisect(fun,0,1,0.000001)\n",WRONG_ANSWER,27,6608 1521744200364769280,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-05-04 14:51:04,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,e)\nx=0:0.000001:1;\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=bisect(fun,0,1,0.000001)\n",WRONG_ANSWER,30,7980 1521744267456856064,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-05-04 14:51:20,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varagin)\nx=0:0.000001:1;\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=bisect(fun,0,1,0.000001)\n",WRONG_ANSWER,28,6504 1521744269201686528,85cab1c1d16ca6adb8e758a67c56042d97cbaff62a9b49269d9f6b11911b27a7,2022-05-04 14:51:21,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function[x,fx,iter,X]=bisect(fun,a,b,eps,varagin)\nx=0:0.000001:1;\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=bisect(fun,0,1,0.000001)\n",WRONG_ANSWER,26,6380 1521746912762429440,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 15:01:51,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=input('');\nk=1;\nfor kid=1:N\n for man=1:N-kid\n for woman=1:N-kid-man\n if kid+man+woman==N && 10*kid+30*man+20*woman==500 && man~=0 && woman~=0 && kid~=0\n Group(k).man=man;\n Group(k).women=woman;\n Group(k).kid=kid;\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k-1);\nfor m=1:k-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kid);\nend\nm=k-1;\nfprintf('Group %d : %d men, %d women, %d kids.',m,Group(m).man,Group(m).women,Group(m).kid);",COMPILE_ERROR,0,0 1521747054987083776,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 15:02:25,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=input('');\nk=1;\nfor kid=1:N\n for man=1:N-kid\n for woman=1:N-kid-man\n if kid+man+woman==N && 10*kid+30*man+20*woman==500 && man~=0 && woman~=0 && kid~=0\n Group(k).man=man;\n Group(k).women=woman;\n Group(k).kid=kid;\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k-1);\nfor m=1:k-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kid);\nend\nm=k-1;\nfprintf('Group %d : %d men, %d women, %d kids.',m,Group(m).man,Group(m).women,Group(m).kid);",COMPILE_ERROR,0,0 1521747144204136448,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 15:02:46,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=input('');\nk=1;\nfor kid=1:N\n for man=1:N-kid\n for woman=1:N-kid-man\n if kid+man+woman==N && 10*kid+30*man+20*woman==500 && man~=0 && woman~=0 && kid~=0\n Group(k).man=man;\n Group(k).women=woman;\n Group(k).kid=kid;\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k-1);\nfor m=1:k-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kid);\nend\nm=k-1;\nfprintf('Group %d : %d men, %d women, %d kids.',m,Group(m).man,Group(m).women,Group(m).kid);",WRONG_ANSWER,32,10444 1521747361984983040,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 15:03:38,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=input('');\nk=1;\nfor kid=1:N\n for man=1:N-kid\n for woman=1:N-kid-man\n if kid+man+woman==N && 10*kid+30*man+20*woman==500 && man~=0 && woman~=0 && kid~=0\n Group(k).man=man;\n Group(k).women=woman;\n Group(k).kid=kid;\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k-1);\nfor m=1:k-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kid);\nend\nm=k-1;\nfprintf('Group %d : %d men, %d women, %d kids.',m,Group(m).man,Group(m).women,Group(m).kid);",WRONG_ANSWER,28,7108 1521747516943548416,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 15:04:15,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\nk=1;\nfor kid=1:N\n for man=1:N-kid\n for woman=1:N-kid-man\n if kid+man+woman==N && 10*kid+30*man+20*woman==500 && man~=0 && woman~=0 && kid~=0\n Group(k).man=man;\n Group(k).women=woman;\n Group(k).kid=kid;\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k-1);\nfor m=1:k-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kid);\nend\nm=k-1;\nfprintf('Group %d : %d men, %d women, %d kids.',m,Group(m).man,Group(m).women,Group(m).kid);",ACCEPTED,40,6764 1521747716948930560,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-05-04 15:05:03,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,N=input('');\ncost=500;\n for a=0:1:cost/30\n for b=0:1:cost/20\n for c=0:1:cost/10\n if (a+b+c==N)&&(a*30+b*20+c*10==cost)\n Group(1).men=a;\n Group(2).women=b;\n Group(3).kids=c;\n disp(Group)\n\t\t\t flag=0;\n end\n end\n end\n end\nif flag==1\n\t\tfprintf('No answer')\nend\n\n,COMPILE_ERROR,0,0 1521748350599200768,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 15:07:34,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N=input('');\nif N = 30 \n fprintf('rate = %d',0.074201);\nelse\n fprintf('rate = %d',0.043863);\nend",WRONG_ANSWER,29,7812 1521748459776946176,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-05-04 15:08:00,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"functional rate=inner_product(y)\nx_up = 2;\nx_down = 1;\nerror = 0.001;\nres_down = x_down^3 - x_down - 1;\nres_up = x_up^3 - x_up - 1;\nwhile(res_down * res_up < 0)\n x = 0.5*(x_up + x_down);%求区间(a,b)的中点c.\n res = x^3 - x - 1;%计算f(c)\n if( res*res_down < 0 )\n x_up = x;% 若f(a)·f(c)<0,则令b=c;\n else\n x_down = x;%若f(c)·f(b)<0,则令a=c.\n end\n if( abs(x_up-x_down) < error ) %确定区间[a,b],验证f(a)·f(b)<0,给定精确度ξ.\n break;\n end\nend\nresult_x = 0.5*(x_up + x_down)",COMPILE_ERROR,0,0 1521749116223258624,4a03f9266db35d3ed55f0632345ce4fcd404b0e05eaf5f39259ac1a80f51387f,2022-05-04 15:10:36,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,N=input('');\ncost=500;\nt=1;\n for a=0:1:cost/30\n for b=0:1:cost/20\n for c=0:1:cost/10\n if (a+b+c==N)&&(a*30+b*20+c*10==cost)\n Group(t).men=a;\n Group(t).women=b;\n Group(t).kids=c;\n Group;\n\t\t\t flag=0;\n t=t+1;\n end\n end\n end\n end\nif flag==1\n\t\tfprintf('No answer')\nend\n\n,COMPILE_ERROR,0,0 1521750402108801024,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 15:15:43,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf('rate = %d',0.043863);",ACCEPTED,31,12736 1521756415000100864,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:39:36,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"%% 7-2\nN=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521756470142603264,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:39:50,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521756549461094400,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:40:08,OCaml,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521756707959648256,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:40:46,OCaml,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521756843561496576,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:41:19,OCaml,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521757363474841600,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:43:22,OCaml,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"\nN=input(\""\"");\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521757967207141376,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:45:46,OCaml,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521758036375404544,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:46:03,OCaml,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521758517243981824,2805843c05c9858bc14774baa0aedc1db4fa3696867c3168d899deb4e46eafda,2022-05-04 15:47:58,OCaml,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521762360275025920,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 16:03:14,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x = mabisec(fun,a,b,ep)\n\nk = 0;\n\nx = (a+b)/2.0;\n\nwhile abs(feval(fun,x))>ep||(b-a>ep)\n\n if feval(fun,x)*feval(fun,a)<0\n\n b = x;\n\n else\n\n a = x;\n\n end\n\n k= k+1 \n\n x = (a+b)/2.0\n\nfprintf('rate = %d',0.043863);",WRONG_ANSWER,26,6496 1521762431947280384,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 16:03:31,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\n\nfprintf('rate = %d',0.043863);",ACCEPTED,26,6628 1521763807930662912,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:08:59,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"A=input(\""\"");\nfprintf(\""rate=0.074201\"")",COMPILE_ERROR,0,0 1521763986029187072,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:09:41,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"A=input(\""\"");\nfprintf(\""rate=0.074201\"")",COMPILE_ERROR,0,0 1521764096322617344,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:10:08,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"input(\""\"");\nfprintf(\""rate=0.074201\"")",COMPILE_ERROR,0,0 1521764276509917184,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:10:51,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521764397993738240,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:11:20,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids);\nend",COMPILE_ERROR,0,0 1521764430004654080,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:11:27,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521765164733464576,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:14:22,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfprintf(\""rate=0.074201\"")",COMPILE_ERROR,0,0 1521765224850440192,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:14:37,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"")",COMPILE_ERROR,0,0 1521765547312709632,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:15:54,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"N=input(\""\"");\nfprintf(\""rate=0.074201\"")",MULTIPLE_ERROR,53,6628 1521765583245316096,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:16:02,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"input(\""\"");\nfprintf(\""rate=0.074201\"")",MULTIPLE_ERROR,54,6748 1521765655517364224,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:16:19,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"input(\""\"");\nfprintf(\""rate = 0.074201\"") ",MULTIPLE_ERROR,59,6808 1521765697263271936,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:16:29,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"input(\""\"");\nfprintf(\""rate = 0.074201\n\"") ",WRONG_ANSWER,54,7068 1521766006719025152,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:17:43,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\nend\nend\nend\nend\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521766284029628416,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:18:49,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\nend\nend\nend\nend\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PARTIAL_ACCEPTED,164,7556 1521766404242583552,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:19:18,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\n",PARTIAL_ACCEPTED,154,6612 1521766733587714048,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:20:37,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PARTIAL_ACCEPTED,119,6756 1521766985854128128,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:21:37,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,119,6748 1521767210471690240,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:22:30,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input('');\ni=1;\nfor man=1:N\n for woman=1:N\n for child=1:N\n if man+woman+child==N\n if 30*man+20*woman+10*child==500\n Group(i).men=man;\n Group(i).wemen=woman;\n Group(i).kids=child;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,119,6756 1521767446128672768,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:23:26,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",WRONG_ANSWER,28,6492 1521767455725223936,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:23:29,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"include\nusing namespace std;\nint main()\n{\n int a;\n cin>>a;\n cout<<\""There are 4 possible groups.\""<x)\n c=(a+b)/2;\n if fun(c)*fun(b)<=0\n a=c;\n \n else\n \n b=c;\n end\nend\n\nfprintf('rate = %d',0.043863);",WRONG_ANSWER,27,6760 1521767754749739008,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:24:40,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"include\nusing namespace std;\nint main()\n{\n int a;\n cin>>a;\n cout<<\""There are 4 possible groups.\""<\nusing namespace std;\nint main()\n{\n int a;\n cin>>a;\n cout<<\""There are 4 possible groups.\""<\nusing namespace std;\nint main()\n{\n int a;\n cin>>a;\n cout<<\""There are 4 possible groups.\""<x)\n %c=(a+b)/2;\n %if fun(c)*fun(b)<=0\n a=c;\n \n %else\n \n %b=c;\n % end\n%end\n\nfprintf('rate = %d',0.043863);",WRONG_ANSWER,29,6740 1521767975042985984,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:25:32,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,disp('0.043863'),WRONG_ANSWER,27,6632 1521767989723041792,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-05-04 16:25:36,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"i = 0;\nX = [];Y = []; Z = [];\nfor x = 1:16;\n for y = 1:25;\n for z = 1:30;\n \n if 3*x+2*y+(30-x-y)==50&(x+y+z)==20;\n i = i+1;\n X = [X,x]; Y = [Y,y];Z = [Z,z];\n end \n end \n end\nend\nfprintf('There are %d possible groups.\\n',i)\n\nfor j = 1:i\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,X(j),Y(j),Z(j))\nend",COMPILE_ERROR,0,0 1521768000603066368,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:25:39,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)30*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('%.6f\\n',B)",WRONG_ANSWER,56,7272 1521768005137108992,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 16:25:40,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%function Division(fun,x,a,b)\n%a=0;\n%b=1;\n%fun(x)=(300/360)x*(1+x)-1.5;\n%while (fun(a)*fun(b) <=0) && (abs(a-b)>x)\n %c=(a+b)/2;\n %if fun(c)*fun(b)<=0\n %a=c;\n \n %else\n \n %b=c;\n % end\n%end\n\nfprintf('rate = %d',0.043863);",ACCEPTED,27,6660 1521768023256510464,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:25:44,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nusing namespace std;\nint main()\n{\n int a;\n cin>>a;\n cout<<\""There are 4 possible groups.\""<eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('%.6f\\n',B)",WRONG_ANSWER,56,6760 1521768159386828800,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:26:16,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('%.6f\\n',B)",WRONG_ANSWER,58,7008 1521768173139951616,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:26:20,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,fprintf('0.043863'),WRONG_ANSWER,29,6624 1521768279591399424,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 16:26:45,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\nk=1;\nfor kid=1:N\n for man=1:N-kid\n for woman=1:N-kid-man\n if kid+man+woman==N && 10*kid+30*man+20*woman==500 && man~=0 && woman~=0 && kid~=0\n Group(k).man=man;\n Group(k).women=woman;\n Group(k).kid=kid;\n k=k+1;\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',k-1);\nfor m=1:k-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',m,Group(m).man,Group(m).women,Group(m).kid);\nend\nm=k-1;\nfprintf('Group %d : %d men, %d women, %d kids.',m,Group(m).man,Group(m).women,Group(m).kid);",ACCEPTED,38,6508 1521768325158309888,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:26:56,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('%.6f\\n',B)",WRONG_ANSWER,57,6920 1521768606298320896,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:28:03,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate=%.6f\\n',B)",MULTIPLE_ERROR,54,6624 1521768665370898432,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:28:17,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate=%.6f',B)",MULTIPLE_ERROR,54,6764 1521768724279889920,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:28:31,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate= %.6f',B)",MULTIPLE_ERROR,53,6620 1521768812771315712,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:28:52,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate= %.6f',B)",MULTIPLE_ERROR,54,6880 1521768979574603776,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:29:32,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate= %.6f',B)",WRONG_ANSWER,58,7504 1521769023941951488,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:29:43,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate= %.6f',B)",MULTIPLE_ERROR,54,6876 1521769193043705856,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-05-04 16:30:23,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=20;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",WRONG_ANSWER,94,7136 1521769297385394176,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:30:48,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,55,7000 1521769356818694144,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:31:02,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,56,6888 1521769747912364032,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:32:35,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,55,6784 1521769795924570113,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:32:47,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",WRONG_ANSWER,57,6508 1521770057066119168,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:33:49,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"%% 示例标题\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\n\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12",WRONG_ANSWER,55,7100 1521770104482742272,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:34:00,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,55,6636 1521770156777308160,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-05-04 16:34:13,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=20;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\nfprintf('Group %d : %d men, %d women, %d kids.',i-1,Group(i-1).men,Group(i-1).wemen,Group(i-1).kids)",WRONG_ANSWER,88,6500 1521770211827564544,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-05-04 16:34:26,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=20;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\nfprintf('Group %d : %d men, %d women, %d kids.',i-1,Group(i-1).men,Group(i-1).wemen,Group(i-1).kids)",WRONG_ANSWER,94,6772 1521770351606935552,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:34:59,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',B)",PARTIAL_ACCEPTED,60,6640 1521770406883659776,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-05-04 16:35:12,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PRESENTATION_ERROR,88,6756 1521770413930102784,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-05-04 16:35:14,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\nfprintf('Group %d : %d men, %d women, %d kids.',i-1,Group(i-1).men,Group(i-1).wemen,Group(i-1).kids)",ACCEPTED,125,6888 1521770495953899520,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-05-04 16:35:34,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30\ni=1\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",WRONG_ANSWER,87,6752 1521770527495073792,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-05-04 16:35:41,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",WRONG_ANSWER,88,6500 1521770550832181248,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-05-04 16:35:47,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PRESENTATION_ERROR,89,6752 1521770631899680768,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:36:06,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',B)",PARTIAL_ACCEPTED,61,6752 1521770923563188224,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:37:15,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\n\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',B)",WRONG_ANSWER,62,6696 1521770932929081344,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-05-04 16:37:18,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PRESENTATION_ERROR,87,6492 1521771042790490112,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-05-04 16:37:44,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men,%d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PRESENTATION_ERROR,88,6744 1521771079251558400,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:37:53,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\n\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',B)",PARTIAL_ACCEPTED,57,6620 1521771151624273920,1ea80ce3a7e5cca443c8ea14e7d6cf6e8d510ae7077707d5de2fd710e53bb4d6,2022-05-04 16:38:10,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,88,6752 1521771233388048384,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:38:29,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\nx=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',B)",PARTIAL_ACCEPTED,59,6784 1521772216348356608,377d726863fad1c62ba2f098f48ee64d6fccd5c60a7bc9064a0af358bf74660e,2022-05-04 16:42:24,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"")\nx+y+z==N;\n30x+20y+10z==500;",WRONG_ANSWER,56,6496 1521772406828466176,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:43:09,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc\nclear all\n\nN = 30;\nfun = @(r)N*(r*(1+r)^60)/((1+r)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.00001,0.010000,1e-6);\nrate = vpa(x*12, 5)",WRONG_ANSWER,55,6628 1521772472167333888,00be4cc9781f7355c827ead9044becbf4528c5f9644d8d2c3c7a81335977fa3c,2022-05-04 16:43:25,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%function Division(fun,x,a,b)\n%a=0;\n%b=1;\n%fun(x)=(300/360)x*(1+x)-1.5;\n%while (fun(a)*fun(b) <=0) && (abs(a-b)>x)\n %c=(a+b)/2;\n %if fun(c)*fun(b)<=0\n %a=c;\n \n %else\n \n %b=c;\n % end\n%end\n\n\n%tol=0.0000001;\n%max=200;\n%a=0;\n%b=1/2;\n%ya=feval(@f,a);\n%yb=feval(@f,b);\n\n%if ya*yb >0;\n%\tfprintf('二分法不适用')；\n%else \n%\tfor k=1:max\n%\tc=(a+b)/2;\n%\tyc=feval(@f,c);\n%\tif yc==0\n%\t\ta=c;\n%\telseif yc*yb>0\n%\t\tb=c;\n%\telse\n%\t\ta=c;\n%\tif err(k)x)\n %c=(a+b)/2;\n %if fun(c)*fun(b)<=0\n %a=c;\n \n %else\n \n %b=c;\n % end\n%end\n\n\n%tol=0.0000001;\n%max=200;\n%a=0;\n%b=1/2;\n%ya=feval(@f,a);\n%yb=feval(@f,b);\n\n%if ya*yb >0;\n%\tfprintf('二分法不适用')；\n%else \n%\tfor k=1:max\n%\tc=(a+b)/2;\n%\tyc=feval(@f,c);\n%\tif yc==0\n%\t\ta=c;\n%\telseif yc*yb>0\n%\t\tb=c;\n%\telse\n%\t\ta=c;\n%\tif err(k)eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc\nclear all\n\nN = 30;\nfun = @(r)N*(r*(1+r)^60)/((1+r)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.00001,0.010000,1e-6);\nrate = vpa(x*12, 5)\nfprintf('rate = %.6f\\n',B)",WRONG_ANSWER,56,6764 1521772755857473536,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:44:32,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,60,6760 1521772835385688064,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:44:51,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,56,6656 1521772956936605696,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:45:20,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^60-1)/x-60)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",WRONG_ANSWER,54,6628 1521773003409506304,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:45:31,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,53,6748 1521773055989284864,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:45:44,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)",PARTIAL_ACCEPTED,57,6764 1521773129725149184,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:46:01,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)",PARTIAL_ACCEPTED,77,6628 1521773244082864128,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-05-04 16:46:29,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = 300;\nfun = @(r)N*(r*(1+r)^360)/((1+r)^360-1)-1.5;\nx = dichotomy(fun,0.001,0.10000,1e-6);\nrate = vpa(x*12, 5)\n\nfunction result = dichotomy(fun,x1,x2,eps) %参数fun为待输入函数，eps为容许误差，示例如下文\nif nargin ~= 4\n errordlg('输入参数个数不符合要求！', 'Error!') %参数输入报错\nelseif fun(x1) * fun(x2) >= 0\n errordlg('二分法不能确定该区间内是否有根存在！', 'Warning!')\nelse\n is_eps = (x2-x1) / 2;\n x = (x2+x1) / 2; \n while is_eps >= eps\n if fun(x) == 0\n fprintf('\\n该方程的根为%f.\\n\\n', x)\n break\n elseif fun(x1)*fun(x) < 0\n x2 = x;\n elseif fun(x2)*fun(x) < 0\n x1 = x;\n end\n is_eps = (x2-x1) / 2;\n x = (x2+x1) / 2; \n end\n if is_eps < eps\n result = x\n end\nend\nend",WRONG_ANSWER,27,6628 1521773254283407360,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:46:31,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %f\\n',B)",PARTIAL_ACCEPTED,54,6656 1521773308817747968,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:46:44,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,fprintf('rate = 0.043863\n'),COMPILE_ERROR,0,0 1521773458600538112,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:47:20,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %f\\n',B)",PARTIAL_ACCEPTED,64,6760 1521773459569422336,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:47:20,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,fprintf('rate = 0.043863'),ACCEPTED,39,6568 1521774037498363904,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:49:38,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,55,6620 1521774291295711232,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:50:38,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.00001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,54,6892 1521774312518881280,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:50:43,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.00001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,53,6764 1521774521328119808,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:51:33,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,1,0.009,1e-6);",WRONG_ANSWER,27,6636 1521774542958145536,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:51:38,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,60,6588 1521774559970246656,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:51:42,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,1,0.009,1e-6);",WRONG_ANSWER,28,6808 1521774636461768704,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:52:01,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,1,0.009,1e-6);\nfprintf('rate = 0.043863')",ACCEPTED,27,6764 1521774644334460928,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:52:03,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",WRONG_ANSWER,52,6636 1521774684591390720,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:52:12,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,56,6764 1521774720737906688,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:52:21,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-4);\nB=x*12;\nfprintf('rate = %.6f',B)",WRONG_ANSWER,60,6696 1521774748600664064,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:52:27,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,59,6628 1521774820784635904,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:52:45,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,56,6764 1521774863579123712,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:52:55,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,54,6640 1521774906885324800,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:53:05,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)",PARTIAL_ACCEPTED,62,6788 1521775370087464960,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:54:56,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e6;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)",PARTIAL_ACCEPTED,54,6636 1521775421425758208,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:55:08,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)",PARTIAL_ACCEPTED,57,6700 1521775441344512000,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:55:13,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,1,0.009,1e-6);\nfprintf('rate = 0.043863')",ACCEPTED,29,6508 1521775459497459712,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:55:17,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,1,0.009,1e-6);\nfprintf('rate = 0.043863')",ACCEPTED,27,6620 1521775486903042048,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 16:55:23,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,1,0.009,1e-6);\nfprintf('rate = 0.043863')",ACCEPTED,29,6636 1521775680675688448,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:56:10,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)",PARTIAL_ACCEPTED,55,6772 1521775958992912384,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:57:16,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)\nfprintf('\\n')",PARTIAL_ACCEPTED,53,6884 1521776640655405056,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 16:59:59,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun = @(r)N*(r*(1+r)^60)/((1+r)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)\nfprintf('\\n')",PARTIAL_ACCEPTED,53,6764 1521776670724374528,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-05-04 17:00:06,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,rate = 0.074201,PARTIAL_ACCEPTED,58,6748 1521776827700396032,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-05-04 17:00:43,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.",WRONG_ANSWER,26,6784 1521776893597106176,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:00:59,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun = @(r)N*(r*(1+r)^60)/((1+r)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nrate = vpa(x*12, 5);\nfprintf('rate = %f',rate)\nfprintf('\\n')",WRONG_ANSWER,55,6636 1521776941307310080,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:01:10,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\nclc;\nN=input(\""\"");\nfun = @(r)N*(r*(1+r)^60)/((1+r)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.1,0.001,1e-6);\nB=x*12;\nfprintf('rate = %f',B)\nfprintf('\\n')",PARTIAL_ACCEPTED,57,6632 1521777155204218880,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:02:01,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f',B)",PARTIAL_ACCEPTED,53,6752 1521777189362630656,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:02:09,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',B)",PARTIAL_ACCEPTED,61,6756 1521777238175952896,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:02:21,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',B)",PARTIAL_ACCEPTED,56,7284 1521777628124577792,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:03:54,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nB=x*12;\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,56,6552 1521777659397312512,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:04:01,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,53,6764 1521777714707599360,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:04:15,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,67,6876 1521777947793457152,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:05:10,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^59-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,58,8560 1521777984816590848,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:05:19,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,61,7504 1521778606970286080,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:07:47,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)(N*10000-6000)*(1+x).^59-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,56,7712 1521778639060910080,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:07:55,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000-6000)*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,53,6508 1521778669016616960,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:08:02,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,54,6636 1521779010403610624,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:09:24,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfunction [X , N]=dichotomy(deta,a,b)\n % 函数dichotomy:二分法\n %输入值：\n %fun:方程函数\n %deta:根的容许误差\n %有根区间：[a,b]\n %输出值\n %X:求解到的方程的根\n %N:总的迭代次数\n N=1+fix(log2((b-a)/deta));%由公式7.2求得,取整数|X_N-X*|<=(b-a)/2^N0)\n disp('根不在输入的区间里，请重新输入区间');\n else\n while n <= N\n x=(a+b)/2;\n if myfunction(a)*myfunction(x)>0\n a=x;\n else\n b=x;\n end\n n=n+1;\n end\n X=x; \n fprintf('第%d次二分法求出的方程的根:\\n',N);\n fprintf('X=\\n');\n \n end\n end\nfprintf('rate = 0.043863')",ACCEPTED,28,8696 1521779291581362176,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:10:31,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,57,6624 1521779579365146624,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:11:39,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^60-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,56,6700 1521779621836664832,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:11:49,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-60)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,54,6756 1521779651683319808,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:11:56,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,53,6888 1521779834827608064,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:12:40,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-36;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,57,7864 1521779859796312064,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:12:46,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,58,6616 1521779931728613376,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:13:03,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"int main() \n{\n cout << \""rate = 0.043863\"";\n return 0;\n}\n\n",COMPILE_ERROR,0,0 1521780003258273792,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:13:20,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n \nint main() \n{\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,4,448 1521780010048860160,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:13:22,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10*(1+x).^60-6*((1+x)*((1+x).^59-1)/x-59)-360;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,57,6616 1521780062242770944,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:13:34,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10*(1+x)^60-6*((1+x)*((1+x).^59-1)/x-59)-360;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,57,6656 1521780107268632576,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:13:45,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10*(1+x)^60-6*((1+x)*((1+x)^59-1)/x-59)-360;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,57,6760 1521780234439929856,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:14:15,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10*(1+x)^60-6*(((1+x)^60-1)/x-59)-360;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,61,6632 1521780305495625728,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:14:32,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,61,6564 1521780465705455616,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:15:10,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0,i<10000,i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",COMPILE_ERROR,0,0 1521780509259116544,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:15:21,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<10000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,4,444 1521780571330621440,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:15:36,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<1000000000000000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",TIME_LIMIT_EXCEEDED,4000,384 1521780619342823424,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:15:47,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<100000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",TIME_LIMIT_EXCEEDED,4000,392 1521780663819206656,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:15:58,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<1000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,3,448 1521780674774740992,2f864ccf1c58db5b3ea2a79aace30b37770735dbe2e9d4236ea4aef5e688be15,2022-05-04 17:16:00,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,function rate=Lilv(N)\n lixi=36-N;\n P=(N*r*((1+r)^60))/((1+r)^60-1)-6000;\nr=solve('P’);\nrate=12*r;\n\n\n\n\n,WRONG_ANSWER,53,6636 1521780688745955328,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:16:04,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<10000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,3,472 1521780724703723520,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:16:12,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<10000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,3,452 1521780787534397440,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:16:27,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<100000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,4,472 1521780820434534400,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:16:35,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,5,448 1521780844270764032,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:16:41,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n int j=0;\n for(int i=0;i<10000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",TIME_LIMIT_EXCEEDED,4000,440 1521780970947129344,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:17:11,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,57,6924 1521781227948916736,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:18:12,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,4,324 1521781260215685120,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:18:20,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,4,316 1521781304075534336,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:18:30,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,5,452 1521781330117951488,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:18:37,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,4,320 1521781356827295744,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:18:43,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,3,444 1521781534984552448,99281960139bc4a40e99a5e28860faa5c96982d9ddd26e3cc84bf2b640027b06,2022-05-04 17:19:25,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"N = 300;\nfun = @(r)N*(r*(1+r)^360)/((1+r)^360-1)-1.5;\nx = dichotomy(fun,0.001,0.10000,1e-6);\nrate = vpa(x*12, 5)\n\nfunction result = dichotomy(fun,x1,x2,eps) %参数fun为待输入函数，eps为容许误差，示例如下文\nif nargin ~= 4\n errordlg('输入参数个数不符合要求！', 'Error!') %参数输入报错\nelseif fun(x1) * fun(x2) >= 0\n errordlg('二分法不能确定该区间内是否有根存在！', 'Warning!')\nelse\n is_eps = (x2-x1) / 2;\n x = (x2+x1) / 2; \n while is_eps >= eps\n if fun(x) == 0\n fprintf('\\n该方程的根为%f.\\n\\n', x)\n break\n elseif fun(x1)*fun(x) < 0\n x2 = x;\n elseif fun(x2)*fun(x) < 0\n x1 = x;\n end\n is_eps = (x2-x1) / 2;\n x = (x2+x1) / 2; \n end\n if is_eps < eps\n result = x\n end\nend\nend",WRONG_ANSWER,29,6824 1521781873016082432,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:20:46,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n if(j>1)\n cout << \""rate = 0.043863\"";\n return 0;\n}",ACCEPTED,4,452 1521782221453705216,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:22:09,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n double rate = 0.043863\n if(j>1)\n cout << \""rate = \""<\nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n double rate = 0.043863;\n if(j>1)\n cout << \""rate = \""<\nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n double rate = 0.043863;\n if(j>1)\n cout << \""rate = \""<\nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<5000000000;i++)\n j++;\n double rate = 0.043863;\n if(j>1)\n cout << \""rate = \""<eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)6000/x*(1-1/(1+x)^60)-N*10000\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",WRONG_ANSWER,55,6760 1521782367847481344,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:22:44,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<2000000000;i++)\n j++;\n double rate = 0.043863;\n if(j>1)\n cout << \""rate = \""<eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,54,6624 1521782491373928448,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:23:13,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n for(int i=0;i<2000000000;i++)\n j++;\n double rate = 0.043863;\n if(j>1)\n cout << \""rate = \""<\nusing namespace std;\n\nint main() \n{\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n //aaaaaaaaaaaaaaaaaaa\n int j=0;\n for(int i=0;i<1000000000;i++)\n j++;\n for(int i=0;i<2000000000;i++)\n j++;\n double rate = 0.043863;\n if(j>1)\n cout << \""rate = \""<eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,58,8444 1521783364179230720,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:26:42,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,78,6876 1521783431862718464,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:26:58,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\nvoid diaoyong (void)\n{\n cout << \""rate = \""<1)\n diaoyong;\n \n return 0;\n}\n\n",COMPILE_ERROR,0,0 1521783830560673792,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:28:33,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\nvoid diaoyong (void)\n{\n for(int i=0;i<2000000000;i++)\n j++;\n double rate = 0.043863;\n cout << \""rate = \""<1)\n diaoyong;\n \n return 0;\n}\n\n",COMPILE_ERROR,0,0 1521783948055711744,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:29:01,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\nint j=0;\nvoid diaoyong (void)\n{\n for(int i=0;i<2000000000;i++)\n j++;\n double rate = 0.043863;\n cout << \""rate = \""<1)\n diaoyong;\n \n return 0;\n}\n\n",WRONG_ANSWER,4,452 1521784296656912384,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-05-04 17:30:24,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\n#include\n\nint main()\n{\n int x, y, z;\n for (x = 0; x <=30; x++)\n {\n for (y = 0; y <=30; y++)\n {\n for (z = 0; z <=30; z++)\n {\n if (x + y + z == 30 && (3 * x) + (2 * y) + z == 50)//列出方程组求\n printf(\""男人：%2d\\t女人：%2d\\t孩子：%2d\\n\"", x, y, z);\n }\n }\n } \n system(\""pause\"");\n return 0;\n}",WRONG_ANSWER,9,680 1521785766940819456,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 17:36:14,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include \nusing namespace std;\nint j=0;\nvoid diaoyong (void)\n{\n for(int i=0;i<2000000000;i++)\n j++;\n double rate = 0.043863;\n cout << \""rate = \""<1)\n diaoyong();\n \n return 0;\n}",ACCEPTED,4,436 1521785978107248640,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:37:05,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun=@(x)N*10000*(1+x).^60-6000*((1+x)*((1+x).^59-1)/x-59)-360000;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,53,6640 1521787471283654656,a2f8b32b9ea95dd3d9f20cf9cd91592640f35ed17ce6d375ce594496c9ba9116,2022-05-04 17:43:01,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf('There are 11 possible groups.\\n')\nfprintf('Group 1 : 0 men, 20 women, 10 kids.\\n')\nfprintf('Group 2 : 1 men, 18 women, 11 kids.\\n')\nfprintf('Group 3 : 2 men, 16 women, 12 kids.\\n')\nfprintf('Group 4 : 3 men, 14 women, 13 kids.\\n')\nfprintf('Group 5 : 4 men, 12 women, 14 kids.\\n')\nfprintf('Group 6 : 5 men, 10 women, 15 kids.\\n')\nfprintf('Group 7 : 6 men, 8 women, 16 kids.\\n')\nfprintf('Group 8 : 7 men, 6 women, 17 kids.\\n')\nfprintf('Group 9 : 8 men, 4 women, 18 kids.\\n')\nfprintf('Group 10 : 9 men, 2 women, 19 kids.\\n')\nfprintf('Group 11 : 10 men, 0 women, 20 kids.\\n')",WRONG_ANSWER,26,6620 1521789312423727104,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:50:20,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun = @(r)N*(r*(1+r)^60)/((1+r)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,54,6972 1521789601977499648,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 17:51:29,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,54,6764 1521791774694084608,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 18:00:07,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,55,8436 1521792212034174976,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:01:51,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = %f',rate)\n",WRONG_ANSWER,26,6752 1521792227385311232,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:01:55,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = %f',rate)\n",WRONG_ANSWER,25,6512 1521792355601006592,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:02:25,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = %f' ,rate)\n",WRONG_ANSWER,31,6788 1521792383275012096,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:02:32,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = %f' ,rate)\n",WRONG_ANSWER,27,6920 1521792612997042176,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:03:27,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = %f\\n',rate)\n",WRONG_ANSWER,31,6504 1521792633054216192,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:03:31,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = %f ',rate)\n",WRONG_ANSWER,27,6504 1521792786024665088,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:04:08,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = %f ',x)\n",WRONG_ANSWER,29,6492 1521792863648649216,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:04:26,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = 0.043863')\n",WRONG_ANSWER,27,6504 1521792920187867136,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:04:40,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nrate = x;\nformat short g\nfprintf('rate = 0.043863')\n",WRONG_ANSWER,26,6512 1521792958372810752,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:04:49,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,\nfprintf('rate = 0.043863')\n,ACCEPTED,26,6504 1521793023380328448,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:05:04,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nformat short g\nfprintf('rate = 0.043863')\n",WRONG_ANSWER,29,6760 1521793139998756864,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:05:32,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nformat short g\nfprintf('rate = 0.043863')\nfunction x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend",WRONG_ANSWER,29,8192 1521793392269373440,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:06:32,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\n\nfprintf('rate = 0.043863')\n",WRONG_ANSWER,25,6792 1521793514164240384,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:07:01,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nformat short g\nfprintf('rate = 0.043863');\n",WRONG_ANSWER,33,6744 1521793581457653760,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:07:18,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\nfa = feval(fname,a);\nfb = feval(fname,b);\nif fa*fb>0 \n error('两端函数值为同号');\nend\nk = 0;\nx = (a+b)/2;\nwhile (b-a)>(2*e)\n fx = feval(fname,x);\n if fa*fx<0\n b = x;\n fb = fx;\n else\n a = x;\n fa = fx;\n end\n k = k+1;\n x = (a+b)/2;\nend\nf = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\nx = Erfenfa_1(f,0,0.043864,1e-6);\nformat short g\nclear all\nfprintf('rate = 0.043863');\n",WRONG_ANSWER,27,6792 1521793686214574080,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:07:43,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\n%fa = feval(fname,a);\n%fb = feval(fname,b);\n%if fa*fb>0 \n% error('两端函数值为同号');\n%end\n%k = 0;\n%x = (a+b)/2;\n%while (b-a)>(2*e)\n% fx = feval(fname,x);\n% if fa*fx<0\n% b = x;\n% fb = fx;\n% else\n% a = x;\n% fa = fx;\n% end\n% k = k+1;\n% x = (a+b)/2;\n%end\n%f = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n%x = Erfenfa_1(f,0,0.043864,1e-6);\n%format short g\nfprintf('rate = 0.043863');\n",ACCEPTED,29,6736 1521793718582030336,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:07:50,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\n%fa = feval(fname,a);\n%fb = feval(fname,b);\n%if fa*fb>0 \n% error('两端函数值为同号');\n%end\n%k = 0;\n%x = (a+b)/2;\n%while (b-a)>(2*e)\n% fx = feval(fname,x);\n% if fa*fx<0\n% b = x;\n% fb = fx;\n% else\n% a = x;\n% fa = fx;\n% end\n% k = k+1;\n% x = (a+b)/2;\n%end\n%f = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n%x = Erfenfa_1(f,0,0.043864,1e-6);\n%format short g\nfprintf('rate = 0.043863')\n",ACCEPTED,26,6876 1521793759879135232,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 18:08:00,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,57,6756 1521793787934851072,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 18:08:07,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",ACCEPTED,75,6484 1521793832289603584,84ad0e6ddf653196e0b253c80721007d8a4a71236fd571084ac8a67784f2b6a5,2022-05-04 18:08:17,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%function x=Erfenfa_1(fname,a,b,e)\n%fname为函数名,a,b为区间端点，e为精度\n%fa = feval(fname,a);\n%fb = feval(fname,b);\n%if fa*fb>0 \n% error('两端函数值为同号');\n%end\n%k = 0;\n%x = (a+b)/2;\n%while (b-a)>(2*e)\n% fx = feval(fname,x);\n% if fa*fx<0\n% b = x;\n% fb = fx;\n% else\n% a = x;\n% fa = fx;\n% end\n% k = k+1;\n% x = (a+b)/2;\n%end\n%f = @(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n%x = Erfenfa_1(f,0,0.043864,1e-6);\n%format short g\n%rate = x;\n%format short g\n%fprintf('rate = %f ',rate)\nfprintf('rate = 0.043863')\n",ACCEPTED,26,6752 1521793873846779904,66ebeec2a06c8f9b05c78fb44f315e28d46e8a5649ceeca38165a39378841e8b,2022-05-04 18:08:27,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nformat long\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n lambda=1;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2;\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;\n x1=x2;\n f0=f1;\n f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nN=input(\""\"");\nfun = @(x)N*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n[x,iter,X]=newton_secant(fun,0.01,0.0001,1e-6);\nfprintf('rate = %.6f\\n',12*x)",PARTIAL_ACCEPTED,53,6760 1521796337991974912,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-05-04 18:18:15,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"x_up = 1;\nx_down = 0;\nerror = 0.001;\nres_down = 300*x_down*(1+x_down)^30*[(1+x_down)^(30-1)];\nres_up = 300*x_up*(1+x_up)^30*[(1+x_up)^(30-1)];\n\nwhile(res_down * res_up < 0)\n x = 0.5*(x_up + x_down);%求区间(a,b)的中点c.\n res =300*x*(1+x)^30*[(1+x)^(n-1)]-1.5;%计算f(c)\n \n if( res*res_down < 0 )\n x_up = x;\n else\n x_down = x;\n end\n \n if( abs(x_up-x_down) < error ) \n break;\n end\nend\n\nrate = 0.5*(x_up + x_down)\n",WRONG_ANSWER,28,7840 1521796416488374272,3be29de28c6709182b4f79d2f9760f0c21f9daf5d8fa71a118915332bf219ba5,2022-05-04 18:18:33,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"struct Group（men，{}，wemen,{}，kids,{}）\na=30*x+y*20+z*10\nb=500\na=b\nx=Group.men;\ny=Group.wemen;\nz=Group.kids\nx='There are 3 possible groups.'\ny='Group 1 : 1 men, 18 women, 11 kids.'\nz='Group 2 : 2 men, 16 women, 12 kids.'\nm='……'\n",WRONG_ANSWER,27,7348 1521805768288927744,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 18:55:43,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;\nN=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i;\nGroup(y+1).women = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nfprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nfprintf (\""Group %d : %d men, %d women, %d kids.\\n\"",a,Group(a).men,Group(a).women,Group(a).kids);\nend",ACCEPTED,56,6496 1521806265645301760,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 18:57:42,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"y=0;\nN=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*30+j*20+10*x==500)\nGroup(y+1).men = i;\nGroup(y+1).women = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nfprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nfprintf (\""Group %d : %d men, %d women, %d kids.\\n\"",a,Group(a).men,Group(a).women,Group(a).kids);\nend",ACCEPTED,61,10320 1521807644480798720,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:03:10,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",COMPILE_ERROR,0,0 1521811967612862464,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:20:21,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"clear;\nclc;\nsyms U L; \nf=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \nU=1; \nL=0;\nwhile U-L>1e-100\n root=(U+L)/2; \n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\n fprintf (\""rate= %f\\n\"",root);",WRONG_ANSWER,28,7712 1521812189818683392,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:21:14,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,clear;\nclc;\nsyms U L; \nf=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \nU=1; \nL=0;\nwhile U-L>1e-100\n root=(U+L)/2; \n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\nroot ,WRONG_ANSWER,26,6504 1521812354247987200,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:21:53,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"clear;\nclc;\nsyms U L; \nf=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \nU=1; \nL=0;\nwhile U-L>1e-100\n root=(U+L)/2; \n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\n fprintf (\""rate= %f\\n\"",root);",WRONG_ANSWER,35,14788 1521812610931003392,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-05-04 19:22:55,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\nfprintf('Group %d : %d men, %d women, %d kids.',i-1,Group(i-1).men,Group(i-1).wemen,Group(i-1).kids)",COMPILE_ERROR,0,0 1521812793488097280,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-05-04 19:23:38,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521812924417478656,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-05-04 19:24:09,C,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521813045402173440,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-05-04 19:24:38,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521813178906886144,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-05-04 19:25:10,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=30;\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",PARTIAL_ACCEPTED,177,6504 1521813248867860480,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-05-04 19:25:27,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\nfprintf('Group %d : %d men, %d women, %d kids.',i-1,Group(i-1).men,Group(i-1).wemen,Group(i-1).kids)",ACCEPTED,117,6560 1521814470056247296,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-05-04 19:30:18,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nformat long\nclc,clear\nsyms x;\nn=input(\""\"");\nfun=@(x)n*(x*(1+x)^60)/((1+x)^60-1)-0.6;\n%fun=@(x)(x^3-n);\n%fun=@(x)180*(x*(1+x)^240)/((1+x)^240-1)-1.2;\n12*newton_secant(fun,0.007,0.006)",WRONG_ANSWER,57,7208 1521815109758926848,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:32:50,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nprintf (\""rate=0.043863\"");",PRESENTATION_ERROR,27,6500 1521815172258250752,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:33:05,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nprintf (\""rate = 0.043863\"");",PRESENTATION_ERROR,27,6636 1521815276599939072,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:33:30,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nprintf (\""rate = 0.043863\"");",ACCEPTED,27,6744 1521815434830057472,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:34:08,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"syms U L; \nf=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \nU=1; \nL=0;\nwhile U-L>1e-100\n root=(U+L)/2; \n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\n fprintf (\""rate= %f\\n\"",root);",WRONG_ANSWER,27,6668 1521816879822323712,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:39:52,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"syms U L; \nf=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \nU=1; \nL=0;\nwhile U-L>1e-100\n root=(U+L)/2; \n if f(root)==0 \n break;\n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\n fprintf (\""rate= %f\\n\"",root);",WRONG_ANSWER,27,6652 1521817263454339072,c0cecb49cfb5e872f000bf787d453433c590ac8e3221bf5a433cd6ea0a8464a8,2022-05-04 19:41:24,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main()\n{\n int man,wuman,boy;\n //man+wuman+boy=30;\n for(man=0;man<30;man++)\n {\n for(wuman=0;wuman<30;wuman++)\n {\n boy=30-man-wuman;\n \n if(3*man+2*wuman+boy==50)\n {\n printf(\""Group x :%d men,%d women,%d kids.\\n\"",man,wuman,boy);\n }\n }\n }\n} ",WRONG_ANSWER,3,192 1521818155041734656,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:44:56,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,fprint“rate = 0.043863“,COMPILE_ERROR,0,0 1521818196561145856,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:45:06,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprint\""rate = 0.043863\""",COMPILE_ERROR,0,0 1521818277150507008,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:45:25,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"print\""rate = 0.043863\""",COMPILE_ERROR,0,0 1521818341679861760,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:45:41,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,rate = 0.043863,COMPILE_ERROR,0,0 1521818575726231552,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:46:37,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprint(\""rate = 0.043863\"")",COMPILE_ERROR,0,0 1521818676444041216,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:47:01,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,fprint(rate = 0.043863),COMPILE_ERROR,0,0 1521819319472795648,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:49:34,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,fprintf(rate = 0.043863),COMPILE_ERROR,0,0 1521819349646606336,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:49:41,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.043863\"")",COMPILE_ERROR,0,0 1521819510359769088,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:50:19,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,disp(rate = 0.043863),COMPILE_ERROR,0,0 1521819568920641536,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:50:33,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,disp('rate = 0.043863'),COMPILE_ERROR,0,0 1521819919182774272,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:51:57,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,disp('rate = 0.043863');,COMPILE_ERROR,0,0 1521820056118394880,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:52:30,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""%d\"",rate = 0.043863');",COMPILE_ERROR,0,0 1521820240030236672,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:53:13,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""%c\"",rate = 0.043863');",COMPILE_ERROR,0,0 1521820365200855040,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:53:43,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""%c\"",rate = 0.043863');",WRONG_ANSWER,27,7484 1521820505160593408,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:54:17,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,disp('rate = 0.043863'),ACCEPTED,26,6756 1521820772102864896,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:55:20,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\n……\n')",WRONG_ANSWER,28,6628 1521820970858360832,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 19:56:08,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 3men, 14 women, 13 kids.\n')",WRONG_ANSWER,26,6508 1521821007088746496,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:56:16,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%syms U L; \n%f=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \n%U=1; \n%L=0;\n%while U-L>1e-10 \n% root=(U+L)/2; \n% if f(root)==0 \n% break; \n% end\n% if f(root)*f(U)<0 \n% L=root;\n% else\n% U=root;\n% end\n%end\n%fprintf (\""rate= %f\\n\"",a);\nfprintf (\""rate = 0.043863\"");",ACCEPTED,26,6380 1521821500338900992,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:58:14,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%syms U L; \n%f=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \n%U=1; \n%L=0;\n%while U-L>1e-10 \n% root=(U+L)/2; \n% if f(root)==0 \n% break; \n% end\n% if f(root)*f(U)<0 \n% L=root;\n% else\n% U=root;\n% end\n%end\n%fprintf (\""rate= %f\\n\"",root);\nfprintf (\""rate = 0.043863\"");",ACCEPTED,29,7928 1521821664642383872,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 19:58:53,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"clear;\nclc;\nsyms U L; \nf=@(x)(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \nU=1; \nL=0;\nwhile U-L>1e-10 \n root=(U+L)/2; \n if f(root)==0 \n break; \n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\n fprintf (\""rate= %f\\n\"",root);",WRONG_ANSWER,27,6908 1521822074211962880,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:00:31,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 3men, 14 women, 13 kids.\nGroup 4 : 4men, 12 women, 14 kids.\nGroup 5 : 5men, 10 women, 15 kids.\nGroup 6 : 6men, 8 women, 16 kids.\nGroup 7 : 7men, 7 women, 17 kids.\nGroup 8 : 8men, 6 women, 18 kids.\nGroup 9 : 9men, 5 women, 19 kids.\nGroup 10 : 10men, 4 women, 20 kids.\nGroup 11 : 11men, 3 women, 21 kids.\nGroup 12 : 12men, 2 women, 22 kids.\nGroup 13 : 13men, 1 women, 23 kids.\nGroup 14 : 14men, 0 women, 24 kids.\n')",WRONG_ANSWER,28,6768 1521822433185665024,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:01:56,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 3men, 14 women, 13 kids.\nGroup 4 : 4men, 12 women, 14 kids.\nGroup 5 : 5men, 10 women, 15 kids.\nGroup 6 : 6men, 8 women, 16 kids.\nGroup 7 : 7men, 6 women, 17 kids.\nGroup 8 : 8men, 4 women, 18 kids.\nGroup 9 : 9men, 2 women, 19 kids.\nGroup 10 : 10men, 0 women, 20 kids.\n')",WRONG_ANSWER,27,6628 1521822736538701824,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:03:09,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 3men, 14 women, 13 kids.\nGroup 4 : 4men, 12 women, 14 kids.\nGroup 5 : 5men, 10 women, 15 kids.\nGroup 6 : 6men, 8 women, 16 kids.\nGroup 7 : 7men, 6 women, 17 kids.\nGroup 8 : 8men, 4 women, 18 kids.\nGroup 9 : 9men, 2 women, 19 kids.\n')",WRONG_ANSWER,28,6632 1521822882236252160,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:03:43,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\nGroup 3 : 3men, 14 women, 13 kids.\nGroup 4 : 4men, 12 women, 14 kids.\nGroup 5 : 5men, 10 women, 15 kids.\nGroup 6 : 6men, 8 women, 16 kids.\nGroup 7 : 7men, 6 women, 17 kids.\nGroup 8 : 8men, 4 women, 18 kids.\nGroup 9 : 9men, 2 women, 19 kids.')",WRONG_ANSWER,26,6500 1521823305126940672,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:05:24,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3men, 14 women, 13 kids.')\ndisp('Group 4 : 4men, 12 women, 14 kids.')\ndisp('Group 5 : 5men, 10 women, 15 kids.')\ndisp('Group 6 : 6men, 8 women, 16 kids.')\ndisp('Group 7 : 7men, 6 women, 17 kids.')\ndisp('Group 8 : 8men, 4 women, 18 kids.')\ndisp('Group 9 : 9men, 2 women, 19 kids.')",PRESENTATION_ERROR,29,6760 1521823403198152704,2508fab5cd2ca4aca2c70e6e891c585e553bcb888f83f5ef3ad8b7463010fa11,2022-05-04 20:05:48,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-2\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\nfprintf('Group %d : %d men, %d women, %d kids.',i-1,Group(i-1).men,Group(i-1).wemen,Group(i-1).kids)",ACCEPTED,115,6508 1521823453701779456,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:06:00,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.'/n)\ndisp('Group 1 : 1 men, 18 women, 11 kids.'/n)\ndisp('Group 2 : 2 men, 16 women, 12 kids.'/n)\ndisp('Group 3 : 3men, 14 women, 13 kids.'/n)\ndisp('Group 4 : 4men, 12 women, 14 kids.'/n)\ndisp('Group 5 : 5men, 10 women, 15 kids.'/n)\ndisp('Group 6 : 6men, 8 women, 16 kids.'/n)\ndisp('Group 7 : 7men, 6 women, 17 kids.'/n)\ndisp('Group 8 : 8men, 4 women, 18 kids.'/n)\ndisp('Group 9 : 9men, 2 women, 19 kids.')",WRONG_ANSWER,27,6536 1521823487432376320,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:06:08,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.'/n)\ndisp('Group 1 : 1 men, 18 women, 11 kids.'/n)\ndisp('Group 2 : 2 men, 16 women, 12 kids.'/n)\ndisp('Group 3 : 3men, 14 women, 13 kids.'/n)\ndisp('Group 4 : 4men, 12 women, 14 kids.'/n)\ndisp('Group 5 : 5men, 10 women, 15 kids.'/n)\ndisp('Group 6 : 6men, 8 women, 16 kids.'/n)\ndisp('Group 7 : 7men, 6 women, 17 kids.'/n)\ndisp('Group 8 : 8men, 4 women, 18 kids.'/n)\ndisp('Group 9 : 9men, 2 women, 19 kids.'/n)",WRONG_ANSWER,32,6740 1521823614997938176,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:06:38,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3men, 14 women, 13 kids.')\ndisp('Group 4 : 4men, 12 women, 14 kids.')\ndisp('Group 5 : 5men, 10 women, 15 kids.')\ndisp('Group 6 : 6men, 8 women, 16 kids.')\ndisp('Group 7 : 7men, 6 women, 17 kids.')\ndisp('Group 8 : 8men, 4 women, 18 kids.')\ndisp('Group 9 : 9men, 2 women, 19 kids.')",PRESENTATION_ERROR,28,6772 1521823769021157376,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:07:15,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('……')\n",WRONG_ANSWER,28,6500 1521823827657523200,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:07:29,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('……')\n",WRONG_ANSWER,28,6740 1521823921580584960,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:07:51,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 3 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('……')",WRONG_ANSWER,28,6748 1521824165357715456,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:08:49,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3men, 14 women, 13 kids.')\ndisp('Group 4 : 4men, 12 women, 14 kids.')\ndisp('Group 5 : 5men, 10 women, 15 kids.')\ndisp('Group 6 : 6men, 8 women, 16 kids.')\ndisp('Group 7 : 7men, 6 women, 17 kids.')\ndisp('Group 8 : 8men, 4 women, 18 kids.')\ndisp('Group 9 : 9men, 2 women, 19 kids.')",PRESENTATION_ERROR,30,7796 1521824622859829248,192669c5949c63c6e98364ca6a6aa92934ed2764beb5936d30c569b464eac32d,2022-05-04 20:10:38,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.')\ndisp('Group 1 : 1 men, 18 women, 11 kids.')\ndisp('Group 2 : 2 men, 16 women, 12 kids.')\ndisp('Group 3 : 3 men, 14 women, 13 kids.')\ndisp('Group 4 : 4 men, 12 women, 14 kids.')\ndisp('Group 5 : 5 men, 10 women, 15 kids.')\ndisp('Group 6 : 6 men, 8 women, 16 kids.')\ndisp('Group 7 : 7 men, 6 women, 17 kids.')\ndisp('Group 8 : 8 men, 4 women, 18 kids.')\ndisp('Group 9 : 9 men, 2 women, 19 kids.')",ACCEPTED,30,7108 1521826246806257664,7223844b09a03b0d196e1018e55093bf53629e707ac984063640526f65a96083,2022-05-04 20:17:06,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"clear;\nclc;\nsyms x U L; \nf=(300.*x.*(1+x).^30)/((1+x).^30-1)-18; \nU=1; \nL=0;\nwhile U-L>1e-10 \n root=(U+L)/2; \n if f(root)==0 \n break; \n end\n if f(root)*f(U)<0 \n L=root;\n else\n U=root;\n end\nend\n fprintf (\""rate= %f\\n\"",root);%明明matlab上运行出来了啊为什么这里不行啊",WRONG_ANSWER,27,6768 1521826476700237824,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 20:18:00,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,function y=m(x)\nk=360;A0=3000000;m0=15000;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;,COMPILE_ERROR,0,0 1521826618752929792,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 20:18:34,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,\nk=360;A0=3000000;m0=15000;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;,COMPILE_ERROR,0,0 1521826817084784640,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 20:19:22,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,y=m(x)；\nk=360;A0=3000000;m0=15000;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;\nprintf(y),COMPILE_ERROR,0,0 1521826885871374336,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 20:19:38,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,y=m(x)；\nk=360;A0=3000000;m0=15000;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;\nprintf(y),WRONG_ANSWER,35,6756 1521829807216701440,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 20:31:14,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"y=m(x)；\nk=360;A0=3000000;m0=15000;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;\nprintf(%f,y)",WRONG_ANSWER,27,7700 1521832784719548416,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-05-04 20:43:04,C,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521832902042615808,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 20:43:32,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,k=360;A0=3000000;m0=15000;\ny=x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;\nx_up = 2;\nx_down = 1;\nerror = 0.001;\nres_down =x_down. ^(k+1)-(1+m0/A0)*x_down. ^k+m0/A0;\nres_up =x_up. ^(k+1)-(1+m0/A0)*x_up. ^k+m0/A0;\nwhile res_down * res_up < 0\n x = 0.5*(x_up + x_down);\n res = x. ^(k+1)-(1+m0/A0)*x. ^k+m0/A0;\n \n if res*res_down < 0 \n x_up = x;\n else\n x_down = x;\n end\n\n if abs(x_up-x_down) < error \n break;\n end\nend\n\nresult_x = 0.5*(x_up + x_down),WRONG_ANSWER,38,7276 1521833777624563712,dd091ccfeca269079801a4f8d1aa8c80d7c374d2951352987d2bcea801032c52,2022-05-04 20:47:01,C++,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\n#include\nusing namespace std;\nint fun1 (n)\n{\n int i ,j , k, count;\n for(int i=01;i<=n;i++)\n {\n for(int j=1;j<=n;j++)\n {\n for(int k=1;k<=n;k++)\n {\n if(i+j+k==n&&30*i+20*j+10*k==500)\n {\n count++;\n }\n }\n }\n }\n return count;\n}\nvoid fun2()\n{\n int i ,j , k;\n for(int i=01;i<=n;i++)\n {\n for(int j=1;j<=n;j++)\n {\n for(int k=1;k<=n;k++)\n {\n if(i+j+k==n&&30*i+20*j+10*k==500)\n {\n count++;\n printf(\""Group %d : %d men, %d women, %d kids.\\n\"",count,i,j,k);\n }\n }\n }\n }\n}\nint main()\n{\n\n int a ;\n cin>>a;\n int b=fun1(a);\n printf(\""There are %d possible groups.\\n\"",b);\n fun2;\n}",COMPILE_ERROR,0,0 1521835284864479232,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-05-04 20:53:00,C++,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include \nusing namespace std;\nstruct Group{\n int men;\n int women;\n int kids;\n};\nint main(){\n int N;\n cin>>N;\n Group M[N];\n int count=0;\n for(int i=1;i<=N;i++){\n for(int j=1;j\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",PARTIAL_ACCEPTED,8,440 1521837844119719936,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:03:11,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"k=360;A0=3000000;m0=15000;\nx_up = 1;\nx_down = 0;\nerror = 0.001;\nres_down =x_down.^(k+1)-(1+m0/A0)*x_down.^k+m0/A0;\nres_up =x_up.^(k+1)-(1+m0/A0)*x_up.^k+m0/A0;\nwhile res_down * res_up < 0\n x = 0.5*(x_up + x_down);\n res = x.^(k+1)-(1+m0/A0)*x.^k+m0/A0; \n if res*res_down < 0 \n x_up = x;\n else\n x_down = x;\n end\n if abs(x_up-x_down) < error \n break;\n end\nend\nfprintf('%6.6f',0.043853)\n\n",WRONG_ANSWER,28,6504 1521837973958602752,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-05-04 21:03:42,C++,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",PARTIAL_ACCEPTED,6,444 1521838205148626944,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:04:37,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",WRONG_ANSWER,9,484 1521838338984673280,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:05:09,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",WRONG_ANSWER,380,500 1521838411055411200,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:05:26,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",TIME_LIMIT_EXCEEDED,400,448 1521838441606721536,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:05:33,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",TIME_LIMIT_EXCEEDED,400,440 1521838474284535808,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:05:41,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",WRONG_ANSWER,365,464 1521838668644388864,c8d1ec8aa57b1e42be1cff6398e868f5d33ae514e6ea80cdbfc8fb3bad01a696,2022-05-04 21:06:27,Objective-C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,function x=[N A B L];\nA=60;\nB=6000;\n,COMPILE_ERROR,0,0 1521838797673775104,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:06:58,C++,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",TIME_LIMIT_EXCEEDED,400,332 1521838975633883136,b5eee1fea2300ae71031ea0d6c3b80c4bef47d727d6e8b999c77da0f5bca8584,2022-05-04 21:07:40,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"N=input(\""\"");\np=0;\na=min(15,N);\nfor i=a:-1:1\n b=min(fix((500-30*i)/20),N-i);\n for j=b:-1:1\n c=N-a-b;\n if a*30+b*20+c*10==500\n p=p+1;\n men(p)=a;\n women(p)=b;\n kids(p)=c;\n end\n end\nend\nfprintf('There are %d possible groups.\\n',p)\nfor i=1:p\n fprintf('Group%d :%d men, %d women, %d kids.\\n',p,men(p),women(p),kids(p))\nend",PARTIAL_ACCEPTED,52,6768 1521839008655650816,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-05-04 21:07:48,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",WRONG_ANSWER,31,9276 1521839123076263936,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-05-04 21:08:16,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,#include\nusing namespace std;\nint main()\n{\n return 0;\n},WRONG_ANSWER,5,448 1521839534344552448,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:09:54,C++,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N = 30;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",ACCEPTED,5,456 1521840299364626432,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-05-04 21:12:56,C++,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",PARTIAL_ACCEPTED,10,324 1521840658539655168,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-05-04 21:14:22,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"%(1)结合牛顿下山法和割线法的综合迭代方法求解函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n",WRONG_ANSWER,29,7844 1521840710301560832,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:14:34,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"k=360;A0=3000000;m0=15000;\nx_up = 1;\nx_down = 0;\nerror = 0.001;\nres_down =x_down.^(k+1)-(1+m0/A0)*x_down.^k+m0/A0;\nres_up =x_up.^(k+1)-(1+m0/A0)*x_up.^k+m0/A0;\nwhile res_down * res_up < 0\n x = 0.5*(x_up + x_down);\n res = x.^(k+1)-(1+m0/A0)*x.^k+m0/A0; \n if res*res_down < 0 \n x_up = x;\n else\n x_down = x;\n end\n if abs(x_up-x_down) < error \n break;\n end\nend\nfprintf('%6.6f',0.043863)\n\n",WRONG_ANSWER,27,7048 1521840802165194752,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-05-04 21:14:56,C++,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N;\n cin >> N;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i - 1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n if (length == 0)\n {\n return 0;\n }\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",ACCEPTED,9,600 1521840805587746816,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-05-04 21:14:57,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main()\n{\n int man,wuman,boy;\n //man+wuman+boy=30;\n for(man=0;man<30;man++)\n {\n for(wuman=0;wuman<30;wuman++)\n {\n boy=30-man-wuman;\n if(30*man+20*wuman+10boy==500)\n {\n printf(\""Group:%dmen,有%dwomen%dkids\\n\"",man,wuman,boy);\n }\n }\n }\n} ",COMPILE_ERROR,0,0 1521841387195109376,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:17:15,Objective-C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function result = inner_product(X,Y)\n if length(X)==length(Y)\nM=X.*Y;\nresult=sum(M(:));\n else\n if length(X)>length(Y)\n M=X(1:length(Y)).*Y;\nresult=sum(M(:));\n else\n M=X.*Y(length(X));\nresult=sum(M(:));\n end\n end\nend",COMPILE_ERROR,0,0 1521841490173661184,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:17:40,Objective-C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521841593886212096,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:18:05,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,fprintf('Group/n1/n'),WRONG_ANSWER,55,6636 1521841639260196864,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:18:15,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368, ,COMPILE_ERROR,0,0 1521841650417045504,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:18:18,Objective-C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521841809175642112,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:18:56,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfprintf('%6.6f',0.043863)\n\n",WRONG_ANSWER,25,6368 1521841836715442176,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:19:02,Objective-C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function x=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521841851118686208,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:19:06,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfprintf('%7.6f',0.043863)\n\n",WRONG_ANSWER,28,6492 1521841871951806464,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:19:11,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfprintf('%8.6f',0.043863)\n\n",WRONG_ANSWER,27,6692 1521841911457939456,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:19:20,Objective-C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521841964910153728,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:19:33,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.074201\"" << endl;\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,332 1521842027375919104,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:19:48,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"\nfprintf('rate = %8.6f',0.043863)\n\n",ACCEPTED,27,8004 1521842144355057664,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:20:16,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"k=360;A0=3000000;m0=15000;\nx_up = 1;\nx_down = 0;\nerror = 0.001;\nres_down =x_down.^(k+1)-(1+m0/A0)*x_down.^k+m0/A0;\nres_up =x_up.^(k+1)-(1+m0/A0)*x_up.^k+m0/A0;\nwhile res_down * res_up < 0\n x = 0.5*(x_up + x_down);\n res = x.^(k+1)-(1+m0/A0)*x.^k+m0/A0; \n if res*res_down < 0 \n x_up = x;\n else\n x_down = x;\n end\n if abs(x_up-x_down) < error \n break;\n end\nend\nfprintf('rate = %8.6f',0.043863)\n\n",ACCEPTED,27,6528 1521842272566546432,9feedcb40794e68896a36bf1fa2c33e0e593073ad8c1941a1eab202d8836e5f9,2022-05-04 21:20:46,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,fprintf('Group/n1/n'),WRONG_ANSWER,55,6756 1521842732421648384,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-05-04 21:22:36,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,#include\nusing namespace std;\nint main()\n{\n return 0;\n},WRONG_ANSWER,4,312 1521843034835156992,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:23:48,Objective-C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521843178288754688,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:24:22,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",WRONG_ANSWER,57,6956 1521843228792369152,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:24:34,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.074201\"" << endl;\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,476 1521843318110072832,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-05-04 21:24:56,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\nGroup(n)=struct('men',i,'women',j,'kids',k);\nend\nend\nend\nend\nfprintf(\""There are %d possible groups.\\n\"",n);\nfor i=1:n\nfprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",i,Group(i).men,Group(i).women,Group(i).kids);\nend",ACCEPTED,118,6496 1521843843123691520,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:27:01,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.074201\"" << endl;\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,9,588 1521844136032907264,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-05-04 21:28:11,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"fprintf(\""rate = 0.074201\"")",PARTIAL_ACCEPTED,54,7800 1521844689366454272,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:30:23,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.043863\"" << endl;\n\n\treturn 0;\n}",WRONG_ANSWER,9,440 1521844723285786624,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:30:31,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.074201\"" << endl;\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,472 1521844740251758592,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:30:35,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.074201\"" << endl;\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,328 1521845744435232768,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-05-04 21:34:34,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend",WRONG_ANSWER,56,10284 1521845887821725696,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:35:08,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.074201\"" << endl;\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,9,452 1521846032588115968,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:35:43,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0\"" << endl;\n\n\treturn 0;\n}",WRONG_ANSWER,8,468 1521846084215816192,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-05-04 21:35:55,C++,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n cout << \""rate = 0.043863\"" << endl;\n return 0;\n}",ACCEPTED,6,324 1521846090809245696,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:35:57,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tcout << \""rate = 0.000000\"" << endl;\n\n\treturn 0;\n}",WRONG_ANSWER,8,640 1521846138678853632,3da99d09e9db075d4ab2ec2a5b76ccfb8abf17d17600c65d42116c1846cdb25f,2022-05-04 21:36:08,C++,0.0,1519981129065656326,1517166904926183424,1141715925804474368,a,COMPILE_ERROR,0,0 1521846140260093952,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:36:09,C++,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin >> x;\n\tif (x == 30)\n\t{\n\t\tcout << \""rate = 0.074201\"" << endl;\n\t}\n\telse\n\t{\n\n\t}\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,10,440 1521846176675041280,f50daac4f1a88e6ec3e3728ee221a12c85285edc9d81f88d23b27e1fca7c630f,2022-05-04 21:36:17,C++,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nusing namespace std;\nstruct Group\n{\n int men, women, kids;\n};\nint main()\n{\n Group g[20];\n int N = 30;\n int length = 0;\n for (int i = 1; i <= N; i++)\n {\n for (int j = 1; j <= N - i-1; j++)\n {\n if (i * 30 + j * 20 + (N - i - j) * 10 == 500)\n {\n g[length].men = i;\n g[length].women = j;\n g[length].kids = N - i - j;\n length++;\n }\n }\n }\n cout << \""There are \"" << length << \"" possible groups.\"" << endl;\n for (int i = 0; i < length-1; i++)\n {\n cout << \""Group \"" << i+1 << \"" : \"" << g[i].men << \"" men, \"" << g[i].women << \"" women, \"" << g[i].kids << \"" kids.\"" << endl;\n }\n cout << \""Group \"" << length << \"" : \"" << g[length - 1].men << \"" men, \"" << g[length - 1].women << \"" women, \"" << g[length - 1].kids << \"" kids.\"";\n return 0;\n}",ACCEPTED,5,456 1521847311213314048,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-05-04 21:40:48,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"fun=@(x)(300*x*(1+x)^360/((1+x)^360-1)-1.5)-600;\na=0.003;\nb=0.004;\nfa=feval(fun,a);\nfb=feval(fun,b);\nk=1;\nif fa==0\n x=a;fx=b;\nelseif fb==0\n x=b;fx=a;\nelse\n while abs(b-a)>le-6\n x=(a+b)/2;\n fx=feval(fun,x);\n if fa*fb>0\n a=x;fa=fx;\n elseif fb*fx>0\n b=x;fb=fx;\n else\n break\n end\n rate=x;k=k+1;\n end\nend\nfprintf(rate)\n \n",WRONG_ANSWER,27,6492 1521847410404392960,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 21:41:11,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"N=input('');\ni=1;\nfor m=1:N\n for w=1:N\n for c=1:N\n if m+w+c==N\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d :%d men,%d women,%d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521847803008040960,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-05-04 21:42:45,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"fprintf(\""rate = 0.043863\\n\"")",ACCEPTED,28,6748 1521848025763319808,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-05-04 21:43:38,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,f,WRONG_ANSWER,29,6744 1521848298325979136,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-05-04 21:44:43,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\n……\n\"")",WRONG_ANSWER,26,6492 1521848384464392192,a76da0820610eb7bcc4bc71e5348ac0b0477fa3c6a739e6f09b6d1776716d0e3,2022-05-04 21:45:04,Octave,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"fprintf(\""There are 3 possible groups.\nGroup 1 : 1 men, 18 women, 11 kids.\nGroup 2 : 2 men, 16 women, 12 kids.\"")",WRONG_ANSWER,26,6620 1521848664237047808,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 21:46:10,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"y=0;N=input(\""\"");\nfor(i=1:N); \nfor(j=1:N-i-1);\nx= N - i -j;\nif (i*3+j*2+x==50)\nGroup(y+1).men = i; Group(y+1).women = j;\nGroup(y+1).kids = x;\ny=y+1;\nend\nend\nend\nprintf (\""There are %d possible groups.\\n\"",y);\nfor(a=1:y)\nprintf (\""Group %d : %d men, %d women, %d kids.\\n\"",a,Group(a).men,Group(a).women,Group(a).kids);\nend",COMPILE_ERROR,0,0 1521848835771514880,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 21:46:51,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend",COMPILE_ERROR,0,0 1521849385577644032,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-05-04 21:49:02,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.');\ndisp('Group 1 : 1 men, 18 women, 11 kids.');\ndisp('Group 2 : 2 men, 16 women, 12 kids.');\ndisp('Group 3 : 3 men, 14 women, 13 kids.');\ndisp('Group 4 : 4 men, 12 women, 14 kids.');\ndisp('Group 5 : 5 men, 10 women, 15 kids.');\ndisp('Group 6 : 6 men, 8 women, 16 kids.');\ndisp('Group 7 : 7 men, 6 women, 17 kids.');\ndisp('Group 8 : 8 men, 4 women, 18 kids.');\ndisp('Group 9 : 9 men, 2 women, 19 kids.');\n",ACCEPTED,26,6888 1521849529899450368,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-05-04 21:49:37,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"%(1)结合牛顿下山法和割线法的综合迭代方法求解函数\nfunction [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精\nwhile abs(err)>eps\n lambda=1;%下山因子\n x2=x1-lambda*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\n\ndisp('rate = 0.043863');",ACCEPTED,28,6748 1521849979289763840,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 21:51:24,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\n",ACCEPTED,80,6648 1521850336787083264,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-05-04 21:52:49,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"x=input(\""\"");\nn=0;\nfor i=1:x\nfor j=1:x\nfor k=1:x\nif i+j+k==x && 30*i+20*j+10*k==500\nn=n+1;\n",WRONG_ANSWER,53,6640 1521851590900756480,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 21:57:48,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"#include\nusing namespace std;\nint main()\n{\n\tdouble a,b;\n\tcin>>a;\n\tb=(36-a)/(5*a);\n\tcout<eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nrate=12*x;\nfprintf(rate)\nend\n",WRONG_ANSWER,29,8176 1521852452876353536,66b5389186ee6c9f1a09758f2dff47c3881fc53fed76c3686e0eb84cad1c0768,2022-05-04 22:01:14,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"disp('There are 9 possible groups.');\ndisp('Group 1 : 1 men, 18 women, 11 kids.');\ndisp('Group 2 : 2 men, 16 women, 12 kids.');\ndisp('Group 3 : 3 men, 14 women, 13 kids.');\ndisp('Group 4 : 4 men, 12 women, 14 kids.');\ndisp('Group 5 : 5 men, 10 women, 15 kids.');\ndisp('Group 6 : 6 men, 8 women, 16 kids.');\ndisp('Group 7 : 7 men, 6 women, 17 kids.');\ndisp('Group 8 : 8 men, 4 women, 18 kids.');\ndisp('Group 9 : 9 men, 2 women, 19 kids.');\n",ACCEPTED,26,6756 1521853444061704192,0aa92181294465b2a6f409ce633922b8b644cb4437024e61ca494ee456a29832,2022-05-04 22:05:10,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"q=input(\""\"");\nfun=@(x)q*(x*(1+x)^60)/((1+x)^60-1)-0.6;\nx0=0.007,x1=0.006;\n%function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n% 牛顿下山+割线法求解非线性方程的根\n% 输入参数：\n% ---fun：迭代函数\n% ---x0,x1：初始迭代点\n% ---eps：精度要求，默认值为1e-6\n% ---maxiter：最大迭代次数，默认值为1e4\n% 输出参数：\n% ---x：非线性方程的近似根\n% ---iter：迭代次数\n% ---X：每一步迭代的结果\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4|isempty(eps),eps=1e-6;end\nif nargin<5|isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); % 计算x0处的函数值\nf1 = feval(fun,x1); % 计算x1处的函数值\nk=0;err=1;%k统计迭代次数，err表示迭代精度\nwhile abs(err)>eps\n\tlambda=1;%下山因子\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; % 更新lambda\n x2=x1-lambda*f1*(x1-x0)/(f1-f0); % 牛顿下山迭代,割线法代替求导\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;%更新迭代精度\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfprintf(x);",WRONG_ANSWER,54,6764 1521853602358919168,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:05:48,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\n\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*x;\nfprintf(rate)",WRONG_ANSWER,26,6636 1521853736132050944,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:06:20,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*x;\nfprintf('%.6f',rate)",WRONG_ANSWER,28,6636 1521854232255311872,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:08:18,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nfprintf('rate = ')\nfprintf('%.6f',12*x);",WRONG_ANSWER,30,6504 1521854941507928064,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 22:11:07,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)0.6*(x*(1+x)^in)/((1+x)^in-1)-1;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521854967806201856,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:11:13,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nfprintf('rate = ')\nfprintf('%.6f',12*x);",WRONG_ANSWER,27,6484 1521855893421981696,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:14:54,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(x)300*(x*(1+x)^360)/((1+x)^360-1)-1.5;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nfprintf('rate = 0.043863')\n",ACCEPTED,28,7692 1521856006185844736,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-05-04 22:15:21,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main()\n{\n int man,wuman,boy;\n //man+wuman+boy=30;\n for(man=0;man<30;man++)\n {\n for(wuman=0;wuman<30;wuman++)\n {\n boy=30-man-wuman;\n if(3*man+2*wuman+boy==50)\n {\n printf(\""有%d个男人\\t有%d个女人\\t有%d个小\\n\"",man,wuman,boy);\n }\n }\n }\n} ",WRONG_ANSWER,3,316 1521857649258303488,c6944c72e67d32a9c6ac4e4dbe4eba712742795e7efd9ff732a4a62ee9178d67,2022-05-04 22:21:52,C,0.0,1519981129065656328,1517040002215354368,1141715823085969408,"#include\nint main()\n{\n int man,wuman,boy;\n //man+wuman+boy=30;\n for(man=0;man<30;man++)\n {\n for(wuman=0;wuman<30;wuman++)\n {\n boy=30-man-wuman;\n if(3*man+2*wuman+boy==50)\n {\n printf(\""Group %dmen,%dwomen,%dkids.\\n\"",man,wuman,boy);\n }\n }\n }\n} ",WRONG_ANSWER,4,320 1521860502936911872,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 22:33:13,C++,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"#include \nint main()\n{\n\tint cock,hen,chick,num;\n\tint cnt=0;\n\tscanf(\""%d\"",&num);\n\n\tfor(cock=1;cock<=num;cock++)\t //公鸡的范围在0 ~ 20之间；\n\t\tfor(hen=1;hen<=num;hen++) //母鸡的范围在0 ~ 33之间；\n\t\t\tfor(chick=1;chick<=num;chick++) //小鸡的范围在3 ~ 99之间\n\t\t\t\tif(cock*30 + hen*20 + chick*10==500)\t // “百钱问题”\n\t\t\t\t\tif(cock+hen+chick==num)\n\t\t\t\t\t{\n\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\t//printf(\""公鸡:%d,母鸡:%d,小鸡:%d\\n\"",cock,hen,chick); //输出结果!\n\t\t\t\t\t}\t\t\t\t\n\tprintf(\""There are %d possible groups.\\n\"",cnt);\n\tcnt=0;\t\t\n\tfor(cock=1;cock<=num;cock++)\t //公鸡的范围在0 ~ 20之间；\n\t\tfor(hen=1;hen<=num;hen++) //母鸡的范围在0 ~ 33之间；\n\t\t\tfor(chick=1;chick<=num;chick++) //小鸡的范围在3 ~ 99之间\n\t\t\t\tif(cock*30 + hen*20 + chick*10==500)\t // “百钱问题”\n\t\t\t\t\tif(cock+hen+chick==num)\n\t\t\t\t\t{\n\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\tprintf(\""Group %d : %d men, %d women, %d kids.\\n\"",cnt,cock,hen,chick); //输出结果!\n\t\t\t\t\t}\t\t\t\n}\n",ACCEPTED,8,196 1521860696009117696,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:33:59,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*fzero(fun,x);\nfprintf('rate= ')\nfprintf('%.6f',rate);",WRONG_ANSWER,27,6512 1521860869082886144,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:34:40,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*fzero(fun,x);\nfprintf('rate= ')\nfprintf('%.4f',rate);",WRONG_ANSWER,28,6952 1521860937374531584,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:34:56,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*fzero(fun,x);\nfprintf('rate= ')\nfprintf('%.4f',rate);\nfprintf('63');",WRONG_ANSWER,26,6500 1521861111341690880,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:35:38,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*fzero(fun,x);\nfrintf('rate = 0.043863')",WRONG_ANSWER,27,6620 1521861148893294592,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:35:47,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*fzero(fun,x);\nfprintf('rate = 0.043863')",WRONG_ANSWER,27,6872 1521861207819075584,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 22:36:01,C++,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",COMPILE_ERROR,0,0 1521861249804054528,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 22:36:11,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function [x]=fun1(fun,x0,x1)\nf0 = feval(fun,x0);\nf1 = feval(fun,x1);\nerr=1;\nwhile abs(err)>eps\n xiashan=1;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2 = feval(fun,x2);\n while abs(f2)>=abs(f1) \n xiashan=xiashan/2;\n x2=x1-xiashan*f1*(x1-x0)/(f1-f0);\n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\nend\nx=x2;\nend\nin=input(\""\"");\nfun=@(x)180*(x*(1+x)^in)/((1+x)^in-1)-1.2;\n[x]=fun1(fun,0.007,0.006);\nrate=12*x",WRONG_ANSWER,57,6916 1521861376497188864,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 22:36:41,Octave,0.0,1519981129065656327,1517175951723835392,1141715925804474368,fprintf(rate = 0.074201),WRONG_ANSWER,52,6624 1521861425708969984,c940aac3af8ebef0a4c1c782f8b3e7e34187ba319d554254a68365e3dff74166,2022-05-04 22:36:53,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"fprintf(\""rate = 0.074201\"")",PARTIAL_ACCEPTED,54,6528 1521861509754425344,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:37:13,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*fzero(fun,x);\nfprintf('rate = 0.043863')",WRONG_ANSWER,27,6496 1521861555908554752,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:37:24,Octave,0.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*fzero(fun,x);\nfprintf('rate = 0.043863')",WRONG_ANSWER,26,6768 1521861602926690304,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:37:35,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\n\nfprintf('rate = 0.043863')",ACCEPTED,27,6620 1521861670756978688,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-05-04 22:37:51,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input(\""\"");\nf = @(r) N*(1+r/4.923061303)^(60/4.923061303)-36;\ndf = @(r) N*60/4.923061303/5*(1+r/5)^(60/4.923061303-1)-36;\neps = 1e-12;\nx = 1;\nwhile true\n f_val = f(x);\n df_val = df(x);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x=x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);",PARTIAL_ACCEPTED,61,6756 1521861773123162112,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-05-04 22:38:16,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input(\""\"");\nf = @(r) N*(1+r/4.923061303)^(60/4.923061303)-36;\ndf = @(r) N*60/4.923061303/5*(1+r/5)^(60/4.923061303-1)-36;\neps = 1e-12;\nx = 1;\nwhile true\n f_val = f(x);\n df_val = df(x);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x=x_new;\nend\nfprintf(\""rate = %.6f\\n\"",x);",PARTIAL_ACCEPTED,57,6504 1521861795109699584,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-05-04 22:38:21,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"fprintf(\""There are 4 possible groups.\\n\"")\nfprintf(\""Group 1 : 11 men, 8 women, 1 kids.\\n\"")\nfprintf(\""Group 2 : 12 men, 6 women, 2 kids.\\n\"")\nfprintf(\""Group 3 : 13 men, 4 women, 3 kids.\\n\"")\nfprintf(\""Group 4 : 14 men, 2 women, 4 kids.\"")",WRONG_ANSWER,59,6792 1521862212933697536,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:40:01,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\n\nfprintf('rate = 0.043863')",ACCEPTED,27,6520 1521862238976126976,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:40:07,Octave,20.0,1519981129065656328,1517040002215354368,1141715823085969408,"i=1;\nfor m=1:30\n for w=1:30\n for c=1:30\n if m+w+c==30\n if 30*m+20*w+10*c==500\n Group(i).men=m;\n Group(i).wemen=w;\n Group(i).kids=c;\n i=i+1;\n end\n end\n end\n end\nend\nfprintf('There are %d possible groups.\\n',i-1)\nfor j=1:i-1\n fprintf('Group %d : %d men, %d women, %d kids.\\n',j,Group(j).men,Group(j).wemen,Group(j).kids)\nend\n",ACCEPTED,76,6888 1521863163211976704,4869c51d9ec387d8627b39947f7fefa3ae78f821df10c485e15ffb5c2fbb03ad,2022-05-04 22:43:47,Octave,10.0,1519981129065656326,1517166904926183424,1141715925804474368,"function [x,iter,X]=newton_secant(fun,x0,x1,eps,maxiter)\nif nargin<3,error('输入参数至少需要3个！'),end\nif nargin<4||isempty(eps),eps=1e-6;end\nif nargin<5||isempty(maxiter),maxiter=1e4;end\nf0 = feval(fun,x0); \nf1 = feval(fun,x1);\nk=0;err=1;\nwhile abs(err)>eps\n\tlambda=1;\n\tx2=x1-lambda*f1*(x1-x0)/(f1-f0);\n\tf2 = feval(fun,x2);\n\twhile abs(f2)>=abs(f1) \n lambda=lambda/2; \n x2=x1-lambda*f1*(x1-x0)/(f1-f0); \n f2=feval(fun,x2);\n end\n x0=x1;x1=x2;\n f0=f1;f1=f2;\n err=x1-x0;\n k=k+1;\n X(k)=x2;\nend\n\nif k>=maxiter\n error('迭代次数超限，迭代失败！')\nend\nx=x2;iter=k;X=X';\n\nend\nfun=@(r)15000/r*(1-1/(1+r)^360)-3000000;\n[x,iter,X]=newton_secant(fun,0.008,0.007);\nrate=12*x;\nfprintf('rate = 0.043863')",ACCEPTED,27,6752 1521865170970787840,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-05-04 22:51:46,Octave,10.0,1519981129069850624,1517141269389144064,1141715823085969408,"count=0;\nfor i=1:15\n for j=1:25\n if((30-i-j)>0 && 30*i+20*j+(30-i-j)*10==500)\n count++;\n Group(count).men=i;\n Group(count).wemen=j;\n Group(count).kids=(30-i-j);\n \n end\n end\nend\nfprintf('There are %d possible groups.',count);\nfor i=1:count\n fprintf('\\nGroup %d : %d men, %d women, %d kids.',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",PARTIAL_ACCEPTED,61,8476 1521865849500110848,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-05-04 22:54:28,Octave,10.0,1519981129065656327,1517175951723835392,1141715925804474368,"N = input(\""\"");\nf = @(r) N*(1+r/4.923061303)^(60/4.923061303)-36;\ndf = @(r) N*60/4.923061303/5*(1+r/5)^(60/4.923061303-1)-36;\neps = 1e-12;\nx = 1;\nwhile true\n f_val = f(x);\n df_val = df(x);\n x_new = x - f_val/df_val;\n if abs(x-x_new) < eps\n break\n end\n x=x_new;\nend\nfprintf(\""rate = %.6f\"",x);",PARTIAL_ACCEPTED,63,8848 1521866750784733184,91c73f59381aad6b55acbfbae97c4f5d7aae9d226f668f9e09e7ae7c88b5641d,2022-05-04 22:58:02,Octave,20.0,1519981129069850624,1517141269389144064,1141715823085969408,"count=0;\nN = input(\""\"");\nfor i=1:15\n for j=1:25\n if((N-i-j)>0 && 30*i+20*j+(N-i-j)*10==500)\n count++;\n Group(count).men=i;\n Group(count).wemen=j;\n Group(count).kids=(N-i-j);\n \n end\n end\nend\nfprintf('There are %d possible groups.',count);\nfor i=1:count\n fprintf('\\nGroup %d : %d men, %d women, %d kids.',i,Group(i).men,Group(i).wemen,Group(i).kids);\nend",ACCEPTED,59,7896 1521871087158198272,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-05-04 23:15:16,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N = input(\""\"");\nsum = 500;\nk=0;\ngroup=zeros(100);\nfor m = 1:16\n for w = 1:25\n c=floor((500-30*m-20*w)/10);\n k=k+1;\n group(k).men=m;\n group(k).women=w;\n group(k).kids=c;\n end\nend\n\ndisp(\""There are \"",k\"" possible groups.\"")\n\nfor n = 1:k\ndisp(\""Group \"",n,\"" :\"",\""group(n).men\"", \"" men, \"",\"" group(n).women\"", \"" women, \"",\"" group(n).kids\"", \"" kids \"")\nend",WRONG_ANSWER,55,6648 1521871190690414592,d1bd3c88b44e5d50d59037a9086f807451f342a3bbd7ef077fd50b8d55b90b54,2022-05-04 23:15:41,Octave,0.0,1519981129069850624,1517141269389144064,1141715823085969408,"N = input(\""\"");\nsum = 500;\nk=0;\ngroup=zeros(100);\nfor m = 1:16\n for w = 1:25\n c=floor((500-30*m-20*w)/10);\n k=k+1;\n group(k).men=m;\n group(k).women=w;\n group(k).kids=c;\n end\nend\n\ndisp(\""There are \"",k\"" possible groups.\"")\n\nfor n = 1:k\ndisp(\""Group \"",n,\"" :\"",\""group(n).men\"", \"" men, \"",\"" group(n).women\"", \"" women, \"",\"" group(n).kids\"", \"" kids \"")\nend",WRONG_ANSWER,52,6624 1521875744655970304,6b4e32b1eef4854e86ccf592390789ac4932ea06a07c635359899fe0acf8a405,2022-05-04 23:33:47,C,0.0,1519981129065656327,1517175951723835392,1141715925804474368,"function x=Newtondownhill(fun,dfun,x0,EPS)\nx=input(\""\"");\na=6000;\nb=60;\n\n%fun即迭代函数，dfun即迭代函数的一阶导数，x0为迭代初值，EPS为精度\nf=fcnchk(fun);\ndf=fcnchk(dfun);\nx1=x0-f(x0)/df(x0);\nd=norm(x1-x0);\nk=1;\nr=1;\nwhile d>=EPS\n while abs(f(x1))>abs(f(x0)) \n %迭代过程一定具有单调性|f(k+1)|<|f(k)|\n r=r/2; \n%调整下山因子保证其单调性\n x2=x0-r*f(x0)/df(x0);\n x1=x2;\n end\n x0=x1;\n r=1;\n x1=x0-f(x0)/df(x0);\n disp(x1);\n disp(f(x1));\n d=norm(x1-x0);\n k=k+1;\nend\nif k==1000 \nx='Iterative divergence'; %迭代公式发散\nelse\nx=x1; %切记要给x赋值\nend\n\nx0=0.6;\nx=newtoni\nx=Newtondownhillmethod('x^3-x-1','3*x^2-1',1.5,1.0e-5)，\n\nrate=12*m",COMPILE_ERROR,0,0 1514862553850093568,ecd921c78e234ec4d6363f68614c8f82423e144e1ddb7303f67aa44557c0a44a,2022-04-15 15:05:52,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = int(input());\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi();\nside = sqrt(a1^2 + a^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [side,area]",WRONG_ANSWER,31,6580 1514862656812228608,ecd921c78e234ec4d6363f68614c8f82423e144e1ddb7303f67aa44557c0a44a,2022-04-15 15:06:16,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = [];\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi();\nside = sqrt(a1^2 + a^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [side,area]",WRONG_ANSWER,28,6512 1514862713426944000,ecd921c78e234ec4d6363f68614c8f82423e144e1ddb7303f67aa44557c0a44a,2022-04-15 15:06:30,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = [3 4 90];\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi();\nside = sqrt(a1^2 + a^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [side,area]",WRONG_ANSWER,33,6824 1514862883576717312,ecd921c78e234ec4d6363f68614c8f82423e144e1ddb7303f67aa44557c0a44a,2022-04-15 15:07:10,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = [3 4 90];\na1 = a(1);\na2 = a(2);\nangle = a(3);\nrad = angle/180*pi();\nside = sqrt(a1^2 + a^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nresult = [side,area]",WRONG_ANSWER,25,6380 1514864937033015296,6f03ca149aaaa3e63703cc0660d113ff26f0095cf2c8fda1a6f6166c473643b2,2022-04-15 15:15:20,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,x = 20.3,WRONG_ANSWER,27,6756 1514866782279311360,c03fbebb81eeae161b37cabdf04ef832df4831d6162e9f0e20493160d83c10ad,2022-04-15 15:22:40,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = myhilb(rows, cols)\nA =zeros(rows,cols);\nfor m = 1:rows\nfor n = 1:cols\nA(m,n) = 1/(m+n-1);\nend\nend\nformat rat \nA",COMPILE_ERROR,0,0 1514866821478916096,7ee74e0bb4bdbeaa1ca1578b3fe31f6eec93daa0721d865d4ffa23db21344a23,2022-04-15 15:22:49,Python,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"print(20.3,end='')",WRONG_ANSWER,17,3272 1514867015402921984,c03fbebb81eeae161b37cabdf04ef832df4831d6162e9f0e20493160d83c10ad,2022-04-15 15:23:35,C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"print(20.3,end='')",COMPILE_ERROR,0,0 1514867604891377664,c03fbebb81eeae161b37cabdf04ef832df4831d6162e9f0e20493160d83c10ad,2022-04-15 15:25:56,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"print(20.3,end='')",WRONG_ANSWER,38,6656 1514868126855733248,fb1068847ed3182409930ec1edcd112aca30722b6e4abfba77caa3ec05d2ae95,2022-04-15 15:28:00,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"print(20.3,end='')",WRONG_ANSWER,29,6568 1514868261996208128,6f03ca149aaaa3e63703cc0660d113ff26f0095cf2c8fda1a6f6166c473643b2,2022-04-15 15:28:33,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x = 3;\ny = 4;\na = 90;\nz = (x^2+y^2-2*x*y*cosd(a))^0.5;\ns = 0.5*x*y;\ndisp(z),disp(s)\n",WRONG_ANSWER,28,6760 1514869643520253952,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-15 15:34:02,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"digits(2);\na=input('');\na1=a(1);\na2=a(2);\na3=a(3);\ns=1/2*a1*a2*sin(a3);\nb1=a1^2+a2^2-2*a1*a2*cos(a3);\nb=sqrt(b1);\nS=round(s);\nD=round(b);\nC=zeros(1,2);\nC(1,1)=S;\nC(1,2)=D\n",COMPILE_ERROR,0,0 1514869764353957888,c03fbebb81eeae161b37cabdf04ef832df4831d6162e9f0e20493160d83c10ad,2022-04-15 15:34:31,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function s=area(A,B,C)\nif length(A)==2 \n AB=[B-A 0];\n BC=[C-B 0];\nelseif length(A)==3 \n AB=B-A;\n BC=C-B;\nend\n Z=cross(AB,BC); \n s=1/2*norm(Z); \nend",COMPILE_ERROR,0,0 1514869792132833280,c03fbebb81eeae161b37cabdf04ef832df4831d6162e9f0e20493160d83c10ad,2022-04-15 15:34:38,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function s=area(A,B,C)\nif length(A)==2 \n AB=[B-A 0];\n BC=[C-B 0];\nelseif length(A)==3 \n AB=B-A;\n BC=C-B;\nend\n Z=cross(AB,BC); \n s=1/2*norm(Z); \nend",WRONG_ANSWER,27,6800 1514870157293133824,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-15 15:36:05,C++,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"digits(2);\na=input('');\na1=a(1);\na2=a(2);\na3=a(3);\ns=1/2*a1*a2*sin(a3);\nb1=a1^2+a2^2-2*a1*a2*cos(a3);\nb=sqrt(b1);\nS=round(s);\nD=round(b);\nC=zeros(1,2);\nC(1,1)=S;\nC(1,2)=D\n",COMPILE_ERROR,0,0 1514872567935803392,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-15 15:45:39,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"digits(2);\na=input('');\na1=a(1);\na2=a(2);\na3=a(3);\ns=1/2*a1*a2*sin(a3);\nb1=a1^2+a2^2-2*a1*a2*cos(a3);\nb=sqrt(b1);\nS=round(s);\nD=round(b);\nC=zeros(1,2);\nC(1,1)=S;\nC(1,2)=D",WRONG_ANSWER,34,6572 1514873989946908672,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 15:51:18,C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,clc;clear\nsyms u;\nf=1/2*u^2-10*92380\nA=solve(f==0),COMPILE_ERROR,0,0 1514874096717111296,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 15:51:44,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,clc;clear\nsyms u;\nf=1/2*u^2-10*92380\nA=solve(f==0),WRONG_ANSWER,27,6444 1514874214233677824,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:52:12,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\n\nprint('',c)",NON_ZERO_EXIT_CODE,18,3276 1514874230562103296,7ee74e0bb4bdbeaa1ca1578b3fe31f6eec93daa0721d865d4ffa23db21344a23,2022-04-15 15:52:16,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\n[c, s]",WRONG_ANSWER,29,6380 1514874282663190528,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-15 15:52:28,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a = 3\nb = 4\nC = 90\nA =[a b C]\nc = sqrt(a^2+b^2)\ns = 0.5*a*b\nR =[c s],WRONG_ANSWER,29,6672 1514874661052325888,fb1068847ed3182409930ec1edcd112aca30722b6e4abfba77caa3ec05d2ae95,2022-04-15 15:53:58,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = triangle(a,b,c)\nl=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5)\ns=(1/2)*a(1)*a(2)*sind(a(3))\nresult=[l s]",WRONG_ANSWER,26,6540 1514874720024240128,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 15:54:12,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\n[c, s]",WRONG_ANSWER,29,6660 1514874766547656704,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-15 15:54:24,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90]\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5)\ns=(1/2)*a(1)*a(2)*sind(a(3))\nresult=[r s],WRONG_ANSWER,27,6488 1514874982382149632,fb1068847ed3182409930ec1edcd112aca30722b6e4abfba77caa3ec05d2ae95,2022-04-15 15:55:15,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=inpt('')\nl=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5)\ns=(1/2)*a(1)*a(2)*sind(a(3))\nresult=[l s],WRONG_ANSWER,27,6384 1514875387938349056,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 15:56:52,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2)^(0.5)\n[c, s]",WRONG_ANSWER,26,6764 1514875502715117568,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:57:19,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(s)\nprint('',c)",NON_ZERO_EXIT_CODE,17,3296 1514875585590730752,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:57:39,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(s)\nprint('',c)",NON_ZERO_EXIT_CODE,19,3284 1514875750527541248,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-15 15:58:18,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,h=25000*12*2.54/100 %单位米 7620m=7.62km\nL=100000-h\ng=10\n%mgL=1/2mu^2 u^2=2Lg \nU=2*L*g\nu=sqrt(U),WRONG_ANSWER,27,6636 1514875754801176576,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:58:19,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)",NON_ZERO_EXIT_CODE,18,3148 1514875900184141824,fb1068847ed3182409930ec1edcd112aca30722b6e4abfba77caa3ec05d2ae95,2022-04-15 15:58:54,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nl=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\nresult=[l s],WRONG_ANSWER,26,6504 1514875940739227648,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:59:03,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)",NON_ZERO_EXIT_CODE,57,29960 1514876014449926144,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:59:21,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)",NON_ZERO_EXIT_CODE,18,3296 1514876060650184704,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 15:59:32,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*pi))^(0.5)\n[c, s]",WRONG_ANSWER,27,6640 1514876070623879168,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:59:34,C++,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)",COMPILE_ERROR,0,0 1514876106929774592,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 15:59:43,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)",NON_ZERO_EXIT_CODE,17,3200 1514876184234991616,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-15 16:00:02,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = input('')\nb = input('')\na=input('')\nS = 0.5*a*b*sin((a/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((a/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,28,6768 1514876205030711296,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 16:00:06,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\n[c, s]",WRONG_ANSWER,27,6396 1514876233295765504,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 16:00:13,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)\nreturn 0",NON_ZERO_EXIT_CODE,24,3148 1514876624926679040,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 16:01:47,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,clc;clear\nsyms u;\nf=1/2*u^2-1/2*20.3^2\nA=solve(f==0),WRONG_ANSWER,29,6532 1514876679905615872,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 16:02:00,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)\nprint(0)",NON_ZERO_EXIT_CODE,18,3200 1514876731302060032,7a617188b600ec609d37a872ab91664b11f283cb380c84d71cef58cd3ffe2892,2022-04-15 16:02:12,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"syms u\nf = 2*9.8*92380-u^2\nresult=solve(f==0,x)",WRONG_ANSWER,33,6532 1514876845752590336,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 16:02:39,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)\nprint(0)",NON_ZERO_EXIT_CODE,18,3164 1514876927624847360,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 16:02:59,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,clc;clear\nsyms u;\nf=1/2*u^2-1/2*20.3^2\nA=solve(f==0),WRONG_ANSWER,28,6672 1514877370480631808,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:04:44,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,s] = triangle(a,b,t)\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\n[c,s]",WRONG_ANSWER,29,6820 1514878032538935296,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-15 16:07:22,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input('');\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(0.5)*a(1)*a(2)*sind(a(3));\nresult=[r s],WRONG_ANSWER,27,6568 1514878152349032448,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-15 16:07:51,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input('');\nc=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^0.5;\ns=(1/2)*a(1)*a(2)*sind(a(3));\nans=[c s],WRONG_ANSWER,28,6380 1514878184054333440,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-15 16:07:58,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,s] = triangle(a,b,t)\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\n[c,s]",WRONG_ANSWER,32,6764 1514878378535460864,94a906449762e754add90d001ff8f84f29f672edf9bdcdeec5144ffdc1c0fdcf,2022-04-15 16:08:45,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input('');\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\nresult=[r s],WRONG_ANSWER,28,6948 1514878507699052544,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-15 16:09:15,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nc=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^0.5;\ns=(1/2)*a(1)*a(2)*sind(a(3));\nans=[c s],WRONG_ANSWER,27,6532 1514878749622312960,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-15 16:10:13,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=[3,4,90];\nc=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^0.5;\ns=(1/2)*a(1)*a(2)*sind(a(3));\nans=[c,s]",WRONG_ANSWER,26,6384 1514878891423703040,503804e4deaa726652afe2fed047e8f603fc81c2b4db00c9875d949f6f421bb7,2022-04-15 16:10:47,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=[3,4,90];\nc=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(1/2);\ns=(1/2)*a(1)*a(2)*sind(a(3));\nans=[c,s]",WRONG_ANSWER,30,6384 1514878939683004416,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 16:10:58,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)\nprint(0)",NON_ZERO_EXIT_CODE,23,3108 1514878988294791168,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:11:10,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\nresult=[c, s]",WRONG_ANSWER,28,6440 1514879001062252544,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-15 16:11:13,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"imput = [a,b,c]\nS = (1/2)*sinc*a*b\ny= (a^2-x^2)^(1/2)\nd= (x^2+(b-y)^2)^(1/2)\noutput = [d,S]",COMPILE_ERROR,0,0 1514879027452813312,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 16:11:19,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)\nprint(0)",NON_ZERO_EXIT_CODE,14,3148 1514879105752276992,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:11:38,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\nresult=[c,s]",WRONG_ANSWER,26,6764 1514879450880581632,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-15 16:13:00,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = input('')\nb = input('')\na=input('')\nS = 0.5*a*b*sin((a/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((a/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,36,6532 1514879961943941120,b12496bda123eb86567a75be56f63c17640f172c11214e8df197b39fe0b27e1f,2022-04-15 16:15:02,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,syms v;\nv=solve(0-(v*v)==2*(25000*12*2.54/100)*(-9.8))\n,WRONG_ANSWER,25,6560 1514880224578674688,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:16:05,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]\\n',c,s)",WRONG_ANSWER,28,6788 1514880796489162752,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:18:21,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]\\n',c,s)",WRONG_ANSWER,31,6636 1514880984326512640,473e3da84aef2692b62dc000ece3cdcfa21f284467888086604893bf8f1b3212,2022-04-15 16:19:06,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,A = input('');\nL = (A(1)^2 + A(2)^2 - 2*A(1)*A(2)*cosd(A(3)))^0.5;\nS = 0.5*A(1)*A(2)*sind(A(3));\nB = [L S];\ndisp(B);,WRONG_ANSWER,29,6760 1514881051465097216,f6dbcf75b0f4a25708037298deda8506f91ebd9cdde0302338ae24a47d40d80c,2022-04-15 16:19:22,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3)); \nresult=[r s],WRONG_ANSWER,30,6380 1514881180288950272,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-15 16:19:53,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]\\n',c,s)",WRONG_ANSWER,27,6656 1514881617355841536,c7ed1db2923965fa98b8630ee921c02380e523029ec023e982e6fa7be5cf1188,2022-04-15 16:21:37,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input('')\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\ndisp(a;),WRONG_ANSWER,30,6532 1514881667855261696,c7ed1db2923965fa98b8630ee921c02380e523029ec023e982e6fa7be5cf1188,2022-04-15 16:21:49,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input('')\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\ndisp(a;),WRONG_ANSWER,25,6512 1514881699778666496,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-15 16:21:57,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,double h;\ndouble h0;\ndouble v0;\nh0=25000*0.0254*12\nh=100*1000-h0\nv0=(2*9.8*h)^(1/2)\nresult=[v0],WRONG_ANSWER,27,6708 1514881738093633536,473e3da84aef2692b62dc000ece3cdcfa21f284467888086604893bf8f1b3212,2022-04-15 16:22:06,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,clear;\nclc;\nA = input('');\nL = (A(1)^2 + A(2)^2 - 2*A(1)*A(2)*cosd(A(3)))^0.5;\nS = 0.5*A(1)*A(2)*sind(A(3));\nB = [L S];\ndisp(B);,WRONG_ANSWER,27,6504 1514881956817838080,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 16:22:58,Python,0.0,1514821715228844034,1514802200680230912,1141715823085969408,clc;clear\nsyms u;\nf=1/2*u^2-1/2*20.3^2\nA=solve(f==0),NON_ZERO_EXIT_CODE,14,2888 1514882178659131392,71741e96acadc71b95c14031682f004f3d35a0b044c5756b1dfab47e903e0860,2022-04-15 16:23:51,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,clc;clear\nsyms u;\nf=1/2*u^2-1/2*20.3^2\nA=solve(f==0),WRONG_ANSWER,27,6560 1514882287572262912,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 16:24:17,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)\n",NON_ZERO_EXIT_CODE,19,3200 1514882340944584704,c67c3e077f01a48ce5c66e23fdf568f877725b65e81cf94c425d0415323c674d,2022-04-15 16:24:29,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input()\na,b,theta=map(float,x.split())\nc=math.sqrt(a**2+b**2-2*a*b*math.cos(theta*math.pi/180))\ns=(a*b*math.sin(theta*math.pi/180))/2\nprint(c)\nprint(s)\n",NON_ZERO_EXIT_CODE,20,3144 1514882541596090368,e5b8ccb2ed7d236af43bfc4bc1cb55ed39d2a68e1592cf484b672ba142e8c891,2022-04-15 16:25:17,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,G,WRONG_ANSWER,26,6384 1514882859599634432,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-15 16:26:33,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,h=0.0254*12*25000+100000\nu=sqrt(2*9.8*h),WRONG_ANSWER,28,6636 1514883274013646848,6294258c0db2bed3729bbfcf94cb080810cd81cd787128a63c378aa9e70fef3e,2022-04-15 16:28:12,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\nresult=[r s]\ndisp(a);,WRONG_ANSWER,26,6388 1514883330763137024,6294258c0db2bed3729bbfcf94cb080810cd81cd787128a63c378aa9e70fef3e,2022-04-15 16:28:25,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\nresult=[r s]\ndisp(result);,WRONG_ANSWER,27,6512 1514883434005569536,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-15 16:28:50,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=input('');\nb=input('');\no=input('');\ns=1/2*a*b*sind(o);\nc=sqrt(a^2+b^2-2*a*b*cosd(o));\ndisp([c,s])\n",WRONG_ANSWER,31,6536 1514884091714740224,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:31:27,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\nresult=[c,s]",WRONG_ANSWER,25,6500 1514884282173530112,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-15 16:32:12,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nc=90;\nsyms x;\neq=a^2+b^2-2*a*b*cosd(c)-x^2;\nx=solve(eq,x);\ns=a*b*sind(c)/2;\nd=abs(x);\nd,s",WRONG_ANSWER,25,6508 1514884340759568384,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:32:26,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"\na=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,28,6536 1514884412582830080,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:32:43,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\nend\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\nend\nresult=[c,s]\nend",WRONG_ANSWER,26,6628 1514884521265995776,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:33:09,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,x1 = input('')\nx2 = input('')\nangle=input('')\nend\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\nend\nresult=[c s]\nend,WRONG_ANSWER,26,6532 1514884537333817344,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:33:13,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,x1 = input('')\nx2 = input('')\nangle=input('')\nend\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\nend\nresult=[c s]\nend,WRONG_ANSWER,28,6520 1514884591884935168,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:33:26,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\nend\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\nend\nresult=[c,s]\nend",WRONG_ANSWER,28,6440 1514884985072132096,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:35:00,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"[3 4 90];\na=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,26,6384 1514885049257205760,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:35:15,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,27,6380 1514885267394371584,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:36:07,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14/180);\nd=cos(t*3.14/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,30,6560 1514885274621157376,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-15 16:36:09,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\ndisp(a);\nend,WRONG_ANSWER,25,6804 1514885309132087296,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-15 16:36:17,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3));\ndisp(a);\n,WRONG_ANSWER,28,6512 1514885803871215616,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-15 16:38:15,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]\\n',c,s)",WRONG_ANSWER,27,6516 1514885870141022208,39bc6dec05a300b4bbb3ee1488cdef9bd6b73ece7fa395ba92bfb8f57a86cdd8,2022-04-15 16:38:31,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]\\n',c,s)",WRONG_ANSWER,25,6384 1514886533361344512,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-15 16:41:09,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\nc=90;\nr=((a^2+b^2-2*a*b)*cos(C)^(0.5)\ns=(1/2)*a*b*sin(C)\nresult=[r s],WRONG_ANSWER,25,6664 1514886552076328960,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:41:13,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14/180);\nd=cos(t*3.14/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,27,6452 1514886895615352832,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:42:35,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\n\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\n\nresult=[c,s]\nend",WRONG_ANSWER,26,6508 1514886908763938816,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:42:38,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\n\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\n\nresult=[c,s]\nend",WRONG_ANSWER,26,6636 1514887114402275328,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:43:27,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"clc\na=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14/180);\nd=cos(t*3.14/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,25,6600 1514887233449205760,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:43:56,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"clc\na=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14/180);\nd=cos(t*3.14/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,25,6440 1514887326411956224,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:44:18,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"clc,clear;\na=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14/180);\nd=cos(t*3.14/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nfprintf('[%1.0f %1.0f]',c,s)",WRONG_ANSWER,29,6508 1514888312358608896,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:48:13,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"print(20.3,end=‘’)",WRONG_ANSWER,26,6532 1514888376808087552,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:48:28,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,s] = triangle(a,b,t)\na=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nresult=[c,s]",WRONG_ANSWER,25,6444 1514888481624301568,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:48:53,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\n\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\n\nresult=[c,s，end='']\nend",WRONG_ANSWER,29,6508 1514888809782091776,3b524648fc5eb7662f494c16f3e8fc2bda7a43c565787921c34066d1a3f8167b,2022-04-15 16:50:12,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"x1 = input('')\nx2 = input('')\nangle=input('')\n\ns = 0.5*x1*x2*sin((angle/360)*2*pi)\nc = (x1*x1+x2*x2-2*x1*x2*cos((angle/360)*2*pi))^(0.5)\n\nprint[c,s]\nend",WRONG_ANSWER,26,6660 1514889020772360192,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 16:51:02,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nresult=[c,s]",WRONG_ANSWER,26,6380 1514889024647897088,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-15 16:51:03,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180))^(1/2);\ns=(1/2)*a(1)*a(2)*sin(a(3)*pi/180);\nresult=[r s];\nresult,ACCEPTED,24,6668 1514889696026304512,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-15 16:53:43,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\nc=90;\nr=((a^2+b^2-2*a*b)*cosd(C)^(0.5)\ns=(1/2)*a*b*sind(C)\nresult=[r s],WRONG_ANSWER,28,6616 1514890699853275136,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-15 16:57:42,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\nc=90;\nr=((a^2+b^2-2*a*b)*cosd(C)^(0.5)\ns=(1/2)*a*b*sind(C)\nresult=[r s],WRONG_ANSWER,25,6636 1514890912243884032,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-15 16:58:33,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM = ' 20.3',WRONG_ANSWER,28,6756 1514891099339202560,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-15 16:59:18,C++,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"#include \nusing namespace std;\n\nint main()\n{\n cout<<\""startM = 20.3\"";\n}",WRONG_ANSWER,8,488 1514891180511764480,475ad7ec182bfff856610cda7574c219f2a0cb438afb857d67a7fabb7f8e1276,2022-04-15 16:59:37,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function res=triarea(a,b,angle)\nres=0.5*a*b*sin(angle);\nend",WRONG_ANSWER,30,6512 1514891255069515776,f6dbcf75b0f4a25708037298deda8506f91ebd9cdde0302338ae24a47d40d80c,2022-04-15 16:59:55,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3)); \nresult=[r s],WRONG_ANSWER,28,6440 1514891368919703552,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-15 17:00:22,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=input('');\nresult=zeros(1,2);\nresult(1)=sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180));\nresult(2)=0.5*a(1)*a(2)*sin(a(3)*pi/180);\nresult",ACCEPTED,29,6796 1514891523790381056,f6dbcf75b0f4a25708037298deda8506f91ebd9cdde0302338ae24a47d40d80c,2022-04-15 17:00:59,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3)); \nresult=[r s];\nend,WRONG_ANSWER,24,6640 1514891921796636672,f6dbcf75b0f4a25708037298deda8506f91ebd9cdde0302338ae24a47d40d80c,2022-04-15 17:02:34,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cosd(a(3)))^(0.5);\ns=(1/2)*a(1)*a(2)*sind(a(3)); \nresult=[r s];,WRONG_ANSWER,27,6760 1514892018445623296,8c0f99c061618f2b53ecf39540bc86d0575e117e942cc728289e385826d2ad64,2022-04-15 17:02:57,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input('输入两边及夹角以逗号分隔:')\na,b,j=eval(x) \nc=math.sqrt(a**2+b**2-math.cos(j*math.pi/180)*2*a*b)\nprint(\""c={:.2f}\"".format(c))\n\n",WRONG_ANSWER,16,3272 1514892131327287296,8c0f99c061618f2b53ecf39540bc86d0575e117e942cc728289e385826d2ad64,2022-04-15 17:03:24,Python,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"import math\nx=input('输入两边及夹角以逗号分隔:')\na,b,j=eval(x) \nc=math.sqrt(a**2+b**2-math.cos(j*math.pi/180)*2*a*b)\nprint(\""c={:.2f}\"".format(c))\n\n",WRONG_ANSWER,20,3072 1514892138121699328,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-15 17:03:25,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,\nstartM = 20.3,WRONG_ANSWER,27,6384 1514892262977544192,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 17:03:55,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"clc,clear;\na=3;\nb=4;\nt=90;\nc=0;\ns=0;\n\nresult =zeros(c,s);\n\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nresult",WRONG_ANSWER,25,6384 1514892280031584256,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-15 17:03:59,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nresult=[c,s]",WRONG_ANSWER,25,6504 1514892351942926336,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-15 17:04:16,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"\nstartM = vpa(20.3,3);",WRONG_ANSWER,30,6524 1514892449066426368,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-15 17:04:39,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,\nstartM = 20.3;,WRONG_ANSWER,29,6508 1514892839337828352,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:06:12,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"tri = input();\na = tri(1);\nb = tri(2);\ntheta = tri(3);\nc = sqrt(a^2+b^2-2*a*b*cos(theta));\nS = a*b*sin(theta)/2;\n[c,S]",WRONG_ANSWER,28,6640 1514893010281078784,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:06:53,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function res = triangle(tri)\na = tri(1);\nb = tri(2);\ntheta = tri(3);\nc = sqrt(a^2+b^2-2*a*b*cos(theta));\nS = a*b*sin(theta)/2;\n res = [c,S]\nend",WRONG_ANSWER,26,6372 1514893282260721664,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:07:58,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function res = triangle(tri)\na = tri(1);\nb = tri(2);\ntheta = tri(3)/180*pi;\nc = sqrt(a^2+b^2-2*a*b*cos(theta));\nS = a*b*sin(theta)/2;\nres = [c,S]\nend",WRONG_ANSWER,30,6508 1514893332768890880,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:08:10,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,A=input('');\nresult(2)=0.5*A(1)*A(2)*sin(A(3)*pi/180);\na=A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)*pi/180);\nresult(1)=a^0.5;\nresult,ACCEPTED,26,6656 1514893494689996800,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:08:49,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function res = triangle(tri)\na = tri(1);\nb = tri(2);\ntheta = tri(3)/180*pi;\nc = sqrt(a^2+b^2-2*a*b*cos(theta));\nS = a*b*sin(theta)/2;\nres = [c,S]\nend",WRONG_ANSWER,27,6764 1514893580228075520,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-15 17:09:09,C++,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"#include \nusing namespace std;\n\nint main()\n{\n double a,b,c;\n getchar();\n cin>>a>>b>>c;\n c*=acos(-1)/180;\n cout<<\""result =\\n\\n\"";\n cout<\n#include \nusing namespace std ;\nint main()\n{\n int *p=new int [3];\n int *t=new int [2];\n cin>>p[0]>>p[1]>>p[2];\n if (p[2]<=0 or p[2]>=180)\n cout<<\""输出范围错误\""<0\n disp(result(i));\n end \nend\n",WRONG_ANSWER,26,6632 1514903077042692096,acd8c3f215b732b6bebe18a474d6a5b790cfd507d50715371503f73a26c1c9d3,2022-04-15 17:46:53,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,print 20.8,WRONG_ANSWER,26,6380 1514903101638451200,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-15 17:46:59,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"l1=3;l2=4;angle=90;\nresult=[sqrt(l1^2+l2^2-2*l1^2*l2^2*cosd(angle)),l1*l2*sind(angle)/2];\nresult",COMPILE_ERROR,0,0 1514903126338707456,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-15 17:47:05,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"startM = sqrt(2*9.8*(100000-25000*0.12*2.54));\nstartM = sprintf('%.1f',startM)",WRONG_ANSWER,34,6532 1514903133413941248,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:47:07,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"result = clac(3,4,90);\n\nfunction result = calc(a,b,C)\n\n C = deg2rad(C);\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c,S];\n\nend",WRONG_ANSWER,30,6504 1514903156822548480,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-15 17:47:12,Python,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"print('startM = ',20.3)\n",WRONG_ANSWER,18,3016 1514903198236909568,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:47:22,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 386.5'),WRONG_ANSWER,28,6540 1514903202347524096,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-15 17:47:23,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,25,6772 1514903221066702848,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-15 17:47:28,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"%startM = sqrt(2*9.8*(100000-25000*0.12*2.54));\nstartM = 20.3;\nstartM = sprintf('%.1f',startM)",WRONG_ANSWER,25,6700 1514903243325677568,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 17:47:33,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=a(a,b,c)\n result=[sqrt(a*a+b*b) a*b/2]\n end\na = [3 4 90];\n[c s] = a(a(1),a(2),a(3));\nresult = [c s] \n\n",WRONG_ANSWER,25,6568 1514903252372987904,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:47:35,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 20.3'),WRONG_ANSWER,28,6568 1514903283716825088,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-15 17:47:43,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"l1=3;l2=4;angle=90;\nresult=[sqrt(l1^2+l2^2-2*l1^2*l2^2*cosd(angle)),l1*l2*sind(angle)/2]",COMPILE_ERROR,0,0 1514903384019607552,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-15 17:48:06,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = [3 4 90];\n[L3, S] = count(a(1),a(2),a(3));\nresult = [L3,S]\n\nfunction [L3,S] = count(L1,L2,A)\n S = 1/2*L1*L2*sin(A/180*pi);\n a = L1^2+L2^2-2*L1*L2*cos(A/180*pi);\n L3 = sqrt(a);\nend",WRONG_ANSWER,24,6764 1514903390030405632,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-15 17:48:08,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"\ntmp = input('');\na = tmp(1); b = tmp(2); theta = tmp(3)/180*pi;\n\nc = sqrt(a^2+b^2-2*a*b*cos(theta));\narea = a*b*sin(theta)/2;\nresult = [c,area]",ACCEPTED,26,6376 1514903407411240960,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:48:12,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"\nfunction [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,26,6564 1514903455343550464,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-15 17:48:23,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,h=7620;\na=9.8;\nstartM=sqrt(2*a*h);\nresult=startM;\nend,WRONG_ANSWER,27,6764 1514903459764346880,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-15 17:48:25,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"l1=3;l2=4;angle=90;\nresult=[sqrt(l1^2+l2^2-2*l1^2*l2^2*cosd(angle)),l1*l2*sind(angle)/2]",WRONG_ANSWER,25,6512 1514903477355257856,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 17:48:29,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=a(a,b,c)\n c=sqrt(a*a+b*b) ;\n s=a*b/2;\n end\na = [3 4 90];\n[c s] = a(a(1),a(2),a(3));\nresult = [c s] ;\n\n",WRONG_ANSWER,25,6508 1514903513661710336,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 17:48:37,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=a(a,b,c)\n c=sqrt(a*a+b*b) ;\n s=a*b/2;\n end\na = [3 4 90];\n[c s] = a(a(1),a(2),a(3));\nresult = [c s] \n\n",WRONG_ANSWER,24,6756 1514903566752849920,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-15 17:48:50,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM = 20.3\n,WRONG_ANSWER,30,6380 1514903573543231488,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-15 17:48:52,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"% result = [5 6]\nfunction [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,28,6656 1514903574051299328,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-15 17:48:52,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"%startM = sqrt(2*9.8*(100000-25000*0.12*2.54));\nstartM = 20.3;\nstartM = sprintf(' %.1f',startM)",WRONG_ANSWER,25,6528 1514903589154988032,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:48:55,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"\nfunction result = calc(a,b,C)\n\n C = deg2rad(C);\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c,S];\n\nend\nresult = clac(3,4,90);\n",WRONG_ANSWER,25,6384 1514903618515116032,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 17:49:02,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=a(a,b,C)\n c=sqrt(a*a+b*b) ;\n s=a*b/2;\n end\na = [3 4 90];\n[c s] = a(a(1),a(2),a(3));\nresult = [c s] \n\n",WRONG_ANSWER,23,6384 1514903623774773248,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-15 17:49:04,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=20.3,WRONG_ANSWER,25,6640 1514903689780535296,ecd921c78e234ec4d6363f68614c8f82423e144e1ddb7303f67aa44557c0a44a,2022-04-15 17:49:19,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"\n\nfunction [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = input('');\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,25,6384 1514903697640300544,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-15 17:49:21,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [L3,S] = count(L1,L2,A)\n S = 1/2*L1*L2*sin(A/180*pi);\n a = L1^2+L2^2-2*L1*L2*cos(A/180*pi);\n L3 = sqrt(a);\nend\na = [3 4 90];\n[L3, S] = count(a(1),a(2),a(3));\nresult = [L3,S]\n",ACCEPTED,26,6556 1514903762874671104,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-15 17:49:37,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;b=4;arg=90;\nrad = arg/180*pi();\nc=sqrt(a^2+b^2-2*a*b*cos(rad));\ns=0.5*a*b*sin(rad);\nresult(1,1)=c;\nresult(1,2)=s;\nresult",ACCEPTED,27,6504 1514903766368165888,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-15 17:49:38,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"startM = sqrt(2*10*(100000-25000*0.12*2.54));\n%startM = 20.3;\nstartM = sprintf(' %.1f',startM)",WRONG_ANSWER,26,6376 1514903782453321728,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:49:41,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,len = 100000-25000*12*2.54/100;\nstartM = sqrt(2*len*9.8);\nstartM,WRONG_ANSWER,25,6792 1514903823150456832,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-15 17:49:51,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi;\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\n\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,28,6516 1514903842222153728,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:49:56,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,S] = calc(a,b,C)\n\n C = deg2rad(C);\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n\nend\n\n[c,S] = calc(3,4,90);\n\n\nresult = [c,S]\n",WRONG_ANSWER,27,6568 1514903856084328448,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 17:49:59,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c s]=a(a,b,C)\n c=sqrt(a*a+b*b) ;\n s=a*b/2;\n end\na = [3 4 90];\n[c s] = a(a(1),a(2),a(3));\nresult = [c s] \n\n",WRONG_ANSWER,25,6760 1514903857959182336,ecd921c78e234ec4d6363f68614c8f82423e144e1ddb7303f67aa44557c0a44a,2022-04-15 17:49:59,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"\n\nfunction [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = input('');\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,25,6920 1514903876732690432,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-15 17:50:04,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,format short g\ntemp=25000;\ntemp1=temp*2.54*12/100;\ntemp2=100*1000;\nstartM=sqrt((temp2-temp1)*2*10),WRONG_ANSWER,28,6660 1514903933708115968,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-15 17:50:18,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\nc=90/180*pi;\nd=sqrt(a^2+b^2-2*a*b*cosc);\ne=1/2*a*b*sinc;\nresult=[d e],WRONG_ANSWER,26,6384 1514903987755917312,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-15 17:50:30,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,A=input(' ');\na=A(1);b=A(2);c=A(3);\ns=1/2*A(1)*A(2)*sind(A(3));\nd=sqrt(a*a+b*b-2*a*b*cosd(c));\nresult=[d s],WRONG_ANSWER,29,6532 1514903997272793088,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 17:50:33,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408," L = 100000; %出发点到外太空的距离（100千米）\n l0 = 7620; %初始上升高度\n g = 9.80; %重力加速度设置为9.80m/s^2\n \n %由公式得到初速度u的计算公式\n u = sqrt(2*g*(L-l0));\n \n disp( ['startM = ',num2str(u)] );\n",WRONG_ANSWER,28,6384 1514904004038205440,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-15 17:50:34,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"l1=3;l2=4;angle=90;\nresult=[sqrt(l1^2+l2^2-2*l1^2*l2^2*cosd(angle)),l1*l2*sind(angle)/2]",WRONG_ANSWER,25,6548 1514904130538414080,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-15 17:51:04,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,l=100000-25000*12*2.54/100;\nstartM = sqrt(2*9.8*l),WRONG_ANSWER,26,6508 1514904144694190080,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 17:51:08,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=a(a,b,C)\n length=sqrt(a*a+b*b) ;\n area=a*b/2;\n end\na = [3 4 90];\n[c s] = a(a(1),a(2),a(3));\nresult = [c s] \n\n",WRONG_ANSWER,27,6760 1514904146913173504,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-15 17:51:08,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"q=25000*12*2.54/100;\np=100*1000;\ns=p-q;\na=10.0;\nsyms x;\nfun=-0.5*a*(x/a)^2+x*x/a==s;\nresult=solve(fun,x);\nfor i=1:2\n if result(i)>0\n disp(result(i));\n end \nend\n",WRONG_ANSWER,25,6764 1514904159332507648,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-15 17:51:11,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\nc=90/180*pi;\nd=sqrt(a^2+b^2-2*a*b*cos(c));\ne=1/2*a*b*sin(c);\nresult=[d e],ACCEPTED,28,6788 1514904160360112128,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-15 17:51:12,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,h0=(25000*12*2.54)/100;\nh1=100000;\ng=9.8;\n%vt=sqrt(2*g*vt.^2);\nstartM=sqrt(2*g*(h0+h1))\n,WRONG_ANSWER,28,6552 1514904170489356288,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-15 17:51:14,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,l1=3;l2=4;angle=90;\nresult=[sqrt(l1^2+l2^2-2*l1^2*l2^2*cosd(angle)) l1*l2*sind(angle)/2],WRONG_ANSWER,28,6380 1514904195084558336,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-15 17:51:20,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,m=25000;\nn=10000000;\nstartM=sqrt(2*(n-m*12*2.54)/100*9.8);\nstartM,WRONG_ANSWER,31,6380 1514904198783934464,475ad7ec182bfff856610cda7574c219f2a0cb438afb857d67a7fabb7f8e1276,2022-04-15 17:51:21,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,g=9.8;\nh0=25000*12*2.54*0.01;\nouter=100000;\nstartM=sqrt(2*g*(outer-h0)),WRONG_ANSWER,28,6380 1514904213833097216,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:51:24,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,S] = calc(a,b,C)\n\n C = C/180*pi();\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n\nend\n\n[c,S] = calc(3,4,90);\n\n\nresult = [c,S]\n",ACCEPTED,25,6640 1514904225527013376,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-15 17:51:27,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,l0=25000*12*2.54/100;\nl=100*1000;\nstartM=sqrt(2*9.8*(l-l0)),WRONG_ANSWER,26,6924 1514904237782769664,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-15 17:51:30,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,h0=(25000*12*2.54)/100;\nh1=100000;\ng=9.8;\nstartM=sqrt(2*g*(h0+h1)),WRONG_ANSWER,28,6380 1514904244338466816,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 17:51:32,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,a=25000*2.54*12/100+100*1000\nstartM=sqrt(2*a*9.8)\nformat short\n,WRONG_ANSWER,25,6636 1514904245059690496,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-15 17:51:32,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"l1=3;l2=4;angle=90;\nresult=[sqrt(l1^2+l2^2-2*l1^2*l2^2*cosd(angle)),l1*l2*sind(angle)/2]",WRONG_ANSWER,25,6384 1514904268933865472,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:51:37,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 1345.6\\n'),WRONG_ANSWER,29,6536 1514904279490928640,2ba943b978267503034acb4f52f525d0593dde92c6a4f6afcc1749a96e66763c,2022-04-15 17:51:40,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\nA=[3 4 90];\n[length,area] = triangle(A(1),A(2),A(3));\n result=[length,area]",ACCEPTED,25,6380 1514904292304527360,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:51:43,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"len = 100000-25000*12*2.54/100;\nstartM = sqrt(2*len*9.8);\nans = ['startM = ',str(startM)]\ndisp(ans)",WRONG_ANSWER,25,6512 1514904300516974592,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:51:45,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = calc(a,b,C)\n\n C = C/180*pi();\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n\nend\n\nresult = calc(3,4,90);",WRONG_ANSWER,24,6760 1514904317176750080,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 17:51:49,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"function u = ship()\n L = 100000; %出发点到外太空的距离（100千米）\n l0 = 7620; %初始上升高度\n g = 9.80; %重力加速度设置为9.80m/s^2\n \n %由公式得到初速度u的计算公式\n u = sqrt(2*g*(L-l0));\n \n disp( ['startM = ',num2str(u)] );\nend\n",WRONG_ANSWER,25,6384 1514904351926362112,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-15 17:51:57,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,startM = 7620,ACCEPTED,24,6380 1514904355265224704,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-15 17:51:58,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,x = 100.635\ng = 9.8\nstartM = sqrt(2*g*x)\n,WRONG_ANSWER,30,6640 1514904373032099840,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:52:02,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = calc(a,b,C)\n\n C = C/180*pi();\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c,S]\n\nend\n\nresult = calc(3,4,90)",WRONG_ANSWER,27,6656 1514904397984571392,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:52:08,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = calc(a,b,C)\n\n C = C/180*pi();\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c S]\n\nend\n\nresult = calc(3,4,90)",WRONG_ANSWER,25,6380 1514904416640835584,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:52:13,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = calc(a,b,C)\n\n C = C/180*pi();\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c S];\n\nend\n\nresult = calc(3,4,90)",ACCEPTED,26,6444 1514904456725438464,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 17:52:22,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,a=100*1000\nstartM=sqrt(2*a*9.8)\nformat short\n,WRONG_ANSWER,25,6800 1514904475306008576,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:52:27,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = calc(a,b,C)\n\n C = C / 180 * pi;\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c S];\n\nend\n\nresult = calc(3,4,90)",ACCEPTED,26,6532 1514904482205835264,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-15 17:52:28,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,\nstartM=sqrt(2*9.8*(25000*12*0.01*2.54+100000)),WRONG_ANSWER,24,6440 1514904487058448384,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 17:52:29,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"function u = ship()\n L = 100000; %出发点到外太空的距离（100千米）\n l0 = 7620; %初始上升高度\n g = 10.0; %重力加速度设置为9.80m/s^2\n \n %由公式得到初速度u的计算公式\n u = sqrt(2*g*(L-l0));\n \n disp( ['startM = ',num2str(u)] );\nend\n",WRONG_ANSWER,23,6636 1514904542351958016,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:52:43,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"\n\nresult = calc(3,4,90)\nfunction result = calc(a,b,C)\n\n C = C / 180 * pi;\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c S];\n\nend",WRONG_ANSWER,29,6508 1514904570278191104,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:52:49,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = calc(a,b,C)\n\n C = C / 180 * pi;\n\n c = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\n S = 0.5 * a * b * sin(C);\n \n result = [c S];\n\nend\n\nresult = calc(3,4,90)",ACCEPTED,25,6508 1514904593262419968,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-15 17:52:55,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi;\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\n",WRONG_ANSWER,26,6632 1514904600409513984,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-15 17:52:56,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,x = 100.635\ng = 0.0098\nstartM = sqrt(2*g*x)\n,WRONG_ANSWER,25,6388 1514904637487161344,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-15 17:53:05,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi;\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\n\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,24,6636 1514904649365626880,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-15 17:53:08,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,u=(x*9.8*100000)^0.5;\nresult=u*5;\nresult,WRONG_ANSWER,25,6380 1514904659159687168,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:53:10,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"len = 100000-25000*12*2.54/100;\nstartM = sqrt(2*len*9.8);\nans = ['startM = ',num2str(startM)]\ndisp(ans)",WRONG_ANSWER,25,6636 1514904773965815808,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:53:38,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,len = 100000-25000*12*2.54/100;\nstartM = sqrt(2*len*9.8),WRONG_ANSWER,29,6380 1514904779141586944,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:53:39,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,function u = calc\n\n u = sqrt(2 * 9.8 * (100000 - 25000*12*2.54*0.01));\n\nend\n\nu = calc;,WRONG_ANSWER,26,6652 1514904807864180736,fc622031909fd01e20e29d9a630a8e53e363d4c3210424fe4cb2be9f3759c759,2022-04-15 17:53:46,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\ntheta=pi*90/180;\nd=sqrt(a*a+b*b-2*a*b*cos(c));\narea=a*b*sin(theta)/2;\nresult=[d,area] ",WRONG_ANSWER,27,6380 1514904840772493312,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-15 17:53:54,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,startM = 25000*12*2.54/100,ACCEPTED,25,6404 1514904878261739520,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 17:54:03,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,result=[sqrt(3*3+4*4) 3*4/2]\n \n,ACCEPTED,26,6632 1514904887392739328,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:54:05,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 1359.3\\n'),WRONG_ANSWER,25,6764 1514904906782449664,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-15 17:54:10,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"h=1e5-250*12*2.54;\nu=sqrt(2*9.8*h);\nfprintf('startM = %.1f',u);",WRONG_ANSWER,29,6508 1514904911979749376,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-15 17:54:11,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,format short g\ntemp=25000;\ntemp1=temp*2.54*12/100;\ntemp2=100*1000;\nresult=sqrt((temp2-temp1)*2*9.8),WRONG_ANSWER,26,6636 1514904921765060608,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:54:13,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 1359.3'),WRONG_ANSWER,24,6440 1514904956996853760,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:54:21,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 1345.6'),WRONG_ANSWER,25,6384 1514905009928970240,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-15 17:54:34,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,u=(2*9.8*100000)^0.5;\nu*5\n,WRONG_ANSWER,24,6760 1514905032691458048,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-15 17:54:40,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,u=(2*9.8*100000)^0.5;\nu\n,WRONG_ANSWER,24,6532 1514905043085303808,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-15 17:54:42,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,format short g\ntemp=25000;\ntemp1=temp*2.54*12/100;\ntemp2=100*1000;\nstartM=temp2-temp1,WRONG_ANSWER,24,6764 1514905078585335808,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-15 17:54:50,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,a=sqrt(1810648);\ndisp(a);,WRONG_ANSWER,27,6376 1514905090639962112,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 17:54:53,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 1400'),WRONG_ANSWER,25,6464 1514905132930932736,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-15 17:55:03,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,startM =25000*12*2.54/100\n,ACCEPTED,24,6388 1514905136508870656,2f899571508a053be2b21d9e394ba6abafa406997760a25532719b07d17fd619,2022-04-15 17:55:04,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=1400,WRONG_ANSWER,27,6512 1514905136965853184,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-15 17:55:04,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=(2*9.8*100000)^0.5;\nstartM\n,WRONG_ANSWER,28,6640 1514905188019478528,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-15 17:55:17,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,m=25000;\nn=10000000;\nstartM=sqrt(2*93280*9.8);\nstartM,WRONG_ANSWER,27,6800 1514905230939430912,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-15 17:55:27,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,l=100000-25000*12*2.54/100\nstartM = sqrt(2*9.8*l);,WRONG_ANSWER,25,6380 1514905248286875648,85dbdc3a3cbc974bede3b9dd4f3437c8bbb2d0854eb860df450f7a69f9ee571e,2022-04-15 17:55:31,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,h=100000-7620;\ng=9.8;\nu=sqrt(2*g*h);\nresult=u,WRONG_ANSWER,26,6380 1514905302033244160,cbac9a50bb450bc8a49ef840efd65c7ad92933110e2dede9f72212bf8250991c,2022-04-15 17:55:44,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"x=solve(x^2-2*9.8*25000*12*2.54*0.01-2*9.8*1000000=0,'x')",WRONG_ANSWER,25,6404 1514905308366086144,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 17:55:45,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,a=25000*2.54*12/100+100*1000;\nstartM=sqrt(2*a*9.8),WRONG_ANSWER,26,6508 1514905325944971264,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:55:49,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,\nfunction u = calc()\n\n u = sqrt(2 * 10 * (100000 - 25000*12*2.54*0.01));\n\nend\n\nu = calc();,WRONG_ANSWER,27,6532 1514905340024692736,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-15 17:55:53,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,dis=100*1000-25000*2.54*0.01*12;\nstartM=sqrt(dis*9.8*2);\n,WRONG_ANSWER,25,6384 1514905347730186240,c1f243f5106d0832d4bd1c6b1988e28764fc6fbc00aeeb159f601eb20c68bce7,2022-04-15 17:55:55,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,24,6636 1514905354751090688,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 17:55:56,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"function u = ship()\n L = 100000; %出发点到外太空的距离（100千米）\n l0 = 7620; %初始上升高度\n g = 10.0; %重力加速度设置为9.80m/s^2\n \n %由公式得到初速度u的计算公式\n u = sqrt(2*g*(L-l0));\n \n disp( ['startM = ',num2str(u)] );\nend\n",WRONG_ANSWER,24,6536 1514905364171857920,c5d8955f8d024cc1f6e34be920b383ef27428bfd5c9c0d08aa5ae85a9bc72e9f,2022-04-15 17:55:59,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=(2*9.8*(100000-25000*12*2.54/100))^0.5\n,WRONG_ANSWER,24,6384 1514905396442832896,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-15 17:56:06,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"startM = 14*9238^(1/2);\nprintf(\""startM = %f\"",startM);",WRONG_ANSWER,25,6440 1514905399122436096,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-15 17:56:07,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,\nfunction u = calc()\n\n u = sqrt(2 * 10 * (100000 - 25000*12*2.54*0.01));\n\nend\n\nstartM = calc();,WRONG_ANSWER,24,6536 1514905409692639232,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-15 17:56:09,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=tri(c,b,alpha)\n#function result = myhilb(rows,cols) \n result(1)=sqrt(b*b+c*c-2*b*c*cos(alpha));\n result(2)=0.5*b*c*sin(alpha);\nend",COMPILE_ERROR,0,0 1514905420576858112,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 17:56:12,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"u = ship();\n\nfunction u = ship()\n L = 100000; %出发点到外太空的距离（100千米）\n l0 = 7620; %初始上升高度\n g = 10.0; %重力加速度设置为9.80m/s^2\n \n %由公式得到初速度u的计算公式\n u = sqrt(2*g*(L-l0));\n \n disp( ['startM = ',num2str(u)] );\nend\n\n",WRONG_ANSWER,25,6764 1514905441141530624,cbac9a50bb450bc8a49ef840efd65c7ad92933110e2dede9f72212bf8250991c,2022-04-15 17:56:17,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"x=solve(x^2-2*9.8*25000*12*2.54*0.01-2*9.8*100000=0,'x')",WRONG_ANSWER,24,6640 1514905469159481344,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-15 17:56:24,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,temp=25000;\ntemp1=temp*2.54*12/100;\ntemp2=100*1000;\nstartM=temp2-temp1,WRONG_ANSWER,23,6640 1514905471742812160,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-15 17:56:24,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,m=25000;\nn=10000000;\nstartM=93280;\nstartM,WRONG_ANSWER,25,6380 1514905486255464448,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-15 17:56:28,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=sanjiaoxing(c,b,alpha)\n#function result = myhilb(rows,cols) \n result(1)=sqrt(b*b+c*c-2*b*c*cos(alpha));\n result(2)=0.5*b*c*sin(alpha);\nend",COMPILE_ERROR,0,0 1514905496757444608,cbac9a50bb450bc8a49ef840efd65c7ad92933110e2dede9f72212bf8250991c,2022-04-15 17:56:30,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"x=solve(x^2-2*9.8*25000*12*2.54*0.01-2*9.8*100000=0,'x')",WRONG_ANSWER,25,6380 1514905519235276800,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-15 17:56:36,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=(2*9.8*250*2.54*12)^0.5;\nstartM\n,WRONG_ANSWER,25,6516 1514905521239597056,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-15 17:56:36,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,\ntemp=25000;\ntemp1=temp*2.54*12/100;\ntemp2=100*1000;\nstartM=sqrt((temp2-temp1)*2*9.8),WRONG_ANSWER,29,6376 1514905525656756224,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-15 17:56:37,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=14*9238/2;\n,WRONG_ANSWER,25,6792 1514905548104114176,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-15 17:56:42,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,u;\nu=(2*9.8*(100000-250*2.54*12))^1/2;\nstartM = u;\n,WRONG_ANSWER,25,6636 1514905555222405120,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 17:56:44,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=sqrt(2*（25000*2.54*12/100+100*1000）*9.8),WRONG_ANSWER,28,6648 1514905564688392192,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-15 17:56:46,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\nsyms x;\neq=a^2+b^2-2*a*b*cosd(c)-x^2;\nx=solve(eq,x);\nd=x(2);\ns=a*b*sind(c)/2;\nresult=[d,s];\nend",WRONG_ANSWER,26,6800 1514905566999650304,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-15 17:56:47,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152, function result = solve_area(A)\n %a=A(1);b=A(2);c=A(3);\n s=1/2*A(1)*A(2)*sind(A(3));\n d=sqrt(A(1)*A(1)+A(2)*A(2)-2*A(1)*A(2)*cosd(A(3)));\n result=[d s];\n \n end,WRONG_ANSWER,26,6640 1514905592697954304,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-15 17:56:53,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,28,6764 1514905598884552704,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-15 17:56:55,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=14*9238^1/2;\n,WRONG_ANSWER,24,6640 1514905618912354304,4656dae84891deb3913056727d32336a0a77612f09609dee133334eeaec738f4,2022-04-15 17:56:59,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,s] = triangle(a,b,rad)\n arg = rad/180 * pi();\n\n c = (a^2 + b^2 -2*a*b*cos(arg))^0.5;\n\n s = b *sin(arg) * a * 1/2;\n\nend\n\narr = [3,4,90];\n[c,s] = triangle(arr(1),arr(2),arr(3));\nresult = [c,s]",ACCEPTED,26,6528 1514905641754533888,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-15 17:57:05,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=14*9238^(1/2);\n,WRONG_ANSWER,25,6384 1514905774848745472,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-15 17:57:36,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,s] = triangle(a,b,A)\n s = 1/2*a*b*sin(A*pi/180);\n H = a^2+b^2-2*a*b*cos(A*pi/180);\n c = sqrt(H);\nend",COMPILE_ERROR,0,0 1514905781215141888,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-15 17:57:38,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=(14*9238)^(1/2);\n,WRONG_ANSWER,25,6384 1514905787418714112,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-15 17:57:39,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,s] = triangle(a,b,A)\n s = 1/2*a*b*sin(A*pi/180);\n H = a^2+b^2-2*a*b*cos(A*pi/180);\n c = sqrt(H);\nend",COMPILE_ERROR,0,0 1514905859011289088,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-15 17:57:57,C++,0.0,1514821715228844034,1514802200680230912,1141715823085969408,x1=25000*0.0254/12;\nx2=100000;\nA=2*9.8*(x1+x2);\nstartM=sqrt(A);\ncout<>c>>b>>alpha;\n#function result = myhilb(rows,cols) \n a=sqrt(b*b+c*c-2*b*c*cos(alpha));\n s=0.5*b*c*sin(alpha);\n}\n",COMPILE_ERROR,0,0 1514906706412052480,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-15 18:01:19,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"%startM = sqrt(2*10*(100000-25000*0.12*2.54));\n\nstartM = sprintf(' %.1f',232.5)",WRONG_ANSWER,24,6384 1514906722539151360,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-15 18:01:22,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,S] = count(a,b,A)\n S = 1/2*a*b*sin(A/180*pi);\n H = a^2+b^2-2*a*b*cos(A/180*pi);\n c = sqrt(H);\nend\nH = [3 4 90];\n[c, S] = count(H(1),H(2),H(3));\nresult = [c,S]",COMPILE_ERROR,0,0 1514906729170345984,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-15 18:01:24,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"%startM = sqrt(2*10*(100000-25000*0.12*2.54));\n\nstartM = sprintf(' %.1f',232.4)",WRONG_ANSWER,29,6384 1514906770442297344,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-15 18:01:34,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [L3,S] = count(L1,L2,A)\n S = 1/2*L1*L2*sin(A/180*pi);\n a = L1^2+L2^2-2*L1*L2*cos(A/180*pi);\n L3 = sqrt(a);\nend\na = [3 4 90];\n[L3, S] = count(a(1),a(2),a(3));\nresult = [L3,S]",COMPILE_ERROR,0,0 1514906781041303552,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 18:01:36,Objective-C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt\n,COMPILE_ERROR,0,0 1514906781620117504,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 18:01:37,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM =20.3\nformat short g,WRONG_ANSWER,27,6764 1514906795792310272,475ad7ec182bfff856610cda7574c219f2a0cb438afb857d67a7fabb7f8e1276,2022-04-15 18:01:40,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,g=9.8;\nh0=25000*12*2.54*0.01;\nouter=100000;\nstartM=h0,ACCEPTED,24,6376 1514906890667466752,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-15 18:02:03,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\n syms x;\n eq=a^2+b^2-2*a*b*cosd(c)-x^2;\n x=solve(eq,x);\n d=x(2);\n s=a*b*sind(c)/2;\n result=[d,s];\nend",WRONG_ANSWER,24,6380 1514906905598992384,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 18:02:06,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,\nformat short g\nstartM =20.3,WRONG_ANSWER,26,6384 1514906915489161216,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-15 18:02:08,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt\n,ACCEPTED,26,6380 1514906988772597760,7dc75fd02be02ae27e8ec9629a966cdf57456df2fe702a237b41410ee92b896c,2022-04-15 18:02:26,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt,ACCEPTED,25,6636 1514906999786283008,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-15 18:02:29,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [L3,S] = count(L1,L2,A)\n S = 1/2*L1*L2*sin(A/180*pi);\n a = L1^2+L2^2-2*L1*L2*cos(A/180*pi);\n L3 = sqrt(a);\nend\n",COMPILE_ERROR,0,0 1514907030048743424,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-15 18:02:36,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=25000*2.54*12/100;\nstartM,ACCEPTED,24,6384 1514907065184428032,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 18:02:44,Objective-C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,starM=sqrt(2*25000*2.54*12*9.8)/1000,COMPILE_ERROR,0,0 1514907074441256960,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:02:46,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A[a,b,c]\nm=sqrt(a^2+b^2);\nn=1/2*a*b;\na=3,b=4,c=90;\nresult=[m,n]",WRONG_ANSWER,25,6380 1514907080132370432,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-15 18:02:48,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,result=[5 6],ACCEPTED,26,6504 1514907087535316992,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-15 18:02:49,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\n syms x;\n eq=a^2+b^2-2*a*b*cosd(c)-x^2;\n x=solve(eq,x);\n side=x(2);\n area=a*b*sind(c)/2;\n result=[side,area];\nend",WRONG_ANSWER,29,6908 1514907103767830528,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:02:53,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A[a,b,c]\nm=sqrt(a^2+b^2);\nn=1/2*a*b;\na=3,b=4,c=90;\nresult=[m,n]\nend",WRONG_ANSWER,26,6804 1514907172428226560,1871f8c875d18f58722f0c4bb53131594a310942901a4f296c8bef48e28d9dd5,2022-04-15 18:03:10,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"A=input('');\nb=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cos(A(3)*pi/180));\nc=1/2*A(1)*A(2)*sin(A(3)*pi/180);\nresult=[b,c]",ACCEPTED,27,6792 1514907195610505216,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-15 18:03:15,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c,s]=tri(a,b,A)\narg=(A/180)*pi;\nc=sqrt(a*a+b*b-2*a*b*cos(arg));\ns=(a*b*sin(arg))/2\nend",WRONG_ANSWER,24,6380 1514907232645652480,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-15 18:03:24,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"a=sqrt(1810648);\ndisp(['startM = ',num2str(a)]);\n",WRONG_ANSWER,28,6384 1514907252669456384,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-15 18:03:29,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [c s]=triangle(a,b,theta)\n rad=theta/180*pi();\n c=sqrt(a^2+b^2-2*a*b*cos(rad));\n s=0.5*a*b*sin(rad);\nend \n[c,s]=triangle(3,4,90);\nresult=[c,s]",ACCEPTED,29,6636 1514907265466638336,78acc34a21c23ccd20a45ae591eacdd72337cea87711fc4a0806b8b2756303b2,2022-04-15 18:03:32,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\ns=pi/2;\nc=sqrtm(a^2+b^2-2*a*b*cos(s));\ns=a*b*sin(s)/2;\ndisp(\""result =\"");\ndisp(\""\"");\ndisp(c);disp(s);\ndisp(\""\"");",PRESENTATION_ERROR,26,6760 1514907268070940672,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 18:03:32,Objective-C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,starM=2*25000*2.54*12*9.8,COMPILE_ERROR,0,0 1514907292536315904,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 18:03:38,Objective-C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,starM=2*25000*2.54*12*9.8;,COMPILE_ERROR,0,0 1514907317093965824,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 18:03:44,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,result=（5 6）,WRONG_ANSWER,25,6636 1514907329853399040,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-15 18:03:47,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 7620'),ACCEPTED,28,6384 1514907354834116608,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 18:03:53,Objective-C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=2*25000*2.54*12*9.8;,COMPILE_ERROR,0,0 1514907357573554176,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-15 18:03:54,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,"%startM = sqrt(2*10*(100000-25000*0.12*2.54));\n%startM = sprintf(' %.1f',232.4)\ncmPerInch = 2.54;\ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt\n",ACCEPTED,25,6384 1514907395489701888,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 18:04:03,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,result=[5 6],ACCEPTED,27,6640 1514907420194512896,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-15 18:04:09,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,result=[5 6],ACCEPTED,25,6640 1514907422223998976,596ce0ba9cbd8dc9c53abd759006b0d0ab5dc2ffa94fecf4a2d73c04b2d9cc05,2022-04-15 18:04:09,Python,0.0,1514821715228844034,1514802200680230912,1141715823085969408,result=20.3,WRONG_ANSWER,17,3276 1514907458215878656,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-15 18:04:18,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408, ,WRONG_ANSWER,28,6376 1514907461113782272,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-15 18:04:19,Objective-C,0.0,1514821715228844034,1514802200680230912,1141715823085969408,fprintf('startM = 7620'),COMPILE_ERROR,0,0 1514907464356339712,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-15 18:04:19,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,startM=25000*12*2.54/100,ACCEPTED,26,6676 1514907478914211840,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-15 18:04:23,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,% temp=input('');\n% a=temp(1);\n% b=temp(2);\n% jiao=temp(3);\n% r(1)=sqrt(a^2+b^2-2*a*b*cosd(jiao));\n% r(2)=1/2*a*b*sind(jiao);\n% result=r\nresult=[5 6],ACCEPTED,26,6644 1514907491736199168,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-15 18:04:26,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=input('');\nresult=zeros(1,2);\nresult(1)=sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180));\nresult(2)=0.5*a(1)*a(2)*sin(a(3)*pi/180);\nresult",ACCEPTED,25,6756 1514907500028338176,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-15 18:04:28,C++,0.0,1514821715228844034,1514802200680230912,1141715823085969408,#include iostream\nusing namespace std;\nint main()\n{\n int x1=25000*0.0254/12;\n int x2=100000;\n int A=2*9.8*(x1+x2);\n int startM=sqrt(A);\n cout<\nusing namespace std;\nint main()\n{\n int x1=25000*0.0254/12;\n int x2=100000;\n int A=2*9.8*(x1+x2);\n int startM=sqrt(A);\n cout<\n#include\nint main()\n{\n int a, b, theta;\n float c, s, d;\n printf(\""请分别输入三角形两边边长以及夹角，数据之间用空格键隔开。其中夹角请按角度制输入\\n\"");\n scanf(\""%d%d%d\"", &a, &b, &theta);\n s=0.5*a*b*sin(theta*3.14159265/180);\n d=cos(theta*3.14159265/180);\n c=sqrt(a*a+b*b-2*a*b*d);\n printf(\""三角形面积为%f\\n\"", s);\n printf(\""三角形第三边长为%f\\n\"", c); \n return 0;\n}\n",WRONG_ANSWER,28,6504 1514910765004791808,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-15 18:17:26,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cm = 2.54;\na = 12;\nb = 1/100;\nh = b * cm * a;\nstartFt = 25000; \nstartM = startFt * h;\ng = 9.8;\ntop = 100*1000;\ns = top-startM;\nintialV = (2*g*s)^0.5,WRONG_ANSWER,27,6384 1514910776920809472,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-15 18:17:29,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch=2.54;   \ninchesPerFt=12;\nmetersPerCm=1/100;\nmetersPerFt=metersPerCm * cmPerInch * inchesPerFt;\nstartFt=25000;   \nstartM=startFt * metersPerFt;\ng=9.8;\ntop=100*1000;\ns=top-startM;\ninitV=sqrt(2*g*s);\ninitV=1345.6;\ninitV\n\n ,WRONG_ANSWER,24,6380 1514910806792642560,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:17:36,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nB=[3 4 90];\nA=B;\nrresult=[m,n]\n",WRONG_ANSWER,27,6384 1514910817819828224,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-15 18:17:39,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"clear\nfunction result=tri(c,b,m)\n alpha=m/180*pi;\n a=(b^2+c^2-2*b*c*cos(alpha))^0.5;\n s=0.5*b*c*sin(alpha);\n result=[a,s];\nend",WRONG_ANSWER,25,6380 1514910821955051520,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-15 18:17:40,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch=2.54;   \ninchesPerFt=12;\nmetersPerCm=1/100;\nmetersPerFt=metersPerCm*cmPerInch*inchesPerFt;\nstartFt=25000;   \nstartM=startFt*metersPerFt;\ng=9.8;\ntop=100*1000;\ns=top-startM;\ninitV=sqrt(2*g*s);\ninitV=1345.6;\ninitV\n\n ,WRONG_ANSWER,29,6404 1514910839050838016,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:17:44,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nB=[3 4 90];\nA=B;\nrresult=[m,n];\n",WRONG_ANSWER,28,6656 1514910843769626624,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-15 18:17:45,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch=2.54;\ninchesPerFt=12;\nmetersPerCm=1/100;\nmetersPerFt=metersPerCm*cmPerInch*inchesPerFt;\nstartFt=25000;\nstartM=startFt*metersPerFt\n\n,WRONG_ANSWER,26,6380 1514910848496967680,da7d97ec36359a2769cfceafd8afb7cf3f8f8f21c0fa1075f95b2f312072de1d,2022-04-15 18:17:46,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,starth=25000*12*2.54/100;\nfinalh=100*1000;\ng=9.8;\ninitV=sqrt(2*g*(finalh-starth)),ACCEPTED,27,6508 1514910894881775616,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-15 18:17:57,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch=2.54;   \ninchesPerFt=12;\nmetersPerCm=1/100;\nmetersPerFt=metersPerCm*cmPerInch*inchesPerFt;\nstartFt=25000;   \nstartM=7620;\ng=9.8;\ntop=100*1000;\ns=top-startM;\ninitV=sqrt(2*g*s);\ninitV=1345.6;\ninitV\n\n ,WRONG_ANSWER,24,6664 1514910938506371072,b12496bda123eb86567a75be56f63c17640f172c11214e8df197b39fe0b27e1f,2022-04-15 18:18:08,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result = myhilb(a,b,z)\n if nargin<3\n fprintf(\""参数输入不足\"")\n end\n z0=deg2rad(z);\n c=sqrt(a^2+b^2-2*a*b*cos(z0));\n d=(a*b*sin(z0))/2;\n result = [c d];\nend",WRONG_ANSWER,25,6380 1514910958374789120,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-15 18:18:12,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,clear\nx1=25000*0.0254/12;\nx2=100000;\nA=2*9.8*(x2-x1);\ninitV=A^0.5;\nfprintf('startM=');\ndisp(startM);,WRONG_ANSWER,25,6380 1514911093540429824,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:18:45,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nB=[3 4 90];\n[m,n]=A(B1 B2 B3);\nrresult=[m,n]\n",WRONG_ANSWER,26,6648 1514911094370705408,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-15 18:18:45,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"y = input('[a b arg] = ');\nformat short\na=y(1);\nb=y(2);\narg=deg2rad(y(3));\nresult=ones(1,2);\nresult(1)=(a^2+b^2-2*a*b*cos(arg))^0.5;\nresult(2)=0.5*a*b*sin(arg);\ndisp(result)",WRONG_ANSWER,28,6504 1514911120530579456,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-15 18:18:51,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"u=(2*9.8*(100000-250*2.54*12))^(1/2);\nfprintf('initV = %.1f',u);",PRESENTATION_ERROR,32,6508 1514911168547168256,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-15 18:19:02,Octave,5.0,1514821715228844034,1514802200680230912,1141715823085969408,"u=(2*9.8*(100000-250*2.54*12))^(1/2);\nfprintf('initV = %.1f',u);",ACCEPTED,27,6380 1514911245596336128,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-15 18:19:21,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,function initV = myhilb(varargin)\nsyms h h0 v0 vt;\nh0=25000*0.0254*12\nh=100*1000-h0\nv0=(2*9.8*h)^(1/2)\n%vt=(2*10*92380)^(1/2)\n%v0=(vt^2+2*10*h)^(1/2)\ninitV=v0\ndisp(initV)\nend,WRONG_ANSWER,25,6512 1514911248427491328,756ea902fb56673ca3d53a63cbf73b5be5e47897a3f49f24db8886e4ff2845dd,2022-04-15 18:19:21,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=cal(A)\ns=1/2*A(1,1)*A(1,2)*sin(A(1,3)/180*pi);\nl=sqrt(A(1,1)^2+A(1,2)^2-1/2*A(1,1)*A(1,2)*cos(A(1,3)/180*pi));\nB=ones(1,2);\nB(1,1)=l;\nB(1,2)=s;\nresult=B;\nend\nA=[3 4 90];\nresult=cal(A);\ndisp('result');\ndisp(result)",WRONG_ANSWER,28,6764 1514911269176713216,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:19:26,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2);\n area = a2*a1/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,26,6508 1514911301867315200,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-15 18:19:34,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,\ncmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt\n,WRONG_ANSWER,25,6380 1514911302693396480,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-15 18:19:34,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152," function result = solve_area(A)\n %a=A(1);b=A(2);c=A(3);\n s=1/2*A(1)*A(2)*sin(A(3)/180*pi);\n d=sqrt(A(1)*A(1)+A(2)*A(2)-2*A(1)*A(2)*cos(A(3)/180*pi));\n result=[d s]\n \n end\n \n result = solve_area([3,4,90]);\n",ACCEPTED,28,6508 1514911314530279424,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:19:37,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n length = sqrt(a1^2 + a2^2);\n area = a2*a1/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,24,6380 1514911321488072704,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-15 18:19:39,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"clear\nfunction result=tri(c,b,m)\n alpha=m/180*pi;\n a=(b^2+c^2-2*b*c*cos(alpha))^0.5;\n s=0.5*b*c*sin(alpha);\n result=[a,s];\nend",WRONG_ANSWER,25,6380 1514911363276480512,756ea902fb56673ca3d53a63cbf73b5be5e47897a3f49f24db8886e4ff2845dd,2022-04-15 18:19:49,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=cal(A)\ns=1/2*A(1,1)*A(1,2)*sin(A(1,3)/180*pi);\nl=sqrt(A(1,1)^2+A(1,2)^2-1/2*A(1,1)*A(1,2)*cos(A(1,3)/180*pi));\nB=ones(1,2);\nB(1,1)=l;\nB(1,2)=s;\nresult=B;\nend\nA=[3 4 90];\nresult=cal(A);\ndisp('result');\n\ndisp(result)",WRONG_ANSWER,28,6504 1514911375514902528,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-15 18:19:52,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"y=[3,4,90];\na=y(1);\nb=y(2);\narg=deg2rad(y(3));\nresult=ones(1,2);\nresult(1)=(a^2+b^2-2*a*b*cos(arg))^0.5;\nresult(2)=0.5*a*b*sin(arg);\ndisp(result)",WRONG_ANSWER,27,6380 1514911440820412416,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-15 18:20:07,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch=2.54;\ninchesPerFt=12;\nmetersPerCm=1/100;\nmetersPerFt=metersPerCm*cmPerInch*inchesPerFt;\nstartFt=25000;\nstartM=startFt*metersPerFt\ng=9.8;%重力加速度\ntop=100*1000;% 千米\ns=top-startM;\nintialV=(2*g*s)^0.5\n,WRONG_ANSWER,24,6640 1514911480192344064,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-15 18:20:17,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\nx=sqrt(a^2+b^2-2*a*b*cosd(c));\ns=a*b*sind(c)/2;\nresult=[x,s];\nend\n",WRONG_ANSWER,25,6376 1514911483329683456,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:20:17,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n] = triangle(a,b,c)\n length = sqrt(a^2 + b^2);\n area =a*b/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",WRONG_ANSWER,25,6504 1514911555773505536,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-15 18:20:35,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,h0=(25000*12*2.54)/100;\nh2=100000;\ninitV=(2*9.8*(h2-h0))^(0.5);,WRONG_ANSWER,27,6396 1514911563625799680,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:20:37,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n] = triangle(a,b,c)\n length = sqrt(a^2 + b^2);\n area =a*b/2;\nend\nd = [3 4 90];\n[side, area] = triangle(d(1),d(2),d(3));\nresult = [side,area]",WRONG_ANSWER,25,6500 1514911635243180032,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-15 18:20:54,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\nx=sqrt(a^2+b^2-2*a*b*cosd(c));\ns=a*b*sind(c)/2;\nend\nresult=[x,s];",WRONG_ANSWER,25,6384 1514911671390052352,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-15 18:21:02,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length, area]= triangle(a1, a2, angle)\nrad angle/180*pi();\nlength= sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side, area]= triangle(a(1), a(2), a(3));\nresult= [side, area]",WRONG_ANSWER,25,6888 1514911672815755264,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-15 18:21:03,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,format short\nh0=(25000*12*2.54)/100;\nh2=100000;\ninitV=(2*9.8*(h2-h0))^(0.5);,WRONG_ANSWER,27,6640 1514911701756813312,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-15 18:21:10,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch=2.54;\ninchesPerFt=12;\nmetersPerCm=1/100;\nmetersPerFt=metersPerCm*cmPerInch*inchesPerFt;\nstartFt=25000;\nstartM=startFt*metersPerFt\ng=9.8;\ntop=100*1000;\ns=top-startM;\nintiV=(2*g*s)^0.5\n,WRONG_ANSWER,27,6380 1514911748694712320,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-15 18:21:21,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length, area]= triangle(a1, a2, angle)\n rad angle/180*pi();\n length= sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side, area]= triangle(a(1), a(2), a(3));\nresult= [side, area]",WRONG_ANSWER,30,6508 1514911779447545856,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:21:28,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n] = triangle(a,b,c)\n m = sqrt(a^2 + b^2);\n n =a*b/2;\nend\nd = [3 4 90];\n[m, n] = triangle(d(1),d(2),d(3));\nresult = [m,n]",ACCEPTED,26,6480 1514911855796822016,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:21:46,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nB=[3 4 90];\n[m,n]=A(B1 B2 B3);\nrresult=[m,n]",WRONG_ANSWER,28,6380 1514911909906980864,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-15 18:21:59,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length, area]= triangle(a1, a2, angle)\n rad=angle/180*pi();\n length= sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]= triangle(a(1), a(2), a(3));\nresult= [side, area]",WRONG_ANSWER,27,6512 1514911923945512960,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 18:22:03,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,side] = tri_S(a,b,angle)\n %a^2=b^2+c^2-2bccosA\n c = sqrt(a^2 + b^2 - 2*a*b*cosd(angle)) ;\n \n p = (a + b + c)/2;\n S = sqrt(p*(p-a)*(p-b)*(p-c));\nend\n\n[length,side] = tri_S(3,4,90);\nresult = [length,side];\n",WRONG_ANSWER,31,6504 1514911936247767040,f9c917192004d3c3a20c1383af0992882b60953c796e2c4093bdc6935ae56de7,2022-04-15 18:22:05,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input(prompt)\nl = sqrt(a(1)^2 + a(2)^2 - 2*a(1)*a(2)*cos(a(3)/180*pi));\ns = 1/2*a(1)*a(2)*sin(a(3)/180*pi);\nl\ns,WRONG_ANSWER,26,6380 1514911963216781312,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:22:12,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nB=[3 4 90];\n[m,n]=A(B(1) B(2) B(3));\nrresult=[m,n]",WRONG_ANSWER,25,6640 1514911987808346112,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-15 18:22:18,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt\ng = 9.8; %重力加速度\ntop = 100*1000; % 千米\ns = top-startM;\nintialV = (2*g*s)^0.5 ,WRONG_ANSWER,25,6380 1514911994535452672,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-15 18:22:19,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,"q=25000*12*2.54/100;\np=100*1000;\ns=p-q;\na=10.0;\nsyms x;\nfun=-0.5*a*(x/a)^2+x*x/a==s;\nresult=solve(fun,x);\nfor i=1:2\n if result(i)>0\n disp(result(i));\n end \nend\n",WRONG_ANSWER,25,6764 1514912033924161536,756ea902fb56673ca3d53a63cbf73b5be5e47897a3f49f24db8886e4ff2845dd,2022-04-15 18:22:29,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function C=cal(A)\ns=1/2*A(1,1)*A(1,2)*sin(A(1,3)/180*pi);\nl=sqrt(A(1,1)^2+A(1,2)^2-1/2*A(1,1)*A(1,2)*cos(A(1,3)/180*pi));\nB=ones(1,2);\nB(1,1)=l;\nB(1,2)=s;\nC=B;\nend\nA=[3 4 90];\nC=cal(A);\nresult=C;\ndisp(result)",WRONG_ANSWER,24,6536 1514912039502585856,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:22:30,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nd=[3 4 90];\n[m,n]=A(d(1) d(2) d(3));\nrresult=[m,n]",WRONG_ANSWER,25,6380 1514912040144871424,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 18:22:30,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,side] = tri_S(a,b,angle)\n %a^2=b^2+c^2-2bccosA\n c = sqrt(a^2 + b^2 - 2*a*b*cosd(angle)) ;\n \n p = (a + b + c)/2;\n S = sqrt(p*(p-a)*(p-b)*(p-c));\nend\n\na = [3 4 90]\n[length,side] = tri_S(a(1),a(2),a(3));\nresult = [length,side];\n",WRONG_ANSWER,24,6892 1514912080405635072,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-15 18:22:40,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,side] = tri_S(a,b,angle)\n %a^2=b^2+c^2-2bccosA\n c = sqrt(a^2 + b^2 - 2*a*b*cosd(angle)) ;\n \n p = (a + b + c)/2;\n S = sqrt(p*(p-a)*(p-b)*(p-c));\nend\n\na = [3 4 90];\n[length,side] = tri_S(a(1),a(2),a(3));\nresult = [length,side];\n",WRONG_ANSWER,28,6936 1514912084289363968,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-15 18:22:41,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=A(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nd=[3 4 90];\n[m,n]=A(d(1),d(2),d(3));\nrresult=[m,n]",WRONG_ANSWER,32,6440 1514912084658462720,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-15 18:22:41,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length, area]= triangle(a1, a2, angle)\n rad=angle/180*pi();\n length= sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]= triangle(a(1), a(2), a(3));\nresult= [side, area]",ACCEPTED,25,6916 1514912128040345600,c1e7960bebeba405bac22627e54760b1aad0bd2e36aadb491585b6b8943876e2,2022-04-15 18:22:51,Octave,0.0,1514821715228844034,1514802200680230912,1141715823085969408,function initV = myhilb(varargin)\nsyms h h0 v0 vt;\nh0=25000*0.0254*12\nh=100*1000-h0\nv0=(2*9.8*h)^(1/2)\n%vt=(2*10*92380)^(1/2)\n%v0=(vt^2+2*10*h)^(1/2)\ninitV=v0\ndisp(initV)\nend,WRONG_ANSWER,26,6376 1516691627614396416,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-20 16:13:57,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a = input('')\nb = input('')\na=input('')\nS = 0.5*a*b*sin((a/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((a/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,32,10792 1516699477904449536,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:45:09,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nd=[3 4 90];\n[m,n]=F(d(1),d(2),d(3));\nresult=[m,n]",WRONG_ANSWER,29,7324 1516699569365622784,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:45:30,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nd=[3 4 90];\n[m,n]=F(d(1),d(2),d(3));\nresult=[m,n]",WRONG_ANSWER,31,10196 1516699872034807808,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:46:43,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nd=[3 4 90];\n[m,n]=F(d(1),d(2),d(3));\nresult=[m,n]",WRONG_ANSWER,27,6496 1516700359052763136,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:48:39,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nd=[3 4 90];\n[e,f]=F(d(1),d(2),d(3));\nresult=[e,f]",WRONG_ANSWER,33,6632 1516700429692690432,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:48:56,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nm=sqrt(a*2+b*2);\nn=1/2*a*b;\nend\nd=[3 4 90];\n[e,f]=\nF(d(1),d(2),d(3));\nresult=[e,f]",WRONG_ANSWER,30,6756 1516700972989456384,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:51:05,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nrad=c/180*pi();\nm=sqrt(a*2+b*2);\nn=a*b/2;\nend\nd=[3 4 90];\n[e,f]=\nF(d(1),d(2),d(3));\nresult=[e,f]",WRONG_ANSWER,31,6896 1516701138018361344,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:51:44,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nm=sqrt(a^2+b^2);\nn=a*b/2;\nend\nd=[3 4 90];\n[e,f]=\nF(d(1),d(2),d(3));\nresult=[e,f]",WRONG_ANSWER,29,6648 1516701750462242816,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:54:10,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nrad=c/180*pi();\nm=sqrt(a^2+b^2-2*a*b*cos(rad));\nn=a*b*sin(rad)/2;\nend\nd=[3 4 90];\n[e,f]=\nF(d(1),d(2),d(3));\nresult=[e,f]",WRONG_ANSWER,31,6500 1516701793655365632,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:54:21,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nrad=c/180*pi();\nm=sqrt(a^2+b^2-2*a*b*cos(rad));\nn=a*b*sin(rad)/2;\nend\n\nd=[3 4 90];\n[e,f]=\nF(d(1),d(2),d(3));\nresult=[e,f]",WRONG_ANSWER,26,6748 1516702139450925056,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:55:43,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a,b,c)\nrad=c/180*pi();\nlength=sqrt(a^2+b^2-2*a*b*cos(rad));\narea=a*b*sin(rad)/2;\nend\n\nd=[3 4 90];\n[side,area]=\ntriangle(d(1),d(2),d(3));\nresult=[e,f]",WRONG_ANSWER,31,6748 1516702193288470528,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:55:56,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a,b,c)\nrad=c/180*pi();\nlength=sqrt(a^2+b^2-2*a*b*cos(rad));\narea=a*b*sin(rad)/2;\nend\n\nd=[3 4 90];\n[side,area]=\ntriangle(d(1),d(2),d(3));\nresult=[side,area]",WRONG_ANSWER,29,6816 1516702557732085760,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:57:23,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad=angle/180*pi();\nlength=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea=a1*a2*sin(rad)/2;\nend\n\na=[3 4 90];\n[side,area]=\ntriangle(a(1),a(2),a(3));\nresult=[side,area]",WRONG_ANSWER,31,6764 1516702777890742272,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:58:15,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad=angle/180*pi();\nlength=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea=a1*a2*sin(rad)/2;\n\na=[3 4 90];\n[side,area]=\ntriangle(a(1),a(2),a(3));\nresult=[side,area]",WRONG_ANSWER,28,6760 1516702806261374976,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:58:22,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad=angle/180*pi();\nlength=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea=a1*a2*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=\ntriangle(a(1),a(2),a(3));\nresult=[side,area]",WRONG_ANSWER,35,6616 1516702873239674880,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:58:38,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad=angle/180*pi();\nlength=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea=a1*a2*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=\ntriangle(a(1),a(2),a(3));\nresult=[side,area]",WRONG_ANSWER,27,6744 1516703050663469056,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:59:20,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,32,6508 1516703108326219776,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:59:34,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\nrad = angle/180*pi();\nlength = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,37,6896 1516703138739118080,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:59:41,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\nrad = angle/180*pi();\nlength = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side,area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,28,6884 1516703164840452096,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:59:48,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\nrad = angle/180*pi();\nlength = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area] = triangle(a(1),a(2),a(3));\nresult = [side,area]",ACCEPTED,27,6920 1516703212097675264,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 16:59:59,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\nrad = angle/180*pi();\nlength = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,32,6496 1516703321229271040,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:00:25,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad = angle/180*pi();\nlength = sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,27,7608 1516703342779604992,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:00:30,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad = angle/180*pi();\nlength = sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea = a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,43,6784 1516703413894029312,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:00:47,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad=angle/180*pi();\nlength=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea=a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,28,6696 1516703481854156800,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:01:03,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n\nlength=sqrt(a1^2+a2^2);\narea=a2*a1/2;\nend\na=[3 4 90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,38,6652 1516703597080616960,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:01:31,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nlength=sqrt(a1^2+a2^2);\narea=a2*a1/2;\nend\na=[3 4 90];\n[length,area]=triangle(a(1),a(2),a(3));\nresult=[length,area]",ACCEPTED,32,6748 1516703676935430144,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:01:50,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,area]=triangle(a1,a2,angle)\nm=sqrt(a1^2+a2^2);\narea=a2*a1/2;\nend\na=[3 4 90];\n[m,area]=triangle(a(1),a(2),a(3));\nresult=[m,area]",ACCEPTED,27,6512 1516703738927243264,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:02:05,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=triangle(a1,a2,angle)\nm=sqrt(a1^2+a2^2);\nn=a2*a1/2;\nend\na=[3 4 90];\n[m,n]=triangle(a(1),a(2),a(3));\nresult=[m,n]",ACCEPTED,26,6492 1516703804425494528,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:02:20,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=triangle(a1,a2,angle)\nm=sqrt(a1^2+a2^2);\nn=a2*a1/2;\nend\nd=[3 4 90];\n[m,n]=triangle(d(1),d(2),d(3));\nresult=[m,n]",ACCEPTED,25,6508 1516703923212918784,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:02:48,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=triangle(a,b,angle)\nm=sqrt(a^2+b^2);\nn=a*b/2;\nend\nd=[3 4 90];\n[m,n]=triangle(d(1),d(2),d(3));\nresult=[m,n]",ACCEPTED,32,6632 1516703955035103232,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:02:56,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=triangle(a,b,c)\nm=sqrt(a^2+b^2);\nn=a*b/2;\nend\nd=[3 4 90];\n[m,n]=triangle(d(1),d(2),d(3));\nresult=[m,n]",ACCEPTED,34,6476 1516704074228834304,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:03:24,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nm=sqrt(a^2+b^2);\nn=a*b/2;\nend\nd=[3 4 90];\n[m,n]=f(d(1),d(2),d(3));\nresult=[m,n]",ACCEPTED,34,6788 1516704120860745728,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:03:36,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=F(a,b,c)\nm=sqrt(a^2+b^2);\nn=a*b/2;\nend\nd=[3 4 90];\n[m,n]=F(d(1),d(2),d(3));\nresult=[m,n]",ACCEPTED,29,6900 1516704716141895680,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:05:57,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nm=sqrt(a^2+b^2);\nn=a*b/2;\nend\nd=(3 4 90);\n[m,n]=f(d(1),d(2),d(3));\nresult=[m,n]",WRONG_ANSWER,31,6824 1516704918701252608,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-20 17:06:46,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nm=sqrt(a^2+b^2);\nn=a*b/2;\nend\nd=[3 4 90];\n[m,n]=f(d(1),d(2),d(3));\nresult=[m,n]\n\n",ACCEPTED,26,6692 1516989862308470784,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 11:59:02,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input('输入a边: ');\nb=input('输入b边: ');\ntheta=input('输入theta角: ');\ns=0.5*a*b*sin(theta*pi/180);\ns,COMPILE_ERROR,0,0 1516990115888242688,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:00:02,C,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input();\nb=input();\ntheta=input();\ns=0.5*a*b*sin(theta*pi/180);\ns\n,COMPILE_ERROR,0,0 1516991726643044352,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:06:26,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input();\nb=input();\ntheta=input();\ns=0.5*a*b*sin(theta*pi/180);\ns\n,COMPILE_ERROR,0,0 1516991812458504192,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:06:47,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input();\nb=input();\ntheta=input();\ns=0.5*a*b*sin(theta*pi/180);\ns\n,COMPILE_ERROR,0,0 1516991891592617984,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:07:05,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=input();\nb=input();\ntheta=input();\ns=0.5*a*b*sin(theta*pi/180);\ns\nend\n,COMPILE_ERROR,0,0 1516992036510015488,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:07:40,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"[a,b,theta]=input();\ns=0.5*a*b*sin(theta*pi/180);\ns\nend\n",COMPILE_ERROR,0,0 1516994941916798976,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:19:13,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\ns\n,COMPILE_ERROR,0,0 1516994973714358272,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:19:20,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\n,COMPILE_ERROR,0,0 1516995055435816960,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:19:40,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\nresult=0.5*a*b*sin(theta*pi/180);\n,COMPILE_ERROR,0,0 1516995140378861568,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:20:00,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\nresult=0.5*a*b*sin(theta*pi/180);\nresult\n,COMPILE_ERROR,0,0 1516996436775133184,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:25:09,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult=[s c];\nresult,COMPILE_ERROR,0,0 1516996575950708736,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:25:42,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult={s c};\nresult,COMPILE_ERROR,0,0 1516996696410939392,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:26:11,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult=[s c];\nresult,COMPILE_ERROR,0,0 1516996838170566656,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:26:45,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult=[s c];\nresult,COMPILE_ERROR,0,0 1516996896915988480,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:26:59,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult=[s,c];\nresult",COMPILE_ERROR,0,0 1516996925457866752,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 12:27:06,OCaml,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult=[s c];\nresult,COMPILE_ERROR,0,0 1517004754491006976,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-21 12:58:12,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180))^(1/2);\ns=(1/2)*a(1)*a(2)*sin(a(3)*pi/180);\nresult=[r s];\nresult,ACCEPTED,30,10700 1517009528011792384,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 13:17:10,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult=[s c];\nresult,WRONG_ANSWER,38,10308 1517010530836144128,09ae8acd34b207d68f406191cc28ffea37e0059c638b40a0b01a5daf054b9cf0,2022-04-21 13:21:09,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,a=3;\nb=4;\ntheta=90;\ns=0.5*a*b*sin(theta*pi/180);\nc=sqrt(b^2+a^2-2*b*a*cos(theta*pi/180));\nresult=[c s];\nresult,ACCEPTED,26,7004 1517319613296582656,c5d8955f8d024cc1f6e34be920b383ef27428bfd5c9c0d08aa5ae85a9bc72e9f,2022-04-22 09:49:20,Octave,10.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,30,6888 1517319705273475072,c5d8955f8d024cc1f6e34be920b383ef27428bfd5c9c0d08aa5ae85a9bc72e9f,2022-04-22 09:49:42,Octave,0.0,1514821715228844035,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\n%%a = [3 4 90];\n%%[side, area] = triangle(a(1),a(2),a(3));\n%%result = [side,area] ",WRONG_ANSWER,27,6508 1518086686860197888,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-24 12:37:25,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h=100*1000-25000*12*2.54/100;\ninitV = sqrt(2*h*9.8),ACCEPTED,27,6884 1518086774860242944,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-24 12:37:46,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h=100*1000-25000*12*2.54/100;\ninitV = sqrt(2*h*9.8),ACCEPTED,27,6624 1518089255275806720,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-24 12:47:37,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [L3,S] = calculate(L1,L2,angle)\n S = 1/2*L1*L2*sin(angle/180*pi);\n L3 =sqrt(L1^2+L2^2-2*L1*L2*cos(angle/180*pi));\nend\na = [3,4,90];\n[b1,b2] = calculate(a(1),a(2),a(3));\nresult = [b1,b2]",ACCEPTED,26,6764 1518089311153131520,eb11732220b53dfe5993e7b1f947e367b0774c58e1fa17ee0407f0007eae83af,2022-04-24 12:47:51,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [L3,S] = calculate(L1,L2,angle)\n S = 1/2*L1*L2*sin(angle/180*pi);\n L3 =sqrt(L1^2+L2^2-2*L1*L2*cos(angle/180*pi));\nend\na = [3,4,90];\n[b1,b2] = calculate(a(1),a(2),a(3));\nresult = [b1,b2]",ACCEPTED,30,6788 1518101024555098112,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-24 13:34:23,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,29,7264 1518101166616174592,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-24 13:34:57,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,result =[5 6]\n\n,ACCEPTED,31,6492 1518104503492644864,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:48:13,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nm=1/2*sqrt(a^2+b^2);\nn=1/2*a*b;\nresult=[m,n]\nend",WRONG_ANSWER,28,6908 1518104553362112512,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:48:25,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nm=1/2*sqrt(a^2+b^2);\nn=1/2*a*b;\nend\nresult=[m,n]",WRONG_ANSWER,27,6628 1518104585867968512,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:48:32,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nm=1/2*sqrt(a^2+b^2);\nn=1/2*a*b;\nend\nresult=[m,n];\nend\n",WRONG_ANSWER,27,6492 1518104941389758464,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:49:57,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi;\nm=1/2*sqrt(a^2+b^2-2*a*b*sin(d));\nn=1/2*a*b*sin(d);\nend\nresult=[m,n];\nend\n",WRONG_ANSWER,27,6752 1518105035949694976,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-24 13:50:20,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"x = [3 4 90]\na = x(1)\nb = x(2)\nC = x(3)/180*pi\nva = [a 0 0]\nvb = [b*cos(C) b*sin(C) 0]\nvc = va-vb\nc = sqrt(dot(vc, vc))\narea = cross(va, vb)/2\nresult = [c abs(area(3))]",WRONG_ANSWER,27,6760 1518105364141400064,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-24 13:51:38,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"x = [3 4 90];\na = x(1);\nb = x(2);\nC = x(3)/180*pi;\nva = [a 0 0];\nvb = [b*cos(C) b*sin(C) 0];\nvc = va-vb;\nc = sqrt(dot(vc, vc));\narea = a*b*sin(C)/2;\nresult = [c area]",ACCEPTED,29,7380 1518105376503468032,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:51:41,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi;\nm=1/2*sqrt(a^2+b^2-2*a*b*sin(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90]\n[m,n]=f(A(1),A(2),A(3))\nresult=[m,n];\nend\n",WRONG_ANSWER,26,6492 1518105441350795264,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:51:56,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi;\nm=1/2*sqrt(a^2+b^2-2*a*b*sin(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90]\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n];\nend\n",WRONG_ANSWER,26,6504 1518105472731930624,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:52:04,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi;\nm=1/2*sqrt(a^2+b^2-2*a*b*sin(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90]\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n];\n\n",WRONG_ANSWER,26,6908 1518105507158777856,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:52:12,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi;\nm=1/2*sqrt(a^2+b^2-2*a*b*sin(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90];\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n];\n\n",WRONG_ANSWER,31,6908 1518105616827244544,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:52:38,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi();\nm=1/2*sqrt(a^2+b^2-2*a*b*sin(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90];\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n];\n\n",WRONG_ANSWER,26,6884 1518105726420213760,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:53:04,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi();\nm=sqrt(a^2+b^2-2*a*b*sin(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90];\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n];\n\n",WRONG_ANSWER,26,6496 1518105830502514688,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:53:29,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi();\nm=sqrt(a^2+b^2-2*a*b*cos(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90];\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n];\n\n",WRONG_ANSWER,26,6752 1518105852157059072,7793e362c8b0faf15270dc03a96d09966e3cbe0eaf06b0cb83b840344c7e7bdb,2022-04-24 13:53:34,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,g=9.8;\nx2=100*1000;\nx1=25000*12*2.54/100;\ninitV = sqrt(2*g*(x2-x1)),ACCEPTED,26,6760 1518106059225653248,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:54:24,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi();\nm=sqrt(a^2+b^2-2*a*b*cos(d));\nn=a*b*sin(d)/2;\nend\nA=[3,4,90];\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n]\n\n",ACCEPTED,28,6748 1518106081636466688,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:54:29,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi();\nm=sqrt(a^2+b^2-2*a*b*cos(d));\nn=a*b*sin(d)/2;\nend\nA=[3,4,90];\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n];\n\n",WRONG_ANSWER,26,6884 1518106154209861632,bb9ec55e4f6a9786e70139b0375708d92be6c4acbc322fc5e49186f4878e7b2e,2022-04-24 13:54:46,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [m,n]=f(a,b,c)\nd=c/180*pi();\nm=sqrt(a^2+b^2-2*a*b*cos(d));\nn=1/2*a*b*sin(d);\nend\nA=[3,4,90];\n[m,n]=f(A(1),A(2),A(3));\nresult=[m,n]\n\n",ACCEPTED,28,6756 1518111522675712000,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-24 14:16:06,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,25,6632 1518111606860234752,b3d6604b105f1cdfb006936390d1d0e1248d2a5148d84e1429eac934d8ec5c22,2022-04-24 14:16:26,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,result =\n\n 5 6,WRONG_ANSWER,28,6616 1518115085116203008,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 14:30:16,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,27,6660 1518115258186416128,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 14:30:57,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,result =\n\n 5 6,WRONG_ANSWER,26,6748 1518115386301431808,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-24 14:31:27,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,h=25000*12*2.54/100;\ns=100000-h;\nv=sqrt(2*9.8*s),WRONG_ANSWER,34,6752 1518116003921084416,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-24 14:33:55,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h=25000*12*2.54/100;\ns=100000-h;\ninitV=sqrt(2*9.8*s),ACCEPTED,26,6876 1518116928802217984,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 14:37:35,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n rad=angle/180*pi;\n length=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=1/2*sin(rad)*a1*a2;\nend\na=[3,4,90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,28,6740 1518117015624310784,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 14:37:56,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n rad=angle/180*pi;\n length=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=1/2*sin(rad)*a1*a2;\nend\na=[3,4,90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,25,6500 1518117231740018688,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-24 14:38:47,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = triangle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*bcos(arg));\ns=0.5*a*b;\nresult=[c,s];\nend\nresult = triangle(3,4,90)\n",WRONG_ANSWER,27,6504 1518117399827398656,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-24 14:39:28,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = triangle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*bcos(arg));\ns=0.5*a*b*sin(arg);\nresult=[c,s];\nend\nresult = triangle(3,4,90)\n",WRONG_ANSWER,27,6748 1518117810428788736,6709ec9ca212cdb34a72ded2a9b6ed0b529cba8867cdd00f0e73c3a3a1c58c3f,2022-04-24 14:41:05,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = triangle(a,b,ang)\narg=ang*pi/180;\nc=sqrt(a^2+b^2-2*a*b*cos(arg));\ns=0.5*a*b*sin(arg);\nresult=[c,s];\nend\nresult = triangle(3,4,90)\n",ACCEPTED,25,6504 1518123734410039296,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 15:04:38,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n rad=angle/180*pi;\n length=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=1/2*sin(rad)*a1*a2;\nend\na=[3 4 90];\n[length,area]=triangle(a(1),a(2),a(3));\nresult=[length,area]",ACCEPTED,25,6508 1518123847226974208,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 15:05:05,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n rad=angle/180*pi;\n length=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=1/2*sin(rad)*a1*a2;\nend\na=[6 8 90];\n[length,area]=triangle(a(1),a(2),a(3));\nresult=[length,area]",WRONG_ANSWER,27,6656 1518123880437473280,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 15:05:13,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n rad=angle/180*pi;\n length=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=1/2*sin(rad)*a1*a2;\nend\na=[3 4 90];\n[length,area]=triangle(a(1),a(2),a(3));\nresult=[length,area]",ACCEPTED,29,6496 1518125790256533504,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-24 15:12:48,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,ycm=2.54;\nydm=12;\nh=25000/ycm;\nu=1*10^8/ydm;\ninitV=u*h;\ninitV=1345.6;\ninitV\n,ACCEPTED,28,6564 1518126003791290368,f58ceda394a2d80136efaef228143e9755955977e40006cd286478e63e253483,2022-04-24 15:13:39,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nt=90;\nrows=1;\ncols=2;\nresult =zeros(rows, cols);\ns=0.5*a*b*sin(t*3.14159265/180);\nd=cos(t*3.14159265/180);\nc=sqrt(a*a+b*b-2*a*b*d);\nc=5;\ns=6;\nresult=[c,s]",ACCEPTED,26,6764 1518127614232707072,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 15:20:03,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,inchp=2.54;\ninp=12;\ninch=25000;\nwai=100;\nx=inch*inchp*inp/100+(wai*1000);\ninitV=sqrt(2*9.8*x),WRONG_ANSWER,26,6508 1518127820365324288,a2990cbc022bc24d436ed335adc1807a8f4070183093d770dee2068e63871eb2,2022-04-24 15:20:52,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,inchp=2.54;\ninp=12;\ninch=25000;\nwai=100;\nx=inch*inchp*inp/100+(wai*1000);\ninitV=sqrt(2*9.8*x);\ninitV = 1345.6,ACCEPTED,26,6504 1518131020254371840,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-24 15:33:35,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h0=(25000*12*2.54)/100;\nh1=100000;\ng=9.8;\nH=h1-h0;\ninitV=sqrt(2*g*H),ACCEPTED,27,6748 1518133967889588224,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-24 15:45:18,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h1=1e5;\nh2=250*12*2.54;\nh=h1-h2;\ng=9.8;\ninitV=sqrt(2*g*h),ACCEPTED,27,6760 1518134090073858048,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-24 15:45:47,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,a=3;\nb=4;\nC=90*pi/180;\nc2=a^2+b^2-2*a*b*cos(C);\nc=sqrt(c2);\nS=0.5*a*b*sin(C);\nresult=[c S],ACCEPTED,27,6760 1518134112794402816,9cff99daf432bb6d949dc0229d5e4cab72aad6d3987a51432bc576f5f76b49ba,2022-04-24 15:45:52,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,a=3;\nb=4;\nC=90*pi/180;\nc2=a^2+b^2-2*a*b*cos(C);\nc=sqrt(c2);\nS=0.5*a*b*sin(C);\nresult=[c S],ACCEPTED,26,6512 1518137618595012608,28cc0f11c5c39bdf01661723993a6fa2654c8a1d9b306317b370bc0f75ab6710,2022-04-24 15:59:48,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"a=3;b=4;y=90;\nrad=y/180*pi;\nlength=sqrt(a^2+b^2-2*a*b*cos(rad));\narea=0.5*a*b*sin(rad);\nfprintf('result =\\n\\n %d %d\\n\\n',length,area);",ACCEPTED,30,6520 1518137931046141952,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-24 16:01:03,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,g=9.8;\nx1=25000*12*2.54/100;\nx2=100000;\nx3=x2-x1;\ninitV=sqrt(2*g*x3);\nfprintf('initV=');\ndisp(initV),PRESENTATION_ERROR,25,6512 1518138441673293824,c5d8955f8d024cc1f6e34be920b383ef27428bfd5c9c0d08aa5ae85a9bc72e9f,2022-04-24 16:03:04,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=((100000-250*2.54*12)*2*9.8)^0.5,ACCEPTED,33,6908 1518138526154964992,c5d8955f8d024cc1f6e34be920b383ef27428bfd5c9c0d08aa5ae85a9bc72e9f,2022-04-24 16:03:24,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,30,6760 1518139178645413888,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-24 16:06:00,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result[c,s]= triangle(a,b,m)\ngama=m/180*pi;\nc=sqrt(a^2+b^2-2*cos(gama)*a*b);\ns=0.5*a*b*sin(gama);\nresult=[c,s];\nend",WRONG_ANSWER,32,6788 1518140420322975744,1871f8c875d18f58722f0c4bb53131594a310942901a4f296c8bef48e28d9dd5,2022-04-24 16:10:56,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,s=100*1000-25000*12*2.54/100;\ninitV=sqrt(2*9.8*s),ACCEPTED,28,6984 1518140476398080000,1871f8c875d18f58722f0c4bb53131594a310942901a4f296c8bef48e28d9dd5,2022-04-24 16:11:09,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,s=100*1000-25000*12*2.54/100;\ninitV=sqrt(2*9*s),WRONG_ANSWER,35,6628 1518140536477290496,1871f8c875d18f58722f0c4bb53131594a310942901a4f296c8bef48e28d9dd5,2022-04-24 16:11:24,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,s=100*1000-25000*12*2.54/100;\ninitV=sqrt(2*9.8*s),ACCEPTED,30,6760 1518140738932150272,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-24 16:12:12,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"g=9.8;\nx1=25000*12*2.54/100;\nx2=100000;\nx3=x2-x1;\ninitV=sqrt(2*g*x3);\nfprintf('initV=%f',initV);",WRONG_ANSWER,29,6756 1518141377937752064,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-24 16:14:44,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"g=9.8;\nx1=25000*12*2.54/100;\nx2=100000;\nx3=x2-x1;\ninitV=sqrt(2*g*x3);\nfprintf('initV=%f',initV);",WRONG_ANSWER,28,6500 1518141772589010944,508a89694a22eb7d6fd359abd93d831a10d1f2221168cd3f699a57f541bcdfb4,2022-04-24 16:16:18,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result= triangle(a,b,m)\ngama=m/180*pi;\nc=sqrt(a^2+b^2-2*cos(gama)*a*b);\ns=0.5*a*b*sin(gama);\nresult=[c,s];\nend",WRONG_ANSWER,27,6872 1518142375309688832,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-24 16:18:42,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,starth = 25000*12*2.54/100;\nendh = 100*1000;\ninitV = sqrt(2*9.8*(endh - starth)),ACCEPTED,28,6696 1518142752201457664,fc622031909fd01e20e29d9a630a8e53e363d4c3210424fe4cb2be9f3759c759,2022-04-24 16:20:12,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,fprintf('initV = 1345.6');,ACCEPTED,30,6660 1518142942840963072,fc622031909fd01e20e29d9a630a8e53e363d4c3210424fe4cb2be9f3759c759,2022-04-24 16:20:57,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nc=pi*90/180;\nd=sqrt(a*a+b*b-2*a*b*cos(c));\ne=a*b*sin(c)/2;\nresult=[d,e]\n\n",ACCEPTED,29,6756 1518143081093611520,fc622031909fd01e20e29d9a630a8e53e363d4c3210424fe4cb2be9f3759c759,2022-04-24 16:21:30,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"input('tmp');\na=tmp(1);\nb=tmp(2);\nc=tmp(3);\nd=sqrt(a*a+b*b-2*a*b*cos(c));\ne=a*b*sin(c)/2;\nresult=[d,e]\n\n",WRONG_ANSWER,39,7036 1518143519554375680,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-24 16:23:15,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = area(data)\n a = data(1);\n b = data(2);\n angle = data(3)*pi/180;\n c = sqrt(a*a + b*b - 2*a*b*cos(angle));\n s = a*b*0.5*sin(angle);\n result = [c s];\nendfunction\n\nresult = area([3,4,90])",ACCEPTED,30,6736 1518143540344733696,28f821a19de5f4fd1ed870416b948338cc68072e257503a87893dce665bdd73a,2022-04-24 16:23:20,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = area(data)\n a = data(1);\n b = data(2);\n angle = data(3)*pi/180;\n c = sqrt(a*a + b*b - 2*a*b*cos(angle));\n s = a*b*0.5*sin(angle);\n result = [c s];\nendfunction\n\nresult = area([3,4,90])",ACCEPTED,27,6748 1518155489631617024,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-24 17:10:49,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,%x0=100000;\n%u=sqrt(2*x0*9.8);\n%x1=2.54*0.01*25000*12;\n%initV=sqrt(2*9.8*(x1+x0))\ninitV = 1345.6\n,ACCEPTED,27,6636 1518155846222307328,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-24 17:12:14,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,a=[3 4 90];\nr=(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180))^(0.5);\ns=(1/2)*a(1)*a(2)*sin(a(3)*pi/180);\nresult=[r s],ACCEPTED,36,6756 1518156690662985728,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-24 17:15:35,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,h = 1e5-25000*2.54*12/100;\ninitV=sqrt(2*9.8*h);,WRONG_ANSWER,28,6744 1518156782212059136,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-24 17:15:57,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h = 1e5-25000*2.54*12/100;\ninitV=sqrt(2*9.8*h),ACCEPTED,30,6744 1518156891884720128,473e3da84aef2692b62dc000ece3cdcfa21f284467888086604893bf8f1b3212,2022-04-24 17:16:23,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,A=[3 4 90];\nL=(A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)*pi/180))^0.5;\nS=(1/2)*A(1)*A(2)*sin(A(3)*pi/180);\nresult=[L S],ACCEPTED,34,6496 1518157296616824832,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-24 17:18:00,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,34,6748 1518157404978122752,473e3da84aef2692b62dc000ece3cdcfa21f284467888086604893bf8f1b3212,2022-04-24 17:18:26,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=1345.6,ACCEPTED,28,6628 1518157733174022144,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-24 17:19:44,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,h1=25000;\nh2=100*1000;\ng=9.8;\ninitv=(2*g*(h2-h1*12*2.54/100))^(0.5),WRONG_ANSWER,25,6492 1518157803415224320,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-24 17:20:01,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h1=25000;\nh2=100*1000;\ng=9.8;\ninitV=(2*g*(h2-h1*12*2.54/100))^(0.5),ACCEPTED,32,7616 1518157888370851840,776a4f2ea729bbcea546aa4d13dcaa3811bfe79fa3477d080ea774502549728c,2022-04-24 17:20:21,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"tri = [3,4,90];\na = tri(1);\nb = tri(2);\ntheta = tri(3);\nc = sqrt(a^2+b^2-2*a*b*cos(theta/180*pi));\nS = 1/2*a*b*sin(theta/180*pi);\nresult = [c,S]",ACCEPTED,39,6872 1518157911259975680,2cc45f1139bd299075967cdf5afb6e1c622230cf8b9c688778fb8ba0d097778d,2022-04-24 17:20:26,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h1=25000;\nh2=100*1000;\ng=9.8;\ninitV=(2*g*(h2-h1*12*2.54/100))^(0.5),ACCEPTED,26,6752 1518158012979429376,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-24 17:20:50,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [L,S]= suan(a,b,c)\nc=c/180*pi;\nL=sqrt(a*a+b*b-2*a*b*cos(c));\nS=1/2*a*b*sin(c);\nend\nresult = suan(3,4,90)",WRONG_ANSWER,32,6920 1518158258204413952,89244da71cad76c45a61bff56c8b6a3a0ef2302d2b9218afd3516e348cc87ff5,2022-04-24 17:21:49,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [L,S]= suan(a,b,c)\nc=c/180*pi;\nL=sqrt(a*a+b*b-2*a*b*cos(c));\nS=1/2*a*b*sin(c);\nend\n[L,S] = suan(3,4,90);\nresult=[L S]",ACCEPTED,29,6752 1518159323862360064,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-24 17:26:03,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result=triangle(a,b,rho)\nangle=rho/180*pi;\nc=sqrt(a^2+b^2-2*a*b*cos(angle));\ns=0.5*a*b*sin(angle);\nresult(1)=c;\nresult(2)=s;\nend\n\nresult=triangle(3,4,90)",ACCEPTED,28,6568 1518159472279261184,9c46a7f5c98bf9b8e7fb30d5b265fe19e39eea65b0abd938ae36280add92e7dd,2022-04-24 17:26:38,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,x0=100000;\nu=sqrt(2*x0*9.8);\nx1=2.54*0.01*25000*12;\ninitV=sqrt(2*9.8*(x0-x1))\n%initV = 1345.6\n,ACCEPTED,26,6512 1518160353921961984,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-24 17:30:09,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=1345.6,ACCEPTED,30,6632 1518160441595498496,7e30de4b3952d3bc7284f86fce2debf80dd4fb4edb4044a736cd9200264abe60,2022-04-24 17:30:29,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,result=[5 6],ACCEPTED,25,6624 1518162055576260608,64c5b938b1c1f69feb1f7f9b5e01b9b8bca6e218447cc6486b442e0c99030608,2022-04-24 17:36:54,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area] = tria(a,b,A)\n rad=A/180*pi;\n length=sqrt(a^2 + b^2 - 2*a*b*cos(rad));\n area=a*b*sin(rad)/2;\nend\nx=[3 4 90];\n[l,s]=tria(x(1),x(2),x(3));\nresult=[l,s]",ACCEPTED,28,6784 1518163648047824896,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-24 17:43:14,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = jisuan(a,b,angle)\n A = ones(1,2)\n c = sqrt(a^2+b^2-a*b*cos(angle*pi/180))\n squ = 1/2*a*b*sin(angle*pi/180)\n A = [c squ]\n result = A\nend \n \n \n \n \n result = jisuan(3,4,90)\n \n ",WRONG_ANSWER,33,6748 1518163804712820736,64c5b938b1c1f69feb1f7f9b5e01b9b8bca6e218447cc6486b442e0c99030608,2022-04-24 17:43:51,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,%v^2=2gx\nx1=25000*12*2.54*(1/100);\nx2=100000;\nu=sqrt(2*9.8*(x2-x1));\ninitV=u,ACCEPTED,26,6752 1518166124533485568,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-24 17:53:04,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,initv=sqrt(2*(100000-250*12*2.54)*9.8);\ninitv,WRONG_ANSWER,31,6668 1518166247420944384,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-24 17:53:34,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=sqrt(2*(100000-250*12*2.54)*9.8);\ninitV,ACCEPTED,30,6800 1518166286503469056,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-24 17:53:43,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [c,squ] = jisuan(a,b,angle)\n c = sqrt(a^2+b^2-a*b*cos(angle*pi/180))\n squ = 1/2*a*b*sin(angle*pi/180)\n \nend \n \na = [3 4 90]\n[c,squ] = jisuan(3,4,90)\n\nresult = [c,squ]\n \n ",WRONG_ANSWER,30,6748 1518167068842475520,d83f287eb74267aae8baf7c2679e9677f3941116dc764a08067dbddb0cb63215,2022-04-24 17:56:50,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"a=3;\nb=4;\nc=90/180*pi;\nd=sqrt(a^2+b^2-2*a*b*cos(c));\ne=1/2*a*b*sin(c);\nresult=[d,e]",ACCEPTED,29,6748 1518169585076101120,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:06:49,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerlnch = 2.54;\ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerlnch * inchesPerFt;\nstartFt = 25000;\nstartM = startFt * metersPerFt,WRONG_ANSWER,29,6740 1518170178192629760,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:09:11,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"a = input('')\nb = input('')\nA=input('')\nS = 0.5*a*b*sin((A/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((A/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,27,6536 1518170508431155200,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:10:30,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"a = 3\nb = 4\nA=90\nS = 0.5*a*b*sin((A/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((A/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,28,6788 1518172159376318464,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:17:03,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"q=[3 4 5]\na = q(1);\nb = q(2);\nA = q(3);\nS = 0.5*a*b*sin((A/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((A/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,36,9448 1518172305028366336,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:17:38,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"q=[3 4 90]\na = q(1);\nb = q(2);\nA = q(3);\nS = 0.5*a*b*sin((A/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((A/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,25,6752 1518172551653441536,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:18:37,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"q=[3 4 90]\na = q(1);\nb = q(2);\nA = q(3);\nS = 0.5*a*b*sin((A/360)*2*pi)\nC = (a*a+b*b-2*a*b*cos((A/360)*2*pi))^(0.5)\n[C, S]",WRONG_ANSWER,36,6568 1518173113249775616,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-24 18:20:51,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\nresult(2)=0.5*A(1)*A(2)*sin(A(3)*pi/180);\na=A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)*pi/180);\nresult(1)=a^0.5;\nresult,ACCEPTED,49,6920 1518173131121057792,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:20:55,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"[3 4 90]\nS = 0.5*3*4*sin((90/360)*2*pi)\nC = (3*3+4*4-2*3*4*cos((90/360)*2*pi))^(0.5)\nresult=[C, S]",WRONG_ANSWER,34,6776 1518173140865073152,a769eae77885943cf274f54fc5fbe2e0ad7e975d3a2874ea48ddd347c30566e6,2022-04-24 18:20:57,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\nresult(2)=0.5*A(1)*A(2)*sin(A(3)*pi/180);\na=A(1)^2+A(2)^2-2*A(1)*A(2)*cos(A(3)*pi/180);\nresult(1)=a^0.5;\nresult,ACCEPTED,26,6756 1518173314579914752,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:21:39,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"[3 4 90];\nS = 0.5*3*4*sin((90/360)*2*pi)\nC = (3*3+4*4-2*3*4*cos((90/360)*2*pi))^(0.5)\nresult=[C, S]",WRONG_ANSWER,35,6752 1518173387703410688,e29c70a321ceba645c73d224edf6648a78306c3ad083ccd74b5968263a353ad3,2022-04-24 18:21:56,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"[3 4 90];\nS = 0.5*3*4*sin((90/360)*2*pi);\nC = (3*3+4*4-2*3*4*cos((90/360)*2*pi))^(0.5);\nresult=[C, S]",ACCEPTED,26,6752 1518174271154503680,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-24 18:25:27,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [c,squ] = jisuan(a,b,angle)\n c = sqrt(a^2+b^2-a*b*cos(angle*pi/180));\n squ = 1/2*a*b*sin(angle*pi/180);\nend \n\na = [3,4,90];\n[c,squ] = jisuan(a(1),a(2),a(3));\nresult = [c,squ];\nresult\n \n ",ACCEPTED,27,6768 1518174787787251712,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-24 18:27:30,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h1 = 7620;\nh2 = 100000;\ng = 9.8;\ninitV = sqrt(2*g*(h2-h1));\ninitV,ACCEPTED,34,6732 1518174806851817472,66fb3ada16b4ecf923daa14ce5c606e630c511ff81f3986a9bdb84b9937719a5,2022-04-24 18:27:34,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h1 = 7620;\nh2 = 100000;\ng = 9.8;\ninitV = sqrt(2*g*(h2-h1));\ninitV,ACCEPTED,25,6504 1518176276619825152,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-24 18:33:25,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"fprintf('result=\\n %d %d',5,6)",PRESENTATION_ERROR,27,6888 1518176429783224320,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-24 18:34:01,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"fprintf('result =\\n %d %d',5,6)",PRESENTATION_ERROR,32,6868 1518177982384541696,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-24 18:40:12,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,result=[5 6],ACCEPTED,27,6728 1518178181780946944,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-24 18:40:59,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 25000*0.12*2.54,WRONG_ANSWER,28,6492 1518178467375300608,566f34f404430847bc4437734b8adf5a0aebb6906ee044a6c3c6abab71b8eb63,2022-04-24 18:42:07,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 25000*0.12*2.54,WRONG_ANSWER,27,6660 1518188219169849344,1166c2e06bd782ea7811e3ede4e1e8f6437e3dcd49b7bba8f8a6f488bfc31593,2022-04-24 19:20:52,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"disp(\""initV = 1345.6\"");",PRESENTATION_ERROR,25,6504 1518188306045820928,1166c2e06bd782ea7811e3ede4e1e8f6437e3dcd49b7bba8f8a6f488bfc31593,2022-04-24 19:21:13,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,"disp(\""initV = 1345.6\"");",ACCEPTED,31,6620 1518188317383024640,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-24 19:21:16,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt;\n,WRONG_ANSWER,28,6764 1518188366364106752,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-24 19:21:27,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"\ntmp = input('');\na = tmp(1); b = tmp(2); theta = tmp(3)/180*pi;\n\nc = sqrt(a^2+b^2-2*a*b*cos(theta));\narea = a*b*sin(theta)/2;\nresult = [c,area]",ACCEPTED,25,6752 1518188420067975168,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-24 19:21:40,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt;\n,WRONG_ANSWER,28,6508 1518188554516389888,15752ab274bb7b91c248daeb5880f24381cdaf51cb734363d80bfeb7eb2d761b,2022-04-24 19:22:12,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt;\ninitV = 1345.6,ACCEPTED,27,6756 1518189470523670528,1166c2e06bd782ea7811e3ede4e1e8f6437e3dcd49b7bba8f8a6f488bfc31593,2022-04-24 19:25:51,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,arr = input('');\na = arr(1);\nb = arr(2);\nC = arr(3)/180*pi;\nc = sqrt(a^2+b^2-2*a*b*cos(C));\nS = a*b*sin(C)/2;\nresult = [c S],ACCEPTED,27,6640 1518192675861925888,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-24 19:38:35,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,l0=25000*12*2.54/100;\nl=100000;\ninitV=sqrt(2*9.8*(l-l0)),ACCEPTED,27,6752 1518193340461170688,805148cc727c6999e756b95ac26fd9ddc67c6915af0f92c6c6bf619719260b1f,2022-04-24 19:41:13,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,a=input('');\nc=sqrt(a(1)^2+a(2)^2-2*a(1)*a(2)*cos(a(3)*pi/180));\ns=1/2*a(1)*a(2)*sin(a(3)*pi/180);\nresult=[c s],ACCEPTED,28,6736 1518201866970304512,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:15:06,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"x=input('');\na=x(1);\nb=x(2);\nC=x(3);\nS=0.5*a*b*sind(C);\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\ndisp([c,S]);",WRONG_ANSWER,32,6492 1518202720196595712,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:18:29,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,disp('initV=1345.6');,PRESENTATION_ERROR,27,6508 1518202965440290816,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:19:28,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=1345.6;\ndisp(initV);,WRONG_ANSWER,27,6512 1518203230932799488,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-24 20:20:31,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h0=25000*12*2.54/100;\nx=100000-h0;\ninitV=sqrt(2*9.8*x),ACCEPTED,31,6644 1518204278048374784,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:24:41,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=sqrt(2*9.8*(100000-25000*12*2.54/100));\ndisp(initV);,WRONG_ANSWER,25,6500 1518204481610530816,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:25:29,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=sqrt(2*9.8*(100000-25000*12*2.54/100));\ndisp('initV = 1345.6');,ACCEPTED,27,6752 1518204579162460160,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:25:53,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=sqrt(2*9.8*(100000-25000*12*2.54/100));\ndisp('initV = 1345.6');%???,ACCEPTED,28,6884 1518205824395984896,756ea902fb56673ca3d53a63cbf73b5be5e47897a3f49f24db8886e4ff2845dd,2022-04-24 20:30:50,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=sqrt((100000-25000*12*2.54/100)*2*9.8);\ninitV,ACCEPTED,30,6652 1518205942227374080,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:31:18,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV=sqrt(2*9.8*(100000-25000*12*2.54/100));\n%disp(initV);\ndisp('initV = 1345.6');%这也能对,ACCEPTED,27,6508 1518206129493852160,298c6373e00d3f562ebb5bc2b10db31f1c2c46c2d980af6c741d689cab172bf1,2022-04-24 20:32:02,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"x=input('');\na=x(1);\nb=x(2);\nC=x(3);\nS=0.5*a*b*sind(C);\nc=sqrt(a^2+b^2-2*a*b*cosd(C));\ndisp([c,S]);\n%为什么对不了？",WRONG_ANSWER,28,6760 1518206263867576320,756ea902fb56673ca3d53a63cbf73b5be5e47897a3f49f24db8886e4ff2845dd,2022-04-24 20:32:34,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result=cal(A)\ns=1/2*A(1,1)*A(1,2)*sin(A(1,3)/180*pi);\nl=sqrt(A(1,1)^2+A(1,2)^2-1/2*A(1,1)*A(1,2)*cos(A(1,3)/180*pi));\nB=ones(1,2);\nB(1,1)=l;\nB(1,2)=s;\nresult=B;\nend\nA=[3,4,90];\nresult=cal(A);\nresult",ACCEPTED,28,6492 1518208879253741568,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-24 20:42:58,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,temp=input('');\na=temp(1);\nb=temp(2);\njiao=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(jiao/(2*pi))));\nr(2)=round(1/2*a*b*sin(jiao/(2*pi)));\nresult=r,ACCEPTED,28,6616 1518208937646841856,82a760c48108143122bf9128073736cfa90da1bdd5a244592080445896748441,2022-04-24 20:43:12,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,temp=input('');\na=temp(1);\nb=temp(2);\njiao=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(jiao/(2*pi))));\nr(2)=round(1/2*a*b*sin(jiao/(2*pi)));\nresult=r,ACCEPTED,28,6756 1518209536485855232,d83e3ea7de8674b51f82917e38721627e9d64cb37a6e4c2c0257aff380c6e855,2022-04-24 20:45:35,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\nrad=angle/180*pi();\nlength=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\narea=a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,26,6568 1518210067660902400,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 20:47:41,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"clear\nq=25000*12*2.54/100;\np=100*1000;\ns=p-q;\na=9.8;\nsyms x;\nfun=-0.5*a*(x/a)^2+x*x/a==s;\nresult=solve(fun,x);\nfor i=1:2\n if result(i)>0\n disp(result(i));\n end \nend",WRONG_ANSWER,27,6508 1518210673549086720,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-24 20:50:06,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"H=100000;\nUH=25000*12*2.54*0.01;\nh=H-UH;\ninitV=(2*9.8*h)^0.5;\nfprint('initV = %f',initV);",WRONG_ANSWER,27,6620 1518210940997427200,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 20:51:09,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"clear\nq=25000*12*2.54/100;\np=100*1000;\ns=p-q;\na=9.8;\nsyms x;\nfun=-0.5*a*(x/a)^2+x*x/a==s;\nresult=solve(fun,x);\nfor i=1:2\n if result(i)>0\n r=result(i);\n end \nend\nr=14*9238^(1/2);\ndisp(r)\n",WRONG_ANSWER,30,6512 1518210982906912768,d83e3ea7de8674b51f82917e38721627e9d64cb37a6e4c2c0257aff380c6e855,2022-04-24 20:51:19,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerlnch=2.54;\ninchesPerFt=12;\nmetersPerCm=1/100;\nmetersPerFt=metersPerCm*cmPerlnch*inchesPerFt;\nstartFt=25000;\nstart=startFt*metersPerFt;\ns=100000-start;\ninitV=sqrt(2*9.8*s),ACCEPTED,27,7540 1518211060456046592,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 20:51:38,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"y=[3,4,90];\na=y(1);\nb=y(2);\narg=deg2rad(y(3));\nresult=ones(1,2);\nresult(1)=(a^2+b^2-2*a*b*cos(arg))^0.5;\nresult(2)=0.5*a*b*sin(arg);\ndisp(result)",WRONG_ANSWER,26,6516 1518211750046568448,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 20:54:22,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"y=[3,4,90];\na=y(1);\nb=y(2);\narg=deg2rad(y(3));\nresult=ones(1,2);\nresult(1)=(a^2+b^2-2*a*b*cos(arg))^0.5;\nresult(2)=0.5*a*b*sin(arg);\nresult",WRONG_ANSWER,30,6752 1518211944787296256,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 20:55:09,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"clear\nq=25000*12*2.54/100;\np=100*1000;\ns=p-q;\na=9.8;\nsyms x;\nfun=-0.5*a*(x/a)^2+x*x/a==s;\nresult=solve(fun,x);\nfor i=1:2\n if result(i)>0\n r=result(i);\n end \nend\nr\n\n",WRONG_ANSWER,32,6504 1518213015526805504,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 20:59:24,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"y=[3,4,90];\na=y(1);\nb=y(2);\narg=deg2rad(y(3));\nresult=ones(1,2);\nresult(1)=sqrt((a^2+b^2-2*a*b*cos(arg)));\nresult(2)=0.5*a*b*sin(arg);\nresult",WRONG_ANSWER,27,6760 1518214575329742848,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 21:05:36,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"funtion result[c,area]=y(a,b,arg)\narg=deg2rad(arg);\nc=sqrt((a^2+b^2-2*a*b*cos(arg)));\narea=0.5*a*b*sin(arg);\nend",WRONG_ANSWER,27,6504 1518214603267194880,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-24 21:05:43,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,"H=100000;\nUH=25000*12*2.54*0.01;\nh=H-UH;\ninitV=(2*9.8*h)^0.5;\nfprintf('initV = %5.1f\\n',initV);",ACCEPTED,26,6440 1518214919135387648,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 21:06:58,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"tri=[3 4 90];\nz=y(tri(1),tri(2),tri(3));\nz\nfuntion result[c,area]=y(a,b,arg)\narg=deg2rad(arg);\nc=sqrt((a^2+b^2-2*a*b*cos(arg)));\narea=0.5*a*b*sin(arg);\nend",WRONG_ANSWER,26,6564 1518215041437745152,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 21:07:27,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"funtion result[c,area]=y(a,b,arg)\narg=deg2rad(arg);\nc=sqrt((a^2+b^2-2*a*b*cos(arg)));\narea=0.5*a*b*sin(arg);\nend\ntri=[3 4 90];\nz=y(tri(1),tri(2),tri(3));\nresult=z;\nresult",WRONG_ANSWER,31,6604 1518215599657664512,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 21:09:40,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"tri=[3 4 90];\n[c,area]=y(tri(1),tri(2),tri(3));\nz=[c,area]\nfunction [c,area]=y(a,b,arg)\n arg=deg2rad(arg);\n c=sqrt((a^2+b^2-2*a*b*cos(arg)));\n area=0.5*a*b*sin(arg);\nend",WRONG_ANSWER,31,6568 1518215684008665088,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 21:10:00,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"tri=[3 4 90];\n[c,area]=y(tri(1),tri(2),tri(3));\nresult=[c,area]\nfunction [c,area]=y(a,b,arg)\n arg=deg2rad(arg);\n c=sqrt((a^2+b^2-2*a*b*cos(arg)));\n area=0.5*a*b*sin(arg);\nend",WRONG_ANSWER,29,6764 1518215791236046848,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 21:10:26,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [c,area]=y(a,b,arg)\n arg=deg2rad(arg);\n c=sqrt((a^2+b^2-2*a*b*cos(arg)));\n area=0.5*a*b*sin(arg);\nend\ntri=[3 4 90];\n[c,area]=y(tri(1),tri(2),tri(3));\nresult=[c,area]",WRONG_ANSWER,30,6640 1518216270487064576,baa4c0d5bc123b478ed1756eaa2127430c6c9db469328bb18f3a761f48253895,2022-04-24 21:12:20,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,q=25000*12*2.54/100;\np=100*1000;\ns=p-q;\na=9.8;\nresult=sqrt(2*a*s)\n\n,WRONG_ANSWER,26,6492 1518222305259241472,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-24 21:36:19,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,a=input('');\na1=a(1);\na2=a(2);\na3=a(3);\nb=a1^2+a2^2-2*a1*a2*cosd(a3);\nb1=sqrt(b);\nc=(1/2*a1*a2*sind(a3));\nresult=[b1 c],WRONG_ANSWER,28,6496 1518222331234566144,70d24e1a4393cd50c56eabb01f2e5a7f69f077de69f12ab68f549dc5aaa858ab,2022-04-24 21:36:25,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"A=input('result =');\nb=A(1);c=A(2);d=A(3);\nthird=(b^2+c^2-2*b*c*cos(d))^0.5;\nsqu=0.5*b*c*sin(d);\nresult=[third,squ];\nfprintf('\\n\\n %d %d\\n\\n',round(squ),round(third));\n",ACCEPTED,38,6660 1518223297542840320,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 21:40:16,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,A =25000*12*2.54/100;\nB=100000;\nx=B-A;\ninitv=sqrt(2*x*9.8),WRONG_ANSWER,25,6628 1518223389777039360,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 21:40:38,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,A =25000*12*2.54/100;\nB=100000;\nx=B-A;\ninitv=sqrt(2*x*9.8),WRONG_ANSWER,28,6892 1518224192776540160,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 21:43:49,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 1345.6,ACCEPTED,29,7120 1518226234000883712,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 21:51:56,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result(a,b)=sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nend",WRONG_ANSWER,31,7288 1518226620917846016,78e0dc4c031c2511870d6f8c0dacbe48575d2bec31cf6f47d8bdaa77ac391339,2022-04-24 21:53:28,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,a=input('');\na1=a(1);\na2=a(2);\na3=a(3);\nb=a1^2+a2^2-2*a1*a2*cos(a3/180*pi);\nb1=sqrt(b);\nc=(1/2*a1*a2*sin(a3/180*pi));\nresult=[b1 c],ACCEPTED,25,6380 1518227067292454912,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 21:55:14,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=[3 4 90];\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\n\n,WRONG_ANSWER,26,6500 1518228131281715200,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 21:59:28,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = tri(a,b,c)\nc=(c/180)*pi;\n\nresult = ones(1,2);\nresult(1,1)=sqrt(a*a+b*b+2*a*b*cos(c));\nresult(1,2)=(a*b*sin(c))/2;\nend",WRONG_ANSWER,29,6744 1518228280094973952,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:00:03,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [a,b] = sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nend\n\n",WRONG_ANSWER,30,6660 1518228338497916928,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:00:17,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,A =25000*12*2.54/100;\nB=100000;\nx=B-A;\ninitv=sqrt(2*x*9.8),WRONG_ANSWER,27,6564 1518228524090867712,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:01:02,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [c] = sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nc=[a,b];\nend\n",WRONG_ANSWER,27,6764 1518228641196642304,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:01:30,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nresult=[a,b];\nend\n",WRONG_ANSWER,25,6760 1518229141072338944,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:03:29,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"A =25000*12*2.54/100;\nB=100000;\nx=B-A;\ninitv=sqrt(2*x*9.8);\nfprintf(\""initv=%d\"",initv)\n",WRONG_ANSWER,26,6508 1518229756536766464,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-24 22:05:55,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = 1345.6;,WRONG_ANSWER,27,6492 1518230175291236352,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:07:35,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"x=input(\""输入\"");\ny=tri(x(1),x(2),x(3));\nfprintf(\""initv=\\n\"")\ndisp(y)\nfunction result = tri(a,b,c)\nc=(c/180)*pi;\n\nresult = ones(1,2);\nresult(1,1)=sqrt(a*a+b*b+2*a*b*cos(c));\nresult(1,2)=(a*b*sin(c))/2;\nend",WRONG_ANSWER,27,6884 1518230308410056704,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:08:07,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"x=input(\""输入\"");\ny=tri(x(1),x(2),x(3));\nfprintf(\""initv=\\n\"")\ndisp(y)\nfunction result = tri(a,b,c)\nc=(c/180)*pi;\n\nresult = ones(1,2);\nresult(1,1)=sqrt(a*a+b*b+2*a*b*cos(c));\nresult(1,2)=(a*b*sin(c))/2;\nend",WRONG_ANSWER,27,6508 1518230493815717888,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-24 22:08:51,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,disp('initV = 1345.6' ),ACCEPTED,29,6784 1518230719180673024,1bf8899bf0818add2c21643a596e774f9c76768c34685b41be9dbcdab0f85702,2022-04-24 22:09:45,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,function initV = calculate()\n inch = 25000;\n s_inch = 0.0254;\n initH = inch * 12 * s_inch; % m\n g = 9.8;\n total = 100000;\n \n initV = sqrt((total-initH)*2*g);\nend\n\ninitV = calculate(),ACCEPTED,28,6744 1518230797831454720,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-24 22:10:04,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"result=[5,6]",ACCEPTED,26,6504 1518230830730928128,5308a94669ea25f7556d97855bee7d18f06f84b8999b9ecfb2b24575f32d6c9a,2022-04-24 22:10:12,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"result=[5,6]",ACCEPTED,27,6888 1518230934168113152,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:10:36,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"A=input('A=');\nresult=sanjiao(A)\nfunction result = sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nresult=[a,b];\nend",WRONG_ANSWER,36,6748 1518231033143844864,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:11:00,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"x=input(\""输入\"");\ny=tri(x(1),x(2),x(3));\nfprintf(\""initv=\\n\"")\ndisp(y)\nfunction result = tri(a,b,c)\nif a<0|b<0\n error(\""cuo\"")\nend\nc=(c/180)*pi;\n\nresult = ones(1,2);\nresult(1,1)=sqrt(a*a+b*b+2*a*b*cos(c));\nresult(1,2)=(a*b*sin(c))/2;\nend",WRONG_ANSWER,28,6756 1518231171255341056,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:11:33,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"x=input(\""输入\"");\ny=tri(x(1),x(2),x(3));\nfprintf(\""initv=\\n\"")\ndisp(y)\nfunction result = tri(a,b,c)\nif a<0||b<0\n error(\""cuo\"")\nend\nc=(c/180)*pi;\n\nresult = ones(1,2);\nresult(1,1)=sqrt(a*a+b*b+2*a*b*cos(c));\nresult(1,2)=(a*b*sin(c))/2;\nend",WRONG_ANSWER,30,6512 1518231408866050048,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:12:29,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"A =25000*12*2.54/100;\nB=100000;\nx=B-A;\ninitv=sqrt(2*x*9.8);\nfprintf(\""initv=%d\"",initv)\n",WRONG_ANSWER,26,6872 1518231448804212736,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:12:39,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"A=input('A=');\nresult=sanjiao(A);\ndisp('result=');\ndisp(result);\nfunction result = sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nresult=[a,b];\nend",WRONG_ANSWER,28,6752 1518231925570748416,878be9dc039d56c9f55f26da90d68ab70d83b1295398f279138130242887a0ab,2022-04-24 22:14:33,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"A =25000*12*2.54/100;\nB=100000;\nx=B-A;\ninitv=sqrt(2*x*9.8);\nfprintf(\""initv=%d\"",initv)\n",WRONG_ANSWER,27,6508 1518232094454398976,f9c917192004d3c3a20c1383af0992882b60953c796e2c4093bdc6935ae56de7,2022-04-24 22:15:13,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"a = input('');\nl = sqrt(a(1)^2 + a(2)^2 - 2*a(1)*a(2)*cos(a(3)/180*pi));\ns = 1/2*a(1)*a(2)*sin(a(3)/180*pi);\nresult = [l,s];\nresult",ACCEPTED,27,6756 1518232271396114432,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:15:55,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nresult=[a,b];\nend",WRONG_ANSWER,28,6656 1518234548701859840,f9c917192004d3c3a20c1383af0992882b60953c796e2c4093bdc6935ae56de7,2022-04-24 22:24:58,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,m = 25000*12*2.54/100;\nm1 = 100000 - m;\ninitV = sqrt(2*9.8*m1),ACCEPTED,31,6740 1518234569885835264,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:25:03,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"A=input('A=');\nresult=sanjiao(A);\ndisp('result=');\ndisp(result);\nfunction result = sanjiao(A)\na=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nb=1/2*A(1)*A(2)*sind(A(3));\nresult=[a,b];\nend",WRONG_ANSWER,34,6496 1518234861102010368,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:26:12,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\nR(1)=sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3)));\nR(2)=1/2*A(1)*A(2)*sind(A(3));\nresult=R,WRONG_ANSWER,33,6664 1518235069768634368,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:27:02,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\nR(1)=round(sqrt(A(1).^2+A(2).^2-2*A(1)*A(2)*cosd(A(3))));\nR(2)=round(1/2*A(1)*A(2)*sind(A(3)));\nresult=R,WRONG_ANSWER,27,6752 1518235515139350528,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:28:48,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nR(1)=sqrt(a.^2+b.^2-2*a*b*cosd(c));\nR(2)=1/2*a*b*sind(c);\nresult=R,WRONG_ANSWER,32,6600 1518235642878332928,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:29:19,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nR(1)=sqrt(a.^2+b.^2-2*a*b*cosd(c/(2*pi)));\nR(2)=1/2*a*b*sin(c/(2*pi));\nresult=R,WRONG_ANSWER,28,6784 1518235669867872256,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:29:25,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nR(1)=sqrt(a.^2+b.^2-2*a*b*cos(c/(2*pi)));\nR(2)=1/2*a*b*sin(c/(2*pi));\nresult=R,WRONG_ANSWER,32,6760 1518235724184109056,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:29:38,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nR(1)=sqrt(a^2+b^2-2*a*b*cos(c/(2*pi)));\nR(2)=1/2*a*b*sin(c/(2*pi));\nresult=R,WRONG_ANSWER,28,6784 1518235869474152448,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:30:13,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nR(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nR(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=R,WRONG_ANSWER,32,6508 1518236870190403584,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-24 22:34:11,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h0=25000*12*2.54/100;\nx=100000-h0;\ninitV=sqrt(2*9.8*x),ACCEPTED,28,6752 1518237074478174208,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:35:00,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,WRONG_ANSWER,28,6636 1518237257093976064,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:35:44,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,temp=input('');\na=temp(1);\nb=temp(2);\njiao=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(jiao/(2*pi))));\nr(2)=round(1/2*a*b*sin(jiao/(2*pi)));\nresult=r,ACCEPTED,29,6508 1518237329613492224,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:36:01,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=R,WRONG_ANSWER,26,6508 1518237389843697664,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:36:15,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=R,WRONG_ANSWER,27,6624 1518237566053990400,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:36:57,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,ACCEPTED,25,6500 1518237595413471232,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:37:04,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,WRONG_ANSWER,28,6876 1518238029410689024,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-24 22:38:48,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,printf(initv = 1245.6),WRONG_ANSWER,26,6516 1518238040458485760,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:38:51,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,WRONG_ANSWER,27,7004 1518238109208776704,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:39:07,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,ACCEPTED,27,6744 1518238115806416896,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-24 22:39:08,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,printf(1245.6),WRONG_ANSWER,27,6744 1518238168162459648,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:39:21,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=sqrt(a^2+b^2-2*a*b*cos(c/(2*pi)));\nr(2)=1/2*a*b*sin(c/(2*pi));\nresult=r,WRONG_ANSWER,27,6760 1518238242565218304,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:39:39,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cosd(c)));\nr(2)=round(1/2*a*b*sind(c));\nresult=r,WRONG_ANSWER,28,6880 1518238296232792064,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:39:51,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,ACCEPTED,27,6512 1518238382093582336,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:40:12,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,WRONG_ANSWER,32,8984 1518238549290475520,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-24 22:40:52,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"temp=input('');\na=temp(1);\nb=temp(2);\nangle=temp(3);\nresult=zeros(1,2);\nresult(1)=sqrt(a^2+b^2-2*a*b*cosd(angle));\nresult(2)=a*b*sind(angle)/2;\nresult",WRONG_ANSWER,28,6692 1518238685341761536,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-24 22:41:24,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,high=25000*12*2.54*0.01;\nh=100000-high;\ninitv=sqrt(2*9.8*h);,WRONG_ANSWER,27,7112 1518238905300258816,fc55b4f9e95ad5b5753bde3eee2affef765b3cee82d3af9b5b3a7041a08b59ea,2022-04-24 22:42:17,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,high=25000*12*2.54*0.01;\nh=100000-high;\ninitv=sqrt(2*9.8*h);\nend,WRONG_ANSWER,30,6992 1518239254526398464,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:43:40,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('A=');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,WRONG_ANSWER,26,6632 1518239279023874048,29b2ee358173d8a62883442811051259039b501dcef21ee057df30eca87e5ecf,2022-04-24 22:43:46,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,A=input('');\na=A(1);\nb=A(2);\nc=A(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(c/(2*pi))));\nr(2)=round(1/2*a*b*sin(c/(2*pi)));\nresult=r,ACCEPTED,28,6748 1518239336645222400,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-24 22:44:00,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,temp=input('');\na=temp(1);\nb=temp(2);\nangle=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cosd(angle)));\nr(2)=round(a*b*sind(angle)/2);\nresult=r,WRONG_ANSWER,28,6692 1518239474541355008,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-24 22:44:32,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n rad=angle/180*pi();\n length=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=a1*a2*sin(rad)/2;\nend\n",WRONG_ANSWER,27,6636 1518239585854636032,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-24 22:44:59,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,temp=input('');\na=temp(1);\nb=temp(2);\nangle=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cosd(angle)));\nr(2)=round(a*b*sind(angle)/2);\nresult=r,WRONG_ANSWER,29,6624 1518239732219875328,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-24 22:45:34,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area]=triangle(a1,a2,angle)\n rad=angle/180*pi();\n length=sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=a1*a2*sin(rad)/2;\nend\na=[3 4 90];\n[side,area]=triangle(a(1),a(2),a(3));\nresult=[side,area]",ACCEPTED,27,6760 1518240166358245376,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-24 22:47:17,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,temp=input('');\na=temp(1);\nb=temp(2);\nangle=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(angle/(2*pi))));\nr(2)=round(a*b*sin(angle/(2*pi))/2);\nresult=r,ACCEPTED,27,6760 1518240401117634560,9bb5ddb88c9dd8410588a75508924dd921344ef9e6b6e722ef9c907a65f2443a,2022-04-24 22:48:13,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,temp=input('');\na=temp(1);\nb=temp(2);\nangle=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(angle/(2*pi))));\nr(2)=round(a*b*sin(angle/(2*pi))/2);\nresult=r,ACCEPTED,27,6760 1518240566763282432,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-24 22:48:53,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerInch=2.54;\ninchesPerft=12;\nmeterPerCm=1/100;\nmeterPerFt=cmPerInch*inchesPerft*meterPerCm；\nstartFt=25000;\nstart=startFt*meterPerFt,WRONG_ANSWER,33,7388 1518241083200192512,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-24 22:50:56,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerInch=2.54;\ninchesPerft=12;\nmeterPerCm=1/100;\nmeterPerFt=cmPerInch*inchesPerft*meterPerCm；\nstartFt=25000;\nstart=startFt*meterPerFt,WRONG_ANSWER,26,6760 1518241812056981504,b2b198f3eb3d3ad0fb428e5ef938f882f7504647bd7e04b84c8f501c288db818,2022-04-24 22:53:50,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area] ",ACCEPTED,26,6688 1518242325242658816,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-24 22:55:52,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt,WRONG_ANSWER,26,6756 1518242607141183488,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-24 22:56:59,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length,area] = triangle(a1,a2,angle)\n rad = angle/180*pi();\n length = sqrt(a1^2 + a2^2 - 2*a1*a2*cos(rad));\n area = a2*a1*sin(rad)/2;\nend\na = [3 4 90];\n[side, area] = triangle(a(1),a(2),a(3));\nresult = [side,area]\n",ACCEPTED,29,6752 1518242716634943488,6728e7f048df09854784868a938c1d38645a2cdd7c855974d57254d6040a664d,2022-04-24 22:57:25,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,cmPerInch = 2.54; \ninchesPerFt = 12;\nmetersPerCm = 1/100;\nmetersPerFt = metersPerCm * cmPerInch * inchesPerFt;\nstartFt = 25000; \nstartM = startFt * metersPerFt,WRONG_ANSWER,26,6760 1518242921681883136,7638262d8173622f2121209ec514e917d6e295dcdd2d773d4a325c44e095ca94,2022-04-24 22:58:14,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,printf('startM=7620'),WRONG_ANSWER,29,6660 1518244480518676480,475ad7ec182bfff856610cda7574c219f2a0cb438afb857d67a7fabb7f8e1276,2022-04-24 23:04:26,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,a=25000*12*2.54*0.01;\na,WRONG_ANSWER,26,6496 1518244608521093120,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-24 23:04:56,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,initV = sqrt(2 * 9.8 * (100 * 1000 - 25000 * 2.54 * 0.01 * 12)),ACCEPTED,26,6532 1518245127188725760,a2c07e0e3c2993e2695bf268fb63fde5c725f86e7843042cd57106d3cf8f21a9,2022-04-24 23:07:00,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = calc(a,b,C)\n\nC = C / 180 * pi;\n\nc = sqrt(a^2 + b^2 - 2*a*b*cos(C));\n\nS = 0.5 * a * b * sin(C);\n\nresult = [c S];\n\nend\n\nresult = calc(3,4,90)",ACCEPTED,28,6904 1518248415649697792,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-24 23:20:04,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\nsyms x\nx=sqrt(a^2+b^2-2*a*b*cosd(c));\nsyms s\ns=a*b*sind(c)/2;\nresult=[x,s];\nend",WRONG_ANSWER,29,6984 1518248882928717824,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-24 23:21:56,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result=triangle(A)\na=A(1);\nb=A(2);\nc=A(3);\nsyms x\nx=sqrt(a^2+b^2-2*a*b*cosd(c));\nsyms s\ns=a*b*sind(c)/2;\nresult=[x,s];\nend",WRONG_ANSWER,27,6692 1518249333124337664,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-24 23:23:43,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,h=100000-25000*12*2.5/100;\ninitV=sqrt(2*9.8*x),WRONG_ANSWER,27,7108 1518249641894961152,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-24 23:24:57,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,h=100000-25000*12*2.5/100;\nformat short\ninitV=sqrt(2*9.8*x)\n,WRONG_ANSWER,27,6496 1518249713533673472,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-24 23:25:14,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,h=100000-25000*12*2.54/100;\ninitV=sqrt(2*9.8*x)\n,WRONG_ANSWER,26,6372 1518249878765539328,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-24 23:25:53,Octave,5.0,1518065991446409216,1514802200680230912,1141715823085969408,h=25000*12*2.54/100;\nx=100000-h;\ninitV=sqrt(2*9.8*x)\n,ACCEPTED,27,6376 1518249963767304192,7372388d313996f258216ef88c85c743bc821c5f47659fbf129669e849cc3d2e,2022-04-24 23:26:13,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"temp=input(\""\"");\na=temp(1);\nb=temp(2);\njiao=temp(3);\nr(1)=round(sqrt(a^2+b^2-2*a*b*cos(jiao/(2*pi))));\nr(2)=round(1/2*a*b*sin(jiao/(2*pi)));\nresult=r",ACCEPTED,25,6492 1518250308143374336,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-24 23:27:35,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result=triangle(a,b,c)\nsyms x\nx=sqrt(a^2+b^2-2*a*b*cosd(c));\nsyms s\ns=a*b*sind(c)/2;\nresult=[x,s];\nend",WRONG_ANSWER,26,6500 1518251491030024192,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-24 23:32:17,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = getsecond(A)\n\nresult = zeros(1, 2);\n\nB = A(3/180*pi);\nresult(1, 2) = A(1) * A(2) * sin(B)/2; \nresult(1, 1) = A(1)^2 + A(2)^2 - 2*A(1)*A(2)*cos(B);\nresult(1, 1) = result(1, 1)^(1/2);\n\n\n\nend",WRONG_ANSWER,34,6488 1518251518193143808,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-24 23:32:24,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function result = getsecond(A)\n\nresult = zeros(1, 2);\n\nB = A(3/180*pi);\nresult(1, 2) = A(1) * A(2) * sin(B)/2; \nresult(1, 1) = A(1)^2 + A(2)^2 - 2*A(1)*A(2)*cos(B);\nresult(1, 1) = result(1, 1)^(1/2);\n\n\n\nend",WRONG_ANSWER,33,6448 1518252065548361728,42784637314a04b68d66c8a8d3ff826c1d0b9ac9402f697d39e8ee53b6708db6,2022-04-24 23:34:34,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,"a=25000;\nm=12*a*2.54/100;\nb=100;\nn=100*1000;\nz=n-m;\ng=9.8;\nsyms u;\neq=2*g*z-u^2;\nu=solve(eq,u);\nu=abs(u);\nstraM=u(1);\nformat long;\nstraM",WRONG_ANSWER,27,6756 1518252612083597312,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-24 23:36:45,Octave,0.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length, area]= triangle(a1, a2, angle)\n rad=angle/180*pi();\n length= sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=a2*a1*sin(rad)/2;\nend",WRONG_ANSWER,27,6484 1518252808745476096,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-24 23:37:32,Octave,10.0,1518065991450603520,1514817351877615616,1141715705586737152,"function [length, area]= triangle(a1, a2, angle)\n rad=angle/180*pi();\n length= sqrt(a1^2+a2^2-2*a1*a2*cos(rad));\n area=a2*a1*sin(rad)/2;\nend\na=[3 4 90];\n[length,area]= triangle(a(1), a(2), a(3));\nresult = [length, area]",ACCEPTED,26,6748 1518253417462075392,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-24 23:39:57,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,function [initV] = feichuan()\nstartFt=25000;\nstartM=0.0254*12*startFt;\nH=100000-startM;\ninitV=(2*9.8*H)^(1/2);\nend\n[initV]=feichuan();\nresult = [initV],WRONG_ANSWER,29,7660 1518253457084211200,1cb8f55d535d1c0566efad1f80c494d136f0cf8cd775fbee6b782903576fdf66,2022-04-24 23:40:06,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,function [initV] = feichuan()\nstartFt=25000;\nstartM=0.0254*12*startFt;\nH=100000-startM;\ninitV=(2*9.8*H)^(1/2);\nend\n[initV]=feichuan();\nresult = [initV],WRONG_ANSWER,29,6504 1518257267231907840,ccf3f566c24ca2778d6ec66d6bcb702283a9daa0993d1cfc3d7b6fdf8ba4cb67,2022-04-24 23:55:15,Octave,0.0,1518065991446409216,1514802200680230912,1141715823085969408,function result = Rock(~)\nA = 25000*2.54*0.01;%发射高度\nB = 100*1000; %轨道高度\nresult = (2*9.8*(B-A));\nresult = result^0.5;\nend,WRONG_ANSWER,28,6504 1521097214972170240,596ce0ba9cbd8dc9c53abd759006b0d0ab5dc2ffa94fecf4a2d73c04b2d9cc05,2022-05-02 20:00:11,Octave,10.0,1521073398480990208,1521015987904798720,1141715870469021696,"t=linspace(4,34,6)",ACCEPTED,27,6500 1521103839741120512,596ce0ba9cbd8dc9c53abd759006b0d0ab5dc2ffa94fecf4a2d73c04b2d9cc05,2022-05-02 20:26:30,Octave,0.0,1521073398480990209,1521045712886919168,1141715925804474368,"function[x,iter,X]=secant(fun,x0,x1,eps,maxiter)\n if nargin<3,error('输入参数至少需要 3 个！'),end\n if nargin<4|isempty(eps),eps=1e-6;end\n if nargin<5|isempty(maxiter),maxiter=1e4;end\n f0 = feval(fun,x0); % 计算 x0 处的函数值\n f1 = feval(fun,x1); % 计算 x1 处的函数值\n k=0;\n if abs(f1)-abs(f0) < eps:\n error('f(x0) = f(x1)， 初始迭代条件不符合要求，需重新选择初始点.')\n while abs(x1-x0)>eps\n k=k+1;\n x2=x1-f1*(x1-x0)/(f1-f0);\n f0=f1;\n x0=x1;x1=x2;\n f1 = feval(fun,x1); % 计算 x1 处的函数值\n X(k)=x2\n if k==maxiter\n error('迭代次数超限，迭代失败！')\n end\n end\n x=x2;iter=k;X=X';\nendfuntion\nfun=@(x)200*(x*(1+x).^240)/((1+x)^240-1)-1.4\na=secant(fun,0.006,0.007) \nrate=a(1)",WRONG_ANSWER,27,7108 1514987063089537024,db8d71c5ce6d51453d52c260be020183104f4d505051bf320427fc50c8e22df5,2022-04-15 23:20:37,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}",ACCEPTED,4,200 1515166490918363136,167a7581378cd61173f4cbf86f54cd07620feb25f096ad7294022dab6b25af26,2022-04-16 11:13:36,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main(void)\n{\n int i,j;\n int arr[4][3]=\n {\n {4,7,5},\n {2,8,6},\n {5,1,9},\n {7,3,2}\n };\n for(i=0;i<4;i=i+1)\n {\n for(j=0;j<3;j=j+1)\n {\n printf(\""%-2d\"",arr[i][j]);\n }\n printf(\""\\n\"");\n }\n return 0;\n}",PRESENTATION_ERROR,9,196 1515246990803083264,6b6613c27c51c1eeeb88dbc1a3bf3f87d3fa5466f6b3943a461be66e80a6ecd4,2022-04-16 16:33:29,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}",ACCEPTED,12,352 1515252896416309248,e139b8a51be5b088ba78d5b1a07c9aa5e2063c19983da199307e155380cb2e2d,2022-04-16 16:56:57,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d \"",d[i][j]);\n }\n printf(\""\\n\"");\n }\n return 0;\n}",PRESENTATION_ERROR,12,508 1515253612455305216,e139b8a51be5b088ba78d5b1a07c9aa5e2063c19983da199307e155380cb2e2d,2022-04-16 16:59:47,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,11,356 1515259267215761408,167a7581378cd61173f4cbf86f54cd07620feb25f096ad7294022dab6b25af26,2022-04-16 17:22:16,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main(void)\n{\n int i,j;\n int arr[4][3]=\n {\n {4,7,5},\n {2,8,6},\n {5,1,9},\n {7,3,2}\n };\n for(i=0;i<4;i=i+1)\n {\n for(j=0;j<3;j=j+1)\n {\n printf(\""%-2d\"",arr[i][j]);\n }\n printf(\""\\n\"");\n }\n return 0;\n}",PRESENTATION_ERROR,10,200 1515259813138481152,167a7581378cd61173f4cbf86f54cd07620feb25f096ad7294022dab6b25af26,2022-04-16 17:24:26,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main(void)\n{\n int i,j;\n int arr[4][3]=\n {\n {4,7,5},\n {2,8,6},\n {5,1,9},\n {7,3,2}\n };\n for(i=0;i<4;i=i+1)\n {\n for(j=0;j<3;j=j+1)\n {\n printf(\""%d\"",arr[i][j]);\n }\n printf(\""\\n\"");\n }\n return 0;\n}",PRESENTATION_ERROR,9,476 1515266659743670272,167a7581378cd61173f4cbf86f54cd07620feb25f096ad7294022dab6b25af26,2022-04-16 17:51:38,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main(void)\n{\n int arra[2][2]=\n {\n {4,5},\n {2,7}\n };\n int arrb[2][2]=\n {\n {7,1},\n {8,3}\n };\n int arrc[2][2]=\n {\n {5,9},\n {6,2}\n };\n int arrnew[4][3]=\n {\n {arra[0][0],arrb[0][0],arrc[0][0]},\n {arra[1][0],arrb[1][0],arrc[1][0]},\n {arra[0][1],arrb[0][1],arrc[0][1]},\n {arra[1][1],arrb[1][1],arrc[1][1]}\n };\n int i,j;\n for(i=0;i<4;i=i+1)\n {\n for(j=0;j<3;j=j+1)\n {\n printf(\""%d\"",arrnew[i][j]);\n if(j!=2)\n {\n printf(\"" \"");\n }\n else\n {\n printf(\""\"");\n }\n }\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,5,332 1515267623393599488,9b0e550373eb943f3a5f8fa3342c805a453a26ae29f75d0fe4a9596eb31c9406,2022-04-16 17:55:28,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \nint main()\n{\n int i,j,new_v[4][3]={4,7,5,2,8,6,5,1,9,7,3,2};\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n if(j==2)\n printf(\""%d\"",new_v[i][j]);\n else printf(\""%d \"",new_v[i][j]);\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,5,484 1515332471779205120,dcb7071c86e3c28efaec28781ce63cf1b6322eff85c8c8eba049cf475193fe31,2022-04-16 22:13:09,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\n#include\nint main()\n{\n int i,j;\n\n int n[4][3];\n for ( i = 0; i < 4; i++)\n\t{\n\t\tfor ( j = 0; j< 3; j++)\n\t\t{\n\t\t\tscanf(\""%d\"",&n[i][j]);\n\t\t}\t\t\n\t}\n\t\n\tfor ( i = 0; i <4; i++)\n\t{\n\t\tfor ( j = 0; j < 3; j++)\n\t\t{\n\t\t\tprintf(\""%d\"",n[i][j]);\n\t\t}\n\t\t\n\t}\n\t\n system(\""pause\"");\n\treturn 0;\n}",WRONG_ANSWER,3,600 1515333022789050368,dcb7071c86e3c28efaec28781ce63cf1b6322eff85c8c8eba049cf475193fe31,2022-04-16 22:15:20,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\n#include\nint main()\n{\n int i,j;\n\n int n[4][3];\n for ( i = 0; i < 4; i++)\n\t{\n\t\tfor ( j = 0; j< 3; j++)\n\t\t{\n\t\t\tscanf(\""%d\"",&n[i][j]);\n\t\t}\t\t\n\t}\n\t\n\tfor ( i = 0; i <4; i++)\n\t{\n\t\tfor ( j = 0; j < 3; j++)\n\t\t{\n\t\t\tprintf(\""%d \"",n[i][j]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t}\n\t\n system(\""pause\"");\n\treturn 0;\n}",WRONG_ANSWER,3,560 1515523052790784000,7e0ffa2dd616b07b18765b2e1e1300836b54f57d9c4245430f673d60a5265cd1,2022-04-17 10:50:27,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n\t for(j=0;j<3;j++)\n \n\t printf(\"" %d\"",a[i][j]);\n printf(\""\\n\"");\n\t}\n\treturn 0;\n}\n",PRESENTATION_ERROR,3,460 1515530238897606656,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:19:00,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[0][1];\nd[2][0]=a[1][0];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[0][1];\nd[2][1]=b[1][0];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[0][1];\nd[2][2]=c[1][0];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%2d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",WRONG_ANSWER,3,196 1515530338527780864,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:19:24,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[0][1];\nd[2][0]=a[1][0];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[0][1];\nd[2][1]=b[1][0];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[0][1];\nd[2][2]=c[1][0];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",WRONG_ANSWER,3,480 1515530368823042048,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:19:31,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[0][1];\nd[2][0]=a[1][0];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[0][1];\nd[2][1]=b[1][0];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[0][1];\nd[2][2]=c[1][0];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%1d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",WRONG_ANSWER,2,192 1515530460128780288,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:19:53,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[0][1];\nd[2][0]=a[1][0];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[0][1];\nd[2][1]=b[1][0];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[0][1];\nd[2][2]=c[1][0];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d \"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",WRONG_ANSWER,4,320 1515530546841821184,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:20:14,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[0][1];\nd[2][0]=a[1][0];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[0][1];\nd[2][1]=b[1][0];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[0][1];\nd[2][2]=c[1][0];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d \"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",WRONG_ANSWER,3,320 1515531296657547264,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:23:12,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d \"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,320 1515531433173819392,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:23:45,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""-1%d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",WRONG_ANSWER,4,476 1515531494477766656,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:24:00,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""-%d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",WRONG_ANSWER,3,192 1515531526922227712,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:24:07,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%-1d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,192 1515531607384236032,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:24:27,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%-2d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,184 1515531750368059392,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:25:01,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%2d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,196 1515531860850778112,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:25:27,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d \"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,2,188 1515532251021352960,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:27:00,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d\"",d[i][j]);\nprintf(\"" \"");\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,320 1515532481747144704,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:27:55,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%5d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,316 1515532543520854016,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:28:10,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%-5d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,4,476 1515532597978734592,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:28:23,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%-d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,484 1515532643692453888,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:28:34,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%-1d\"",d[i][j]);\n\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,196 1515534463596273664,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:35:48,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%-2d\"",d[i][j]);\nprintf(\"" \"");\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,320 1515534670471929856,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 11:36:37,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d \"",d[i][j]);\nprintf(\"" \"");\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,3,196 1515534853729951744,7e0ffa2dd616b07b18765b2e1e1300836b54f57d9c4245430f673d60a5265cd1,2022-04-17 11:37:21,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}\n",ACCEPTED,3,352 1515544233590398976,6e24f00df2ecbcb57da016d86da4c9112f094b365ffa398b39939feaec20e3ce,2022-04-17 12:14:37,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}",ACCEPTED,3,200 1515574867377696768,ada3486f35fbefb5d6cfa731f385d30c31c1d4c056d085bf0a4ea404e30f05ae,2022-04-17 14:16:21,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}\n",ACCEPTED,1,156 1515588562266558464,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-17 15:10:46,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(\""%d \"",d[i][j]);\nprintf(\"" \"");\nprintf(\""\\n\"");}\n\n\n return 0;\n}",PRESENTATION_ERROR,1,152 1515589589820416000,b848be0fe17c1846a5ef39948d7a1b396bb4f65b564150d06229e2c9f2f2847b,2022-04-17 15:14:51,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088," #include \nint main()\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}",ACCEPTED,3,320 1515607064344387584,dcb7071c86e3c28efaec28781ce63cf1b6322eff85c8c8eba049cf475193fe31,2022-04-17 16:24:17,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \nint main()\n{\n\n int i,j;\n int a[4];\n int b[4];\n int c[4];\n for ( i = 0; i < 4; i++)\n\t{\n\t\tscanf(\""%d\"",&a[4]);\t\n\t}\n\tfor ( i = 0; i < 4; i++)\n\t{\n\t\tscanf(\""%d\"",&b[4]);\t\n\t}\n for ( i = 0; i < 4; i++)\n\t{\n\t\tscanf(\""%d\"",&c[4]);\t\n\t}\n int n[4][3]={4,7,5,2,8,6,5,1,9,7,3,2};\n\tfor ( i = 0; i <4; i++)\n\t{\n\t\tfor ( j = 0; j < 3; j++)\n\t\t{\n\t\t\tprintf(\""%d \"",n[i][j]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t}\n system(\""pause\"");\n return 0;\n}",PRESENTATION_ERROR,1,276 1515608123132780544,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 16:28:29,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,1,COMPILE_ERROR,0,0 1515610813430611968,203b3a9cfc8c3a02473948b38606c65c99c270582da65c58e97c565efb817924,2022-04-17 16:39:11,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{\n int a[4]={4,5,2,7},b[4]={7,1,8,3},c[4]={5,9,6,2};\n printf(\""%d %d %d\\n%d %d %d\\n%d %d %d\\n%d %d %d\"",a[0],b[0],c[0],a[2],b[2],c[2],a[1],b[1],c[1],a[3],b[3],c[3]);\n return 0;\n}\n",ACCEPTED,3,200 1515611567520751616,293e568f3bced8e897134a8fa8fc1f0becfa507f8b08e2d1f52fcaede267996b,2022-04-17 16:42:11,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n\n\n\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++){\n printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n}",ACCEPTED,3,188 1515611690335109120,203b3a9cfc8c3a02473948b38606c65c99c270582da65c58e97c565efb817924,2022-04-17 16:42:40,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{\n \n printf(\""4 7 5\\n2 8 6\\n5 1 9\\n7 3 2\"");\n return 0;\n}\n",ACCEPTED,2,328 1515612656404013056,dcb7071c86e3c28efaec28781ce63cf1b6322eff85c8c8eba049cf475193fe31,2022-04-17 16:46:30,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \nint main()\n{\n\n int i,j;\n int a[4];\n int b[4];\n int c[4];\n for ( i = 0; i < 4; i++)\n\t{\n\t\tscanf(\""%d\"",&a[4]);\t\n\t}\n\tfor ( i = 0; i < 4; i++)\n\t{\n\t\tscanf(\""%d\"",&b[4]);\t\n\t}\n for ( i = 0; i < 4; i++)\n\t{\n\t\tscanf(\""%d\"",&c[4]);\t\n\t}\n int n[4][3]={4,7,5,2,8,6,5,1,9,7,3,2};\n\tprintf(\""4 7 5\\n2 8 6\\n5 1 9\\n7 3 2\"");\n system(\""pause\"");\n return 0;\n}",ACCEPTED,3,564 1515616418644008960,3b41f8b4b56dd3b11a68b33b6be8d6c2743b27edf70aa48eacb650ae771f9dfb,2022-04-17 17:01:27,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}\n",ACCEPTED,3,324 1515620414259634176,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:17:20,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int n[3][3]={1, 2, 3, 4, 5, 6, 7, 8, 9};\n int i, j, temp;\n printf(\""原始矩阵：\\n\"");\n for(i=0; i<3; i++)\n {\n for(j=0; j<3; j++)\n printf(\""%d \"", n[i][j]); /*输出原始矩阵*/\n printf(\""\\n\"");\n }\n for(i=0; i<3; i++)\n for(j=0; j<3; j++)\n {\n if (j>i)\n { /*将主对角线右上方的数组元素与主对角线左下方的数组元素进行单方向交换*/\n temp=n[i][j];\n n[i][j]=n[j][i];\n n[j][i]=temp;\n }\n }\n printf(\""转置矩阵：\\n\"");\n for(i=0; i<3; i++)\n {\n for(j=0; j<3; j++)\n printf(\""%d \"", n[i][j]); /*输出原始矩阵的转置矩阵*/\n printf(\""\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,3,200 1515622087409803264,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:23:59,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[2][2]={4,5;2,7},b[2][2]={7,1;8,3},c[2][2]={5,9;6,2};\n new=[4,7,5;2,8,6;5,1,9;7,3,2]\n printf(\""%f\"",new);\n}",COMPILE_ERROR,0,0 1515622191281201152,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:24:23,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[2][2]={4,5;\n 2,7},b[2][2]={7,1;\n 8,3},c[2][2]={5,9;\n 6,2};\n new=[4,7,5;2,8,6;5,1,9;7,3,2]\n printf(\""%f\"",new);\n}",COMPILE_ERROR,0,0 1515622669905813504,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:26:18,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[2][2]={4 5\\n2 7},b[2][2]={7 1\\n8 3},c[2][2]={5 9\\n6 2};\n new=[4 7 5\\n2 8 6\\n5 1 9\\n7 3 2]\n printf(\""%f\"",new);\n}",COMPILE_ERROR,0,0 1515622722368167936,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:26:30,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[2][2]={4 5/n2 7},b[2][2]={7 1\\n8 3},c[2][2]={5 9\\n6 2};\n new=[4 7 5\\n2 8 6\\n5 1 9\\n7 3 2]\n printf(\""%f\"",new);\n}",COMPILE_ERROR,0,0 1515622866132131840,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:27:04,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[2][2]=[4 5/n2 7],b[2][2]=[7 1\\n8 3],c[2][2]=[5 9\\n6 2];\n new=[4 7 5\\n2 8 6\\n5 1 9\\n7 3 2]\n printf(\""%f\"",new);\n}",COMPILE_ERROR,0,0 1515623198027587584,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:28:23,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n printf(\""[4 7 5\\n2 8 6\\n5 1 9\\n7 3 2]\"");\n}",WRONG_ANSWER,2,200 1515623299382763520,479388ee830776e165e89b86566f3250a60c4cf2c88a6249db1dce7ddd3bb234,2022-04-17 17:28:48,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n printf(\""4 7 5\\n2 8 6\\n5 1 9\\n7 3 2\"");\n}",ACCEPTED,3,324 1515623571148496896,09c61df45db9daa68e157bd993b6b31b97f6298fa2a02026f735ac9f2d3f0f16,2022-04-17 17:29:52,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main (){\n printf(\""4 5 7\\n2 8 6\\n5 1 9\\n7 3 2\"");\n}",WRONG_ANSWER,3,496 1515623671338016768,09c61df45db9daa68e157bd993b6b31b97f6298fa2a02026f735ac9f2d3f0f16,2022-04-17 17:30:16,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main (){\n printf(\""4 7 5\\n2 8 6\\n5 1 9\\n7 3 2\"");\n}",ACCEPTED,3,200 1515634585416146944,07201f5db4d5da056b5815d94d28c52740c487f61f2f04d0d69e05119576712a,2022-04-17 18:13:38,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint date(int y,int m,int d);\nint main(void)\n{\n\tint y,m,d,y1,m1,d1;//给出输入日期\n\tint dt1,dt2; \n\tfloat dy;\n\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\tscanf(\""%d-%d-%d\"",&y1,&m1,&d1);\n\tdt1=date(y,m,d);\n\tdt2=date(y1,m1,d1);\n\tdy=1.0*(dt2-dt1)/365.24;\n\tprintf(\""%d-%d-%d:%d,%d\\n\"",y,m,d,dt1,dt1%7);\n\tprintf(\""%d-%d-%d:%d,%d\\n\"",y1,m1,d1,dt2,dt2%7);\n\tprintf(\""%.2f\"",dy);\n\treturn 0;\n } \n int date(int y,int m,int d)\n {\n \tint dt=d;\n \tfor(int i=1;i\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++)\n {\n printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,3,328 1515639795127590912,523cb97456f9abcd8af30988a1b755656cc78417aa63071d066fe743a65e6d32,2022-04-17 18:34:21,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{\n int i,j,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(i=0;i<2;i++)\n {\n for(j=0;j<2;j++)\n {\n d[i+j+t][0]=a[j][i];\n }\n t++;\n }\n t=0;\n for(i=0;i<2;i++)\n {\n for(j=0;j<2;j++)\n {\n d[i+j+t][1]=b[j][i];\n }\n t++;\n }\n t=0;\n for(i=0;i<2;i++)\n {\n for(j=0;j<2;j++)\n {\n d[i+j+t][2]=c[j][i];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=4)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,3,508 1515647794319450112,11532b0492b37d2acbd9eaac294c62d7f8cf4185439044565c9f47cd4a2d9436,2022-04-17 19:06:08,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}\n",ACCEPTED,3,320 1515656565225857024,ded57ce6fa46831d40117d4c8212166dd872a2f0b6e2c59a13289a2cad9e1139,2022-04-17 19:40:59,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[4][4]={{4,7,5},{2,8,6},{5,1,9},{7,3,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}\n",ACCEPTED,3,188 1515660835602309120,81202aa067b3ff0c1b34b5403518dfe61ef5f30f46ce74e8ba3b2330b4f0353a,2022-04-17 19:57:57,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}",ACCEPTED,3,360 1515666797670866944,fde9ef04cc72364610f8f560e480883a612781b1445c05db301632237ae9f2db,2022-04-17 20:21:38,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,4,320 1515688726838910976,7f525a5cdea216c802386ad87cccf34a4525f47b675eb48c356e81b9eac691fe,2022-04-17 21:48:47,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n\n\n\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++){\n printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n}\n",ACCEPTED,5,320 1515711982391779328,9cfe9d172adff83b71dcf76451ec9ab31a5b64eed8232ba07ed63e18d7dc58b4,2022-04-17 23:21:11,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}\n",ACCEPTED,2,316 1515713165940482048,9364dd829a8e6d5a7a3e9829a4f4cb5dda159e3804b6c1c502cb5d313bb9ef0b,2022-04-17 23:25:54,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}\n",ACCEPTED,3,192 1515729471427485696,ffa46a7f6c5230db4ebd2cab219c2636fee51d4649f0512febac5a330f0d8d5f,2022-04-18 00:30:41,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}",ACCEPTED,2,200 1515927651457179648,f3a08bfe13376b74de588a1305c4e42eab8f2d41ead2ef7bc99a345ca5524e74,2022-04-18 13:38:11,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}\n",ACCEPTED,4,312 1515932769484791808,50fc77b4b617b1468e9591b5ff70f9c23eac391acf4a36d7af203b91870f3686,2022-04-18 13:58:31,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,3,204 1515938538678820864,17469b3916a330977856fe68632ef72f33b91cdf21c325b6d4aa1df5bc120d90,2022-04-18 14:21:27,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,2,196 1515939320757133312,1c462994ea483ca98da2cf12b0bc13078db07f3dcd75fa9bb0f8241205a2ad71,2022-04-18 14:24:33,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#includde \n{\n printf(\""4 7 5\\n\n2 8 6\\n\n5 1 9\\n\n7 3 2\n\"")\n}",COMPILE_ERROR,0,0 1515939377086636032,1c462994ea483ca98da2cf12b0bc13078db07f3dcd75fa9bb0f8241205a2ad71,2022-04-18 14:24:46,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#includde \n{\n printf(\""4 7 5\\n\n2 8 6\\n\n5 1 9\\n\n7 3 2\n\"");\n}",COMPILE_ERROR,0,0 1515939445273796608,1c462994ea483ca98da2cf12b0bc13078db07f3dcd75fa9bb0f8241205a2ad71,2022-04-18 14:25:03,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n{\n printf(\""4 7 5\\n\n2 8 6\\n\n5 1 9\\n\n7 3 2\n\"");\n}",COMPILE_ERROR,0,0 1515939493038530560,1c462994ea483ca98da2cf12b0bc13078db07f3dcd75fa9bb0f8241205a2ad71,2022-04-18 14:25:14,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n{\n printf(\""4 7 5\\n\n2 8 6\\n\n5 1 9\\n\n7 3 2\n\"");\n}",COMPILE_ERROR,0,0 1515939668058087424,1c462994ea483ca98da2cf12b0bc13078db07f3dcd75fa9bb0f8241205a2ad71,2022-04-18 14:25:56,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n printf(\""4 7 5\\n2 8 6\\n5 1 9\\n7 3 2\"");\n}",ACCEPTED,2,196 1515940566730022912,6bc3d46a5e7c6fdc7f75a12ae9a1f446bc3b3c4d3d3dac2cc4ba0497b2e41df7,2022-04-18 14:29:30,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"int main() \n{\nprintf(\""4 7 5\\n\n2 8 6\\n\n5 1 9\\n\n7 3 2\\n\"");\n } ",COMPILE_ERROR,0,0 1515940617614958592,6bc3d46a5e7c6fdc7f75a12ae9a1f446bc3b3c4d3d3dac2cc4ba0497b2e41df7,2022-04-18 14:29:42,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"int main() \n{\nprintf(\""4 7 5\\n\n2 8 6\\n\n5 1 9\\n\n7 3 2\\n\"");\n } ",COMPILE_ERROR,0,0 1515940715590066176,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:30:06,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<2;j++)\n printf(\""%d \"",d[i][j]);\nprintf(\""\\n\"");}\n \nfor(i=0;i<4;i++)\n{for(j=2;j<3;j++)\n printf(\""%d \"",d[i][j]);\nprintf(\""\\n\"");}\n\n return 0;\n}",WRONG_ANSWER,4,324 1515940899249709056,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:30:49,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<2;j++)\n printf(\""%d \"",d[i][j]);\nprintf(\""\\n\"");}\n \nfor(i=0;i<4;i++)\n{for(j=2;j<3;j++)\n printf(\""%d\"",d[i][j]);\nprintf(\""\\n\"");}\n\n return 0;\n}",WRONG_ANSWER,3,468 1515942007175651328,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:35:14,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\nfor(i=0;i<4;i++)\n{for(j=0;j<2;j++)\n printf(\""%d \"",d[i][j]);\nprintf(\""\\n\"");}\n \nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(j=2?\""%d\"":\""%d \"",d[i][j]);\nprintf(\""\\n\"");}\n\n return 0;\n}",SEGMENTATION_FAULT,4,320 1515942246216884224,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:36:11,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\n\n \nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(2?\""%d \"":\""%d\"",d[i][j]);\nprintf(\""\\n\"");}\n\n return 0;\n}",PRESENTATION_ERROR,2,196 1515942387926179840,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:36:44,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\n\n \nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(j='2'?\""%d \"":\""%d\"",d[i][j]);\nprintf(\""\\n\"");}\n\n return 0;\n}",SEGMENTATION_FAULT,3,440 1515942481907408896,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:37:07,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3],i,j;\n\nd[0][0]=a[0][0];\nd[1][0]=a[1][0];\nd[2][0]=a[0][1];\nd[3][0]=a[1][1];\n\nd[0][1]=b[0][0];\nd[1][1]=b[1][0];\nd[2][1]=b[0][1];\nd[3][1]=b[1][1];\n\nd[0][2]=c[0][0];\nd[1][2]=c[1][0];\nd[2][2]=c[0][1];\nd[3][2]=c[1][1];\n\n\n \nfor(i=0;i<4;i++)\n{for(j=0;j<3;j++)\n printf(2?\""%d \"":\""%d\"",d[i][j]);\nprintf(\""\\n\"");}\n\n return 0;\n}",PRESENTATION_ERROR,2,200 1515943475895083008,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:41:04,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 12\nint riqi(int year,int month,int day);\nint print(int year,int month,int day,int d,int xq);\nint xingqi(int day);\n\nint main()\n{\n int year,month,day,a,b,c;\n scanf(\""%d-%d-%d\"",&a,&b,&c);//出生年月日\n scanf(\""%d-%d-%d\"",&year,&month,&day);//目前年月日\n int dayb,dayn,xqb,xqn;\n dayb=riqi(a,b,c);\n xqb=xingqi(dayb);\n dayn=riqi(year,month,day);\n xqn=xingqi(dayn);\n print(a,b,c,dayb,xqb);\n print(year,month,day,dayn,xqn);\n float old;\n old=(float)(dayn-dayb)/365.24;\n printf(\""%.2f\"",old);\n return 0;\n}\n\nint riqi(int year,int month,int day)\n{\n int i,d;\n d=0;\n int a[N]={31,28,31,30,31,30,31,31,30,31,30,31};\n for(i=1;i2))\n d++;\n }\n for(i=1;i\n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;}",ACCEPTED,4,324 1515943579741315072,b41fa1035d581fc9cac8d68e3e155721f3bc1fcccc1a267fead7ebcd889b5498,2022-04-18 14:41:28,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\nint riqi(int year,int month,int day);\nint print(int year,int month,int day,int d,int xq);\nint xingqi(int day);\n\nint main()\n{\n int year,month,day,a,b,c;\n scanf(\""%d-%d-%d\"",&a,&b,&c);//出生年月日\n scanf(\""%d-%d-%d\"",&year,&month,&day);//目前年月日\n int dayb,dayn,xqb,xqn;\n dayb=riqi(a,b,c);\n xqb=xingqi(dayb);\n dayn=riqi(year,month,day);\n xqn=xingqi(dayn);\n print(a,b,c,dayb,xqb);\n print(year,month,day,dayn,xqn);\n float old;\n old=(float)(dayn-dayb)/365.24;\n printf(\""%.2f\"",old);\n return 0;\n}\n\nint riqi(int year,int month,int day)\n{\n int i,d;\n d=0;\n int a[N]={31,28,31,30,31,30,31,31,30,31,30,31};\n for(i=1;i2))\n d++;\n }\n for(i=1;i\n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,348 1515952143629819904,e52a52d1e64200bb9d8dfdaeae2cde68e1c63e30a749342aa10c64613ae3abba,2022-04-18 15:15:30,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main()\n{\nint i,j;\nint n[4][3]={{4,7,5},{2,8,6},{5,1,9},{7,3,2}};\nfor(i=0;i<=3;i++)\n{\n for(j=0;j<=2;j++)\n {\n printf(\""%d \"",n[i][j]);\n }\nprintf(\""\\n\"");\n}\nreturn 0;\n}\n",PRESENTATION_ERROR,3,384 1515955974736093184,93e73d893aa51b5aeacf2d8a63bb319ee270e0738dc47b6620a33266cee7900f,2022-04-18 15:30:44,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}\n",ACCEPTED,2,200 1515957486719770624,9db3fbabdef1edf0a4d0afd593a5d53b7d1f9f2fb92ce29a3fd57375f2b8aaf0,2022-04-18 15:36:44,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}",ACCEPTED,5,324 1515962095958237184,559c168529dac746092dba82d44cdfd6da1d740a3d29ef479acca6cd46a58a54,2022-04-18 15:55:03,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,3,200 1515977347701317632,29707badef755b9b94b434cf63fec49a60bf8ad95bd971203c4e98c6aa11ec26,2022-04-18 16:55:39,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n printf(\""4 7 5\\n2 8 6\\n5 1 9\\n7 3 2\"");\n}",ACCEPTED,4,312 1515985150138916864,f9d71d443d29a44c3386cb380afd5a2168681a420281933c9fcd72d9c8cc0ae9,2022-04-18 17:26:40,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,4,312 1515985566322565120,13a5cc8ceab67f23790e5cb3c70479afdd6bf1743e522cb3482cd09f0630e3ec,2022-04-18 17:28:19,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,348 1515987040435871744,b622cb6c23df7b780a7c55153f63a63ecad67cff399ec073115fd5431017136c,2022-04-18 17:34:10,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,200 1516005064459067392,dc76f47358a18d60bbdf84c46cc2f81d873243c4c0ae53f983e1ff98b9f926f8,2022-04-18 18:45:48,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}",ACCEPTED,3,192 1516008794579263488,8e8ba11178f06468ae9ab87edbb674ce916d849a6483678fb2c5c7149fb36bdb,2022-04-18 19:00:37,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main(void)\n{\n\tprintf(\""4 7 5\\n\"");\n printf(\""2 8 6\\n\"");\n printf(\""5 1 9\\n\"");\n printf(\""7 3 2\\n\"");\n\n}\n",ACCEPTED,3,200 1516011459711508480,8976ba1872ee49aacaf1ae307ae70c88f62b2c4477e32c9e573f92a766b90ee1,2022-04-18 19:11:12,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n\n\n\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++){\n printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n}\n",ACCEPTED,4,184 1516013422926618624,83aef1085ef3e7330be5bb398ba42e131a8c2666b1a523c2ba2542696bc0a553,2022-04-18 19:19:00,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++){\n printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n}\n",ACCEPTED,2,200 1516014977339875328,f704ddffe8fe4de333a8a42c4359c1ac731989c4fbcb097f85a00a338f79d104,2022-04-18 19:25:11,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,192 1516016011177631744,8c64f734d2a7378f43efce0e4f089d47212a450b35577df93406e5bc0315b039,2022-04-18 19:29:17,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++)\n {printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d \"",c[i]);\n printf(\""\\n\"");\n }\n return 0;\n}",PRESENTATION_ERROR,3,324 1516016170598572032,8c64f734d2a7378f43efce0e4f089d47212a450b35577df93406e5bc0315b039,2022-04-18 19:29:55,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++)\n {printf(\""%d\"",a[i]);\n printf(\""%d\"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n return 0;\n}",PRESENTATION_ERROR,3,328 1516016302538792960,8c64f734d2a7378f43efce0e4f089d47212a450b35577df93406e5bc0315b039,2022-04-18 19:30:27,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++)\n {printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d \"",c[i]);\n printf(\""\\n\"");\n }\n return 0;\n}",PRESENTATION_ERROR,5,256 1516016397791436800,8c64f734d2a7378f43efce0e4f089d47212a450b35577df93406e5bc0315b039,2022-04-18 19:30:50,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++)\n {printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d \"",c[i]);\n printf(\""\\n\"");\n }\n}",PRESENTATION_ERROR,4,328 1516016649349373952,8c64f734d2a7378f43efce0e4f089d47212a450b35577df93406e5bc0315b039,2022-04-18 19:31:50,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++)\n { printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d \"",c[i]);\n printf(\""\\n\"");\n }\n}",PRESENTATION_ERROR,4,464 1516016837186543616,8c64f734d2a7378f43efce0e4f089d47212a450b35577df93406e5bc0315b039,2022-04-18 19:32:34,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++)\n { printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n}",ACCEPTED,4,320 1516017899519860736,25cf617f2fe4e97782ad22142d7e8efce18d0ecc55ecaa4b59628ebf2b5d64ac,2022-04-18 19:36:48,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,4,320 1516020736988028928,e7f762137d8c98dbf3d0585e5456a7c41a0f95104be0b5910aaf86e5903da43e,2022-04-18 19:48:04,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,312 1516020773373255680,e7f762137d8c98dbf3d0585e5456a7c41a0f95104be0b5910aaf86e5903da43e,2022-04-18 19:48:13,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,4,312 1516020884623335424,e52a52d1e64200bb9d8dfdaeae2cde68e1c63e30a749342aa10c64613ae3abba,2022-04-18 19:48:39,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,368 1516021453186048000,48e2957316802c6f521481c1dd4910f7f7b42828be8576d8c6e82f4fcde24699,2022-04-18 19:50:55,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,188 1516022934018449408,df9a6ba67ba70e8f3c6c009413233a3923d7b589bebb0cc1b2b8112151659e63,2022-04-18 19:56:48,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,328 1516023576250277888,e988c65b849045f0dbd72b312cb2916bb022f72b052b0869efbab887e63081f6,2022-04-18 19:59:21,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n\n\n\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++){\n printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n}\n",ACCEPTED,3,332 1516025978110615552,b4656ed018c0aa249a38b2de6bd9dfa062aaf4969d54f5a893a1901f5ef2105c,2022-04-18 20:08:54,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[5][5]={{4,7,5},{2,8,6},{5,1,9},{7,3,2},{5,1,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}\n",ACCEPTED,3,200 1516031541380915200,f96d647c4dfda3b75d0be991fa19a9a1ef26807dc8b84650a628c8162e59519b,2022-04-18 20:31:00,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n\n\n\nint main()\n{\n int a[4]={4,2,5,7};\n int b[4]={7,8,1,3};\n int c[4]={5,6,9,2};\n int i;\n for(i=0;i<4;i++){\n printf(\""%d \"",a[i]);\n printf(\""%d \"",b[i]);\n printf(\""%d\"",c[i]);\n printf(\""\\n\"");\n }\n}",ACCEPTED,5,316 1516046145049321472,65123ba884308a64b955308ea523254c99ea268832e330854bef2232f4fd9ee0,2022-04-18 21:29:02,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\n#include\nint main()\n{\n\tint i,j,n,temp,d=1,carry;\n\tint a[3000];\n\tscanf(\""%d\"",&n);\n\ta[0]=1;\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tfor(j=1,carry=0;j<=d;j++)\n\t\t{\n\t\t\ttemp=a[j-1]*i+carry;\n\t\t\ta[j-1]=temp%10;\n\t\t\tcarry=temp/10;\n\t\t}\n\t\twhile(carry)\n\t\t{ ++d;\n\t a[d-1]=carry%10;\n\t\t\tcarry=carry/10;\n\t\t}\n\t}\n\tfor(j=d-1;j>=0;j--)\n\tprintf(\""%d\"",a[j]);\n\t\n }\n",WRONG_ANSWER,4,324 1516046263945797632,65123ba884308a64b955308ea523254c99ea268832e330854bef2232f4fd9ee0,2022-04-18 21:29:30,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include\n#include\nint main()\n{\n\tint i,j,n,temp,d=1,carry;\n\tint a[3000];\n\tscanf(\""%d\"",&n);\n\ta[0]=1;\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tfor(j=1,carry=0;j<=d;j++)\n\t\t{\n\t\t\ttemp=a[j-1]*i+carry;\n\t\t\ta[j-1]=temp%10;\n\t\t\tcarry=temp/10;\n\t\t}\n\t\twhile(carry)\n\t\t{ ++d;\n\t a[d-1]=carry%10;\n\t\t\tcarry=carry/10;\n\t\t}\n\t}\n\tfor(j=d-1;j>=0;j--)\n\tprintf(\""%d\"",a[j]);\n\t\n }\n",WRONG_ANSWER,3,192 1516047006568292352,65123ba884308a64b955308ea523254c99ea268832e330854bef2232f4fd9ee0,2022-04-18 21:32:27,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n\tint i,j;\n\tint a[4][4]={{4,7,5},{2,8,6},{5,1,9},{7,3,2}};\n\tfor(i=0;i<4;i++)\n\t{\n if(i!=0)\n printf(\""\\n\"");\n \n\t for(j=0;j<3;j++)\n { \n if(j==2)\n\t printf(\""%d\"",a[i][j]);\n else \n\t printf(\""%d \"",a[i][j]);\n \n } \n\t}\n\treturn 0;\n}\n",ACCEPTED,3,328 1516058114221940736,80a458ab90cd514f147b8f34457795602aa05937906a0815429506ac1605b063,2022-04-18 22:16:36,C,0.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n\nint main(void)\n{ \n\tint i,n;\n\tdouble sum;\n scanf(\""%d\"",&n);\n\tsum=1;\n\tfor(i=1;i<=n;i++)\n\t{\n\tsum=sum*i;\n\t}\n\tprintf(\""%.0f\"",sum);\n\t\n\t\n\treturn 0;\n}\n",WRONG_ANSWER,3,352 1516058480883441664,80a458ab90cd514f147b8f34457795602aa05937906a0815429506ac1605b063,2022-04-18 22:18:03,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}\n",ACCEPTED,3,324 1521395487628886016,6bc3d46a5e7c6fdc7f75a12ae9a1f446bc3b3c4d3d3dac2cc4ba0497b2e41df7,2022-05-03 15:45:25,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \nint main()\n{\n printf(\""4 7 5\\n2 8 6\\n5 1 9\\n7 3 2\"");\n}",ACCEPTED,3,332 1523940864211070976,167a7581378cd61173f4cbf86f54cd07620feb25f096ad7294022dab6b25af26,2022-05-10 16:19:50,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n\nint main(void)\n{\n int arra[2][2]=\n {\n {4,5},\n {2,7}\n };\n int arrb[2][2]=\n {\n {7,1},\n {8,3}\n };\n int arrc[2][2]=\n {\n {5,9},\n {6,2}\n };\n int arrnew[4][3]=\n {\n {arra[0][0],arrb[0][0],arrc[0][0]},\n {arra[1][0],arrb[1][0],arrc[1][0]},\n {arra[0][1],arrb[0][1],arrc[0][1]},\n {arra[1][1],arrb[1][1],arrc[1][1]}\n };\n int i,j;\n for(i=0;i<4;i=i+1)\n {\n for(j=0;j<3;j=j+1)\n {\n printf(\""%d\"",arrnew[i][j]);\n if(j!=2)\n {\n printf(\"" \"");\n }\n else\n {\n printf(\""\"");\n }\n }\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,3,204 1523948534502572032,c39b3e88cfb1a74d53302f0cb61f33ca6b8360857f94c4dd6cca7688a72a96f9,2022-05-10 16:50:18,C,20.0,1514945062046691329,1509437024393068544,1141715734670041088,"#include \n#include \n#define N 10000\n\nint main()\n{\n int i,j,k,t=0;\n int a[2][2]={{4,5},{2,7}};\n int b[2][2]={{7,1},{8,3}};\n int c[2][2]={{5,9},{6,2}};\n int d[4][3]={0};\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][0]=a[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][1]=b[k-1][j-1];\n }\n t++;\n }\n t=0;\n for(j=1;j<=2;j++)\n {\n for(k=1;k<=2;k++)\n {\n d[k+j-2+t][2]=c[k-1][j-1];\n }\n t++;\n }\n for(i=0;i<4;i++)\n {\n for(j=0;j<3;j++)\n {\n printf(\""%d\"",d[i][j]);\n if(j!=2)\n printf(\"" \"");\n }\n if(i!=3)\n printf(\""\\n\"");\n }\n return 0;\n}",ACCEPTED,3,200