public static void Main(string[] args)
{
double A,B,C;
for (int i=1;i<=3;i++)
{
Console.WriteLine(i+"-tenglama uchun: ");
Console.Write("x ning kvadrati oldidagi koeffisentini kiriting: A=");
A=double.Parse(Console.ReadLine());
Console.Write("x ning oldidagi koeffisentini kiriting: B=");
B=double.Parse(Console.ReadLine());
Console.Write("Ozod hadni kiriting: C=");
C=Convert.ToDouble(Console.ReadLine());
Console.WriteLine("Tenglama ildizlari soni: "+RootsCount(A,B,C)+"\n");
}
Console.ReadKey(true);
}
}
}
Natija:
6. S satr berilgan, so’zlar orasida ortiqcha probellar mavjud. Uni shunday
o’zgartirinki, so’zlar o’rtasida bitta probel bo’lsin.
Dasturning blok sxemadagi algoritmi:
Dasturning C# dagi ko’rinishi:
Natija:
Bajardi: Abdumalikov Axmadali Qabul qildi: Sh.Farmonov
Do'stlaringiz bilan baham: |