May 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 | 31 | | | Calendar |
|
Top posting users this week | |
| | Trần Minh Hiển | |
| | Tác giả | Thông điệp |
---|
Admin Admin
Tổng số bài gửi : 152 Join date : 23/04/2022 Age : 41 Đến từ : THPT Chuyên Nguyễn Tất Thành - Yên Bái
| Tiêu đề: Trần Minh Hiển Sun Jun 26, 2022 9:57 am | |
| | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Sun Jun 26, 2022 11:00 am | |
| - Code:
-
#include <bits/stdc++.h> #define For(i, a, b) for(int i = a ; i <= b ; i++) #define nmax 1007
using namespace std;
int m, n, a[nmax][nmax]; int s[nmax][nmax];
int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); freopen("QQMIT.inp","r",stdin); freopen("QQMIT.out","w",stdout); cin >> m >> n; For(i, 1, m) For(j, 1, n) cin >> a[i][j]; For(i, 1, m) For(j, 1, n) s[i][j] = s[i-1][j] + s[i][j-1] - s[i-1][j-1] + a[i-1][j-1]; cout << s[m][n]; return 0; }
| |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Sun Jun 26, 2022 11:00 am | |
| - Code:
-
#include <bits/stdc++.h> #define For(i, a, b) for(int i = a ; i <= b ; i++)
using namespace std;
string s; int m;
string invert(string s, int u, int v) { string res = ""; For(i, u-1, v-1) res = s[i] + res; return res; }
int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); freopen("SO.inp","r",stdin); freopen("SO.out","w",stdout); getline(cin, s); cin >> m; For(i, 1, m) { int x, y; cin >> x >> y; string temp = invert(s, x, y); s.replace(x-1, temp.size(), temp); } cout << s; return 0; }
| |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Sun Jun 26, 2022 11:01 am | |
| - Code:
-
#include <bits/stdc++.h> #define For(i, a, b) for(int i = a ; i <= b ; i++) #define nmax 207 #define vt vector<char>
using namespace std;
int n, k; string s; vt a; int dem[nmax][nmax];
int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); freopen("SUBSTRG.inp","r",stdin); freopen("SUBSTRG.out","w",stdout); cin >> n >> k; cin >> s; string s1 = s; For(i, 0, s1.size()-2) For(j, i+1, s1.size()-1) if(s1[i] > s1[j]) swap(s1[i], s1[j]); For(i, 0, s1.size()) if(s1[i] != s1[i+1]) a.push_back(s1[i]); For(i, 0, a.size()-1) For(j, 0, s.size()-1) if(a[i] == s[j]) dem[i][j] = dem[i][j-1] + 1; else dem[i][j] = dem[i][j-1]; int h = s.size()-1; For(i, 0, a.size()) dem[i][s.size()] = (int)(1e9); For(i, 0, a.size()-1) { For(j, 0, h) if(dem[i][j] > k) { h = j-1; break; } } cout << h+1; return 0; }
| |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 9:11 am | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e9 + 7;
int ans = 0;
struct node { int data; node* next; };
node * L = NULL;
void push(node * &L, int u) { node * q; q = new node ; q->data = u; q->next = L; L = q; }
int scp(int u) { return (sqrt(u) == trunc(sqrt(u)))?1:0; }
void inds(node * L) { node * p = L; while (p != NULL) { if(scp(p-> data) == 1) ans++; p = p->next; } cout << ans; }
signed main() { fast; int n, x; cin >> n; For(i, 1, n) { cin >> x; push(L, x); } inds(L); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 9:39 am | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e9 + 7;
int ans = 0;
struct node { int data; node * next; }; node * L = NULL; void push(node * &L, int u) { node * q; q = new node ; q->data = u; q->next = L; L = q; } void inds(node * L) { node * p = L; while (p != NULL) { cout << p->data <<" "; p = p->next; } }
signed main() { fast; int n, x; cin >> n; For(i, 1, n) { cin >> x; push(L, x); cout << x << ' '; } cout << '\n'; inds(L); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 10:02 am | |
| - Code:
-
#include <bits/stdc++.h> #define int long long
using namespace std;
int n;
struct node { int data; node * next; }; node * L; node * L1;
void push(node * &L, int u) { node * q; node * R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } }
void pushback(node * &L, int u) { node * q; q = new node ; q->data = u; q->next = L; L = q; } void inds(node * L) { node * p; p = L; while (p != NULL) { cout << p->data <<" "; p = p->next; } }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); L = NULL; L1 = NULL; cin >> n; for (int i=1; i*i<=n; i++) { if (n%i == 0) { push(L,i); if (n/i != i) pushback(L1,n/i); } } inds(L); inds(L1); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 10:22 am | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e9 + 7;
struct node { int data; node* next; };
node* L = NULL; void push(node*& L, int u) { node * q, *R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } }
int SL(node* L) { if(L == NULL) return 0; node*p = L; int dem = 0; while(p != NULL) { dem++; p = p->next; } return dem; }
signed main() { fast; int n; cin >> n; For(i, 1, n) { int x; cin >> x; push(L, x); } cout << n; return 0; }
| |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 10:32 am | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e9 + 7;
struct node { int data; node * next; }; node * L = NULL; void push(node * &L, int u) { node * q, *R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } } void inds(node * L) { node * p = L; while (p != NULL) { cout << p->data <<" "; p = p->next; } }
void sapxep() { for(node*p = L; p != NULL; p=p->next) for(node*k = p->next ; k != NULL ; k = k->next) if(p->data > k->data) swap(p->data, k->data); }
signed main() { fast; int n; cin >> n; For(i, 1, n) { int x; cin >> x; push(L, x); } sapxep(); inds(L); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 10:53 am | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e9 + 7;
struct node { int data; node * next; }; node * L = NULL; void push(node * &L, int u) { node * q, *R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } } int xfind(int x) { for(node* p=L ; p != NULL ; p = p->next) if(p->data == x) return 1; return 0; }
signed main() { fast; int n, c; cin >> n >> c; For(i, 1, n) { int x; cin >> x; push(L, x); } cout << xfind(c); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 11:00 am | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e9 + 7;
struct node { int data; node * next; }; node * L = NULL; void push(node * &L, int u) { node * q, *R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } } void xfind(node* L, int k) { int tmp = 1; for(node* p=L ; p != NULL ; p = p->next) { if(tmp == k-1) { cout << p->data; return; } else tmp++; } }
signed main() { fast; int n, c; cin >> n >> c; For(i, 1, n) { int x; cin >> x; push(L, x); } xfind(L, c); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 2:25 pm | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e9 + 7;
struct node { int data; node * next; }; node * L = NULL; void push(node * &L, int u) { node * q, *R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } } void inds(node * L) { node * p = L; while(p != NULL) { if(p->next == NULL) { cout << p->data << " "; return; } p = p->next; } }
signed main() { fast; int n; cin >> n; For(i, 1, n) { int x; cin >> x; push(L, x); } inds(L); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 2:44 pm | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e18 + 7;
struct node { int data; node * next; }; node * L = NULL; void push(node * &L, int u) { node * q, *R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } } void inds(node * L) { node * p = L; while (p != NULL) { cout << p->data << ' '; p = p->next; } }
node * timkiem(node * L, int u) { node * p = L; for(node*p = L ; p!= NULL ; p = p->next) if(p->data == u) return p; return NULL; }
void pushsau(node * &L, int x, int y) { node * p = timkiem(L,y); if(p == NULL) return; node * q; q = new node; q->data = x; q->next = p->next; p->next = q; }
signed main() { fast; int n, k, x; cin >> n >> k >> x; For(i, 1, n) { int t; cin >> t; push(L, t); } pushsau(L, x, k); inds(L); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Thu Jul 28, 2022 2:58 pm | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a ; i > b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define int long long #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
using namespace std;
const int nmax = (int)1e6 +7; const int oo = (int)1e18 + 7;
struct node { int data; node * next; }; node * L = NULL; void push(node * &L, int u) { node * q, *R; q = new node ; q->data = u; q->next = NULL; if (L == NULL) { L = q; R = q; } else { R->next = q; R = q; } } void inds(node * L) { node * p = L; while (p != NULL) { cout << p->data <<" "; p = p->next; } }
node * timkiem(node * L, int u) { node * p = L; for(node*p = L ; p!= NULL ; p = p->next) if(p->data == u) return p; return NULL; }
void Xdele(node *&L, int x) { node* p = timkiem(L, x); node* pre = L; while(pre->next != p) pre = pre->next; node* temp = p->next; pre->next = temp; delete p; }
signed main() { fast; int n, x; cin >> n >> x; For(i, 1, n) { int t; cin >> t; push(L, t); } Xdele(L, x); inds(L); return 0; } | |
| | | hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Re: Trần Minh Hiển Fri Jul 29, 2022 10:04 am | |
| - Code:
-
#include <bits/stdc++.h>
using namespace std;
struct node { int data; node * next; }; node * top = NULL; void push(node * &L, int x) { node * q; q = new node; q->data = x; q->next = L; L = q; } int pop(node * &L) { int q = L->data; node * p = L; L = L->next; delete p; return q; } void printList(node * L) { while (L != NULL) { int temp = pop(L); cout << temp <<" "; } } int main() { int n,x; cin >> n; for(int i=1; i<= n; i++) { cin >> x; push(top,x); } printList(top); return 0; } | |
| | | Sponsored content
| Tiêu đề: Re: Trần Minh Hiển | |
| |
| | | | Trần Minh Hiển | |
|
Trang 1 trong tổng số 1 trang | |
Similar topics | |
|
| Permissions in this forum: | Bạn không có quyền trả lời bài viết
| |
| |
| |