CF 723A

#include<bits/stdc++.h>

using namespace std;

int main()
{
 int x,xx,xxx;
 cin>>x>>xx>>xxx;
 
 int result = (max(x,max(xx,xxx))) -( min(x,min(xx,xxx)));
 
 cout<<result<<endl;
 
 return 0;
}

688B - Lovely Palindromes

#include<bits/stdc++.h>

using namespace std;

int main()
{
 string s,lp;
 cin>>s;
 lp=s;
 reverse(s.begin(),s.end());
 
 cout<<lp+s<<endl;
 lp="";
 
 return 0;
}

686A - Free Ice Cream

#include<bits/stdc++.h>

using namespace std;

int a[1000+1];

int main()
{
 long long t,n,sum,dist,m;
 char c;
 
 while(cin>>t>>m)
 {
  sum=0;
  dist=0;
  
   cin>>c;
   cin>>n;
   if(c=='+') {
    sum=m+n;
   }
   else if(c=='-')
   {
    sum=m-n;
    if(sum<0) {
    dist++;
    sum=sum+n;
   }
  }
   
   
   
  for(int i=1; i<t; i++)
  {
   cin>>c;
   cin>>n;
   if(c=='+') {
    sum+=n;
   }
   else if(c=='-')
   {
    sum-=n;
    if(sum<0)
    {
     dist++;
     sum=sum+n;
    }
   }
  }
  cout<<sum<<" "<<dist<<endl;
 }
 
 return 0;
}

681A - A Good Contest

#include<iostream>
#include<cstdio>

using namespace std;

#define dbug(x) cout<<">"<<x<<endl;

void Solve()
{
 int n,N;
 N=2400;
  cin>>n;
  bool bb=false;
  for(int i=0; i<n; i++)
  {
    string s;
    int b,a;
   cin>>s>>b>>a;
   
   if(b>=N && a>b){
    bb=true;
   }
  }
  
  if(bb) {
   cout<<"Yes"<<endl;
  }
  else {
   cout<<"No"<<endl;
  }
 
}

266A - Stones on the Table

#include<bits/stdc++.h>
#include<cstring>
#include<cstdio>

using namespace std;

int main()
{
 int t,l,i,ct;
 cin>>t;
 char a[t];
 cin>>a;
 l= strlen(a);
 ct=0;
 for(i=1; i<l; i++)
 {
  if(a[i-1]==a[i]) ct++;
 }
 
 cout<<ct<<endl;

 return 0;
}

467A - George and Accommodation

#include<bits/stdc++.h>

using namespace std;

void solve()
{
 int t,p,q;
 int mv=0;
 
 cin>>t;
 
 while(t--)
 {
  cin>>p>>q;
  if(q-p>=2) mv++;
 }
 cout<<mv<<endl;
 
}

int main()
{
 solve();
 
 return 0;
}

CF 546A

#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long k,n,w,ans = 0;
    cin >> k >> n >> w;
    for(int i = 1; i <= w; i++){
        ans += i*k;
    }
    ans-=n;
    if(ans <= 0)cout << 0 << endl;
    else cout << ans << endl;
    return 0;
}

CF 96A

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main() {
    int flag, cnt;
    char s[105];
    scanf("%s", s);
    cnt=flag=0;
    for(int i=1; i<strlen(s); i++) {
        if(s[i]==s[i-1]) cnt++;
        else cnt=0;
        if(cnt==6) {
            flag=1;
            printf("YES");
            break;
        }
    }
    if(flag==0) printf("NO");
    return 0;
}

CF 236A

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define sf scanf
#define pf printf
typedef long long ll;

int main()
{
    char s[105];
    cin >> s;
    int len = strlen(s);
    sort(s, s+len);
    int count =0;
    for(int i=0; i<len; i++)
    {
        if(s[i] != s[i+1])
        {
            count++;
        }
    }
    if(count%2==0)
    {
        pf("CHAT WITH HER!\n");
    }
    else
    {
        pf("IGNORE HIM!\n");
    }
}

CF 4A

#include<iostream>
#define dbug(x) cout<<">"<<x<<endl;

using namespace std;

int main()
{
 int index,i;
 long long a[37];
 a[0]=1;
 
 for(i=1; i<=36; i++)
 {
  a[i]=a[i-1]*2;
  if(a[i]==8192) a[i]=a[i]-100;
  //dbug(a[i]);
 }
 
 while(cin>>index)
 {
  cout<<a[index]<<endl;
 }
}

CF 617A

#include<iostream>
#define lld long long
#define dbug(x) cout<<">"<<x<<endl

using namespace std;

int main()
{
 long long x;
 long long hp=5;
 
 while(cin>>x)
 {
  if(x%hp==0) cout<<x/hp<<endl;
  else cout<<(x/hp)+1<<endl;
  
   }
   
   return 0;
}

CF 231A

#include<iostream>
#define pf printf
#include<cstdio>
#define dbug(x) cout<<">"<<x<<endl


using namespace std;

int main()
{
 int a,i,sum,t;
 int cnt=0;
 while(cin>>t)
 {
  
  while(t--)
  {
   sum=0;
   for(i=0; i<3; i++)
   { 
    cin>>a;
    sum+=a;
   }
   if(sum>=2) cnt++;
  }
  cout<<cnt<<endl;
  cnt=0;
 }
 
 
 return 0;
}

CF 282A

#include<iostream>
#include<cstring>
#define debug(x) cout<<">"<<x<<endl;

using namespace std;

int main()
{
 int n,x;
 string s;
 
 while(cin>>n)
 {
  x=0;
  while(n--)
  {
   cin>>s;
   if(s=="X++" || s=="++X") x++;
   else if(s=="X--" || s=="--X") x--;
  }
  cout<<x<<endl;
 }
 
 return 0;
}

CF 122A

#include<iostream>
#define dbug(x) cout<<">"<<x<<endl;
#include<vector>

using namespace std;

bool isLucky(int n)
{
 int digit;
 while(n!=0)
 {
  digit= n%10;
     if(digit!=7 && digit!=4) return false;
     n=n/10;
 }
 
 return true;
}



int main()
{
 int i,x,j,m,temp;
 vector<int>v;

 for(i=4; i<=500; i++)
 {
  if(isLucky(i)) {
   temp=i;
   v.push_back(temp);
  }
  
 }
 
 while(cin>>x)
 {
  int si;
  if(isLucky(x)){
    cout<<"YES"<<endl;
  }
  
  else{
   
   si=0;
   for(i=0; i<v.size(); i++)
   {
    if(x%v[i]==0){
     si=1;
     break; 
    }
   }
   
   if(si==1) cout<<"YES"<<endl;
   else if(si==0) cout<<"NO"<<endl;
  }
 }
 
 return 0;
}

CF 71A

#include<iostream>
#include<cstring>

using namespace std;

int main()
{
 int n,i,l;
 string a;
 
 while(cin>>n)
 {
  while(n--)
  {
   cin>>a;
   l=a.size();
   if(l>10)
   {
    cout<<a[0]<<(l-2)<<a[l-1]<<endl; 
   }
   else cout<<a<<endl;
   
   
  }
 }
 return 0;
}

CF 118A

#include<cstring>
#include<iostream>
#include<vector>
#include<ctype.h>

using namespace std;

int main()
{
 char a[101];
 vector<char>con;
 int i;
 
 while(cin>>a)
 {
  con.clear();
  int l=strlen(a);
  for(i=0; i<l; i++)
  {
   if(a[i]=='A' || a[i]=='a' || a[i]=='I' || a[i]=='i' || a[i]=='e' || a[i]=='E' || a[i]=='o' || a[i]=='O'|| a[i]=='U' || a[i]=='u' || a[i]=='y' || a[i]=='Y')
   {
    continue;
   }
   else {
    char c=tolower(a[i]);
    con.push_back(c);
   }
  }
  
  for(i=0; i<con.size(); i++)
  {
   char cc;
   cc=con[i];
   cout<<"."<<con[i];
  }
  cout<<endl;
 }
 
 return 0;
}

CF: Watermelon

#include<iostream>

using namespace std;

int main()
{
 long long a;
 
 cin>>a;
 if(a<=2 || a%2!=0) cout<<"NO"<<endl;
 else cout<<"YES"<<endl;
 return 0;
}

CF - A and B and Compilation Errors

#include<iostream>

using namespace std;

int main()
{
 long long fl,sl,tl;
 long long tc,n1,n2,n3,i;
 long long r1,r2;
 
 while(cin>>tc)
 {
  fl=0,sl=0,tl=0;
  for(i=0; i<tc; i++)
  {
   cin>>n1;
   fl=fl+n1;
  }
  
  for(i=0; i<tc-1; i++)
  {
   cin>>n2;
   sl=sl+n2;
  }
  
  for(i=0; i<tc-2; i++)
  {
   cin>>n3;
   tl=tl+n3;
  }
  
  r1=fl-sl;
  r2=sl-tl;
  
  cout<<r1<<endl<<r2<<endl;
 }
 
  
 
 return 0;
}

Codeforces : Theatre Square Solution

 Codeforces : Theatre Square Solution


//Author: Humaun Kabir

#include<stdio.h>

#include<math.h>

int main()

{

    double n,m,a;

    double ans;

  

    while(scanf("%lf %lf %lf",&n,&m,&a)==3){

  

        double row = ceil(n/a);

        double column = ceil(m/a);

  

        ans =row * column;

  

        printf("%.0lf\n",ans);

  

    }

    return 0;

}

Problem Link :  http://codeforces.com/problemset/problem/1/A