duongkoii
Tổng số bài gửi : 2 Join date : 28/07/2022
| Tiêu đề: Nguyễn Văn Dương Thu Jul 28, 2022 9:38 am | |
| - Code:
-
#include <bits/stdc++.h>
using namespace std; int a[100007], n; struct node { int value; node*next; }; node*L=NULL; void push(node *&L, int x) { node * q; q = new node; q->value = x; q->next = L; L=q; } void pushback(node * &L, int u) { node * q, *R; q = new node ; q->value = 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->value << " "; p = p->next; } } int scp (node * L) { int dem; node * p =L; while (p!=NULL) { if (sqrt(p->value)==trunc(sqrt(p->value))) dem++; p=p->next; } return dem; } int main() { int x; cin >> n; for ( int i=1; i<=n; i++) { cin >> x; pushback(L,x); } inds(L); cout << endl << scp(L); return 0; }
| |
|
duongkoii
Tổng số bài gửi : 2 Join date : 28/07/2022
| Tiêu đề: Re: Nguyễn Văn Dương Thu Jul 28, 2022 10:21 am | |
| - Code:
-
#include <bits/stdc++.h>
using namespace std; int a[100007], n; struct node { int value; node*next; }; node*L=NULL; void push(node *&L, int x) { node * q; q = new node; q->value = x; q->next = L; L=q; } void pushback(node * &L, int u) { node * q, *R; q = new node ; q->value = 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->value << " "; p = p->next; } } int countL (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); } inds(L); cout << " " << countL(L); return 0; }
| |
|