UVa OJ Board

length=strlen(arr); root=sqrt(length); if(floor(root)==ceil(root)) if I am not wrong, i think your are checking if the length is a perfect square. its better if you do it like this if(root*root==length) its better to use printf instead of putchar,also use int main() and return 0; instead of saving ...

using scanf is a better option since scanf is said to faster than cin !

and reading until EOF is a factor...while(scanf("%d",&N)!=EOF) can help

Stil getting WA.

shall i just print UNKNOWN without cases number? if yes, then shall the cases number increment?

For some unknown reasons, I'm getting WA in this problem.

Can anybody explain what may be the possible reasons of getting WA in this problem?
Thanks

my code gives correct output sometimes also wrong output for the same test cases. i dunno what's wrong with it and why it is showing such a strange behavior. please help. thanks #include <stdio.h> #include <string.h> char res[1000]; int main() { int N,F,i,j,k,len,lim,high,sum,carry,p,m,n,v,quo,flag,...

When i run the loop upto sqrt(n) i get WA because not all the prime factors are below sqrt(n) for example 123456. But when i do it upto n/2, i get TLE. Please help. Thanks #include <stdio.h> #include <math.h> char prime[1000000000]; int main() { long long n,prod,i,j,k; long long d; for(i=2; i<10000;...

getting WA too!! no idea where's the problem.

I am getting WA for this problem. I get the exact ans for the sample I/O.
plz help.

i am getting WA for this problem.
here's my code,large though. please help!!