Algorithms UZ
Open in Telegram
Kanal egasi: @Bekzhanov_rasul ā Dunyoda ilmdan boshqa najot yoq va bolmagay. ā Imom Al-Buxoriy. Muhokama gruh: @Programmer_TK_Chat
Show more202
Subscribers
No data24 hours
No data7 days
No data30 days
Posts Archive
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);
}
Kimlargadir faoliyatimiz manfaatli ekanidan xursandman.šš„°š„°
Kanal:@JK_Progamming
