-
1) Ошибка при вводе русских символов
2) Как иначе написать аргумент в объявлении функции "void get_password(char password[] ){"
3) Проверка:
if(username_len >= MAX_USERNAME_LEN-1){
return -1;
…
-
# Sak Code | ផលដកនៃ២ចំនួន
[https://sakcode.net/problem/BC10](https://sakcode.net/problem/BC10)
-
,로 순서를 바꾸는 부분이 많이 어려워 결국 구현을 못했습니다.
나머지는 그런대로 구현한 것 같은데, 조금만 힌트를 주실 수 있으실까요?
#include
#include
#define MAX_STR_LEN 300
int main() {
char str[MAX_STR_LEN];
printf("문장을 입력하세요");
scanf…
-
![Screenshot (48)](https://user-images.githubusercontent.com/113331717/193502401-aef74ce7-623d-4899-8238-2cb58b479b48.png)
-
-
![Screenshot (45)](https://user-images.githubusercontent.com/113331717/193499946-241118e4-0526-4a84-a848-6025dcdab5ea.png)
-
![Armstrong number(exp-2)](https://user-images.githubusercontent.com/113490860/193498129-3318f682-c425-40d5-bde0-a1430f4d11f3.jpg)
-
-
I get the value of 'n' by user and
char *a;
a = (char*)malloc(sizeof(char) * n);
wrote like this.
But no matter what the value of n, a can store more characters larger than n.
For example,…
-
### Hopcroft-Karp算法
该算法由John.E.Hopcroft和Richard M.Karp于1973提出,故称Hopcroft-Karp算法。
**原理**
为了降低时间复杂度,可以在增广匹配集合M时,每次寻找多条增广路径。这样就可以进一步降低时间复杂度,可以证明,算法的时间复杂度可以到达O(n^0.5*m),虽然优化不了多少,但在实际应用时,效果还是很明显的。…