Bun venit pe infoxa.blogspot.com, noul blog special creat pentru o mai bună viziune. Am decis să mut blogul aici, pentru că fostul blog, dlmuresan.blogspot.com tocami şi-a schimbat domeniul de activitate.

Se citeste din "clasa.in" nr de fete si de baieti dintr-o clasa. Sa se afiseze o diagrama corespunzatoare.

#include<iostream>
#include<fstream>
#include<graphics.h>
using namespace std;
int main()
{int u,x,y;
ifstream f("clasa.in");
f>>x>>y;
u=(x*360)/(x+y);
initwindow(1400,900);

setfillstyle(SOLID_FILL,14);
pieslice(100,200,0,u,100);

setfillstyle(SOLID_FILL,4);
pieslice(100,200,u,360,100);

setfillstyle(SOLID_FILL,14);
bar(0,30,30,60);

setfillstyle(SOLID_FILL,4);
bar(0,60,30,90);

outtextxy(0,5,"Legenda");

outtextxy(30,30,"FETE");

outtextxy(30,65,"BAIETI");


getch();
}

1) Cercuri concentrice

#include<graphics.h>
#include<iostream>
using namespace std;
int main()
{ int i;

initwindow(800,600);
for(i=300;i>=10;i=i-10)
{setcolor(rand()%16);
circle (300,300,i);
delay(43);}

getch();
}

2) Elipsa

#include<graphics.h>
#include<iostream>
using namespace std;
int main()
{ int i;
initwindow(1200,1024);

ellipse(500,500,69,256,200,300);

getch();
}

 3) Desen

#include<graphics.h>
#include<iostream>
using namespace std;
int main()
{ int i,j,k,p;
initwindow(1200,1024);

circle(100,100,100);

setfillstyle(WIDE_DOT_FILL,3);
fillellipse(600,100,300,100);

rectangle(20,250,300,750);

setfillstyle(WIDE_DOT_FILL,3);
bar(400,300,1000,500);


getch();
}

1)Citirea si afisarea unei matrici

#include<iostream>
#include<fstream>
using namespace std;
int main()
{int i,j,n,m,a[100][100];
ifstream f("matrice.in");
ofstream g("matrice.out");

f>>n;

for(i=0;i<n;i++)
    for(j=0;j<n;j++)
    f>>a[i][j];

for(i=0;i<n;i++)
{for(j=0;j<n;j++)
    g<<a[i][j]<<" ";
g<<endl;}

}

2) Elementul maxim de pe diagonala secundata

using namespace std;
int main()
{int i,j,n,m,a[100][100],max=0;
ifstream f("matrice.in");
ofstream g("matrice.out");

f>>n;

for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        f>>a[i][j];
   
i=0;j=n-1;
while(i<n && j>=0)
    {if(a[i][j]>max)max=a[i][j];
     i++;j--;}
   
    g<<"Maximul de pe diagonala secundara"<<endl;
    g<<max;

}

3) Elementele de sub diagonala secundara

#include<iostream>
#include<fstream>
using namespace std;
int main()
{int i,j,n,m,a[100][100],max=0;
ifstream f("matrice.in");
ofstream g("matrice.out");

f>>n;

for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        f>>a[i][j];
   
    g<<"Elementele de sub diagonala secundara"<<endl;
   
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        if(i+j>n-1)g<<a[i][j]<<" ";

}

 4) Afisati suma elementelor din vest, est, sud, nord

#include<iostream>
#include<fstream>
using namespace std;
int main()
{int i,j,n,m,a[100][100],s=0;
ifstream f("matrice.in");
ofstream g("matrice.out");
f>>n;
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        f>>a[i][j];
g<<"Suma elementelor din Vest"<<endl;
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        if(i+j<n-1 && i>j){g<<a[i][j]<<" ";s=s+a[i][j];}
g<<"Suma "<<s;g<<endl;

s=0;
g<<"Suma elementelor din Est"<<endl;
        for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        if(i+j>=n && i<j){g<<a[i][j]<<" ";s=s+a[i][j];}
g<<"Suma "<<s;g<<endl;
      
s=0;
g<<"Suma elementelor din Sud"<<endl;
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        if(i+j>=n && i>j){g<<a[i][j]<<" ";s=s+a[i][j];}
g<<"Suma "<<s;g<<endl;
      
s=0;      
g<<"Suma elementelor din Nord"<<endl;
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        if(i+j<n-1 && i<j){g<<a[i][j]<<" ";s=s+a[i][j];}
        g<<"Suma "<<s;
}

 5)Sa se puna intr-un vector elementele din vest.

#include<iostream>
#include<fstream>
using namespace std;
int main()
{int i,j,n,m,a[100][100],s=0,b[100],k=0;
ifstream f("matrice.in");
ofstream g("matrice.out");
f>>n;
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        f>>a[i][j];
g<<"Elemente din Vest"<<endl;
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
        if(i+j<n-1 && i>j){b[k]=a[i][j];k++;}
       
for(i=0;i<k;i++)
    g<<b[i]<<" ";

}

A se descarca fisierele de aici:
DOWNLOAD

1) Sa se inverseze coloanele unei matrici cu n linii si m coloane.Varianta R0il.

#include<iostream>
using namespace std;
int main()
{int n,m,i,j,a[100][100],aux,p=0,k;
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
for(i=0;i<n;i++)
    for(j=0;j<m;j++)
        {cout<<"a["<<i<<"]["<<j<<"]=";cin>>a[i][j];}

for(i=0;i<n;i++)
{k=m-1;
for(j=0;j<m/2;j++)
{aux=a[i][j];
a[i][j]=a[i][k];
a[i][k]=aux;
k--;}
}
       
for(i=0;i<n;i++)
    {cout<<endl;
for(j=0;j<m;j++)
    cout<<a[i][j]<<" ";}
   
}

1)  Varianta proprie

#include<iostream>
using namespace std;
int main()
{int n,m,i,j,a[100][100],aux,p=0,k;
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
for(i=0;i<n;i++)
    for(j=0;j<m;j++)
        {cout<<"a["<<i<<"]["<<j<<"]=";cin>>a[i][j];}

i=0;j=m-1;p=0;
while(i<m/2 && j>=m/2 && p<n)
    {aux=a[p][i];
    a[p][i]=a[p][j];
    a[p][j]=aux;
    i++;j--;
    if(i==j || i>j)
        {p++;i=0;j=m-1;}
    }
       
for(i=0;i<n;i++)
    {cout<<endl;
for(j=0;j<m;j++)
    cout<<a[i][j]<<" ";}
   
}

2) Sa se cauta intr-o matrice un element. Sa se afiseze linia si coloana pe care apare.

#include<iostream>   //
using namespace std;
int main()
{int n,m,i,j,a[100][100],aux,p,k,ok=0;
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
cout<<"p=";cin>>p;
for(i=0;i<n;i++)
    for(j=0;j<m;j++)
        {cout<<"a["<<i<<"]["<<j<<"]=";cin>>a[i][j];}

for(i=0;i<n;i++)
    for(j=0;j<m;j++)
        if(a[i][j]==p)
        {cout<<"linia "<<i<<" coloana "<<j<<endl;ok=1;}
      
if(ok==0)
cout<<"Nu a fost gasit";
}

3)

Sa se afiseze: elementele de pe linia k, elementele de pe coloana t si suma elementelor impare dintr-o matrice patratică de elemente intregi si deneformabile, dar in acelasi timp elastice.

#include<iostream>
using namespace std;
int main()
{int n,i,j,a[100][100],k,s=0,t;
cout<<"n=";cin>>n;
cout<<"k=";cin>>k;
cout<<"t=";cin>>t;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{cout<<"a["<<i<<"]["<<j<<"]=";cin>>a[i][j];}


for(i=0;i<n;i++)
{cout<<endl;
for(j=0;j<n;j++)
cout<<a[i][j]<<" ";}

cout<<endl;
cout<<endl;
cout<<"Elementele de pe linia k"<<endl;

for(j=0;j<n;j++)
cout<<a[k][j]<<" ";

cout<<endl;
cout<<endl;
cout<<"Elementele de pe coloana t"<<endl;
for(i=0;i<n;i++)
cout<<a[i][t]<<" ";
cout<<endl;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(a[i][j]%2==1)s=s+a[i][j];
cout<<endl;
cout<<"Suma imparelor: "<<s;

}

Sa se afiseze: elementele de pe linia k, elementele de pe coloana t si suma elementelor impare dintr-o matrice patratică de elemente intregi si deneformabile, dar in acelasi timp elastice.

#include<iostream>
using namespace std;
int main()
{int n,i,j,a[100][100],k,s=0,t;
cout<<"n=";cin>>n;
cout<<"k=";cin>>k;
cout<<"t=";cin>>t;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{cout<<"a["<<i<<"]["<<j<<"]=";cin>>a[i][j];}


for(i=0;i<n;i++)
{cout<<endl;
for(j=0;j<n;j++)
cout<<a[i][j]<<" ";}

cout<<endl;
cout<<endl;
cout<<"Elementele de pe linia k"<<endl;

for(j=0;j<n;j++)
cout<<a[k][j]<<" ";

cout<<endl;
cout<<endl;
cout<<"Elementele de pe coloana t"<<endl;
for(i=0;i<n;i++)
cout<<a[i][t]<<" ";
cout<<endl;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(a[i][j]%2==1)s=s+a[i][j];
cout<<endl;
cout<<"Suma imparelor: "<<s;

}

#include<iostream>
using namespace std;
int main()
{int n,i,j,a[100][100];
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
    for(j=0;j<n;j++)
    {cout<<"a["<<i<<"]["<<j<<"]=";cin>>a[i][j];}
   
for(i=0;i<n;i++)
    {cout<<endl;
for(j=0;j<n;j++)
    cout<<a[i][j]<<" ";}
   
}

#include<iostream>
using namespace std;
int main()
{int n,ciur[100],i,j;
cout<<"n=";cin>>n;
for(i=0;i<=n;i++)
    ciur[i]=1;
for(i=2;i<=sqrtl(n);i++)
    if(ciur[i]==1)
        for(j=2*i;j<=n;j=j+i)
            ciur[j]=0;
      
for(i=2;i<=n;i++)
    if(ciur[i]==1)cout<<i<<endl;

}

1) Sa se ordoneze elementele pare ale unui vector in ordine crescatoare, iar cele impare in ordine descrescatoare.

#include<iostream>
using namespace std;
int main()
{int n,i,j,a[100],aux;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
{cout<<"a["<<i<<"]=";cin>>a[i];}

for(i=0;i<n;i++)
    for(j=i+1;j<n;j++)
        if(a[i]%2==0 && a[j]%2==0 && a[j]<a[i])
            {aux=a[i];
             a[i]=a[j];
             a[j]=aux;}
       
for(i=0;i<n;i++)
    for(j=i+1;j<n;j++)
        if(a[i]%2==1 && a[j]%2==1 && a[j]>a[i])
            {aux=a[i];
             a[i]=a[j];
             a[j]=aux;}
           
for(i=0;i<n;i++)
    cout<<a[i]<<endl;
return 0;
}

2) Sa se verifice cate perechi de elemente ale unui vector au primul element mai mare decat al doilea, egal cu al doilea, mai mic decat al doilea.

#include<iostream>
using namespace std;
int main()
{int n,i,a[100],p,k,j;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
{cout<<"a["<<i<<"]=";cin>>a[i];}
p=k=j=0;

for(i=0;i<n-1;i++)
{if(a[i]>a[i+1])k++;
if(a[i]<a[i+1])p++;
if(a[i]==a[i+1])j++;}

cout<<k<<" perechi de nr cu prima cifra mai mare "<<endl;
for(i=0;i<n-1;i++)
if(a[i]>a[i+1])
    cout<<a[i]<<";"<<a[i+1]<<endl;

cout<<p<<" perechi de nr cu prima cifra mai mica "<<endl;
for(i=0;i<n-1;i++)
if(a[i]<a[i+1])
    cout<<a[i]<<";"<<a[i+1]<<endl;

cout<<j<<" perechi de nr cu cifrele egale "<<endl;
for(i=0;i<n-1;i++)
if(a[i]==a[i+1])
    cout<<a[i]<<";"<<a[i+1]<<endl;

}

Interclasarea sirurilor

#include<iostream>

using namespace std;

int main()

{int a[100],b[100],c[100],i,j,k,n,m;

cout<<"n=";cin>>n;

cout<<"m=";cin>>m;

for(i=0;i<n;i++)

{cout<<"a["<<i<<"]=";cin>>a[i];}

for(j=0;j<m;j++)

{cout<<"b["<<j<<"]=";cin>>b[j];}

i=0;j=0;k=0;

while(i<n && j<m)

if(a[i]<b[j])

{c[k]=a[i];k++;i++;}

else {c[k]=b[j];k++;j++;}

while(i<n){c[k]=a[i];k++;i++;}

while(j<m){c[k]=b[j];k++;j++;}

for(i=0;i<k;i++)cout<<c[i]<<endl;}

Se citeste un nr mare. Sa se afiseze daca exista cel mai mic nr. care se poate forma din cifrele acestuia si care sa fie mai mare decat nr. initial.

#include<iostream>
using namespace std;
int main()
{int n,i,a[100],aux,poz,j;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
{cout<<"a["<<i<<"]=";cin>>a[i];}

poz=n-1;
while(poz>0 && a[poz-1]>=a[poz])
    poz--;

if(poz==0){cout<<"nu exista";return 0;}

for(j=n-1;j>poz-1;j--)
    if(a[j]>a[poz-1])
        break;
  
aux=a[j];
a[j]=a[poz-1];
a[poz-1]=aux;

for(i=poz;i<=(n-1+poz)/2;i++)
{aux=a[i];
a[i]=a[poz+n-1-i];
a[poz+n-1-i]=aux;}

for(i=0;i<n;i++)
    cout<<a[i]<<" ";

}

2) Generarea permutarilor sirului {1,2,3,4}

#include<iostream>
using namespace std;
int main()
{int n,i,a[100],aux,poz,j;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
a[i]=i+1;
for(i=0;i<n;i++)
    cout<<a[i]<<" ";
cout<<endl;
while (1)
{   
poz=n-1;
while(poz>0 && a[poz-1]>=a[poz])
    poz--;

if(poz==0)return 0;

for(j=n-1;j>poz-1;j--)
    if(a[j]>a[poz-1])
        break;
   
aux=a[j];
a[j]=a[poz-1];
a[poz-1]=aux;

for(i=poz;i<=(n-1+poz)/2;i++)
{aux=a[i];
a[i]=a[poz+n-1-i];
a[poz+n-1-i]=aux;}
for(i=0;i<n;i++)
    cout<<a[i]<<" ";
cout<<endl;
}
}

Căutarea informaţiilor pe internet - TIC

A se descărca documentul Word de aici:
http://www.megaupload.com/?d=06EGE486
sau
http://dl.fisier.ro/files/gg5ec2g4apfgekp/Cautarea_informatiilor_pe_internet.doc.html

Sortare prin interschimbare

#include<iostream>
using namespace std;
int main()
{int a[100],n,i,j,aux;
cout<<"n=";cin>>n;
for(i=0;i<n;i++){cout<<"a["<<i<<"]=";cin>>a[i];}
for(i=0;i<n;i++)
    for(j=i+1;j<n;j++)
        if(a[i]>a[j])
            {aux=a[i];
            a[i]=a[j];
            a[j]=aux;}
for(i=0;i<n;i++)cout<<a[i]<<endl;
}

1) Se citeste un nr mare. sa se afiseze nr max format din cifrele lui
#include<iostream>


using namespace std;

int main()

{int n,i,a[100],aux,ordonat=0,p;



cout<<"n=";cin>>n;



for(i=0;i<n;i++)

{cout<<"p=";cin>>p;a[i]=p;}



do{ordonat=1;

for(i=0;i<n-1;i++)

if(a[i]<a[i+1]){aux=a[i];

a[i]=a[i+1];

a[i+1]=aux;

ordonat=0;}}

while(ordonat==0);

cout<<endl;

for(i=0;i<n;i++)cout<<a[i];



}

2) Cel mai mic nr care se poate forma

#include<iostream>


using namespace std;

int main()

{int ok,k,n,i,a[100],aux,ordonat=0,p;

cout<<"n=";cin>>n;

for(i=0;i<n;i++)

{cout<<"a["<<i<<"]=";cin>>a[i];}



do{ordonat=1;

for(i=0;i<n-1;i++)

if(a[i]>a[i+1]){aux=a[i];

a[i]=a[i+1];

a[i+1]=aux;

ordonat=0;}}

while(ordonat==0);



if(a[0]==0)ok=1;



if(ok)

for(i=0;i<n;i++)

if(a[i]!=0){k=i;break;}



aux=a[k];a[k]=a[0];a[0]=aux;



for(i=0;i<n;i++)

cout<<a[i];



}

1)2 copii

        #include<iostream>

        using namespace std;

     int main()

        {int a[100],b[100],n,i,aux,p=0,k=0,ordonat=0;

        cout<<"n=";cin>>n;

        for(i=0;i<n;i++)

        {cout<<"a["<<i<<"]=";cin>>a[i];}

        for(i=0;i<n;i++)

        {cout<<"b["<<i<<"]=";cin>>b[i];}

        do{ordonat=1;

        for(i=0;i<n-1;i++)

        if(a[i]>a[i+1]){aux=a[i];

        a[i]=a[i+1];

        a[i+1]=aux;

        k++;

        ordonat=0;}}

        while(ordonat==0);

        do{ordonat=1;

        for(i=0;i<n-1;i++)

        if(b[i]>b[i+1]){aux=b[i];

        b[i]=b[i+1];

        b[i+1]=aux;

        p++;

        ordonat=0;}}

        while(ordonat==0);

        cout<<k<<";"<<p<<endl;

        if(k>p)cout<<"al doilea castiga";

        if(p>k)cout<<"primul castiga";ator p

        if(k==p)cout<<"=";

        }

 
 
 
2)
Sa se ordoneze un sir: crescator pana la jumatate, descrescator de la jumatate
 
 
#include<iostream> //


using namespace std;

int main()

{int a[100],n,i,aux,ordonat=0;



cout<<"n=";cin>>n;



for(i=0;i<n;i++)

{cout<<"a["<<i<<"]=";cin>>a[i];}



do{ordonat=1;

for(i=0;i<n/2-1;i++)

if(a[i]>a[i+1]){aux=a[i];

a[i]=a[i+1];

a[i+1]=aux;

ordonat=0;}}

while(ordonat==0);



do{ordonat=1;

for(i=n/2;i<n-1;i++)

if(a[i]<a[i+1]){aux=a[i];

a[i]=a[i+1];

a[i+1]=aux;

ordonat=0;}}

while(ordonat==0);



for(i=0;i<n;i++)cout<<a[i]<<endl;

}


3)
Sa se ordoneze un sir crescator dupa suma cifrelor elementelor

#include<iostream>


using namespace std;

int main()

{int a[100],n,i,p,aux,ordonat=0,b[100]={0};

cout<<"n=";cin>>n;

for(i=0;i<n;i++)

{cout<<"a["<<i<<"]=";cin>>a[i];}



for(i=0;i<n;i++)

{p=a[i];

while(p){b[i]=b[i]+p%10;

p=p/10;}}



do{ordonat=1;

for(i=0;i<n-1;i++)

if(b[i]>b[i+1]){aux=a[i];

a[i]=a[i+1];

a[i+1]=aux;

aux=b[i];

b[i]=b[i+1];

b[i+1]=aux;

ordonat=0;}}

while(ordonat==0);



for(i=0;i<n;i++)cout<<a[i]<<endl;



}

http://www.megaupload.com/?d=KUIR0LG1
http://www.turboupload.com/54s0y508o1cs/Template.rar.html
http://rapidshare.com/files/375087711/Template.rar.html
http://d01.megashares.com/index.php?d01=AGK4GEJ
http://dl.fisier.ro/files/da5brbmncbkim2k/Template.rar.html
http://www.yourfilelink.com/get.php?fid=540102

Varianta "do...while" 

#include<iostream>
using namespace std;
int main()
{int a[100],n,i,aux,ordonat=0;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
{cout<<"a["<<i<<"]=";cin>>a[i];}
do{ordonat=1;
    for(i=0;i<n-1;i++)
        if(a[i]>a[i+1])
            {aux=a[i];
             a[i]=a[i+1];
             a[i+1]=aux;
             ordonat=0;}
    }
while(ordonat==0);
for(i=0;i<n;i++)cout<<a[i]<<endl;
return 0;
}

Varianta "while"

#include<iostream>
using namespace std;
int main()
{int a[100],n,i,aux,ordonat=0;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
{cout<<"a["<<i<<"]=";cin>>a[i];}
while(ordonat==0)
    {ordonat=1;
    for(i=0;i<n-1;i++)
        if(a[i]>a[i+1])
            {aux=a[i];
             a[i]=a[i+1];
             a[i+1]=aux;
             ordonat=0;}
    }
for(i=0;i<n;i++)cout<<a[i]<<endl;
return 0;
  }

Varianta R0il

#include<iostream>
using namespace std;
int main()
{int a[100],n,i;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
{cout<<"a["<<i<<"]=";cin>>a[i];}
sort(a,n+a);
for(i=0;i<n;i++)cout<<a[i]<<endl;
return 0;
}

Joc geografie
http://www.minijuegosgratis.com/juegos/hwdykyworld/hwdykyworld.html

Impossible Quiz 1
http://www.addictinggames.com/theimpossiblequiz.html
Impossible Quiz 2
http://www.addictinggames.com/theimpossiblequiz2.html

Impossible Quizz 1 Answers
http://www.dabontv.com/game382cheats.html
Impossible Quizz 2 Answers
http://www.dabontv.com/impossiblequiz2answers.html

Ghicitor:
http://en.akinator.com/#

Pian:
http://virtualpiano.net/

Coduri HTML

Bun venit pe infoxa.blogspot.com, noul blog special creat pentru o mai bună viziune. Am decis să mut blogul aici, pentru că fostul blog, dlmuresan.blogspot.com tocami şi-a schimbat domeniul de activitate.

Nu uitaţi să mai daţi câte un click pe reclame, din când în când.