Repository navigation
Expand file tree
/
Copy pathPrateek.java
More file actions
88 lines (84 loc) · 2.75 KB
/
Copy pathPrateek.java
File metadata and controls
88 lines (84 loc) · 2.75 KB
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;
/**
* Created by SMudgal on 5/11/2016.
*/
public class Prateek {
public static void main(String args[])
{
try {
Scanner reader = new Scanner(new FileReader("input.txt"));
int test_cases = reader.nextInt();
int friends,budget,sum,flag;
int[] gift;
while (test_cases > 0)
{
sum=flag=0;
friends = reader.nextInt();
budget = reader.nextInt();
gift = new int[friends];
for (int i=0;i<friends;i++) {
gift[i] = reader.nextInt();
if (sum < budget) {
sum += gift[i];
}
if (sum == budget && flag != 2) {
flag = 2;
System.out.println("YES");
}
if (sum > budget)
flag = 1;
}
if (sum < budget)
{
System.out.println("NO");
test_cases--;
continue;
}
if (flag == 2)
{
test_cases--;
continue;
}
if (flag == 1)
{
for (int i=1;i<friends;i++)
{
sum=gift[i];
if (i == friends - 1) {
if (sum == budget) {
System.out.println("YES");
flag = 2;
break;
}
}
else
{
for (int j=i+1;j<friends;j++)
{
sum+=gift[j];
if (sum == budget) {
System.out.println("YES");
flag = 2;
break;
}
if (sum > budget)
break;
}
}
if (flag == 2)
break;
}
}
if (flag != 2)
System.out.println("NO");
test_cases--;
}
} catch (IOException e) {
e.printStackTrace();
}
}
}