Sei sulla pagina 1di 4

http://www.youtube.com/watch?

NR=1&v=bRNCrAvf6uo&feature=endscreen
vectori: viteza/acceleratie
problema
http://www.youtube.com/watch?v=e2-SZ593Uno
fizica about bungee jumping
http://www.youtube.com/watch?v=FhopiDA43bs
experiment
http://www.youtube.com/watch?v=zG22qQydPVQ
http://dare.uva.nl/document/215150
prob
http://www.chegg.com/homework-help/questions-and-answers/620-kg-bungee-jumper-standing-atallplatform-h0-460-m-indicated-inthe-figure-bungee-cord-u-q466304

a1
int main()
{
int a[100][100],i,j,n,m,max=-999,s=0;
cout<<"nr linii";
cin>>m;
cout<<"nr coloane";
cin>>n;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
cout<<"dati componenta de pe linia"<<i;
cin>>a[i][j];
}
}
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)
s=s+a[i][j];
if(i+j==n+1&& a[i][j]>max)
max=a[i][j];
}
}
cout<<"suma cautata este"<<s<<"\n";
cout<<"elem cel mai mare este"<<max;
return 1;
}
Problema 3
int main()
{
int a[100][100],i,j,n,m,min=99999;
cout<<"nr linii";
cin>>m;
cout<<"nr coloane";
cin>>n;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
cout<<"dati componenta de pe linia"<<i;
cin>>a[i][j];
}
}
for(i=1;i<=m;i++)
{
for(j=1;j<=n/2;j++)
{
if(j>i && j+i<n+1)
{
if(a[i][j]<min)
min=a[i][j];

}
}
}
cout<<"minimul este"<<min;
return 1;
}

Pr. 2
int main()
{
int a[100][100],i,j,n,m,v=0,p;
cout<<"nr linii";
cin>>m;
cout<<"nr coloane";
cin>>n;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
cout<<"dati componenta de pe linia"<<i;
cin>>a[i][j];
}
}
for(i=1;i<=m && v==0;i++)
{
for(j=1;j<=n && v==0;j++)
{
if(i==j && i+j==n+1)
{
v=1;
p=a[i][j];
}
}
}
if(v==1)
cout<<"elem de intersectie este"<<m;
else
cout<<"cum matricea are un nr par de linii si coloane nu avem elem de intersectie";
return 1;
}

Problema 4
int main()
{
int a[100][100],i,j,n,m,c,s=0,div,v=1;
cout<<"nr linii";
cin>>m;
cout<<"nr coloane";
cin>>n;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
cout<<"dati componenta de pe linia"<<i;
cin>>a[i][j];
}
}
for(i=m/2;i<=m;i++)
{
for(j=1;j<=n;j++)
{
if(i+j>n+1 && j>i)
v[c++]=a[i];
}
}
for(i=1;i<=c;i++)
{
v=1;
for(div=2;div<a[i] && v==1;div++)
{
if (a[i]%div==0)
v=0;
}
if(v==1)
s=s+a[i];
}
cout<<"suma este"<<s;
return 1;
}

Potrebbero piacerti anche