Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
58 lines (45 loc) · 1.44 KB

File metadata and controls

58 lines (45 loc) · 1.44 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package org.line;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Test1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int messageNum = sc.nextInt();
int consumerNum = sc.nextInt();
Queue<Integer> message = new LinkedList<Integer>();
int[] consumer = new int[consumerNum];
for(int i=0; i<messageNum; i++) {
int n = sc.nextInt();
message.add(n);
}
for(int i=0; i<consumerNum; i++)
consumer[i] = 0;
for(int i=0; i<consumerNum; i++) {
consumer[i] = message.poll();
}
int time = 1;
while(true) {
int all=0;
for(int i=0; i<consumerNum; i++) {
if(consumer[i] != 0) {
consumer[i]--;
if(consumer[i]==0 && !message.isEmpty())
consumer[i] = message.poll();
}
else if(consumer[i] == 0 && !message.isEmpty()){
consumer[i] = message.poll();
}
all += consumer[i];
}
time++;
if(all==0)
break;
}
System.out.println("----");
System.out.println("time ; "+time);
for(int i=0; i<consumerNum; i++) {
System.out.println("consumer["+i+"] :"+consumer[i]);
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.