Phân tích 5 phương hướng nhiệm vụ phát triển nông -lâm -ngư nghiệp ở nước ta hiện nay

Pls help... : Slide layouts can be changed by _____.

Eddi Din [679]

Answer:

Selecting a new layout from the task pane

Explanation:

6 0

3 years ago

Write a Java program that creates a two-dimensional array of type integer of size x by y (x and y must be entered by the user).

Law Incorporation [45]

Answer:

The java program is as follows:

import java.util.*;

public class Main{

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

Random r = new Random();

int x, y;

x = input.nextInt();

y = input.nextInt();

int[][] Array2D = new int[x][y];

for(int i = 0; i < x ; i++){

for(int j = 0; j < y; j++){ Array2D[i][j] = r.nextInt(9) + 1; }

}

for(int i = 0; i < x ; i++){

for(int j = 0; j < y; j++){ System.out.print(Array2D[i][j]+" "); }

System.out.println();

}

for(int i = 0; i < x ; i++){

for(int j = 1; j < y; j+=2){ System.out.print(Array2D[i][j]+" "); }

System.out.println();

}

Explanation:

This creates a random object

Random r = new Random();

This declares x and y as integers

int x, y;

This gets input for x

x = input.nextInt();

This gets input for y

y = input.nextInt();

This declares the 2D array

int[][] Array2D = new int[x][y];

The following iteration populates the array with integers 1 to 9

for(int i = 0; i < x ; i++){

for(int j = 0; j < y; j++){ Array2D[i][j] = r.nextInt(9) + 1; }

}

The following iteration prints all elements of the array

for(int i = 0; i < x ; i++){

for(int j = 0; j < y; j++){ System.out.print(Array2D[i][j]+" "); }

System.out.println();

}

The following iteration prints all elements on the even column

for(int i = 0; i < x ; i++){

for(int j = 1; j < y; j+=2){ System.out.print(Array2D[i][j]+" "); }

System.out.println();

}

3 0

3 years ago

Kyra is teaching a photography class. She would like her students to share photos. She would also like the students to be able t

SIZIF [17.4K]

Answer:

A blog.

Explanation:

A blog can be defined as an informative or discussion-based website that is updated regularly and published over the internet. The informations that are posted on a blog are usually done chronologically and it includes pictures, videos, music, movies, novels, etc.

In this scenario, Kyra is teaching a photography class. She would like her students to share photos, be able to review other students' photos and offer feedback.

Hence, the technology Kyra should use is a blog because it would avail the users (students) to post photos, make comments on blog posts and review items posted by others.

6 0

3 years ago

Write a program which populates an array with integer values read from a file. We do not know how many integers are in the file,

max2010maxim [7]

Answer:

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

int main()

{

int arr[100];

int i = 0;

int j = 0;

char c[10];

char temp;

int sum = 0;

FILE* fp;

if ((fp = fopen("test.txt", "r")) == NULL) {

printf("cannot open the file");

return;

}

else {

do {

temp = fgetc(fp);

if (temp == ' ' || temp == '\n') {

c[j] = '\0';

arr[i++] = atoi(c);

j = 0;

continue;

}

c[j++] = temp;

} while (temp != EOF);

for (j = i - 1; j >= 0; j--) {

printf("%d\n", arr[j]);

}

getchar();

}

Explanation:

5 0

3 years ago

Your baby brother has found the hammer and is eagerly eyeing one of the boxes. Describe and analyze an algorithm to determine if

erastovalidia [21]

Answer:

Question is incomplete.

Assuming the below info to complete the question

You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.

Detailed answer is written in explanation field.

Explanation:

We have to find the reachability using the directed graph G = (V, E)

In this V are boxes are considered to be non empty and it may contain key.

Edges E will have keys .

G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.

Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.

Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.

If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.

After first search from B we can start marking all other vertex of graph G.

So algorithm will be O ( V +E ) = O (n+m) time.

7 0

3 years ago