1 solutions
-
0
C :
#include<stdio.h> int main() { long int num; int i,j,k; int t=10; int temp[5]; for(i=1; i<256; i++) { num=i*i; j=0; while(num!=0) { temp[j]=num%t; num=num/10; j++; } for(k=0; k<j; k++) { if(temp[k]!=temp[j-k-1]) { break; } } if(k==j) { printf("%ld\n", i*i); } } return 0; }C++ :
#include<iostream> #include<stdlib.h> #include<string> using namespace std; int main() { int t,x; char s[10] ; for(int i=1; i<256; i++) { int j=0; x=i*i; while(x) { t=x%10; s[j++]=t+48; x/=10; } s[j]='\0'; if(i*i==atoi(s)) { cout<<i<<endl; } } return 0; }Java :
public class Main { public static void main(String[] args) { for (int i = 1; i < 256; i++) { if (is(i)) { System.out.println(i); } } } public static boolean is(int n){ long result = n*n ; String str = Long.toString(result) ; char[]c = str.toCharArray() ; for (int i = 0; i < c.length/2; i++) { if(c[i]!=c[c.length-1-i]){ return false ; } } return true ; } }
- 1
Information
- ID
- 19773
- Time
- 1000ms
- Memory
- 32MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By