UVA Solution 256 - Quirksome Squares 0 Solution in C++ | Volume 2 - 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

Monday, May 1, 2017

UVA Solution 256 - Quirksome Squares 0 Solution in C++ | Volume 2

UVA Solution 256 - Quirksome Squares 0 Solution in C++ | Volume 2


UVA Online Judge Solution 256 - Quirksome Squares 0  | Volume 2
UVA Problem Link - 256 - Quirksome Squares https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=192

Problem Name: 256 - Quirksome Squares 0
Problem Number : UVA - 256 - Quirksome Squares 0
Online Judge : UVA Online Judge Solution
Volume: 2
Solution Language : C plus plus

UVA Solution 256 - Quirksome Squares 0  Code in CPP:


#include <stdio.h>
#include <string.h>
int main() {
 int n, i, a, b;
 char s1[10], s2[10];
 while(scanf("%d", &n) == 1) {
  int l1 = 1, l2 = 1;
  for(i = 0; i < n; i++)
   l1 *= 10;
  for(i = 0; i < n/2; i++)
   l2 *= 10;
  for(i = 0; i < l1; i++) {
   if(i*i >= l1) break;
   a = i*i/l2, b = i*i%l2;
   if(n == 2 && (a+b)*(a+b) == i*i) {
    sprintf(s1, "%01d%01d", a, b);
    sprintf(s2, "%02d", i*i);
    if(strcmp(s1, s2) == 0)
     printf("%s\n", s2);
   }
   if(n == 4 && (a+b)*(a+b) == i*i) {
    sprintf(s1, "%02d%02d", a, b);
    sprintf(s2, "%04d", i*i);
    if(strcmp(s1, s2) == 0)
     printf("%s\n", s2);
   }
   if(n == 6 && (a+b)*(a+b) == i*i) {
    sprintf(s1, "%03d%03d", a, b);
    sprintf(s2, "%06d", i*i);
    if(strcmp(s1, s2) == 0)
     printf("%s\n", s2);
   }
   if(n == 8 && (a+b)*(a+b) == i*i) {
    sprintf(s1, "%04d%04d", a, b);
    sprintf(s2, "%08d", i*i);
    if(strcmp(s1, s2) == 0)
     printf("%s\n", s2);
   }
  }
 }
    return 0;
}

No comments:

Post a Comment