Các trang luyện code hay !

[Lái xe]:http://hoclaixeoto.vn/thi-bang-lai-xe-b2-online/
1. ProjectEuler: https://projecteuler.net/progress
2. https://cses.fi/problemset/task/1068
3. https://www.youtube.com/watch?v=dZ_6MS14Mg4
4. http://www.math.ust.hk/excalibur/v13_n4.pdf
5. http://forum.mathscope.org/showthread.php?t=34722
6. http://vnoi.info/wiki/algo/graph-theory/everything?fbclid=IwAR2tZnm_Hyh7CG5tR4th4vcDrl8JSq0iFNuA2prE6zf3vguvQrssFbnWUtg
7. https://github.com/ngthanhtrung23/ACM_Notebook_new
8.https://github.com/acmicpc-vietnam/acmicpc-vietnam.github.io
9.http://vnoi.info/problems/list/?fbclid=IwAR1yLB21OgxY6sdNtJNe4D58J0GJ2parvWTzS7hlwmbyohYTDibAqcK_Mcc&tag=81&page=1
10.https://v0.vnoi.info/index.php?option=com_content&task=view&id=35&Itemid=82
11. http://poj.org/problemlist?volume=12
12. https://accu.org/index.php/journals/1506
13.https://math.stackexchange.com/questions/2228849/algorithm-of-tree-partition
14.https://github.com/Harmon758/Project-Euler
15.https://blog.csdn.net/softliumin/article/details/6693837?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159435315919195265937667%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=159435315919195265937667&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v3~pc_rank_v2-1-6693837.first_rank_ecpm_v3_pc_rank_v2&utm_term=poj3075
16. https://tuoitrekthc.wordpress.com/algorithm/07-do-thi/khop-va-cau/#:~:text=%C4%90%E1%BB%8Bnh%20ngh%C4%A9a%20kh%E1%BB%9Bp%20v%C3%A0%20c%E1%BA%A7u,c%E1%BB%A7a%20%C4%91%E1%BB%93%20th%E1%BB%8B%20t%C4%83ng%20l%C3%AAn.
17. https://github.com/kkmonlee/Project-Euler-Solutions
18.https://thuytrangcoding.wordpress.com/2018/03/19/graph-shortestpath-dijkstra/
19.https://acm.timus.ru/
20.https://www.comp.nus.edu.sg/~stevenha/myteaching/competitive_programming/cp1.pdf
21.https://www.it-swarm-vi.tech/vi/graph/
22.https://codeforces.com/blog/entry/16221
22.https://vn.spoj.com/problems/MYSTERY/
23.https://github.com/ngthanhtrung23/ACM_Notebook_new/tree/master/Graph
24.https://visualgo.net/en?fbclid=IwAR2or_aMvvQzJTjZO8CGLhibbX5cG7zRbz-LB6yItlM6Z67tMLu5MeXO9f4
25.https://codeforces.com/blog/entry/56422?fbclid=IwAR2L9ipGuY5nbN8SNrMqc4P1aGeo-HESmkX-jMY43wn7YW8XaSOfJNqtW1Y
25.https://thunguyen17.files.wordpress.com/2010/10/me1bb99t-se1bb91-chuyen-de1bb81-toan-che1bb8dn-le1bb8dc-be1bb93i-dc6b0e1bba1ng-he1bb8dc-sinh-gie1bb8fi.pdf
26. https://tailieumienphi.vn/doc/luan-van-thac-si-toan-hoc-cac-ham-so-hoc-va-ung-dung-lwm8tq.html
27. Số học - thầy Dũng:http://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvYy8yL2VjNTIyMDVjNjE1ODg1NTJkMjZlZTJiZDUzZjg3NGVkYjVkYzVjLnBkZg==&rn=c28gaG9jIHF1YSBjYWMgZGluaCBseSB2YSBiYWkgdG9hbi5wZGY=
28. https://vjudge.net/problem
29. https://github.com/Mistereo/timus-solutions/tree/master/solutions
30.https://acmp.ru/asp/do/index.asp?main=task&id_course=2&id_section=32&id_topic=52&id_problem=1029
31.http://dut.udn.vn/TTHLTT/Gioithieu/id/2102?fbclid=IwAR3ZEqYIPwKDyHJX1dxeNrdR4WsEjNL_tz3oBW_NJc5yhD4B9JKrAfP1weg
32.https://drive.google.com/drive/u/0/folders/0B7Z7z614qw_LdDg5bVBTRklxQ2c?fbclid=IwAR0sFSrGZCnUVbhgaNOBUUPJGABVoh_jIHTrMnHbllvf_rJErHqs1gj_XLg
48.https://www.facebook.com/codingcompetitions/hacker-cup/2020/round-1/problems/A1
49.https://vjudge.net/article/611
50.[CSES]:https://github.com/thcy/CSES-Solutions
51.https://www.youtube.com/watch?v=qOnGGNNHWSk

Nhận xét

Đăng nhận xét

Bài đăng phổ biến từ blog này

Sinh Test trong Python va code AC

P1: #file = "C:/New folder/aka/1.inp" #with open(file) as f: # a,b=[int(x) for x in next(f).split()] #print(a) #print(b) def gg(id): file= "C:/New folder/aka/" +id+ ".inp" with open (file) as f: a,b=[ int (x) for x in next (f).split()] products = set () for pair in [(x,y) for x in range ( 2 ,a+ 1 ) for y in range ( 2 ,b+ 1 )]: products.add(pair[ 0 ]**pair[ 1 ]) return len (products) x= range ( 1 , 101 ) for i in x: id= str (i) file1 = "C:/New folder/aka/" +id+ ".out" f= open (file1, "w" ) f.write( str (gg(id))) f.close() P2: a,b=[ int (x) for x in input ().split()] product = set () for pair in [(x,y) for x in range ( 2 ,a+ 1 ) for y in range ( 2 ,b+ 1 )]: product.add(pair[ 0 ]**pair[ 1 ]) print ( len (product))
Đọc thêm

Cách tính a*b mod m , a^b mod m , a^(-1) mod m với m không phải là số nguyên tố (inversion có nghĩa khi (a,m)=1)

#include <bits/stdc++.h> using namespace std ; #define ll long long #define MOD (ll)(1000000000000000009) ll inv ( ll a , ll mod ){ ll r = mod ; ll nr = a ; ll t = 0 ; ll nt = 1 ; ll tmp ; while ( nr != 0 ){ ll q = r / nr ; tmp = nt ; nt = t - q * nt ; t = tmp ; tmp = nr ; nr = r - q * nr ; r = tmp ; } if ( r > 1 ) return - 1 ; // no inverse if ( t < 0 ) t += mod ; return t ; } ll f ( ll a , ll n , ll mod ){ ll res = a , ans = 0 ; while ( n ){ if ( n % 2 ) ans = ( ans + res ) % mod ; res = ( res + res ) % mod ; n /= 2 ; } return ans ; } ll po ( ll a , ll n , ll mod ){ ll res = a , ans = 1 ; while ( n ){ if ( n % 2 ) ans = f ( ans , res , mod ); res = f ( res , res , mod ); n /= 2 ; } return ans ; } int main (){ ll x , y , z , m , dem = 0 , res1 , res2 , res , tmp
Đọc thêm

Python - Liệt kê tất các các chu trình trong đồ thị

graph = [[1, 2], [1, 3], [1, 4], [2, 3], [3, 4], [2, 6], [4, 6], [8, 7], [8, 9], [9, 7]] cycles = [] def main(): global graph global cycles for edge in graph: for node in edge: findNewCycles([node]) for cy in cycles: path = [str(node) for node in cy] s = ",".join(path) print(s) def findNewCycles(path): start_node = path[0] next_node= None sub = [] #visit each edge and each node of each edge for edge in graph: node1, node2 = edge if start_node in edge: if node1 == start_node: next_node = node2 else: next_node = node1 if not visited(next_node, path): # neighbor node not on path yet sub = [next_node] sub.extend(path) # explore extended path findNewCycles(sub); e
Đọc thêm