Algorithms UZ
Відкрити в Telegram
Kanal egasi: @Bekzhanov_rasul “ Dunyoda ilmdan boshqa najot yoq va bolmagay. ” Imom Al-Buxoriy. Muhokama gruh: @Programmer_TK_Chat
Показати більше202
Підписники
Немає даних24 години
Немає даних7 днів
Немає даних30 днів
Архів дописів
![// 12-misol PY Obunachimiz tomonidan n = int(input()) a = [] for i in range(n + 1):a.append(i) a[1] = 0; i = 2 while i <=](https://cdn.tlmtr.io/_next/static/media/empty-channel.35ed232f.svg)
// 12-misol PY
Obunachimiz tomonidan
n = int(input())
a = []
for i in range(n + 1):a.append(i)
a[1] = 0; i = 2
while i <= n:
if a[i] != 0:
j = i + i
while j <= n:
a[j] = 0
j = j + i
i += 1
a = set(a)
a.remove(0)
ism=["Bobur","Ali"]
if n==1:print("Ali")
else:print(ism[(len(a)%2)])
B. Satr yasash
n = list(map(int, input().split()))
a = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
res = []
for i1, i2 in zip(n, a):
res.append(i1*i2)
a= ''.join(str(i) for i in res)
for i in a:
if i==i:
rep = a[1:] + a[:1]
else:
pass
print(rep)
Bu juda ajoyib
Hamma obunachilarimiz aktiv.
Bu kanal va muhokama guruhlar obunachilarimizga foydali degan umiddaman.
// 15 masala python
n,k=map(int,input().split())
m=10**9+7
if n!=0:print((pow(k,n,m)-1)*pow(k-1,m-2,m)%m)
else:print(0)
// 383-misol CPP
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h,y,s;
int a[7][7];
for(int i=0; i<7; i++)
{
for(int j=0; j<7; j++)
{
cin>>a[i][j];
}
}
for(int i=0; i<7; i++)
{
for(int j=0; j<7; j++)
{
if(a[i][j]==1)
{
y=i+1;
s=j+1;
}
}
}
cout << abs(y-4)+abs(s-4);
}
// 202-misol PY
Obunachimiz tomonidan
s=input()
k=0
for x in s:
if x=='1':
k=k+2
elif x=='7':
k=k+3
elif x=='4':
k=k+4
elif x=='2' or x=='3' or x=='5':
k=k+5
elif x=='0' or x=='6' or x=='9':
k=k+6
elif x=='8':
k=k+7
print(k)
// 236-misol CPP
#include <iostream>
using namespace std;
int main()
{
int n,s;
cin >> n;
if(n<0)
{
s=-1;
for(int i=1; i<=-n; i++)
s+=i;
cout << -s;
}
else{
s=0;
for(int i=1; i<=n; i++)
s+=i;
cout << s;
}
}
// 28-misol python
n=int(input())
for i in range(0,n):
ax,ay,bx,by=map(int,input().split())
print(bx+bx-ax,by+by-ay)
// 837-misol C++
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
if(n==1|| n<=0)
cout << "murakkab";
else
cout << "tub";
}
// 367-misol PY
from math import *
n=int(input())
s=0
while(n>0):
k=n%10
s+=k
n=n//10
print(s)
// 99-misol PY
Obunachimiz tomonidan
n = int(input())
c = 0
if n == 2 or n == 3:
print(2)
elif n == 1:
print(1)
else:
i = 1
while i <= (n+1)**(1/2):
if (n+1)%i == 0:
c += 1
i += 1
if c >= 2:
print(0)
else:
print(n)
// dfs algoritmi C++
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[1000];
bool vis[1000];
void dfs(int u)
{
vis[u]=true;
cout << u << " ";
for(auto x : adj[u])
{
if(vis[x]==false)
{
dfs(x);
}
}
}
void add( int u, int v)
{
adj[u].push_back(v);
// adj[v].push_back(u);
}
int main()
{
int n ,m , u ,v ;
cin >> n >> m;
for(int i=0; i<m; i++)
{
cin >> u >> v;
add(u,v);
}
for(int i=0; i<n; i++)
{
cout << i << " ";
for(auto x: adj[i])
{
cout << x << " ";
}
cout << endl;
}
dfs(0);
return 0;
}
Chatda qatmoqchi bölgan obunachilarimizni konteynerlardan xabarlari bormi?
Javobini izoxda kutaman...
👇👇👇👇👇👇
Xayrli kech Obunachilar Biz
📌DFS algoritmini ertaga 20:00da videochatda kursatib bermoqchimiz. Videochatda dastur C++ tilida yoziladi , Py tilida kerak bulsa izoxda qoldiring...
