u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
#include <iostream>
using namespace std;
int main()
{
int x=2, y;
y=(x<1) ? (4*x*x+2*x-4) : (6*x-3);
cout << "Vlera e variabls y="
<< y
<< endl;
system("Pause");
return 0;
}
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
( )
#include<iostream >
#include <math.h>
using namespace std;
int main()
{
int i,m,n;
double s=0,y;
cout << "Vlera e m=";
cin >> m;
cout << "Vlera e n=";
cin >> n;
for (i=1;i<=m+n;i++)
{
if (i==3) continue;
s=s+(4*m-n*i);
}
y = 2*(pow(m,4.)) + (n*s)/2;
cout << "Vlera e y ="
<< y
<< "\n\n";
system("pause");
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
[( ) ]
#include <iostream>
using namespace std;
int main()
{
int n,i;
double x,y, F, S;
cout <<"Jep vlerat e x= ";
cin>>x;
cout <<"Jep vlerat e n= ";
cin>>n;
F=1;
for (i=1;i<=n+2;i++)
F=F*i;
S=0;
for (i=1;i<=n;i++)
S=S+(F+2*i);
y=4*pow((x+1),2)-2*S;
cout <<"Vlera e funksionit y="
<<y
<<"\n\n";
system("pause");
return 0;
}
64. T shkruhet programi pr llogaritjen e vlers s funksionit t dhn
duke prdorur unazn for nse dihen vlerat e n dhe x.
( )
[( )
()
#include <iostream>
using namespace std;
int main()
{
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
{
( )
#include <iostream>
using namespace std;
int main()
{
int const n=5,
x=-2;
int i,j;
double s,A[n];
for (i=0;i<n;i++)
{
s=0;
if (x<0)
{
for (j=1;j<=i;j++)
s=s+pow((i+j),2.);
A[i]=-(x*s);
}
else
{
A[i]=x*x;
}
cout << "A["
<< I << "]="
<< A[i] << "\n";
}
system ("pause");
return 0;
}
85. T sortohen antart e vektorit A(m) sipas vlers absolute duke filluar
prej antarit me vler m t madhe kah antari me vler me t vogl
A[m]={5,1,-12,-5,16, 8,-16}, nse m=10.
#include <iostream>
using namespace std;
int main()
{
int const n=5;
int A[n]={5,1,12,-5,16},i,j,b;
for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
{
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
u
e
z
{
( )
#include <iostream>
using namespace std;
int main()
{
int const n=5,
x=-2;
int i,j;
double s,A[n];
for (i=0;i<n;i++)
{
s=0;
if (x<0)
{
for (j=1;j<=i;j++)
s=s+pow((i+j),2.);
A[i]=-(x*s);
}
else
{
A[i]=x*x;
}
cout << "A["
<< I << "]="
<< A[i] << "\n";
}
system ("pause");
return 0;
}
92. T sortohen antart e vektorit A(m) sipas vlers absolute duke filluar
prej antarit me vler m t madhe kah antari me vler me t vogl
A[m]={5,1,-12,-5,16, 8,-16}, nse m=10.
#include <iostream>
using namespace std;
int main()
{
int const n=5;
int A[n]={5,1,12,-5,16},i,j,b;
for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
{
if (abs(A[i])<=abs(A[j]))
{
b=A[i];
A[i]=A[j];
A[j]=b;
}
else
{
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
u
e
z
{
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
const int m=8;
int i,j,a[m][m];
double s=0, p=1;
cout<<"Matrica e formuar a["<<m <<"]["<<m<<"]\n";
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if (i==j)
{
a[i][j]=2*i+1;
cout<<setw(4)<<a[i][j];
}
else
if (i<j)
{
a[i][j]=-2;
s=s+abs(a[i][j]);
www.e-Libraria.com
v
e
h
b
u
e
z
{
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
const int m=8;
int i,j,a[m][m];
double s=0, p=1;
cout<<"Matrica e formuar a["<<m <<"]["<<m<<"]\n";
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if (i==j)
{
a[i][j]=i+j;
cout<<setw(4)<<a[i][j];
if (i%2==0 && j%2==0)
{
s=s+a[i][j];
}
else
{
p=p*a[i][j];
}
}
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
{
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
const int m=8;
int i,j,a[m][m];
double s=0, p=1;
cout<<"Matrica e formuar a["<<m <<"]["<<m<<"]\n";
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if (i==j)
{
a[i][j]=2*i+1;
cout<<setw(4)<<a[i][j];
}
else
if (i<j)
{
a[i][j]=-2;
s=s+abs(a[i][j]);
cout<<setw(4)<<a[i][j];
}
else
{
a[i][j]=2;
p=p*a[i][j];
cout<<setw(4)<<a[i][j];
}
}
cout<<endl;
}
cout<<"\nShuma absolute e anetareve mbi digonale s=" <<s <<"\n"
www.e-Libraria.com
v
e
h
b
u
e
z
{
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
const int m=8;
int i,j,a[m][m];
double s=0, p=1;
cout<<"Matrica e formuar a["<<m <<"]["<<m<<"]\n";
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if (i==j)
{
a[i][j]=i+j;
cout<<setw(4)<<a[i][j];
if (i%2==0 && j%2==0)
{
s=s+a[i][j];
}
else
{
p=p*a[i][j];
}
}
else
if (i<j)
{
a[i][j]=i;
cout<<setw(4)<<a[i][j];
}
else
{
a[i][j]=i-j;
cout<<setw(4)<<a[i][j];
}
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
)
#include<iostream>
using namespace std;
double vellimi;
const double pi=3.14159265359;
double cilindri(float rrezja, float lartesia)
{
double siperfaqja;
siperfaqja = 2 * pi * rrezja * (rrezja + lartesia);
vellimi = pi * rrezja * rrezja * lartesia; //vellimi sht ruajtur n variabl
globale
return siperfaqja;
}
int main()
{
float r,l;
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
c.
d.
11. Ligji i Njutonit thot q forca F midis dy trupave M1 dhe M2 sht
(
)
ku k sht konstanta e gravitetit dhe d sht distanca ndrmjet
trupave. Vlera e prafrt e konstantes k sht 6.67 x 10
-18
cm
2
/g
2
.
T shkruhet programi pr llogaritjen e forcs, nse dihen masat e
trupave dhe distanca n mes tyre.
www.e-Libraria.com
v
e
h
b
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
u
e
z
.
www.e-Libraria.com
v
e
h
b
u
e
z