#include <stdio.h>
#include <math.h>
#include <iostream>

using namespace std;

int main()
{
double a,y;
scanf("%lf", &a );

if (a<=-1)
{
y=1/(a*a);

}
if (a>-1 and a<=2)
{
y=a*a;

} if (a>2)
{
y=4;

}
printf("%.2f",y);
return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
double a,b,c;
cin>>a>>b>>c;
if(a!=0 && (b*b)-(4*a*c)>=0)
{
printf("%.2f ",((-b)+(sqrt((b*b)-(4*a*c))))/(2.0*a));
printf("%.2f",((-b)-(sqrt((b*b)-(4*a*c))))/(2.0*a));
}
else
{
if(a!=0 &&(b*b)-(4*a*c)<0 )
cout<<"NO";
}
return 0;
}

#include <iostream>

using namespace std;

int main()
{
int n,m;
cin>>n>>m;
int a[n+1][m+1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
cin>>a[i][j];
}
}

int b[n+1];
for(int i=1; i<=n; i++)
{
b[i]=0;
for(int j=1; j<=m; j++)
b[i]=b[i]+a[i][j];
}

for(int i=1; i<=n; i++)
cout<<b[i]<<" ";

int max = a[1][1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if (max<a[i][j])
max = a[i][j];
}
}

int min = a[1][1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if (min>a[i][j])
min = a[i][j];
}
}
cout<<endl<<max<<" "<<min;
return 0;
}

#include <stdio.h>
#include <math.h>
#include <iostream>

using namespace std;

int main()
{
double a,y;
scanf("%lf", &a );

if (a<=0)
{
y=fabs(a+1);

}
if (a>0)
{
y=fabs(a-1);

}
printf("%.2f",y);
return 0;
}

#include <stdio.h>
#include <math.h>
#include <iostream>

using namespace std;

int main()
{
double a,y;
scanf("%lf", &a );

if (a<1)
{
y=fabs(a);

}
if (a>=1 and a<=2)
{
y=1;

} if (a>2)
{
y=-2*a+5;

}
printf("%.2f",y);
return 0;
}

#include <stdio.h>
#include <math.h>
#include <iostream>

using namespace std;

int main()
{
double x,y;
scanf("%lf", &x);

if ((y<=3*x+2) && (y<=-3*x+2) && (y>=-1))
{
cout<<"yes";

} else

cout<<"no";
return 0;
}

47-masala "Tarmoqlanuvchi17" grafigi

130-masala "Matritsa1"

1—299 gacha bo'lan algo.ubtuit.uz saytining misollari bularni ishlab borishni unutmag 👆 vaqtingizni bekor sarflamang. https://t.me/algo_with_mirshodbek

C++ dasturlash bo'yicha Maruzalar to'plami. O'qib o'rganishning erta-kechi bo'lmaydi .
👉 @algo_with_mirshodbek 👈
Bizning kanaldan aslo yiroqlashmang.☝️☝️☝️

👨🏻‍💻Dasturchilar uchun juda foydali saytlar:

1. www.codecademy.com
2. www.lynda.com
3. www.udemy.com
4. www.udacity.com
5. www.coursera.org
6. www.w3schools.com
7. www.thenewboston.org
8. www.programmr.com
9. www.codeavengers.com
10. www.codeschool.com
11. www.learnstreet.com
12. www.teamtreehouse.com
13. www.sqlzoo.net
14. www.codehs.com
15. www.teamtreehouse.com
16. www.html5rocks.com
17. www.codepen.io
18. www.sitepoint.com
19. www.tutorialspoint.com
20. www.javatpoint.com
21. www.cplusplus.com
22. www.learncpp.com
23. www.tutorialspoint.com
24. www.cprogramming.com
25. www.stackoverflow.com
26. www.learncodethehardway.org
27. www.bloc.io
28. www.howtocode.io
29. www.edx.org
30. www.instructables.com
31. www.developer.apple.com
32. www.developer.android.com
33. www.developers.google.com
34. www.developer.mozilla.org
35. www.msdn.microsoft.com
36. www.decompera.com
37. www.www.developphp.com
38. www.quackit.com
39. www.htmlite.com
40. www.siteduzero.com
41. www.dreamincode.net
42. www.phpbuddy.com
43. www.php.net
44. www.microsoftvirtualacademy.com
45. www.professormesser.com

➤ @algo_with_mirshodbek - Biz bilan kelajak kasbini o'rganing!

131-masala "Matritsa2"

132-masala "Matritsa3"

#include <iostream>

using namespace std;

int main()
{
int n,m,l;
cin>>l;
int a[1000];
for(int i=1; i<=l; i++)
cin>>a[i];

cin>>n>>m;

int k=0;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if (l>k)
cout<<a[++k]<<" ";
else
cout<<"0 ";
}
cout<<endl;
}
return 0;
}

133-masala "Matritsa4"

#include <iostream>
#include <math.h>
#include <stdio.h>

using namespace std;

int main()
{
int n;
cin>>n;
int a[n+1][n+1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
cin>>a[i][j];
}
}

int b[n+1][n+1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
cin>>b[i][j];
}
}

int c[n][2*n];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
c[i][j]=a[i][j];
}
}

for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
c[i][j+n]=b[i][j];
}
}

for(int i=1; i<=n; i++)
{
for(int j=1; j<=2*n; j++)
{
cout<<c[i][j]<<" ";
}
cout<<endl;
}

return 0;
}

#include <iostream>

using namespace std;

int main()
{
int n,m;
cin>>n>>m;
int a[n+1][m+1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
cin>>a[i][j];
}
}

int b[m+1],s;
for(int j=1; j<=m; j++)
{
s=0;
for(int i=1; i<=n; i++)
s = s + a[i][j];
b[j]=s;
}

for(int j=1; j<=m; j++)
cout<<b[j]<<" ";

int max = a[1][1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if (max<a[i][j])
max = a[i][j];
}
}

int min = a[1][1];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if (min>a[i][j])
min = a[i][j];
}
}
cout<<endl<<max<<" "<<min;
return 0;
}