#include <stdio.h>
#include <stdlib.h>
int main()
{
long long int N,i,j,r;
for(;;)
{
scanf("%lld",&N);
if(N<0)
{
break;
}
else if(N==0)
{
r=1;
printf("%lld\n",r);
}
else if(N>0)
{
for(i=1,j=1; j<=N; j++)
{
r=N+i;
i=i+j;
}
printf("%lld\n",r);
}
}
return 0;
}
Category Ad-hoc
UVa – 10035 – Primary Arithmatic
#include <bits/stdc++.h>
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define sz(x) x.size()
#define qu queue
#define pqu priority_queue
#define vc vector
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n) for(int i=0;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case(z,x) cout<<"Case "<<i<<": "<<x<<endl
#define case(z) cout<<"Case "<<z<<": "
#define PI 3.14159265358979323846264338328
#define valid(tx,ty) tx>=0 && tx<r && ty>=0 && ty<c
#define MAX 2000
/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
using namespace std;
int main()
{
CIN;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
ll a,b,x,y,sum;
while(cin>>a>>b)
{
if(a==0 && b==0)
{
break;
}
int carry=0,c=0;
while(a!=0 || b!=0)
{
x=0;
y=0;
if(a!=0)
x=a%10;
if(b!=0)
y=b%10;
sum=x+y+carry;
a=a/10;
b=b/10;
carry=sum/10;
if(carry>=1)
c++;
}
if(c==0)
{
cout<<"No carry operation."<<endl;
}
else if(c==1)
{
cout<<"1 carry operation."<<endl;
}
else
cout<<c<<" carry operations."<<endl;
}
return 0;
}
UVa – 10018 – Reverse and Add
#include <stdio.h>
#include <stdlib.h>
int main()
{
long long int i,T,d,c,a,rvrs;
scanf("%lld",&T);
for(i=0;i<T;i++)
{
scanf("%lld",&a);
c=0;
for(;;)
{
d=a;
rvrs=0;
while(a!=0)
{
rvrs=rvrs*10;
rvrs=rvrs+(a%10);
a=a/10;
}
if(d==rvrs)
{
printf("%lld %lld\n",c,d);
break;
}
else
{
c++;
a=d+rvrs;
}
}
}
return 0;
}
UVa – 694 – The Collatz Sequence
#include <stdio.h>
#include <stdlib.h>
int main()
{
long long int a,l,k,c,i,d;
for(i=1;;i++)
{
scanf("%lld %lld",&a,&l);
if(a<0 && l<0)
{
break;
}
c=0;
d=a;
for(;;)
{
if(a==1)
{
c++;
break;
}
else if(a>l)
{
break;
}
else if(a%2==0)
{
c++;
a=a/2;
}
else if(a%2==1)
{
c++;
a=(3*a)+1;
}
}
printf("Case %lld: A = %lld, limit = %lld, number of terms = %lld\n",i,d,l,c);
}
return 0;
}
UVa – 382 – Perfection
#include <bits/stdc++.h>
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define sz(x) x.size()
#define qu queue
#define pqu priority_queue
#define vc vector
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n) for(int i=0;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case(z,x) cout<<"Case "<<i<<": "<<x<<endl
#define case(z) cout<<"Case "<<z<<": "
#define PI 3.14159265358979323846264338328
#define valid(tx,ty) tx>=0 && tx<r && ty>=0 && ty<c
#define MAX 2000
/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
using namespace std;
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
printf("PERFECTION OUTPUT\n");
int n,i,j,k,sum;
while((scanf("%d",&n))!=EOF)
{
if(n==0)
{
printf("END OF OUTPUT\n");
break;
}
sum=0;
for(i=1; i<=n/2; i++)
{
if(n%i==0)
{
sum=sum+i;
}
}
if(sum==n)
{
printf("%5d PERFECT\n",n);
}
else if(sum<n)
{
printf("%5d DEFICIENT\n",n);
}
else if(sum>n)
{
printf("%5d ABUNDANT\n",n);
}
}
return 0;
}
Fall out, Codes! 