CF 392a:blocked Points

Source: Internet
Author: User

Is the number of points that are within the circumference of the 1-unit distance from the circle of the original point integer n.

English barrier or mishap, the topic looked for 1 hours, the last special sentence error did not have time ac ...

#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;

int main () {
    //freopen ("In.txt", "R", stdin);
    Long long N;
    CIN >> N;
    Long long NN = n * n;
    Long Long ans = sqrt (NN/2);
    Long long s = (Ans*ans) + (ans+1) * (ans+1);
    if (n = = 0) {
        cout << 1 << endl;
    else if (s <= nn) {
        ans = ans * 8 + 4;
        cout << ans << endl;
    else if (S > nn) {
        ans = ans * 8;
        cout << ans << endl;
    return 0;

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.