News of برنامه نویسی کامپیوتر - PC Programming

/* This program is written by
     Arman Jelodar
    IT student of azad university , Mashhad
*/

#include "iostream.h"
#include "conio.h"

void main()
{
    clrscr();
    long float n,n2,x;
    long int y=0,n1,n3,i=0,p;
    cout<<"please enter a number:";
    cin>>n;
    n1=n;   n2=n;
    p=n;
    while(p!=0)
        {
        p=p/10;
        i++;
        }

    while(n2-n1!=0)
    {
        n=n*10;
        n1=n;  n2=n;
    }

    n3=n;
    while(n3!=0)
    {
        y=(y*10)+n3%10;
        n3=n3/10;
    }
    n=y;
    for(int j=1;j<=i;j++)
        n=n/10;

    cout<<n;
    getch();
}

By Arman Jelodar
#include"conio.h"
#include"iostream.h"
#include"stdio.h"

void main()
{


     clrscr();
      int n,m,d,t;
    cout<<" please enter data";
    cout<<"\n\n";
    cout<<"Please enter day:";
    cin>>d;
    cout<<"\n";
    cout<<" Please enter month:";
    cin>>m;
    cout<<"\n";
    if(m<=6 && d>31)
    cout<<"wrong";
    if(m>6 && d>30)
    cout<<"wrong";
    if(m<1 || m>12)
    cout<<"wrong";
    if (m<6)
    d=((m-1)*31)+d;
    if(d==366)
    cout<<"wrong";
    n=(d%7);
    if(n==0)
    cout<<"friday";
    if(n==1)
    cout<<"saturday";
    if(n==2)
    cout<<"sunday";
    if(n==3)
    cout<<"monday";
    if(n==4)
    cout<<"tuesday";
    if(n==5)
    cout<<"wednesday";
    if(n==6)
    cout<<"thurseday";

    getch();

}

// By Arman Jelodar

#include "conio.h"
#include "iostream.h"

void main()
{

    int h1,h2,m1,m2;
    double h,m;
    float t1,t2;

    clrscr();


    cout<<"time aval ra vared konid: \n";
    cin>>h1>>m1;
    cout<<"time dovom ra vared konid: \n";
    cin>>h2>>m2;

    t1=(h1*60)+m1;
    t2=(h2*60)+m2;
    h=(t2-t1)/60;
    m=(h-(int)h)*60;

    h=(int)h;

    cout<<h<<"hour and "<<m<<" minute";
    getch();

}

321
21
1
12
123

#include "iostream.h"
#include "conio.h"


void main()
{
    clrscr();
    int n,i,k;
    cout<<"  \n please enter a number: "; cin>>n; cout<<"\n";
    for(k=0;k<=n-1;k++)
    {
        for(i=n-k;i>=1;i--)
            cout<<i<<" ";
    cout<<"\n";
    }
    for(k=n-2;k>=0;k--)
    {
        for(i=1;i<=n-k;i++)
            cout<<i<<" ";
    cout<<"\n";
    }
    getch();
}

http://parsaspace.com/download.aspx?file=inverse.zip&username=husainjan

Dijkstra(n,L[1..n,1...n]){
t={ }
for i=2 to do
{touch[i]=1
  lenght[i]=L[1,i]
}
repeat n-1 times
{min=bi nahayat
  for i=2 to n do
   if 0<lenght[i]<min
     min=lenght[i] , k=i
  t=tu{(touch[k],k)}
for i=2 to n do
  if lenght [k]+ L[k,i]<lenght[i]
    lenght[i]=lenght[k]+L[k,i] , touch[i]=k
  minLen[k]=lenght[k]
  lenght[k]= -1 //2 bare entekhab nashavad
  }// end of repeat
return t
}