Orar semigroup #2

Orar semigroup #2

Salut!

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.

vineri, 9 iulie 2010 by DlMuresan
Categories: | Leave a comment

Tema Grafica

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();
}

by DlMuresan
Categories: , | Leave a comment

Grafica

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();
}

by DlMuresan
Categories: , | Leave a comment

26 mai - citire din fisier

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]<<" ";

}

by DlMuresan
Categories: , , | Leave a comment

Dl Muresan Websites

A se descarca fisierele de aici:
DOWNLOAD

by DlMuresan
Categories: , | Leave a comment