hi

labtest.cpp

@@ -1,15 +1,29 @@
 #include<bits/stdc++.h>
 using namespace std;
-//write a user defined function to find first N prime numbers;
-//the function should be named like : youname_yourid;
+void mohammadtalha-web(int n)
+{
+    int count = 0;
 
-/*
-example:
+    for(int num = 2; count < n; num++)
+    {
+        bool prime = true;
 
-void nishat_90(int n){
-//your code here;
+        for(int i = 2; i <= num/2; i++)
+        {
+            if(num % i == 0)
+            {
+                prime = false;
+                break;
+            }
+        }
+
+        if(prime)
+        {
+            cout << num << " ";
+            count++;
+        }
+    }
 }
-*/
 
 int main(){