April 2024 | Mon | Tue | Wed | Thu | Fri | Sat | Sun |
---|
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | | | | | | Calendar |
|
Top posting users this week | |
| | Nguyễn Xuân Mạnh | |
| | |
Tác giả | Thông điệp |
---|
meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Fri Sep 09, 2022 1:05 pm | |
| - Code:
-
//DQBN23 #include <bits/stdc++.h> using namespace std;
int A[100010],B[100010],n,sum=0; bool NT[100010]; long long ans=0;
void nhap() { cin >> n; for (int i=1; i<=n; i++) { cin >> A[i]; sum += A[i]; } }
void sang(int x) { memset(NT,true,sizeof(NT)); NT[0] = NT[1] = false; for (int i=2; i<=x; i++) if (NT[i] == true) for (int j=i*2; j<=x; j+=i) NT[j] = false; }
void xl() { long long tmp=0; for (int i=1; i<=n; i++) if (B[i] == 1) tmp += A[i]; if (NT[tmp] == true) ans = max(ans,tmp); }
void sinh(int i) { for (int j=1; j>=0; j--) { B[i] = j; if (i == n) xl(); else sinh(i+1); } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd.inp","r",stdin); freopen("xdd.out","w",stdout); nhap(); sang(sum); sinh(1); if (ans != 0) cout << ans; else cout << -1; return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Fri Sep 09, 2022 1:07 pm | |
| - Code:
-
//DQBN22 #include <bits/stdc++.h> using namespace std;
int A[100010],B[100010],n,sum=0; bool NT[100010];
void nhap() { cin >> n; for (int i=1; i<=n; i++) { cin >> A[i]; sum += A[i]; } }
void sang(int x) { memset(NT,true,sizeof(NT)); NT[0] = NT[1] = false; for (int i=2; i<=x; i++) if (NT[i] == true) for (int j=i*2; j<=x; j+=i) NT[j] = false; }
void xl() { long long tmp=0; for (int i=1; i<=n; i++) if (B[i] == 1) tmp += A[i]; if (NT[tmp] == true) { for (int i=1; i<=n; i++) if (B[i] == 1) cout << A[i] << ' ' ; cout << '\n'; } }
void sinh(int i) { for (int j=0; j<=1; j++) { B[i] = j; if (i == n) xl(); else sinh(i+1); } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd.inp","r",stdin); freopen("xdd.out","w",stdout); nhap(); sang(sum); sinh(1); return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Fri Sep 09, 2022 1:16 pm | |
| - Code:
-
//EMERALD #include <bits/stdc++.h> using namespace std;
int A[100010],B[100010],n,sum=0;
void nhap() { cin >> n; for (int i=1; i<=n; i++) { cin >> A[i]; sum += A[i]; } if (sum%3 == 1) { cout << 0; exit(0); } }
void xl() { long long tmp=0,dem=0; for (int i=1; i<=n; i++) if (B[i] == 1) { tmp += A[i]; if (tmp > tmp/3) return; dem++; } if (tmp == sum/3) { cout << dem << '\n'; for (int i=1; i<=n; i++) if (B[i] == 1) cout << i << ' ' ; exit(0); } }
void sinh(int i) { for (int j=0; j<=1; j++) { B[i] = j; if (i == n) xl(); else sinh(i+1); } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd.inp","r",stdin); freopen("xdd.out","w",stdout); nhap(); sinh(1); return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Fri Sep 09, 2022 4:28 pm | |
| - Code:
-
//FINANCIAL #include <bits/stdc++.h> using namespace std;
int n,k,A[100010]; int f[100010],trc[100010];
void nhap() { cin >> n >> k; for (int i=1; i<=n; i++) { cin >> A[i]; } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd.inp","r",stdin); freopen("xdd.out","w",stdout); nhap(); int ans=0,check; for (int i=1; i<=n; i++) { f[i] = 1; for (int j=0; j<i; j++) { if (abs(A[i]-A[j]) >= k && f[i] < f[j]+1) { f[i] = f[j]+1; trc[i] = j; } } if (ans < f[i]) { ans = f[i]; check = i; } } cout << ans << '\n'; vector <int> ans1; ans1.push_back(A[check]); while (true) { check = trc[check]; if (check == 0) break; ans1.push_back(A[check]); } for (int i=ans1.size()-1; i>=0; i--) cout << ans1[i] << ' '; return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Tue Sep 20, 2022 9:15 pm | |
| - Code:
-
//dfs thanh phan lien thong #include <bits/stdc++.h> using namespace std;
int n,m; vector <int> dinhke[10010]; bool visited[10010];
void nhap() { cin >> n >> m; for (int i=1; i<=m; i++) { int u,v; cin >> u >> v; dinhke[u].push_back(v); dinhke[v].push_back(u); } memset(visited,false,sizeof(visited)); }
void dfs(int u) { visited[u] = true; for (auto i : dinhke[u]) { if (visited[i] == false) { dfs(i); } } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd1.inp","r",stdin); freopen("xdd1.out","w",stdout); nhap(); int ans=0; for (int i=1; i<=n; i++) { if (visited[i] == false) { dfs(i); ans++; } } cout << ans; return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Tue Sep 20, 2022 9:35 pm | |
| - Code:
-
// dfs liet ke thanh phan lien thong #include <bits/stdc++.h> using namespace std;
int n,m,ans[10010]; vector <int> dinhke[10010]; bool visited[10010];
void nhap() { cin >> n >> m; for (int i=1; i<=m; i++) { int u,v; cin >> u >> v; dinhke[u].push_back(v); dinhke[v].push_back(u); } memset(visited,false,sizeof(visited)); }
int timee=0; void dfs(int u) { visited[u] = true; ans[++timee] = u; for (auto i : dinhke[u]) { if (visited[i] == false) { dfs(i); } } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd1.inp","r",stdin); freopen("xdd1.out","w",stdout); nhap(); for (int i=1; i<=n; i++) { if (visited[i] == false) { dfs(i); for (int i=1; i<=timee; i++) cout << ans[i] << ' ' ; cout << '\n'; timee=0; } } return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Tue Sep 20, 2022 9:40 pm | |
| - Code:
-
//dfs thanh phan lien thong co nhieu dinh nhat #include <bits/stdc++.h> using namespace std;
int n,m,ans=0; vector <int> dinhke[10010]; bool visited[10010];
void nhap() { cin >> n >> m; for (int i=1; i<=m; i++) { int u,v; cin >> u >> v; dinhke[u].push_back(v); dinhke[v].push_back(u); } memset(visited,false,sizeof(visited)); }
int timee=0; void dfs(int u) { visited[u] = true; for (auto i : dinhke[u]) { if (visited[i] == false) { dfs(i); } } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd1.inp","r",stdin); freopen("xdd1.out","w",stdout); nhap(); for (int i=1; i<=n; i++) { if (visited[i] == false) { dfs(i); // for (int i=1; i<=timee; i++) // cout << ans[i] << ' ' ; // cout << '\n'; ans = max(ans,timee); timee=0; } } cout << ans; return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Thu Sep 22, 2022 9:23 pm | |
| - Code:
-
//mistake cộng số lớn #include<bits/stdc++.h> using namespace std;
string max1,max2,min1,min2;
bool ss(string a, string b) { if (a.size() > b.size()) return true; if (a.size() < b.size()) return false; for (int i=0; i<a.size(); i++) { if ((int)a[i] > (int)b[i]) return true; if ((int)a[i] < (int)b[i]) return false; } return false; }
void nhap() { string tmp1,tmp2; cin >> tmp1 >> tmp2;
max1 = tmp1; max2 = tmp2; min1 = tmp1; min2 = tmp2; for (int i=0; i<tmp1.size(); i++) { if (max1[i] == '5') max1[i] = '6'; if (min1[i] == '6') min1[i] = '5'; } for (int i=0; i<tmp2.size(); i++) { if (max2[i] == '5') max2[i] = '6'; if (min2[i] == '6') min2[i] = '5'; }
if (ss(max1,max2) == false) { string tmp = max1; max1 = max2; max2 = tmp; } if (ss(min1,min2) == false) { string tmp = min1; min1 = min2; min2 = tmp; }
while (max2.size() != max1.size()) { max2 = "0" + max2; min2 = "0" + min2; } // cout << max1 << endl << max2 << endl << min1 << endl << min2 << endl; }
string sum(string a, string b) { string ans = ""; long long tmp=0; for (int i=a.size()-1; i>=0; i--) { long long tmp1 = (int)a[i]-48 + (int)b[i]-48 + tmp; tmp = tmp1/10; long long tmp2 = tmp1%10; ans = (char)(tmp2+48) + ans; } if (tmp > 0) ans = (char)(tmp+48) + ans; return ans; }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd.inp","r",stdin); freopen("xdd.out","w",stdout); nhap(); // cout << endl << endl << (int)'0' << endl << (int)'9' << endl; // cout << endl << sum(max1,max2); cout << sum(min1,min2) << ' ' << sum(max1,max2); return 0; }
| |
| | | meliodasssf
Tổng số bài gửi : 71 Join date : 10/05/2022
| Tiêu đề: Re: Nguyễn Xuân Mạnh Thu Sep 22, 2022 9:33 pm | |
| - Code:
-
//palindrome #include<bits/stdc++.h> using namespace std;
int l; string s;
void nhap() { cin >> s; l = s.size(); s += s; // cout << s; }
bool check(int l, int r) { string tmp1 = s.substr(l,(r-l+1)); string tmp2=""; for (int i=tmp1.size()-1; i>=0; i--) { tmp2 += tmp1[i]; } for (int i=0; i<tmp1.size(); i++) { if (tmp1[i] != tmp2[i]) { return false; } } return true; }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("xdd.inp","r",stdin); freopen("xdd.out","w",stdout); nhap(); bool kt = false; for (int i=0; i<l; i++) { if (check(i,i+l-1) == true) { cout << "yes"; kt = true; break; } } if (kt == false) cout << "no"; return 0; }
| |
| | | Sponsored content
| Tiêu đề: Re: Nguyễn Xuân Mạnh | |
| |
| | | | Nguyễn Xuân Mạnh | |
|
Similar topics | |
|
| Permissions in this forum: | Bạn không có quyền trả lời bài viết
| |
| |
| |