pku3090 Visible Lattice Points：人生第一个欧拉函数

最新推荐文章于 2020-03-31 13:38:52 发布

Ra1nbow_Chan

最新推荐文章于 2020-03-31 13:38:52 发布

阅读量648

点赞数 2

分类专栏：欧拉函数文章标签：欧拉函数

本文链接：https://blog.csdn.net/Ra1nBow_Chan/article/details/45155839

版权

欧拉函数专栏收录该内容

0 篇文章 0 订阅

订阅专栏

这是一道很有纪念价值的题目！

Visible Lattice Points

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

Description

A lattice point (x, y) in the first quadrant (x and y are integers greater than or equal to 0), other than the origin, is visible from the origin if the line from (0, 0) to (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 integer C (1 ≤ C ≤ 1000) which is the number of datasets that follow.

Each dataset consists of a single line of input containing a single integer N (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

Sample Output

1 2 5
2 4 13
3 5 21
4 231 32549

Source

Greater New York 2006

既然这是一道有价值的题目，我就不给翻译了

直接上代码！

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define __________ 1100
#define ___________ 0
#define ____________ 1
#define _____________ 2
#define ______________ 3
using 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 ___________;
}

人生第一个欧拉函数！代码极其精致！各位看了记得给我点赞！我的代码风格可是我们小学最好的！

我也不多说什么，自己看代码吧！