Prime generator

#include <iostream>
using namespace std;

///////World's smallest prime number generator (u jelly? u mirin? lol deal with it homo)
int main() {
    int count,n = 0;
    cout << "\t>that feel when prime number generator\n\nEnter the number at which you want to stop checking primes--go!\n";
    cin >> n;
    cout << "\n\n";
    for(int i=2;i<=n;++i) {
        for(int b=2;b<i;++b) {
            if((i%b)==0 && i!=b) ++count;
        }
        if(count==0) cout << i << " is a prime\n";
        count=0;
    }
    return 0;
}


(defun prime (n)
  (loop for i from 2 to (round (sqrt n)) do
    (when (= (mod n i) 0) (return-from prime -1)))
  (return-from prime n))

(defun primes (n)
  (loop for i from 1 to n do
    (when (> (prime i) 0) (print i))))

(primes 100)

1
2
3
5
7
11
13
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
NIL