Want to stay in touch with the latest updates from Latest LCOJ Comments? That's easy! Just subscribe clicking the Follow button below, choose topics or keywords for filtering if you want to, and we send the news to your inbox, to your phone via push notifications or we put them on your personal page here on follow.it.
Reading your RSS feed has never been easier!
Website title: Trang chủ - LCOJ: Luyencode Online Judge
Is this your feed? Claim it!
code tham khảo
include <bits/stdc++.h>using namespace std; int n,i,r,j; const int MAX = 1000005; bool b[MAX]; int main() { iosbase::syncwith_stdio(false); cin.tie(NULL); memset(b, true, sizeof(b)); b[1]=false; b[0]=false; for(i=2;i<=1000005;i++) { if(b[i]==true) { r=i; for(j=r*2;j<=1000005;j+=r) b[j]=false; } } cin>>n; for(...
code tham khảo
include <bits/stdc++.h>using namespace std;
int main()
{
string s, t = "";
getline(cin, s);
for (int i = 0; i < s.size(); i++) {
bool r = false;
for (int j = 0; j < t.size(); j++) {
if (s[i] == t[j]) {
r = true;
break;
}
}
if (!r) {
t += s[i];
}
}
co...