UVA Solution 496 – Simply Subsets – Solution in C++

UVA Onilne Judge Solution UVA-Volume 4

UVA Solution 496 – Simply Subsets – Solution in C,C++ – Volume 4

UVA Online Judge Solution 496 – Simply Subsets | Volume 4
UVA Problem Link -496 – Simply Subsets solve

Problem Name: 496 – Simply Subsets solution
Problem Number : UVA – 496 – Simply Subsets code
Online Judge : UVA Online Judge Solution
Volume: 4
Solution Language : C plus plus

UVA Online Judge Solution, UVA OJ Solution list, UVA Problems Solution, UVA solver, UVA all problem solution list

UVA Solution 496 – Simply Subsets Code in CPP:

#include <iostream>
#include <sstream>
#include <cstdio>
using namespace std;

int
main() {
stringstream sin;
string line;
while
(getline(cin, line)) {
int
A[100], B[100];
int
At = 0, Bt = 0, num, i, j;
sin.clear();
sin << line;
while
(sin >> num)
A[At++] = num;
getline(cin, line);
sin.clear();
sin << line;
while
(sin >> num)
B[Bt++] = num;
int
Act = 0, Bct = 0;
for
(i = 0; i < At; i++) {
for
(j = 0; j < Bt; j++) {
if
(A[i] == B[j]) {
Act++;
break
;
}
}
}

for
(i = 0; i < Bt; i++) {
for
(j = 0; j < At; j++) {
if
(B[i] == A[j]) {
Bct++;
break
;
}
}
}

if
(At == Act && At < Bt)
puts("A is a proper subset of B");
else if
(Bt == Bct && Bt < At)
puts("B is a proper subset of A");
else if
(At == Bt && Act == At && Bct == Bt)
puts("A equals B");
else if
(Act == 0 && Bct == 0)
puts("A and B are disjoint");
else

puts("I'm confused!");
}

return
0;
}

Tags: UVA Online Judge Solution, UVA OJ Solution list, UVA Problems Solution, UVA solver, UVA all problem solution list, UVA 496 – Simply Subsets  code in C, UVA 496 code in C++, UVA 496 – Simply Subsets solution in C, UVA 496 solution

Leave a Reply

Your email address will not be published.