cplusplus/lec5_Bitwise.cpp at main · iamhk12/cplusplus · GitHub

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

//LECTURE 5


// AND OR NOT XOR
/*#include <iostream>
using namespace std;

int main()
{
    int a = 4;
    int b = 6;

    cout << "a&b :" << (a&b);
    cout << endl;
    cout << "a|b :" << (a|b);
    cout << endl;
    cout << "~a : " << ~a;
    cout << endl;
    cout << "a^b : " << (a^b);
    cout << endl;
}
*/

// LEFT SHIFT RIGHT SHIFT
/*
#include <iostream>
using namespace std;

int main()
{
    cout<<(17<<1)<<endl;
    cout<<(17>>1)<<"\tnishtha raut"<<endl;
}
*/

// Prime or not

#include <iostream>
using namespace std;

int main()
{
    int n;
    cin >> n;

    bool isprime;
    for (int i = 2; i < n; i++)
    {
        if (n % i == 0)
        {
            isprime = 0;
        }
    }
    if (isprime = 0)
    {
        cout << "Not a prime number";
    }
    else
    {
        cout << "Prime number";
    }
    return 0;
}