-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfriends.java
68 lines (61 loc) · 1.04 KB
/
friends.java
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
import java.util.*;
import java.io.*;
class friends
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] even= new int[m];
int [] odd = new int[m];
int count1= 0;
int count2 = 0;
boolean flag = false;
for(int i =0;i<m*2;i++)
{
if(i%2==0)
{
even[count1] = sc.nextInt();
count1++;
}
else
{
odd[count2] = sc.nextInt();
count2++;
}
}
for(int i = 0;i<even.length;i++)
{
int com = even[i];
ArrayList<Integer> ar = new ArrayList<Integer>();
ar.add(odd[i]);
for(int j = i+2;j<even.length;j++)
{
if(even[j]==com)
ar.add(odd[j]);
}
for(int k = 0;k<ar.size();k++)
{
for(int l = 0;l<even.length;l++)
{
if(even[l]==ar.get(k))
{
int eom = odd[l];
for(int q =k+1;q<ar.size();q++)
{
if(ar.get(q)==eom)
flag = false;
else
flag = true;
}
}
}
}
}
if(flag)
System.out.println("Yes");
else
System.out.println("No");
}
}