0% found this document useful (0 votes)
62 views8 pages

Rezolvare Variante Bac 2009 Problema 4

The document contains code snippets in C++ for various programming problems or exercises. The code includes functions to count digits of a number, find the minimum and second minimum number from a file, find the maximum number and its frequency in an array, sort numbers in ascending or descending order based on a condition, print prime numbers between two numbers, and print the frequency of digits in numbers read from a file.

Uploaded by

Serban Onofrei
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
62 views8 pages

Rezolvare Variante Bac 2009 Problema 4

The document contains code snippets in C++ for various programming problems or exercises. The code includes functions to count digits of a number, find the minimum and second minimum number from a file, find the maximum number and its frequency in an array, sort numbers in ascending or descending order based on a condition, print prime numbers between two numbers, and print the frequency of digits in numbers read from a file.

Uploaded by

Serban Onofrei
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 8

Varianta 32

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt");
int a;
int nrc(int n)
{
int nr=0;
while(n)
{
nr++;
n/=10;
}
return nr;
}
int main()
{
int min1=100000001,min2=100000001;
fin>>min1;
while(fin>>a)
{
if(nrc(a)==2)
{
if(a<min1)
min1=a;
else if(a<min2)
min2=a;
}
}
if(min2==100000001)
cout<<0;
else
cout<<min1<<" "<<min2;

return 0;
}
varianta 33
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int n, a[1005][1005], x, y, mini= 10000;
int main()
{
fin >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin >> a[i][j];
/// cautam maxim de 3 cifre
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
if(a[i][j] >= 100 && a[i][j] <= 999 && a[i][j] > x)
x = a[i][j];
}
/// cautam y
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
if(a[i][j] > x)
{
if(a[i][j] - x <= mini)
{
mini = a[i][j] - x;
y = a[i][j];
}
}
else if(a[i][j] < x)
{
if(x - a[i][j] <= mini)
{
mini = x - a[i][j];
y = a[i][j];
}
}
}
cout << x << " " << y;
return 0;
}
varianta 36

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int cifra(int n)
{
int c;
if(n==0)
return 0;
while(n)
{
c=n%10;
if(c%2!=0)
n/=10;
else
return c;
}
return -1;

}
int x,n,v[1501],i,j,nr;
int main()
{
fin>>n;
nr=1;
while(fin>>x)
{
if(cifra(x)!=-1)
v[nr++]=cifra(x);
}
for(i=1; i<nr; i++)
for(j=1; j<=nr; j++)
if(v[i]<v[j])
{
int aux=v[i];
v[i]=v[j];
v[j]=aux;

}
for(i=1; i<nr; i++)
cout<<v[i];

return 0;
}

varianta 37

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int nrdiv(int n)
{
int d=2,nr=0;
while(n!=1)
{
if(n%d==0)
{
nr++;
while(n%d==0)
n/=d;
}
if(d==2)
d++;
else d+=2;
}
return nr;

}
int x,n,a[1501],i,j,nr;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
if(nrdiv(a[i])%2==0)
{
cout<<a[i]<<" ";
break;
}
for(i=n;i>=1;i--)
if(nrdiv(a[i])%2==0)
{
cout<<a[i]<<" ";
break;
}

return 0;
}
Varianta 39

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int pr(int n)
{
int d;
if(n<2)
return 0;
else
{
for(d=2; d*d<=n; d++)
if(n%d==0)
return 0;
}
return 1;

}
int n;
int main()
{
fin>>n;
while(n)
{
if(pr(n)==1)
cout<<n<<" ";
n/=10;
}

return 0;
}
varianta 40

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int test(int a[1001],int nr)
{
int i, ok=1;
if(a[1]%2==0)
for(i=1; i<=nr; i++)
{

if(a[i]>a[i+1])
ok=0;
}
else
for(i=1; i<=nr; i++)
{

if(a[i]<a[i+1])
ok=0;
}
return ok;
}
int n,v[1001],v1[1001],x,nr,nr1;
int main()
{
fin>>n;
nr=nr1=1;
while(fin>>x)
{

if(x%2==0)
v[nr++]=x;
else
v1[nr1++]=x;
}
if(test(v,nr)==1 && test(v1,nr1)==1)
cout<<"DA";
else
cout<<"NU";

return 0;
}
Varianta 41

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int n,v[1001],v1[1001],x,nr,maxa,i,nr1;
int main()
{
fin>>n;
nr=1;
while(fin>>x)
{

if(x>maxa)
maxa=x;
v[nr++]=x;
}
for(i=1;i<=nr;i++)
if(v[i]==maxa)
nr1++;
cout<<maxa<<" "<<nr1;

return 0;
}

Varianta 42

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int n,v[1001],fr[1001],x,nr,maxa,i,nr1;
int main()
{
fin>>n;
nr=1;
while(fin>>x)
{

fr[x]++;
}

for(i=1;i<=99;i++)
if(fr[i]==1)
cout<<i<<" ";

return 0;
}

Varianta 43

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt1");
int n,v[1001],x,nr,maxa,i,aux,j;
int main()
{
fin>>n;
nr=1;
while(fin>>x)
{

v[nr++]=x;
}
for(i=1;i<nr;i++)
for(j=i+1;j<=nr;j++)
if(v[i]<v[j])
{
aux=v[j];
v[j]=v[i];
v[i]=aux;
}
for(i=1;i<nr;i++)
cout<<v[i];

return 0;
}

Varianta 44
subiectul 2
5.#include <iostream>
using namespace std;
int a[24][24],i,j,n;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
a[i][j]=1;
if(i>=2)
for(j=n-i+2;j<=n;j++)
a[i][j]=a[i][j-1]+1;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}
subiectul 3
3.#include <iostream>
#include <math.h>
using namespace std;

void P(int a, int b){

if (a > b){
int aux = a;
a = b;
b = aux;
}

int i;
for (i = a; i <= b; i++) {

if (sqrt(i) != (int)sqrt(i) || i == 1)
continue;
int x = sqrt(i),d,ok = 0;
for (d = 2; d <= sqrt(x) && ok == 0; d++)
if (x % d == 0)
ok = 1;

if (ok == 0)
cout<<i<<" ";
}

int main() {

int a,b;
cin>>a>>b;

P(a,b);

return 0;

}
4.#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt");
int n,x,fr[10];
int main()
{
fin>>n;
while(fin>>x)
{
while(x)
{
fr[x%10]++;
x/=10;
}
}
for(int i=0;i<=9;i++)
if(fr[i]!=0)
cout<<i<<" ";
return 0;

You might also like