#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);
string s,str;
while(cin>>s)
{
loop0(i,sz(s))
{
if(s[i]>='A' && s[i]<='C')
{
str+='2';
}
else if(s[i]>='D' && s[i]<='F')
{
str+='3';
}
else if(s[i]>='G' && s[i]<='I')
{
str+='4';
}
else if(s[i]>='J' && s[i]<='L')
{
str+='5';
}
else if(s[i]>='M' && s[i]<='O')
{
str+='6';
}
else if(s[i]>='P' && s[i]<='S')
{
str+='7';
}
else if(s[i]>='T' && s[i]<='V')
{
str+='8';
}
else if(s[i]>='W' && s[i]<='Z')
{
str+='9';
}
else
{
str+=s[i];
}
}
cout<<str<<endl;
str.clear();
}
return 0;
}
Category UVa
UVa – 11734 – Big number of teams will solve this
#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(nx,ny) nx>=0 && nx<r && ny>=0 && ny<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);
int t;
cin>>t;
loop1(z,t)
{
getchar();
string s1,s2;
getline(cin,s1);
cin>>s2;
string s3;
loop0(i,sz(s1))
{
if(s1[i]!=' ') s3+=s1[i];
}
case(z);
if(s1==s2)
cout<<"Yes"<<endl;
else if(s2==s3)
cout<<"Output Format Error"<<endl;
else
cout<<"Wrong Answer"<<endl;
}
return 0;
}
UVa – 10340 – All in ALL
#include <iostream>
using namespace std;
int main()
{
string s,t;
int i,j,c,d,n,s_l;
while(cin>>s>>t)
{
c=0;
d=0;
n=-1;
s_l=s.length();
for(i=0;s[i]!='\0';i++)
{
for(j=n+1;t[j]!='\0';j++)
{
if(s[i]==t[j])
{
c++;
break;
}
}
if(c==0)
{
break;
}
if(j>n)
{
n=j;
}
else if(j<n)
{
d=1;
break;
}
}
if(c==s_l && d==0)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
return 0;
}
UVa – 713 – Adding reverse numbers
#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);
int t;
cin>>t;
for(int z=0; z<t; z++)
{
string s1,s2;
string ans;
cin>>s1>>s2;
int aa=max(sz(s1),sz(s2));
int a=0,b=0,carry=0;
loop0(i,aa)
{
a=b=0;
if(i<sz(s1))
a=s1[i]-'0';
if(i<sz(s2))
b=s2[i]-'0';
int sum=a+b+carry;
ans+='0'+(sum%10);
carry=sum/10;
}
if(carry) ans+='0'+carry;
bool test=0;
loop0(i,sz(ans))
{
if(ans[i]!='0') test=1;
if(test) cout<<ans[i];
}
cout<<endl;
}
return 0;
}
UVa- 11713 – Abstract names
#include <iostream>
using namespace std;
int main()
{
int i,j,k,m,c,t,s1_l,s2_l;
string s1,s2;
cin>>t;
for(m=0;m<t;m++)
{
cin>>s1>>s2;
s1_l=s1.length();
s2_l=s2.length();
c=0;
if(s1_l==s2_l)
{
for(i=0,j=0;s1[i]!='\0';i++,j++)
{
if(s1[i]=='a' || s1[i]=='e' || s1[i]=='i' || s1[i]=='o' || s1[i]=='u')
{
if(s2[j]=='a' || s2[j]=='e' || s2[j]=='i' || s2[j]=='o' || s2[j]=='u')
{
c++;
}
}
else if(s1[i]==s2[j])
{
c++;
}
}
if(c==s1_l)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
else
{
cout<<"No"<<endl;
}
}
return 0;
}
Fall out, Codes! 