OJ Board

Code: Select all

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

main()
{
    char inverse[15];
    unsigned long int inInt,outInt,temp;
    int counter,check;
    int i=0,j,n;
    
    scanf("%d",&n);
    while(i!=n)
    {
        scanf("%lu",&inInt);
        outInt=0;
        counter=0;
        check=0; 
        while(inInt!=outInt || check!=1)
        {
            for(j=0;j<15;j++)
            	inverse[j]='\0';
        	temp=inInt+outInt;
        	inInt=temp;
        	for(j=0;temp!=0 && j<15;j++)
        	{
            	inverse[j]=(char)(temp%10+(int)'0');
            	temp=temp-temp%10;
            	temp/=10;
        	}     
        	puts(inverse);
        	outInt=(long int)atol(inverse);
        	if(inInt==outInt) 
            { 
        		check=1;
        		break;
            }  		
        	counter++;
        }    
       	printf("%d %lu\n",counter,inInt);
        i++;
    }    
}   

Code: Select all

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

main()
{
    char inverse[15];
    unsigned long int inInt,outInt,temp,in,sum,product=10;
    int counter,check;
    int i=0,j,n;
    
    scanf("%d",&n);
    while(i!=n)
    {
        scanf("%lu",&inInt);
        in=inInt;
        outInt=0;
        counter=0;
        check=0; 
        while(inInt!=outInt || check!=1)
        {
            for(j=0;j<15;j++)
            	inverse[j]='\0';
        	temp=inInt+outInt;
        	inInt=temp;
        	for(j=0;temp!=0 && j<15;j++)
        	{
            	inverse[j]=(char)(temp%10+(int)'0');
            	temp=temp-temp%10;
            	temp/=10;
        	}     
        	//puts(inverse);
        	sum=0;
        	for(j=0;inverse[j]!='\0';j++)
        		sum=sum*product+(inverse[j]-'0'); //avoid overflow
        	outInt=sum;
        	if(inInt==outInt) 
            { 
        		check=1;
        		if(counter==0)
        		{
        			check=0;
        			counter++;
        			continue;
       			} 			
        		break;
            }  		
        	counter++;
        }    
        if(in==0)
        {
        	printf("0 0\n");
        	continue;
        }   	 
       	printf("%d %lu\n",counter,inInt);
        i++;
    }    
}   

Code: Select all

sum=0;
        	for(j=0;inverse[j]!='\0';j++)
        		sum=sum*product+(inverse[j]-'0'); //avoid overflow
        	outInt=sum;

Code: Select all

#include<stdio.h>

int count=0;

long revadd(long x)
{
	long temp,rem=0,revnum=0,ans=0,c=0;

		temp=x;
		do{
		revnum=0;
		while(x>0)
		{
			rem=x%10;
			revnum=revnum*10+rem;
			x=x/10;
		}
		ans=temp+revnum;
		revnum=0;
		c=ans;
		while(c>0)
		{
			rem=c%10;
			revnum=revnum*10+rem;
			c=c/10;
		}
		count++;
		x=ans;temp=ans;
		}while(revnum!=ans);
	return revnum;
}





int main()
{
	long n;
	int t;
	 scanf("%d",&t);
	while(t--)
	{	count =0;
		scanf("%ld",&n);
		printf("%d %ld\n",count, revadd(n));
	}
return 0;
}

Code: Select all

{function str2int(s:string):longint;
var liczba:longint;lol:integer;
begin
val(s,liczba,lol);
str2int:=liczba;
end;}
function int2str(l:int64):string;
var tmp:string;
begin
   str(l,tmp);
   int2str:=tmp;
end;
function reverse(a:int64):int64;
var j:int64;
begin

j:=0;
 while a<>0 do
   begin
      j:=j*10+(a mod 10);
      a:=a div 10;
   end;
reverse:=j;
end;

function palindrom(l:int64):boolean;
var liczba:string;i:integer;a:boolean;
begin
a:=true;
   if (l mod 11 = 0) then
      begin
        liczba:=int2str(l);
      for i:=1 to (length(liczba) div 2) do
    if liczba[i]<>liczba[length(liczba)-i+1] then
      begin a:=false; break; end ;
      end else
        if not (l div 10=0) then a:=false;
palindrom:=a;
end;

var i,zestaw,count:integer;liczba:int64;
begin
readln(zestaw);
 for i:=1 to zestaw do
    begin
      readln(liczba);count:=1;
      liczba:=liczba+reverse(liczba);
       while not palindrom(liczba) do
           begin
             inc(count);
             liczba:=liczba+reverse(liczba);
       end;
        writeln(count,' ',liczba);
    end;


end.

Code: Select all

#include<iostream>
using namespace std;
bool pal(unsigned int x)
{
     unsigned int a,b=0;
     a=x;
     while (a>0)
     {
           b=10*b+(a%10);
           a=a/10;
           }
           if (b==x)
           return false;
           else
           return true;
           }
unsigned int rev(unsigned int n)
{   bool flag;
    unsigned int m,t;
    int c=0;
    m=n;
    flag=pal(n);
    if(!flag){cout<<0<<" ";
    return n;}
    while (flag==true)
    {
          t=0;
          while (m>0)
          {
           t=10*t+(m%10);
           m=m/10;
           }
          
           t=n+t;
           c++;
           flag=pal(t);
           if (flag==true)
           {n=t;
            m=t;
            }
          
           }
           cout<<c<<" ";
           return t;
           }
int main()
{
    int n,i=0;
    
    cin>>n;
    while (i<=n)
    {
          unsigned int a,b;
          cin>>a;
          b=rev(a);
          cout<<b<<endl;
          }
          return 0;
          }     

Code: Select all

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

long long add (long long a,char* buf1,char* buf2);
void rev (char* buf1,char* buf2);

long long int count = 0;

long long int add (long long p,char* buf1,char* buf2){
        long long added,j,k;
        char check1[100],check2[100];

        sprintf(buf1,"%d",p);

        rev(buf1,buf2);

        j = atoi(buf1);
        k = atoi(buf2);
        added = j+k;
        
        sprintf(check1,"%d",added);
        rev (check1,check2);

        count++;

        if (strcmp(check1,check2) == 0) {
           return added;
        } else {
          added = add (added,buf1,buf2);
        }
        
}

void rev (char* buf1,char* buf2) {
          int i,z;
          z=0;
          for (i=strlen(buf1)-1;i>=0;i--){
              buf2[z] = buf1[i];
              z++;
          }

          buf2[z] = '\0';
}

int main(){
    long long p;
    int N;
    int i;

    char buf1[100],buf2[100];
    long long result;

    scanf("%d",&N);

    for (i=1;i<=N;i++){
        scanf("%lld",&p);
        count = 0;
        result = add (p,buf1,buf2);
        printf("%lld %lld\n",count,result);
    }

    return 0;
}