Pku3090 Visible Lattice Points: the first Euler function in life

Pku3090 Visible Lattice Points: the first Euler function in life

This is a very memorable question!

 

Visible Lattice Points

Time Limit:1000 MS		Memory Limit:65536 K
Total Submissions:5812		Accepted:3434

 

Description

A lattice point (X,Y) In the first quadrant (XAndYAre integers greater than or equal to 0), other than the origin, is visible from the origin if the line from (0, 0) (X,Y) Does not pass through any other lattice point. for example, the point (4, 2) is not visible since the line from the origin passes through (2, 1 ). the figure below shows the points (X,Y) With 0 ≤X,Y≤ 5 with lines from the origin to the visible points.

Write a program which, given a value for the size,N, Computes the number of visible points (X,Y) With 0 ≤X,Y≤N.

Input

The first line of input contains a single integerC(1 ≤C≤ 1000) which is the number of datasets that follow.

Each dataset consists of a single line of input containing a single integerN(1 ≤N≤ 1000), which is the size.

Output

For each dataset, there is to be one line of output consisting of: the dataset number starting at 1, a single space, the size, a single space and the number of visible points for that size.

Sample Input

4245231

Sample Output

1 2 52 4 133 5 214 231 32549

Source

Greater New York 2006 since this is a valuable question, I will not translate it.

Code directly!

 

#include 
 
  #include 
  
   #include 
   
    #include #define __________ 1100#define ___________ 0#define ____________ 1#define _____________ 2#define ______________ 3using namespace std;int __[__________], _[__________], _______, ____;bool ___[__________];void getprime (){memset ( ___, false, sizeof (___) );memset ( _, ___________, sizeof (_) );____ = ___________;int _____, ______;for ( _____ = _____________; _____ <= _______; _____ ++ ){if ( ___[_____] == false ){__[++____] = _____;_[_____] = _____-____________;}for ( ______ = ____________; ______ <= ____ && _____*__[______] <= _______; ______ ++ ){___[_____*__[______]] = true;if ( _____ % __[______] == ___________ ){_[_____*__[______]] = _[_____] * __[______];}else {_[_____*__[______]] = _[_____] * ( __[______] - ____________ );}}}for ( _____ = ____________; _____ <= _______; _____ ++ ) _[_____] += _[_____-____________];}int main (){int _____, ______, ________, _________;_______ = __________;getprime ();scanf ( "%d", &________ ); _________ = ___________;while ( ________ -- ){scanf ( "%d", &_______ );printf ( "%d %d %d\n", ++_________, _______, _[_______]*_____________+______________ );}return ___________;}
   
  
 

The first Euler's function in life! Code is extremely exquisite! Thank you for remembering to give me a thumbs up! My code style is the best in our primary school!

 

I don't have much to say. Let's read the code!