224 questions
Write a program that takes 10 integers and outputs the sum of the odd-numbered integers and the even-numbered integer. The sentence above is the problem and I made the code.#include <stdio.h>int...
# matte wrap code; fm size 3*10*5 a = zeros(3,10);fm = [];for kCh = 1:5 fm[:,:,kCh] = a;# Python code, fm size 5*3*10a = np.zeros((3,10));fm = [];for kCh in range(5): fm.append(fm_val);I implemented t...
If I run this code, HELLO comes out in red in the console window, but why does it come out like that?Please explain in detail.char red[] = { 0x1b, '[', '1', ';', '3', '1', 'm', 0 };cout << red &...
I'm working on a code that can run the Walsall algorithm, but I don't get the answer I want from where it went wrong. For example, 2310001000041000001011110000When you do it, the result value should c...
testOne = [['ex','ex','ex'],['ex','ex','ex'],['ex','ex','ex'],['ex','ex','ex'],['ex','ex','ex'],];xx = [];realCal = ['a','b','c']; for (let i = 0; i < testOne.length; i++) { xx[i] = realCal; xx...
There was an error in the 13th line in the code below.An error appears saying that } is omitted, but it should not be done.I'm going to print out rock-paper-scissors. Please give me courage.import jav...
const arr = ['a', 'b', 'c', 'd', 'e']; var x = b || d || g || h || z; const the_number_of_x = arr.filter(i => i === x).length; if (the_number_of_x === 2) { console.log(success!) } } else { consol...
#include <stdio.h>void main(){ double i, sale[5] = {157, 209, 251, 312, 500}; for (i = 0; i < 5; i++) { printf(\n address:%u sale[%d]=%d, &sale[i], i, sale[i]); }}This... I want to put ...
Hello, I'm a second-year undergraduate student who is studying alone after being discharged from the military and before returning to school.While solving the problem, C declared this structure.int so...
#define _crt_secure_no_warnings#include<stdio.h>void GetIntArray(int v[], int n);void ReverseIntArray(int v[], int n);void PrintIntArray(int v[], int n);int main(){ int tem[] = { 0 }; int n; Get...
| « | - 21 - | » |
© 2024 OneMinuteCode. All rights reserved.