1.02K subscribers
1.77K photos
420 videos
676 files
3.85K links
Download Telegram
Forwarded from Programmers Portfolio
BMI Calculator.apk
3.9 MB
5🤩1
#savol_34

#javob_34
Java dasturlash tilida

public
static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("x = ");
int x = scanner.nextInt();
System.out.print("y = ");
int y = scanner.nextInt();
boolean oq = (x + y) % 2 == 1;
System.out.println(oq);
}

Telegram | Viktorina bot | Youtube
👍1
#savol_35

#javob_35
Java dasturlash tilida

public
static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("x1 = ");
int x1 = scanner.nextInt();
System.out.print("y1 = ");
int y1 = scanner.nextInt();
System.out.print("x2 = ");
int x2 = scanner.nextInt();
System.out.print("y2 = ");
int y2 = scanner.nextInt();
boolean birXil = (((x1 + y1) % 2 == 1) && ((x2 + y2) % 2 == 1)) ||
(((x1 + y1) % 2 == 0) && ((x2 + y2) % 2 == 0));
System.out.println(birXil);
}

Telegram | Viktorina bot | Youtube
👍1
#savol_36

#javob_36
Java dasturlash tilida

public
static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("x1 = ");
int x1 = scanner.nextInt();
System.out.print("y1 = ");
int y1 = scanner.nextInt();
System.out.print("x2 = ");
int x2 = scanner.nextInt();
System.out.print("y2 = ");
int y2 = scanner.nextInt();
boolean ruh = ((x1 == x2) || (y1 == y2));
System.out.println(ruh);
}

Telegram | Viktorina bot | Youtube
#savol_37

#javob_37
Java dasturlash tilida

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("x1 = ");
int x1 = scanner.nextInt();
System.out.print("y1 = ");
int y1 = scanner.nextInt();
System.out.print("x2 = ");
int x2 = scanner.nextInt();
System.out.print("y2 = ");
int y2 = scanner.nextInt();
boolean shox = ((x1 == x2 - 1) && (y1 == y2 + 1)) ||
((x1 == x2) && (y1 == y2 + 1)) ||
((x1 == x2 + 1) && (y1 == y2 + 1)) ||
((x1 == x2 - 1) && (y1 == y2)) ||
((x1 == x2 + 1) && (y1 == y2)) ||
((x1 == x2 - 1) && (y1 == y2 - 1)) ||
((x1 == x2) && (y1 == y2 - 1)) ||
((x1 == x2 + 1) && (y1 == y2 - 1));
System.out.println(shox);
}

Telegram | Viktorina bot | Youtube
3
#savol_cpp_integer_7

#javob_cpp_integer_7

#include <iostream>
using namespace std;
int main(){
int a, b, onlar, birlar, yigindisi;
cout << "a = ";
cin >> a;
onlar = a / 10;
birlar = a % 10;
yigindisi = onlar + birlar;
cout << "O'nliklar xonasidagi son = " << onlar << endl;
cout << "Birliklar xonasidagi son = " << birlar << endl;
cout << "Ularning yig'indisi = " << yigindisi;
}

Telegram | Viktorina bot | YouTube
🤩41🔥1🎉1
👍2
#savol_38

#javob_38
Java dasturlash tilida

public
static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("x1 = ");
int x1 = scanner.nextInt();
System.out.print("y1 = ");
int y1 = scanner.nextInt();
System.out.print("x2 = ");
int x2 = scanner.nextInt();
System.out.print("y2 = ");
int y2 = scanner.nextInt();
boolean fil = ((Math.abs(x1 - x2)) == (Math.abs(y1 - y2)));
System.out.println(fil);
}

Telegram | Viktorina bot | Youtube
2🔥1
#savol
Satr berilgan. Satrdagi eng qisqa so'z nechta harfdan iborat ekanligini topuvchi dastur tuzing?

#javob
C++ dasturlash tilida

#include <bits/stdc++.h>

using namespace std;

int main(){
string satr, c[50], z;
int k = 0;

cout << "Satr kiriting: ";
getline(cin, satr);
satr += " ";

for (int i = 0; i < satr.length(); i++){
if(satr[i] == ' '){
c[k++] = z;
z.clear();
}
else z += satr[i];
}
int min = c[0].length();

for (int i = 1; i < k; i++)
if (min > c[i].length())
min = c[i].length();

cout << "Eng qisqa so'z uzunligi " << min << " ta harfdan";

}

Telegram | Viktorina bot | YouTube
👍41
#savol
Satr berilgan. Satrdagi eng uzun so'z nechta harfdan iborat ekanligini topuvchi dastur tuzing?

#javob
C++ dasturlash tilida

#include <bits/stdc++.h>

using namespace std;

int main(){
string satr, c[50], z;
int k = 0;

cout << "Satr kiriting: ";
getline(cin, satr);
satr += " ";

for (int i = 0; i < satr.length(); i++){
if(satr[i] == ' '){
c[k++] = z;
z.clear();
}
else z += satr[i];
}
int max = c[0].length();

for (int i = 1; i < k; i++)
if (max < c[i].length())
max = c[i].length();

cout << "Eng uzun so'z uzunligi " << max << " ta harfdan";

}

Telegram | Viktorina bot | YouTube
👍32