poj Visible Lattice Points(3090)

Visible Lattice Points
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 5545 Accepted: 3265

Description

A lattice point (xy) 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 (xy) 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 (xy) with 0 ≤ xy ≤ 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 (xy) with 0 ≤ xy ≤ 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

4
2
4
5
231

Sample Output

1 2 5
2 4 13
3 5 21
4 231 32549
题目大意:给定一个 (N+1)*(N+1) 的矩阵,计算在这些点中与(0,0)的连线具有不相同的斜率。

数据范围:

 C (1 ≤ C ≤ 1000) ,N (1 ≤ N ≤ 1000),

题目分折:

由于图是对称的,所以可以只考虑半边,又因为对角线不必考虑(结果加一即可),Y=0 这条直线也可不用考虑,只会有一个点满足题意。那么对剩下的这些点进行考虑,我们用 vis[a][b],来表示 斜率 为 a/b 的直线,那么统计时去掉有多余的即可了。但因为数据范围有这么大,如果不好处理,会超时,所以我考虑用打表实现。

题目链接:http://poj.org/problem?id=3090

小乐一下:

自己写的程序,如果超时,一般可以考虑用 二分 ,或者直接打表。(后看这题是与欧拉相关的)。

代码:

把结果打印到一个*.txt 文件中。

#include<cstdio>
#include<cstring>
int F[1010];
int vis[1010][1010];
int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}
int main(){
    freopen("output.txt","w",stdout);
    int T;
    int n;
    int i,j,r;
    int ans;
    F[0] = 0;
    for(i = 1;i<=1000;i++) F[i] = F[i-1] + i;
   // scanf("%d",&T);
    for(r = 1;r<=1000;r++){
        int flag = 0;
        n = r;
        if(n == 1) {printf("3,");continue;}
        if(n == 2) {printf("5,");continue;}
        memset(vis,0,sizeof(vis));
        for(i = 1;i<=n;i++){
            for(j = i+1;j<=n;j++){
                int temp = gcd(i,j);
                //printf("%d\n",temp);
                vis[i/temp][j/temp] ++;
            }
        }
        int D = 0;
        for(i = 1;i<=n;i++){
            for(j = i+1;j<=n;j++){
                int temp = gcd(i,j);
                while(vis[i/temp][j/temp]>1){
                    D++;
                    vis[i/temp][j/temp]--;
                }
            }
        }
        ans = F[n-1] - D + 1;
     //   printf("%d %d %d\n",F[n-1],D,ans);
        printf("%d,",2*ans+1);

    }
    return 0;
}

提交程序:

#include<cstdio>
int ans[1010]={0,3,5,9,13,21,25,37,45,57,65,85,93,117,129,145,161,193,205,241,257,281,301,345,361,401,425,461,485,541,557,617,649,689,721,769,793,865,901,949,981,1061,1085,1169,1209,1257,1301,1393,1425,1509,1549,1613,1661,1765,1801,1881,1929,2001,2057,2173,2205,2325,2385,2457,2521,2617,2657,2789,2853,2941,2989,3129,3177,3321,3393,3473,3545,3665,3713,3869,3933,4041,4121,4285,4333,4461,4545,4657,4737,4913,4961,5105,5193,5313,5405,5549,5613,5805,5889,6009,6089,6289,6353,6557,6653,6749,6853,7065,7137,7353,7433,7577,7673,7897,7969,8145,8257,8401,8517,8709,8773,8993,9113,9273,9393,9593,9665,9917,10045,10213,10309,10569,10649,10865,10997,11141,11269,11541,11629,11905,12001,12185,12325,12565,12661,12885,13029,13197,13341,13637,13717,14017,14161,14353,14473,14713,14809,15121,15277,15485,15613,15877,15985,16309,16469,16629,16793,17125,17221,17533,17661,17877,18045,18389,18501,18741,18901,19133,19309,19665,19761,20121,20265,20505,20681,20969,21089,21409,21593,21809,21953,22333,22461,22845,23037,23229,23397,23789,23909,24305,24465,24729,24929,25265,25393,25713,25917,26181,26373,26733,26829,27249,27457,27737,27949,28285,28429,28789,29005,29293,29453,29837,29981,30425,30617,30857,31081,31533,31677,32133,32309,32549,32773,33237,33381,33749,33981,34293,34485,34961,35089,35569,35789,36113,36353,36689,36849,37281,37521,37849,38049,38549,38693,39133,39385,39641,39897,40409,40577,41009,41201,41537,41797,42321,42481,42897,43113,43465,43729,44265,44409,44949,45205,45493,45765,46165,46341,46893,47169,47529,47721,48281,48465,49029,49309,49597,49837,50317,50509,51053,51277,51661,51949,52533,52701,53165,53453,53813,54109,54637,54797,55301,55601,56001,56289,56769,56961,57573,57813,58221,58461,59081,59273,59897,60209,60497,60809,61441,61649,62209,62465,62889,63153,63729,63945,64425,64749,65181,65501,66053,66213,66873,67201,67633,67965,68493,68685,69357,69669,70117,70373,70973,71189,71777,72113,72465,72809,73501,73725,74421,74661,75093,75413,76117,76349,76909,77261,77645,78001,78717,78909,79593,79953,80393,80681,81257,81497,82229,82581,83061,83349,83973,84213,84957,85277,85677,86045,86717,86933,87689,87977,88481,88861,89625,89881,90361,90745,91249,91633,92409,92601,93305,93641,94161,94553,95177,95417,96209,96605,97037,97357,98157,98421,99141,99541,99973,100309,101029,101285,102101,102421,102965,103373,104069,104333,104989,105373,105925,106285,107121,107313,108153,108573,109125,109541,110181,110461,111181,111605,112085,112421,113281,113569,114433,114793,115241,115673,116465,116753,117629,117949,118453,118837,119721,120009,120713,121157,121749,122133,123029,123269,124069,124517,125117,125569,126145,126433,127345,127801,128377,128729,129649,129889,130813,131261,131741,132205,133137,133425,134217,134585,135209,135673,136513,136825,137545,137929,138553,139029,139985,140241,141105,141585,142113,142553,143321,143645,144617,145097,145745,146081,147061,147381,148277,148709,149189,149669,150509,150837,151833,152233,152897,153397,154401,154689,155489,155929,156553,157057,158073,158329,159193,159705,160353,160865,161681,162017,162937,163369,164057,164441,165481,165817,166861,167381,167861,168385,169345,169665,170677,171093,171789,172221,173181,173533,174381,174909,175621,176157,176997,177285,178365,178905,179625,180137,181001,181289,182381,182925,183645,184045,185053,185405,186341,186893,187469,188021,189133,189493,190501,190885,191525,192085,193209,193577,194473,195037,195685,196245,197381,197669,198809,199289,200049,200529,201409,201793,202945,203489,204257,204705,205689,206073,207113,207689,208265,208849,210021,210357,211437,211901,212685,213261,214445,214805,215573,216165,216957,217485,218681,219001,220201,220705,221497,222097,222977,223377,224589,225165,225837,226317,227421,227805,229029,229641,230281,230761,231993,232401,233637,234117,234909,235529,236585,236969,237969,238593,239313,239937,241089,241377,242637,243261,244101,244733,245741,246157,247165,247725,248565,249077,250357,250781,252065,252593,253265,253841,255133,255565,256725,257205,257925,258573,259877,260309,261349,261989,262853,263405,264721,265041,266361,267021,267789,268445,269309,269741,270973,271637,272525,273053,274253,274637,275981,276653,277373,277997,279349,279797,280949,281461,282365,282965,284329,284761,285849,286437,287349,288021,289269,289621,291001,291689,292409,293101,294205,294653,295933,296629,297557,298037,299437,299869,301165,301805,302541,303245,304445,304909,306325,306885,307821,308525,309845,310229,311189,311901,312853,313569,315005,315389,316613,317297,318257,318977,320097,320537,321989,322565,323537,324113,325457,325937,327401,328133,328805,329509,330829,331309,332785,333361,334225,334849,336333,336813,337997,338741,339725,340365,341637,342037,343537,344273,345273,345945,347145,347577,349089,349845,350725,351301,352821,353325,354621,355381,356149,356913,358305,358817,360353,360833,361857,362625,364169,364673,365873,366641,367505,368281,369721,370105,371505,372209,373217,373889,375137,375657,377229,378013,379061,379685,381029,381509,382949,383741,384573,385365,386957,387389,388861,389501,390557,391357,392797,393325,394381,395101,396173,396973,398589,399021,400641,401313,402393,403113,404409,404921,406433,407249,408113,408753,410393,410937,412581,413397,414197,414893,416545,417073,418729,419385,420489,421257,422601,423153,424481,425201,426281,427117,428793,429177,430801,431641,432761,433601,434849,435401,436721,437553,438681,439321,440905,441465,443169,443889,444753,445601,447313,447793,449509,450181,451141,452001,453725,454301,455677,456541,457629,458349,459909,460357,461941,462805,463957,464749,465949,466525,468277,469153,470321,470961,472721,473225,474989,475757,476685,477569,479341,479917,481429,482133,483213,484101,485757,486349,487773,488541,489597,490493,492173,492653,494317,495117,496125,497021,498461,499061,500873,501777,502977,503553,505373,505949,507589,508501,509461,510373,511933,512509,514345,515049,516273,517193,518873,519353,520793,521717,522941,523837,525693,526173,527685,528613,529853,530785,532065,532641,534513,535305,536553,537289,539169,539793,541553,542481,543345,544185,546077,546701,548429,549149,550413,551181,553085,553709,555229,556181,557301,558257,559889,560401,562261,563125,564397,565357,566893,567421,569353,570233,571385,572153,574093,574741,576397,577369,578329,579289,581241,581889,583649,584321,585617,586597,588561,589201,590769,591665,592769,593633,595481,595961,597941,598901,600221,601061,602645,603301,605293,606289,607585,608385};
int main(){
    int T,n;
    scanf("%d",&T);
    for(int i = 1;i<=T;i++){
        scanf("%d",&n);
        printf("%d %d %d\n",i,n,ans[n]);
    }
    return 0;
}

伟大梦想成就伟大的人,从细节做好,从点点滴滴做好,从认真做好。




  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
智慧校园建设方案旨在通过融合先进技术,如物联网、大数据、人工智能等,实现校园的智能化管理与服务。政策的推动和技术的成熟为智慧校园的发展提供了基础。该方案强调了数据的重要性,提出通过数据的整合、开放和共享,构建产学研资用联动的服务体系,以促进校园的精细化治理。 智慧校园的核心建设任务包括数据标准体系和应用标准体系的建设,以及信息化安全与等级保护的实施。方案提出了一站式服务大厅和移动校园的概念,通过整合校内外资源,实现资源共享平台和产教融合就业平台的建设。此外,校园大脑的构建是实现智慧校园的关键,它涉及到数据中心化、数据资产化和数据业务化,以数据驱动业务自动化和智能化。 技术应用方面,方案提出了物联网平台、5G网络、人工智能平台等新技术的融合应用,以打造多场景融合的智慧校园大脑。这包括智慧教室、智慧实验室、智慧图书馆、智慧党建等多领域的智能化应用,旨在提升教学、科研、管理和服务的效率和质量。 在实施层面,智慧校园建设需要统筹规划和分步实施,确保项目的可行性和有效性。方案提出了主题梳理、场景梳理和数据梳理的方法,以及现有技术支持和项目分级的考虑,以指导智慧校园的建设。 最后,智慧校园建设的成功依赖于开放、协同和融合的组织建设。通过战略咨询、分步实施、生态建设和短板补充,可以构建符合学校特色的生态链,实现智慧校园的长远发展。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值