Nguyễn Đức Trình

Tiêu đề: Nguyễn Đức Trình Sun Jun 26, 2022 9:54 am

Nơi nộp bải của Nguyễn Đức Trình Shocked

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
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 pushback(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 in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
int main()
{
int x;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> x;
pushback(L,x);
}
in(L);
//cout << endl << scp(L);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
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 pushback(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 in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
int main()
{
int x;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> x;
push(L,x);
}
in(L);
//cout << endl << scp(L);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
struct node
{
int data;
node*next;
};
node*L1=NULL;
node*L2=NULL;
void push(node*&L,int u)
{
node*q;
q=new node;
q->data=u;
q->next=L;
L=q;
}
void pushback(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 uoc()
{
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
pushback(L1,i);
if(n/i!=i) push(L2,n/i);
}
}
}
void in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
int main()
{
int x;
cin >> n;
uoc();
in(L1);
in(L2);
//cout << n;
//cout << endl << scp(L);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
struct node
{
int data;
node*next;
};
node*L=NULL;
node*L1=NULL;
node*L2=NULL;
void push(node*&L,int u)
{
node*q;
q=new node;
q->data=u;
q->next=L;
L=q;
}
void pushback(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 uoc()
{
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
pushback(L1,i);
if(n/i!=i) push(L2,n/i);
}
}
}
void in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
int demnode(node*L)
{
node*p;
int res=0;
p=L;
while(p!=NULL)
{
res++;
p=p->next;
}
return res;
}
int main()
{
int x;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> x;
push(L,x);
}
cout << demnode(L);
//cout << endl << scp(L);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
struct node
{
int data;
node*next;
};
node*L=NULL;
node*L1=NULL;
node*L2=NULL;
void push(node*&L,int u)
{
node*q;
q=new node;
q->data=u;
q->next=L;
L=q;
}
void pushback(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 uoc()
{
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
pushback(L1,i);
if(n/i!=i) push(L2,n/i);
}
}
}
void in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
void sapxep(node*L)
{
for(node*p=L;p!=NULL;p=p->next)
for(node*k=p;k!=NULL;k=k->next)
if(p->data<k->data)swap(p->data,k->data);
}
int demnode(node*L)
{
node*p;
int res=0;
p=L;
while(p!=NULL)
{
res++;
p=p->next;
}
return res;
}
int main()
{
int x;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> x;
push(L,x);
}
sapxep(L);
in(L);
//cout << endl << scp(L);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
struct node
{
int data;
node*next;
};
node*L=NULL;
node*L1=NULL;
node*L2=NULL;
void push(node*&L,int u)
{
node*q;
q=new node;
q->data=u;
q->next=L;
L=q;
}
void pushback(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 uoc()
{
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
pushback(L1,i);
if(n/i!=i) push(L2,n/i);
}
}
}
void in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
void sapxep(node*L)
{
for(node*p=L;p->next!=NULL;p=p->next)
for(node*k=p->next;k!=NULL;k=k->next)
if(p->data<k->data)swap(p->data,k->data);
}
long long tich(node*L)
{
long long s=0;
for(node*p=L;p->next->next!=NULL;p=p->next)
{
long long tmp=p->data*p->next->data*p->next->next->data;
s=max(s,tmp);
}
return s;
}
int demnode(node*L)
{
node*p;
int res=0;
p=L;
while(p!=NULL)
{
res++;
p=p->next;
}
return res;
}
int main()
{
int x;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> x;
push(L,x);
}

cout << tich(L);
//cout << endl << scp(L);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
struct node
{
int data;
node*next;
};
node*L=NULL;
node*L1=NULL;
node*L2=NULL;
void push(node*&L,int u)
{
node*q;
q=new node;
q->data=u;
q->next=L;
L=q;
}
void pushback(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 uoc()
{
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
pushback(L1,i);
if(n/i!=i) push(L2,n/i);
}
}
}
void in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
void sapxep(node*L)
{
for(node*p=L;p->next!=NULL;p=p->next)
for(node*k=p->next;k!=NULL;k=k->next)
if(p->data<k->data)swap(p->data,k->data);
}
long long tich(node*L)
{
long long s=0;
for(node*p=L;p->next->next!=NULL;p=p->next)
{
long long tmp=p->data*p->next->data*p->next->next->data;
s=max(s,tmp);
}
return s;
}
int demnode(node*L)
{
node*p;
int res=0;
p=L;
while(p!=NULL)
{
res++;
p=p->next;
}
return res;
}
bool timx(int x)
{
for(node*p=L;p!=NULL;p=p->next)
{
if(x==p->data) return 1;
}
return 0;
}
int main()
{
int x,k;
cin >> n >> k;
for(int i=1;i<=n;i++)
{
cin >> x;
push(L,x);
}
cout << timx(k);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
struct node
{
int data;
node*next;
};
node*L=NULL;
node*L1=NULL;
node*L2=NULL;
void push(node*&L,int u)
{
node*q;
q=new node;
q->data=u;
q->next=L;
L=q;
}
void pushback(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 uoc()
{
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
pushback(L1,i);
if(n/i!=i) push(L2,n/i);
}
}
}
void in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
void sapxep(node*L)
{
for(node*p=L;p->next!=NULL;p=p->next)
for(node*k=p->next;k!=NULL;k=k->next)
if(p->data<k->data)swap(p->data,k->data);
}
long long tich(node*L)
{
long long s=0;
for(node*p=L;p->next->next!=NULL;p=p->next)
{
long long tmp=p->data*p->next->data*p->next->next->data;
s=max(s,tmp);
}
return s;
}
int demnode(node*L)
{
node*p;
int res=0;
p=L;
while(p!=NULL)
{
res++;
p=p->next;
}
return res;
}
bool timx(node*L,int x)
{
for(node*p=L;p!=NULL;p=p->next)
{
if(x==p->data) return 1;
}
return 0;
}
int timk(node*L,int x)
{
int dem=0;
node*p=L;
if(p->data==x) return 0;
for(node*p=L;p->next!=NULL;p=p->next)
{
dem++;
if(x==p->next->data) return dem;
}
return 0;
}
int main()
{
int x,k;
cin >> n >> k;
for(int i=1;i<=n;i++)
{
cin >> x;
pushback(L,x);
}
cout << timk(L,k);
//cout << "Hello world!" << endl;
return 0;
}

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

Code:: #include <bits/stdc++.h>

using namespace std;
int n;
struct node
{
int data;
node*next;
};
node*L=NULL;
node*L1=NULL;
node*L2=NULL;
void push(node*&L,int u)
{
node*q;
q=new node;
q->data=u;
q->next=L;
L=q;
}
void pushback(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 uoc()
{
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
pushback(L1,i);
if(n/i!=i) push(L2,n/i);
}
}
}
void in(node*L)
{
node*p=L;
while(p!=NULL)
{
cout << p->data <<" ";
p=p->next;
}
}
int scp(node*L)
{
node*p=L;
int dem=0;
while(p!=NULL)
{
if(sqrt(p->data)==trunc(sqrt(p->data))) dem++;
p=p->next;
}
return dem;
}
void sapxep(node*L)
{
for(node*p=L;p->next!=NULL;p=p->next)
for(node*k=p->next;k!=NULL;k=k->next)
if(p->data<k->data)swap(p->data,k->data);
}
long long tich(node*L)
{
long long s=0;
for(node*p=L;p->next->next!=NULL;p=p->next)
{
long long tmp=p->data*p->next->data*p->next->next->data;
s=max(s,tmp);
}
return s;
}
int demnode(node*L)
{
node*p;
int res=0;
p=L;
while(p!=NULL)
{
res++;
p=p->next;
}
return res;
}
bool timx(node*L,int x)
{
for(node*p=L;p!=NULL;p=p->next)
{
if(x==p->data) return 1;
}
return 0;
}
node* timk(node*L,int x)
{
int dem=0;
node*p=L;
if(p->data==x) return NULL;
for(node*p=L;p->next!=NULL;p=p->next)
{
if(x==p->next->data) return p;
}
return NULL;
}
int main()
{
int x,k;
cin >> n >> k;
for(int i=1;i<=n;i++)
{
cin >> x;
pushback(L,x);
}
node* p=timk(L,k);
if(p!=NULL) cout << p->data;
//cout << "Hello world!" << endl;
return 0;
}

» Trịnh Xuân An
» Trịnh Vũ Hoài Nam
» Bt Tin- Trịnh Tố Uyên
» Trịnh Xuân An
» Nguyễn Nữ Mỹ Ngân