#include<iostream>
using namespace std;
int palin(int i)
{
int isalv=i, iinv=0;
while(i)
{
iinv=iinv*10+i%10;
i=i/10;
}
return isalv==iinv;
}
main()
{
int m, n, i;
cout<<"m="; cin>>m;
cout<<"n="; cin>>n;
for(i=m;i<n;i++)
if (palin(i)) cout<<i<<endl;
return 0;
}
Algoritmi in C++
joi, 3 ianuarie 2013
joi, 22 noiembrie 2012
Numar oglindit (Subprogram)
Oglindit(Subprogram)
#include<iostream>
using namespace std;
int oglindit(int x)
{int xogl=0,uc;
while(x){
uc=x%10;
xogl=xogl*10+uc;
x/=10;}
return xogl;}
int main (){
int n;
cout<<"n=";
cin>>n;
cout<<"oglinditul este:"<<" "<<oglindit(n);
return 0;}
#include<iostream>
using namespace std;
int oglindit(int x)
{int xogl=0,uc;
while(x){
uc=x%10;
xogl=xogl*10+uc;
x/=10;}
return xogl;}
int main (){
int n;
cout<<"n=";
cin>>n;
cout<<"oglinditul este:"<<" "<<oglindit(n);
return 0;}
vineri, 9 noiembrie 2012
Variabila de tip elev cu vectori
#include<iostream>
#include<fstream>
using namespace std;
int main(){
struct elev{
char nume[20],prenume[20];
int nota1,nota2,nota3;
float media;
};
elev v[100];
int n=2;
ifstream f("Variabila cu vectori.IN");
ofstream g("Variabila cu vectori.OUT");
for(int i=1;i<=n;i++){
f>>v[i].nume;
f>>v[i].prenume;
f>>v[i].nota1;
f>>v[i].nota2;
f>>v[i].nota3;
g<<"Elevul: "<<v[i].nume<<" "<<v[i].prenume<<endl<<"Nota1: "<<v[i].nota1<<endl<<"Nota2: "<<v[i].nota2<<endl<<"Nota3: "<<v[i].nota3;
g<<endl<<"Media: "<<(v[i].nota1+v[i].nota2+v[i].nota3)/3.0<<endl<<endl;
}
return 0;
}
#include<fstream>
using namespace std;
int main(){
struct elev{
char nume[20],prenume[20];
int nota1,nota2,nota3;
float media;
};
elev v[100];
int n=2;
ifstream f("Variabila cu vectori.IN");
ofstream g("Variabila cu vectori.OUT");
for(int i=1;i<=n;i++){
f>>v[i].nume;
f>>v[i].prenume;
f>>v[i].nota1;
f>>v[i].nota2;
f>>v[i].nota3;
g<<"Elevul: "<<v[i].nume<<" "<<v[i].prenume<<endl<<"Nota1: "<<v[i].nota1<<endl<<"Nota2: "<<v[i].nota2<<endl<<"Nota3: "<<v[i].nota3;
g<<endl<<"Media: "<<(v[i].nota1+v[i].nota2+v[i].nota3)/3.0<<endl<<endl;
}
return 0;
}
joi, 11 octombrie 2012
Stergere coloana dintr-o matrice
#include <fstream>
using namespace std;
int main()
{
int n, m, l, a[100][100], i, j, c;
ifstream f("mat.IN");
f >> l >> c >> n >> m;
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
f >> a[i][j];
}
}
f.close();
ofstream g("mat.out");
g << "Afisarea normala a matricei:\n\n";
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
g << a[i][j] << " ";
}
g << endl;
}
g << "\n\nMatricea finala:";
for(i = l + 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
a[i-1][j] = a[i][j];
}
g << endl;
}
n--;
for(i = 1; i <= n; i++) {
for(j = c + 1; j <= m; j++) {
a[i][j-1] = a[i][j];
}
}
m--;
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
g << a[i][j] << " ";
}
g<< endl;
}
for(i = 1; i <= n; i++) {
for(j = c + 1; j <= m; j++) {
a[i][j-1] = a[i][j];
}
}
return 0;
}
using namespace std;
int main()
{
int n, m, l, a[100][100], i, j, c;
ifstream f("mat.IN");
f >> l >> c >> n >> m;
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
f >> a[i][j];
}
}
f.close();
ofstream g("mat.out");
g << "Afisarea normala a matricei:\n\n";
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
g << a[i][j] << " ";
}
g << endl;
}
g << "\n\nMatricea finala:";
for(i = l + 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
a[i-1][j] = a[i][j];
}
g << endl;
}
n--;
for(i = 1; i <= n; i++) {
for(j = c + 1; j <= m; j++) {
a[i][j-1] = a[i][j];
}
}
m--;
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
g << a[i][j] << " ";
}
g<< endl;
}
for(i = 1; i <= n; i++) {
for(j = c + 1; j <= m; j++) {
a[i][j-1] = a[i][j];
}
}
return 0;
}
marți, 9 octombrie 2012
Rotire in toate directiile matrice
Rotire in toate directiile matrice
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a[50][50],b[50][50],n,m,i,j;
ifstream f("mat.IN");
f>>m>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>a[i][j];
f.close();
ofstream g("mat.OUT");
g<<"rotire 90 st:"<<" ";
g<<endl;
for(i=1; i<=m;++i)
for(j=1; j<=m; j++)
b[i][j]=a[m+1-j][i];
for(i=1;i<=m;++i){
for(j=1;j<=n;++j)
g<<b[i][j]<<" ";
g<<endl;}
g<<"rotire 90 dr:"<<" ";
g<<endl;
for(i=1; i<=m;++i)
for(j=1; j<=m; j++)
b[i][j]=a[j][m+1-i];
for(i=1;i<=m;++i){
for(j=1;j<=n;++j)
g<<b[i][j]<<" ";
g<<endl;}
g<<"rotire 180"<<" ";
g<<endl;
for(i=1; i<=m;++i)
for(j=1; j<=m; j++)
b[i][j]=a[n+1-i][j];
for(i=1;i<=m;++i){
for(j=1;j<=n;++j)
g<<b[i][j]<<" ";
g<<endl;}
g.close();
return 0;
}
Spirala
Spirala
#include<iostream>
#include<fstream>
using namespace std;
int main(){
int a[50][50],i,k,j,n,m;
ifstream f("spirala.IN");
f>>n;
f>>k;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
f>>a[i][j];
f.close();
ofstream g("spirala.OUT");
g<<a[i][j];
g<<endl;
f>>a[i][j];
}
for(k=1;k<=n/2+1;k++)
for(i=k;i<=n-k+1;i++){
g<<a[k][i]<<endl;
for(i=k+1;i<=n-k+1;i++)
g<<a[n-k+1][i]<<endl;
for(i=n-k;i>=k+1;i++)
g<<a[n-k+1][i]<<endl;
for(i=n-k;i>=k+1;i++)
g<<a[i][k]<<endl;
}
return 0;
}
#include<iostream>
#include<fstream>
using namespace std;
int main(){
int a[50][50],i,k,j,n,m;
ifstream f("spirala.IN");
f>>n;
f>>k;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
f>>a[i][j];
f.close();
ofstream g("spirala.OUT");
g<<a[i][j];
g<<endl;
f>>a[i][j];
}
for(k=1;k<=n/2+1;k++)
for(i=k;i<=n-k+1;i++){
g<<a[k][i]<<endl;
for(i=k+1;i<=n-k+1;i++)
g<<a[n-k+1][i]<<endl;
for(i=n-k;i>=k+1;i++)
g<<a[n-k+1][i]<<endl;
for(i=n-k;i>=k+1;i++)
g<<a[i][k]<<endl;
}
return 0;
}
Triunghiuri sau zone delimitate de diagonale
Triunghiuri sau zone delimitate de diagonale
#include<iostream>
#include<fstream>
using namespace std;
int main(){
int a[50][50],i,j,n,p,m=i,gasit;
ifstream f("zone.IN");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
ofstream g("zone.OUT");
g<<"triunghiul inf. diag, princ.este ";
g<<endl;
for(i=1;i<=n;++i){
g<<endl;
for(j=1;j<=n;++j)
if(i>j)
g<<a[i][j]<<" ";
else g<<" ";
if(a[i][j]==p) gasit=1;
}
g<<"triunghiul inf. diag, sec.este ";
g<<endl;
for(i=1;i<=n;++i){
g<<endl;
for(j=1;j<=n;++j)
if(j>i)
g<<a[i][j]<<" ";
else g<<" ";
if(a[i][j]==p) gasit=2;
}
return 0;
}
Abonați-vă la:
Postări (Atom)