576A - Vasya and Petya's Game - CodeForces Solution


math number theory *1500

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
bool check(long long int x)
{
   long long int cnt=0;
	    for(long long int p=2;p*p<=x;p++)
	    {
	        if(x%p==0)
	        {
	            while(x%p==0)x/=p;
	            if(x>1)return 0;
	        }
	    }
	    return 1;
}
int main()
{
    vector<long long int> v;
	long long int n;
	cin>>n;
	for(int i=2;i<=n;i++)
	{
	    if(check(i))v.push_back(i);
	}
	cout<<v.size()<<endl;
	for(auto t:v) 
	{
	    cout<<t<<" ";
	}
	return 0;
}


Comments

Submit
0 Comments
More Questions

1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment