UVA Solution 155 - All Squares - Solution by C++ | Volume 1 - Online Judge Solution

Latest

It is a free Online judges problems solution list. Here you can find UVA online Judge Solution, URI Online Judge Solution, Code Marshal Online Judge Solution, Spoz Online Judge Problems Solution

Saturday, April 29, 2017

UVA Solution 155 - All Squares - Solution by C++ | Volume 1

UVA Solution 155 - All Squares - Solution by C++ | Volume 1


Problem Name: All Squares
Problem Number : UVA - 155
Online Judge : UVA Online Judge Solution
Volume: 1
Solution Language : C plus plus

UVA Solution 155 Code in CPP:

#include <stdio.h>

int k, n, m, ans;
void dfs(int x, int y, int k) {
    if(k == 0)
        return ;
    if(x-k <= n && x+k >= n && y-k <= m && y+k >= m)
        ans++;
    dfs(x+k, y+k, k/2);
    dfs(x+k, y-k, k/2);
    dfs(x-k, y+k, k/2);
    dfs(x-k, y-k, k/2);
}
int main() {
    while(scanf("%d %d %d", &k, &n, &m) == 3) {
        if(k == 0 && n == 0 && m == 0)
            break;
        ans = 0;
        dfs(1024, 1024, k);
        printf("%3d\n", ans);
    }
    return 0;
}

No comments:

Post a Comment