GFG-Daily-Problems/Prime List at main · Ankitjha2202/GFG-Daily-Problems · 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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114

class Solution{
public:
bool is(int n)

    {

        if(n==1)

            return false;

        for(int i=2;i*i<=n;i++)

        {

            if(n%i==0)

                return false;

        }

        return true;

    }


    int ans(int n)

    {

        if(n==1)

            return 2;


        int first=0;

        int second=0;


        for(int i=n;i>=1;i--)

        {

            if(is(i))

            {

                first=i;

                break;

            }

        }


        for(int i=n;i<=n*n;i++)

        {

            if(is(i))

            {

                second=i;

                break;

            }

        }


        int one=n-first;

        int two=second-n;


        if(one<=two)

            return first;

        return second;

    }


    Node *primeList(Node *head)

    {

        Node *temp=head;

        while(temp!=NULL)

        {

            temp->val=ans(temp->val);

            temp=temp->next;

        }

        return head;
    }
};