TJU 2498. Uncle Jack January 20, 2010

TJU 2498. Uncle Jack
TODOLIST
WRONG ANSWER
{big multiplication based question}

#include<iostream>
#include<stdlib.h>
#include<math.h>
using namespace std;

class A{
   long long i,j,N,D,R;
    
   public:
       void input(){
         cin>>N>>D;
         if(N==0&&D==0) exit(0);
       }
       void output(){
        R=powf(N,D);
        cout<<R<<endl;
       }
};

int main()
{
 A a;
 while(1){
   a.input();
   a.output();
 }

return 0;
}

TJU 2346., PKU 2924 Gauß in Elementary School November 23, 2009

Gauß in Elementary School
TJU 2346
PKU 2924

--AC--
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

int main()
{

  int i=0,j,k;
  int cases;
  long long int n,m,res,res1,res2;

  scanf("%d",&cases);
  while(cases--)
  {
    scanf("%lld%lld",&n,&m);
    
    if(n<=0&&m<=0)
    {
      n=-n;
      m=-m;
      res1=(n*(n+1))/2;
      res2=(m*(m+1))/2;
      if(res2>res1)
       res=-(res2-res1);
      else
       res=-(res1-res2);
       
       res=res+(-m);
     }
     else if(n>=0&&m>=0)
     {
       res1=(n*(n+1))/2;
       res2=(m*(m+1))/2;
       if(res1>res2)
         res=res1-res2;
       else
         res=res2-res1;
       res=res+n;
     }
     else if(n>=0&&m<=0)
     {
       res1=(n*(n+1))/2;
       m=-m;
       res2=(m*(m+1))/2;
       res=res1-res2;
       
     }
     else if(n<=0&&m>=0)
     {
       res1=(m*(m+1))/2;
       n=-n;
       res2=(n*(n+1))/2;
       res=res1-res2;
     }
   printf("Scenario #%d:\n",++i);
   printf("%lld\n\n",res);
  }

return 0;
}

TJU 1730 ,PKU 1316 Self Numbers November 23, 2009

Self Numbers
TJU 1730.
PKU 1316

--AC--
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>


int main()
{
 int i,j,k;
 int n,a[10001],digit_sum,tot;
 char s[100];
 for(i=1;i<=10000;i++)
   a[i]=1;

 for(i=1;i<=10000;i++)
 {
   
   sprintf(s,"%d",i);
   digit_sum=0;
   tot=0;
   for(j=0;s[j]!='\0';j++)
    digit_sum+=s[j]-48;
   tot=i+digit_sum;
  
   if(tot<=10000)
     a[tot]=0;
  }
  for(i=1;i<=10000;i++)
   if(a[i]==1)
    printf("%d\n",i);

return 0;
} 

PKU 1000 A+B Problem November 22, 2009

PKU 1000. A+B Problem

Now, getting in touch with PKU.

#include<stdio.h>
int main()
{
 int a,b;
 scanf("%d%d",&a,&b);
 printf("%d\n",a+b);
return 0;
}