Sa se determine al catelea numar prim este |

|
#include <iostream> |
using namespace std;
int main(){
int x,i,prim=0,counter;
cin>>x;
int n=2;
int estex=0;
while(estex<x){
prim=0;
for(i=1;i<=n;i++){
if(n%i==0)
prim++;

if(prim==2){
counter=n;
++estex;}
n+=1;

}
cout<<counter;
return 0;
}
___________________________________________________

4 3 2 1
3 4 2 1 1
3 2 4 1 2
3 2 1 4 3
2 3 1 4 4
2 1 3 4 5
1 2 3 4 6

#include <iostream>
#include <cstring>
using namespace std;
int main ()
{

const char vocale[]= {"aeiou"};

char sir[255];
int i;
cin.getline(sir, 255);
int lungime = strlen(sir);
int n;
for(i=1; i<=lungime; i++)
{

if(strchr(vocale,sir[i]) and !strchr(vocale,sir[i-1]) and !

strchr(vocale,sir(i+1))){
n++;}

cout<<n;

return 0;}

V E R D E . C R I N
D A N A . D D D D D
V O I . A O Q O A .
N U . A A O T E . .
. U B O B U . A I A
E Z N G A I E T A R
O R I O A T Z U L I
T U R N . N N N N N
O . Z Z C Z Z . I U
E L E G A T E L . O
palindrom problema olimpiada pe care n-am stiut-o xDDD
#include "pch.h"
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
ifstream f("TextFile1.txt");
/*string citire() {
string s;
string s2[100][100];
int i=0, j;
int n;
int ordin;
f >> n;
for (i = 0; i < n; i++) {
v[i] = 0;
}
while (n>=0) {
getline(f, s);
for(j=0;j<s.length();j++){
s2[i][j] += s[j];
}
i++;
n--;

}
n = i;
 f >> ordin;
return ordin, n, s2[][];
}

*/
int main() {
string s; //datele de intrare
string s2[100][100]; //matrice caractere
int i=0, j; //iteratori
int n, ordin; //datele de intrare
int suma; //date de iesire
int punct; //date de iesire
int v[10];
f >> n;
int k;
for (i = 0; i < 10; i++) {
v[i] = 0;
}
while (n >= 0) {
getline(f, s);
for (j = 0; j <s.length(); j++) {
s2[i][j] += s[j];
if (s2[i][j] == ".") {
s2[i][j] = " ";
}
}
i++;
n--;
} //construirea matricei de caractere
n = i;
f >> ordin;

}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {

return 0;
}
_________________________________________________________________________

problema subiect 3 bac 2017 parca citire din fisier si afisare cel mai mic numar ce
apare de un numar impar de ori(oricum nu e o metoda eficienta):
#include "pch.h"
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
ifstream f("TextFile1.txt");
int main() {
int contor = 0;
int actual;
int precedent;
int n = 0;
f >> precedent;
actual = precedent;

while (!f.eof()) {

while (precedent == actual) {

contor++;
f >> actual;
}

if (contor % 2 != 0) {
cout << precedent;
n++;
return 0;

contor = 0;
precedent = actual;
}

if (n == 0) {
cout << "nu exista";
}
___________________________________________________________________________