Nguyễn Xuân Mạnh

Tiêu đề: Nguyễn Xuân Mạnh Sun Jun 26, 2022 9:55 am

Nơi nộp bài của Nguyễn Xuân Mạnh Smile

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n;
string S;

void nhap()
{
getline(cin,S);
n = S.size();
cin >> m;
}

void xl(int fi, int en)
{
int hieu = en-fi;

if (hieu%2 == 0)
{
int mid = hieu/2 + fi;
for (int i=fi; i<mid; i++)
{
swap(S[i],S[i+hieu]);
hieu-=2;
}
}

else
{
int mid = fi + hieu/2;
for (int i=fi; i<=mid; i++)
{
swap(S[i],S[i+hieu]);
hieu-=2;
}
}
// cout << S << endl;
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
nhap();
freopen("SO.inp","r",stdin);
freopen("SO.out","w",stdout);
for (int i=1; i<=m; i++)
{
int fi,en;
cin >> fi >> en;
fi--; en--;
xl(fi,en);
}
cout << S;

return 0;
}

/*
TeldWopOfThro
3
3 11
10 13
2 8
*/

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,dem=0;
int A[1001][1001];
bool check[1001][1001],kt;
vector <int> trc;

void nhap()
{
cin >> m >> n;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
// if (A[i][j] == 1) dem ++;
}
}
}

void clears(int x, int y)
{
while (x!=1 && y!=1)
{
check[x][y] = false;
if (trc[trc.size()-1] == 1) x--;
else y--;
trc.pop_back();
}
}

int X[3] = {0,1,0};
int Y[3] = {0,0,1};

void xl(int x, int y)
{
check[x][y] = true;

// key111111111111
if(A[x+1][y] == 1 && A[x][y+1] == 1)
{
for (int i=1; i<=2; i++)
{
int row = x + X[i];
int col = y + Y[i];
kt = true;
if (row <= m && col <= n && check[row][col] == false)
{
if(row == m && col == n)
{
dem++;
kt = false;
return;
}
xl(row,col);
}
}
}

// key222222222222
else if(A[x+1][y] == 1)
{
int row = x + 1;
int col = y;
kt = true;
if (row <= m && col <= n && check[row][col] == false)
{
if(row == m && col == n)
{
dem++;
kt = false;
return;
}
xl(row,col);
}
}

// key333333333333
else if(A[x][y+1] == 1)
{
int row = x;
int col = y + 1;
kt = true;
if (row <= m && col <= n && check[row][col] == false)
{
if(row == m && col == n)
{
dem++;
kt = false;
return;
}
xl(row,col);
}
}

// key444444444444
else
{
for (int i=1; i<=2; i++)
{
int row = x + X[i];
int col = y + Y[i];
if (row <= m && col <= n && check[row][col] == false)
{
if(row == m && col == n && kt == true)
{
dem++;
return;
}
else if(row == m && col == n && kt == false)
{
clears(x,y);
return;
}
if ((row - x) > 0 && kt == false) trc.push_back(1);
else if ((col - y) > 0 && kt == false) trc.push_back(2);
xl(row,col);
}
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
nhap(); xl(1,1);
freopen("QQMIT.inp","r",stdin);
freopen("QQMIT.out","w",stdout);
cout << dem << endl;
return 0;
}

/*
3 3
0 1 1
0 1 0
0 0 1
*/

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n,k,dem;
string S;
int check[100001];

void nhap()
{
cin >> n >> k;
cin.ignore();
getline(cin,S);
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("SUBSTRG.inp","r",stdin);
freopen("SUBSTRG.out","w",stdout);
nhap();
for (int i=0; i<n; i++)
{
if (check[(int)S[i]] < k)
{
dem++;
check[(int)S[i]]++;
}
}
cout << dem;
return 0;
}

/*
5 2
ababa
*/

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include<bits/stdc++.h>
using namespace std;

long long n,m,A[3001][3001],row[3001][3001],col[3001][3001],maxx;

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
cin >> m >> n;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
row[i][j] = A[i][j] + row[i][j-1];
col[i][j] = A[i][j] + col[i-1][j];
}
}
for (int i=1; i<=m; i++) cout << row[i][n] << " "; cout << "\n";
for (int i=1; i<=n; i++) cout << col[m][i] << " ";
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,k,A[301][301],dem=0,res=INT_MIN;
long long sum[301][301];
struct kq{
int x;
int y;
};
kq ans[90601];

priority_queue <tuple<int,int,int>,vector<tuple<int,int,int>>> test;

void nhap()
{
cin >> m >> n >> k;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
}
}
}

void pre_sum()
{
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + A[i][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap(); pre_sum();
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
int x=i+k-1,y=j+k-1;
if (x <= m && y <= n)
{
int temp = sum[x][y] - sum[i-1][y] - sum[x][y-1] + sum[i-1][j-1];
if (temp >= res)
{
test.push(make_tuple(res,i,j));
res = temp;
}
}
}
}
while (test.empty() == false)
{
ans[++dem].x = get<1>(test.top());
ans[dem].y = get<2>(test.top());
test.pop();
if (get<0>(test.top()) != res) break;
}
cout << dem << "\n";
for (int i=1; i<=dem; i++)
{
cout << ans[i].x << " " << ans[i].y << "\n";
}
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,A[301][301];
bool NT[10000];

void sang()
{
memset(NT,true,sizeof(NT));
NT[0] = NT[1] = false;
for (int i=2; i<=10000; i++)
if (NT[i] == true)
for (int j=i*2; j<=10000; j+=i)
NT[j] = false;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
sang();
cin >> m >> n;
bool check = false;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
if (NT[A[i][j]] == true)
{
check = true;
cout << i << " " << j << "\n";
}
}
}
if (check == false) cout << -1;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,s,A[101][101],dem=0,temp=INT_MIN;
long long sum[101][101];

void nhap()
{
cin >> m >> n >> s;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
}
}
}

void pre_sum()
{
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + A[i][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap(); pre_sum();
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
int x=i,y=j;
while (x <= m && y<= n)
{
int temp = sum[x][y] - sum[i-1][y] - sum[x][y-1] + sum[i-1][j-1];
if (temp == s)
{
cout << i << " " << j << " " << x-i+1 << "\n";
dem++;
}
x++; y++;
}
}
}
if (dem == 0) cout << -1;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,s,A[101][101],dem=0,ans=INT_MIN;
long long sum[101][101];

void nhap()
{
cin >> m >> n >> s;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
}
}
minn = min(m,n); //for k=minn -> 1 tìm hv lớn nhất ko dùng x,y
}

void pre_sum()
{
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + A[i][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap(); pre_sum();
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
int x=i,y=j;
while (x <= m && y<= n)
{
int temp = sum[x][y] - sum[i-1][y] - sum[x][y-1] + sum[i-1][j-1];
if (temp == s)
{
if (x-i+1 > ans) ans = x-i+1;
}
x++; y++;
}
}
}
if (ans == INT_MIN) cout << -1;
else cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,s,A[51][51],dem=0,temp=INT_MIN;
long long sum[51][51];
struct hv{
int x1;
int y1;
int x2;
int y2;
};
hv ans[2601];

void nhap()
{
cin >> m >> n >> s;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
}
}
}

void pre_sum()
{
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + A[i][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap(); pre_sum();

for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
for (int x=i; x<=m; x++)
{
for (int y=j; y<=n; y++)
{
int temp = sum[x][y] - sum[i-1][y] - sum[x][j-1] + sum[i-1][j-1];
if (temp == s)
{
dem++;
ans[dem].x1 = i; ans[dem].y1 = j;
ans[dem].x2 = x; ans[dem].y2 = y;
}
}
}
}
}
if (dem == 0) cout << -1;
else
for (int i=1; i<=dem; i++)
{
cout << ans[i].x1 << " " << ans[i].y1 << " " << ans[i].x2 << " " << ans[i].y2 << "\n";
}
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,k,A[51][51],dem=0;
long long sum[51][51];

void nhap()
{
cin >> m >> n >> k;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
int temp;
cin >> temp;
A[i][j] = temp % k; // (a+b)%k == (a%k+b%k)%k
}
}
}

void pre_sum()
{
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + A[i][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap(); pre_sum();

for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
for (int x=i; x<=m; x++)
{
for (int y=j; y<=n; y++)
{
int temp = sum[x][y] - sum[i-1][y] - sum[x][j-1] + sum[i-1][j-1];
if (temp % k == 0)
{
dem++;
}
}
}
}
}
if (dem == 0) cout << -1;
else cout << dem;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include<bits/stdc++.h>
using namespace std;

int n,t,A[1000000],sum[2000000];
bool NT[2000000],check[1000000];

void sang()
{
   memset(NT,true,sizeof(NT));
   NT[1] = false;
   for (int i=2; i<=2000000; i++)
   if (NT[i] == true)
   for (int j=i*2; j<=2000000; j+=i)
   NT[j] = false;
}

int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);
   freopen("DDB.inp","r",stdin);
   freopen("DDB.out","w",stdout);
   sang();
   cin >> t;
   for (int i=1; i<=2000000; i++) sum[i] = sum[i-1] + (int)NT[i];
   while (t--)
   {
   cin >> n;
   cout << sum[2*n] - sum[n] << "\n";
   }
   return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n,A[10001],maxx=-1;

void nhap()
{
cin >> n;
for (int i=1; i<=n; i++)
{
cin >> A[i];
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("GFIB.inp","r",stdin);
freopen("GFIB.out","w",stdout);
nhap();
for (int i=1; i<n; i++)
{
for (int j=i+1; j<=n; j++)
{
int st=i,nd=j,rd=A[st]+A[nd],len=2;
bool check=false;
while (true)
{
for (int x=nd+1; x<=n; x++)
{
if (A[x] == rd)
{
check = true;
len++;
st = nd; nd = x;
rd=A[st]+A[nd];
}
}
if (check == false) break;
else check = false;
}
maxx = max(maxx,len);
}
}
cout << n - maxx;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,s,A[101][101],sum[101][101],ans;

void nhap()
{
cin >> m >> n;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
}
}
}

void pre_sum()
{
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + A[i][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap(); pre_sum();

for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
for (int x=i; x<=m; x++)
{
for (int y=j; y<=n; y++)
{
int temp = sum[x][y] - sum[i-1][y] - sum[x][j-1] + sum[i-1][j-1];
if (temp == (x-i+1)*(y-j+1)) ans = max(ans,temp);
}
}
}
}
cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,A[101][101],row[101][101],col[101][101],ans=0;

void nhap()
{
cin >> m >> n;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
row[i][j] = row[i][j-1] + A[i][j];
col[i][j] = col[i-1][j] + A[i][j];
}
}
}

void pre_sum()
{
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
row[i][j] = row[i][n];
col[i][j] = col[m][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap(); pre_sum();

for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
int temp = row[i][j] + col[i][j] - A[i][j];
ans = max(ans,temp);
}
}
cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int m,n,A[101][101],sum[101][101],ans;
int X[8] = {-2,-2,-1,-1,+1,+1,+2,+2};
int Y[8] = {-1,+1,-2,+2,-2,+2,+1,-1};

void nhap()
{
cin >> m >> n;
for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
cin >> A[i][j];
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();

for (int i=1; i<=m; i++)
{
for (int j=1; j<=n; j++)
{
int temp = A[i][j];
for (int k=0; k<8; k++)
{
int x = i+X[k];
int y = j+Y[k];
if (x >= 1 && y >= 1 && x<=m && y<=n)
{
temp += A[x][y];
}
ans = max(temp,ans);
}
}
}
cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

string S;

void nhap()
{
getline(cin,S);
S += "a";
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
for (int i=0; i<S.size(); i++)
{
if(S[i] <= '9' && S[i] >= '0')
{
for (int j=i; j<S.size(); j++)
{
if (S[j] <= '9' && S[j] >= '0')
{
cout << S[j]-48;
}
else
{
cout << " ";
i = j-1;
break;
}
}
}
}
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

string S,ans;

void nhap()
{
getline(cin,S);
S += "a";
}

string ss(string x, string y)
{
int a=x.size(),b=y.size();
if (a > b) return x;
if (b > a) return y;
for (int i=0; i<a; i++)
{
if ((int)x[i] < (int)y[i]) return y;
if ((int)x[i] > (int)y[i]) return x;
}
return x;
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
for (int i=0; i<S.size(); i++)
{
if(S[i] <= '9' && S[i] >= '0')
{
string temp;
for (int j=i; j<S.size(); j++)
{
if (S[j] <= '9' && S[j] >= '0')
{
temp += S[j];
// cout << temp << endl;
}
else
{
ans = ss(ans,temp);
i = j-1;
break;
}
}
}
}
cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

string S,ans;
vector <char> test;

void nhap()
{
getline(cin,S);
cout << S << endl;
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
for (int i=0; i<S.size(); i++)
{
if (S[i] == S[i+1])
{
int temp = 2;
cout << S[i];
for (int j=i+2; j<S.size(); j++)
{
if (S[i] == S[j])
{
temp++;
}
else
{
i = j-1;
break;
}
}
cout << temp;
}
else cout << S[i] << 1;
}
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

string S,ans;
vector <char> test;

void nhap()
{
getline(cin,S);
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
for (int i=0; i<S.size(); i+=2)
{
int temp = (int)S[i+1]-48;
for (int j=1; j<=temp; j++)
{
cout << S[i];
}
}
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n,ans=0;

struct node
{
int value;
node * next;
};
node * L;

void push(node * &L, int x)
{
node * q;
q = new node;
q -> value = x;
q -> next = L;
L = q;
}

void inds(node * L)
{
node * p;
p = L;
while (p != NULL)
{
int temp = p -> value;
if ((int)sqrt(temp) == sqrt(temp)) ans++;
p = p -> next;
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
L = NULL;
cin >> n;
for (int i=1; i<=n; i++)
{
int temp;
cin >> temp;
push(L,temp);
}
inds(L);
cout << ans << endl;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n,ans=0;

struct node
{
int value;
node * next;
};
node * L;

void push(node * &L, int x)
{
node * q;
q = new node;
q -> value = x;
q -> next = L;
L = q;
}

void inds(node * L)
{
node * p;
p = L;
while (p != NULL)
{
cout << p -> value << ' ' ;
p = p -> next;
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
L = NULL;
cin >> n;
for (int i=1; i<=n; i++)
{
int temp;
cin >> temp;
push(L,temp);
}
inds(L);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
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);
   freopen("xdd.inp","r",stdin);
   freopen("xdd.out","w",stdout);
   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;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n,x,ans=0;

struct node
{
int value;
node * next;
};
node * L;

void push(node * &L, int x)
{
node * q;
q = new node;
q -> value = x;
q -> next = L;
L = q;
}

bool inds(node * L)
{
node * p;
p = L;
while (p != NULL)
{
if (p -> value == x) return 1;
p = p -> next;
}
return 0;
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
L = NULL;
cin >> n;
for (int i=1; i<=n; i++)
{
int temp;
cin >> temp;
push(L,temp);
}
cin >> x;
cout << inds(L);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n,k,ans=0;

struct node
{
int value;
node * next;
};
node * L;

void push(node * &L, int x)
{
node * q;
q = new node;
q -> value = x;
q -> next = L;
L = q;
}

node * inds(node * L)
{
node * p;
p = L;
node * pre;
pre = L;
while (p != NULL)
{
pre = p;
p = p -> next;
if (p -> value == k) return pre;
}
return pre;
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
L = NULL;
cin >> n;
for (int i=1; i<=n; i++)
{
int temp;
cin >> temp;
push(L,temp);
}
cin >> k;
cout << inds(L);
return 0;
}

» Nguyen Xuan Nghia
» Nguyễn Xuân Long
» Nguyễn Đức Mạnh bài 8
» Nguyễn Đức Mạnh
» Nguyễn Đức Mạnh