I'm Linh, học sinh trường THCS Lê Hữu Lập
Nick khác : Lee Gia Linh

Tôi là NPP_Oi mong mọi người giúp đỡ

hi

include <bits/stdc++.h>

using namespace std;
int s,n;
int main()
{ ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
freopen("BAI2.CPP","r",stdin);
freopen("BAI2.CPP","w",stdout);
cin>>n;
for(int i=9;i<=n;i=i+9)
s=s+i;
cout<<s;
return 0;
}

include <bits/stdc++.h>

using namespace std;
bool snt(long long x)
{
if(x<2) return false;
if(x==2) return true;
if(x%2==0) return false;
for(long long i=3;i*i<=x;i+=2)
if(x%i==0) return false;
return true;
}
long long t,n;
long long dem=0;
int main()
{
cin>>t;
for(long long i=1;i<=t;i++)
{
cin>>n;
for(long long i=1;;i++)
{
if(snt(i)&&(i+3)%8==0)
{
dem++;
if(dem==n)
{
cout<<i<<" "<<i+3<<endl;
break;
}
}
}
}
return 0;
}

nigga

include<bits/stdc++.h>

using namespace std;

int main() {
int n;
cin >> n;
int sum = n * (n + 1) / 2;
if (sum % 2 != 0) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
vector<int> set1, set2;
sum /= 2;
for (int i = n; i >= 1; i--) {
if (i <= sum) {
set1.push_back(i);
sum -= i;
} else {
set2.push_back(i);
}
}
cout << set1.size() << endl;
for (int i = 0; i < set1.size(); i++) {
cout << set1[i] << " ";
}
cout << endl;
cout << set2.size() << endl;
for (int i = 0; i < set2.size(); i++) {
cout << set2[i] << " ";
}
}
return 0;
}

virtual phone

cheap local escorts