Code give primes till 200. Maybe, readable. Let community decide it.

[Treborh]

I show another piece of mini-workflow. Can you read it easy.

#include<iostream>
#include<vector>
using namespace std;

int main(){
             int n=3, m; vector<int>primes(0); bool op=1;
             primes.push_back(2); primes.push_back(3);
             
    while(n<200){ n++;
    
         for(m=n-1; m>1; m--)if(n%m==0){op=0; break;} 
           
         switch(op){
                   case 0: op=1;break;
                   case 1: primes.push_back(n);break;
                   }
                }
    m=0;
    
    do{ cout<<primes[m]<<endl; m++;}
       while(m<primes.size());
     
    cin.get();
           
            }