OJ Board

Code: Select all

// 10042: Smith numbers

#include <cmath>
#include <iostream>
using namespace std;

typedef unsigned long inte;

inte sum (inte n)
{
	inte r = 0;	
	while (n)
	{
		r += n % 10;
		n /= 10;
	}
	return 0;
}

// This algorithm is from Programming challenges, 
// it works for me in other ACM problems
inte ptr (inte w)
{
	inte n = w;
	inte rez = 0;
	
	while (n % 2 == 0)
	{
		rez += 2;
		n /= 2;
	}
	
	inte i = 3;
	while (i <= (sqrt(n) + 1))
	{
		if (n % i == 0)
		{
			rez += sum(i);
			n /= i;
		}
		else i += 2;
	}
	
	if (n > 1) rez += sum(n);
	
	// If n == w ==> n is prime 
	if (n == w) return false;
	
	if (sum(w) == rez) return true;
	return false;
}

int main (void)
{	
	inte t; cin >> t;
	
	while (t--)
	{
		inte n; cin >> n;
		while (!ptr(++n));
		cout << n << endl;
	}
	
//	system("pause");
	return 0;
}

Code: Select all

inte sum (inte n) 
{ 
   inte r = 0;    
   while (n) 
   { 
      r += n % 10; 
      n /= 10; 
   } 
   return 0; 
} 

Code: Select all

#include<stdio.h>
#include<math.h>


long long int DigSum(long long int t)
{
 long long int m=0;
 while(t)
	{
     m+=t%10;
	 t/=10;
	}
 return m;
}

long long int PrimeFactorSum(long long int t)
{
 long long int k=0,i,d;
 while(t%2==0)
	{
	 k+=2;
	 t/=2;
	}
  d=sqrt(t);
 for(i=3;i<=d;i+=2)
	{
	 if(t%i==0)
		{
		 while(t%i==0)
			{
			k+=DigSum(i); 
			t/=i;
			}
		 d=sqrt(t);
		}
	}
 if(t>=i)k+=DigSum(t);
 return k;
}



void main()
{
 long cas;
 long long int sum1,sum2,n;
 scanf("%ld",&cas);
 while(cas--)
	{
	 scanf("%lld",&n);
	 while(0==0)
		{
		 sum1=DigSum(n);
	     sum2=PrimeFactorSum(n);
		 if(sum1==sum2)break;
	     else n++;
		}
	 printf("%lld\n",n);

	}
}

Code: Select all

int arr[1000];
arr[1001] = 5;
printf("%d\n",arr[1001]);