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 天
帖子存档
Kanal obunachilari reytingi:
Robo_nik masalalar
soni:
1.Asadbek Kazakov _____ 751 ta
2.Alisher ________________ 336 ta
3.Behruz Isomitdinov ___ 333 ta
4.Sarvar Saydullayev ____ 298 ta
5.MD-Gray ______________ 267 ta
6.Mohina Olimovna _____ 200 ta
7.Toshtemirova _________ 180 ta
8.G.O.A.T _________________ 185 ta
9.Shohruhxon ___________ 173 ta
10.************** ______ 158 ta
11.Algorithms UZ _________ 84 ta
Asadbek Kazakov ... Ishlaringizda omad bu juda yaxshi natija qolganlardan ham yangilangan reyinglar kutib qolamiz.
CP Competetion #1
Olimpiada javoblari python dasturlash tilida!
Pastdagi havola orqali otip yuklab olishingiz mumkin.
//302-misol PY
Obunachimiz tomonidan
a = input()
s = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
for j in s:
print(j, a.count(j))
//67-misol PY
Obunachimiz tomonidan
print((bin(int(input())+2**32)[-32:]))
Robocontest_yechimlari
//239-misol PY
Obunachimiz tomonidan
def balandlik(a,b):
return (2*a+b-1)//b
b,a = map(int,input().split())
h = balandlik(a,b)
print(h)
Repost from N/a
#algo_ubtuit_uz_1
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
int V, a;
cin>>a;
V=pow(a,3);
cout<<V;
return 0;
}
Telegram
// 69-misol CPP
#include <bits/stdc++.h>
using namespace std;
#define mx 100005
vector<int>adj[mx];
bool vis[mx];
long long d;
void dfs(int u, int s) {
vis[u] = true;
for (auto x : adj[u]) {
if (vis[x] == false) {
d += s+1;
dfs(x, s+1);
}
}
}
void add(int u, int v)
{
adj[u].push_back(v);
adj[v].push_back(u);
}
int main()
{
int n, m;
cin >> n ;
int a[n+1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
// add(i-1, v-1);
}
for(int i=1; i<=n; i++)
{
if (a[i] == -1) add(i, 0);
else add(i, a[i]);
}
dfs(0,0);
cout << d;
}
#robocontest #40masala
Robocontest 40-masala javobi python dasturlash tilida.
Manba: @algorithms_teacher
Matematiklarcha tabrik
Umringiz «ILDIZ»day uzun, Qadringiz «DARAJA»dek yuqori, Muxabbatingiz «FORMULA»dek kuchli, Do’stlaringiz «SONLAR»dek ko’p bo’lsin. Sizga «MINUS CHEKSIZLIK» dan «PLYUS CHEKSIZLIK» gacha baxt tilayman. Hayotingiz davomida «NOMA’LUM IKS» larga o’rin qolmasin. Mashaqqatli hayot yo’lingizda »TO‘G‘RI CHIZIQ» day cheksiz sabr-toqat, »AYLANA» day uzilmas mehr, obro’-e’tibor »FUNKSIYASINING MAKSIMAL QIYMATI» ni tilayman. Ushbu sharafli yo’lingizda hech bir muammoning yechimi »BO‘SH TO‘PLAM» bo’lmasin. Orzular aslo ‘ildiz ostida irratsional» boʻlib qolmasin. 🥳🥳🥳Yangi yilingiz muborak boʻlsin.🥳🥳🥳
Assalomu alaykum
Hammani kelayotgan bayram bilan tabriklayman kanal activmi?
Izox qoldiramiz✍
//283-misol CPP
Obunachimiz tomonidan
#include <bits/stdc++.h>
using namespace std;
string sum(int n) {
string s = "-1";
for (int i = 0; i <= n / 5; i++) {
if ((n - 5 * i) % 3 == 0) {
s = "";
for (int k = 0; k < n - 5 * i; k++) s += to_string(5);
for (int k = 0; k < 5 * i; k++) s += to_string(3);
break;
}
}
return s;
}
int main() {
ifstream myin("input.txt");
ofstream myout("output.txt");
int n, t;
myin >> t;
for (int i = 0; i < t; i++) {
myin >> n;
myout << sum(n) << endl;
}
}
//955-misol PY
Obunachimiz tomonidan
n,m=map(int,input().split())
if n>m:print(-1)
else:
a=m
for i in range(1,n+1):
a*=(m-i)
print(a%(10**9+7))
//955-misol CPP
Obunachimiz tomonidan
#include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
int32_t main() {
int mod = 1e9 + 7, n, m, k = 1;
cin >> n >> m;
if (n > m) cout << -1;
else {
for (int i = m - n; i <= m; i++) {
k *= i;
k %= mod;
}
cout << k % mod;
}
return 0;
}
//696-misol PY
Obunachimiz tomonidan
def isnprime(n):
if n==1:
return False
for i in range(2, int(n**0.5)+1):
if n%i==0:
return False
return True
#code by ave_owner
def nthisp(n):
k=0
for i in range(1, 100000000):
if isnprime(i):
k+=1
if k==n:
return i
def sm(n):
k=0
for i in range(1, n+1):
k+=nthisp(i)
return k
n=int(input())
s=0
for i in range(1,n+1):
s+=sm(i)
print(s)
Agar siz ishlagan misollaringiz ham kanalda bòlishini hohlasangiz biz bilan boģlang
👇👇👇👇👇
@Developerss_uzb
// 952-misol PY
Obunachimiz tomonidan
n=int(input())
print(n if n<3 else n*(n-1)*(n-2)%(10**9+7))
//952-misol PY
Obunachimiz tomonidan
n=int(input())
if n==1:
print(1)
elif n==2:
print(2)
else:
print((n*(n-1)*(n-2))%1000000007)
// 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);
}
