UVA 356 - Square Pegs And Round Holes

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int sqr(int n, int m)
 4 {
 5     return m * m + n * n;
 6 }
 7 int main()
 8 {
 9     int n;
10     int cnt = 0;
11     while(cin >> n)
12     {
13         if(cnt++) cout << endl;
14         double r = (n - 0.5) *(n - 0.5);
15         int in = 0;
16         int side = 0;
17         for(int i = 0;i < n;i++)
18         {
19             for(int j = 0;j < n;j++)
20             {
21                 if(sqr(i , j) < r && sqr(i + 1, j + 1) < r ) in ++;
22                 else if(sqr(i , j) < r && sqr(i + 1, j + 1) > r) side++;
23             }
24         }
25         printf("In the case n = %d, %d cells contain segments of the circle.\n",n,side*4);
26         printf("There are %d cells completely contained in the circle.\n",in*4);
27     }
28     return 0;
29 }