Programming Problems!!!: February 2015

Thursday, February 5, 2015

Solution of 379A. New Year Candles (Codeforces)

#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()
{
int a, b, div, mod;
sf("%d%d", &a, &b);
int sum = a;
while(a>=b)
{
div = (a/b);
sum = sum + div;
mod = (a%b);
a= (div+mod);
}
pf("%d\n", sum);
}

Solution of 228A. Is your horseshoe on the other hoof? (Codeforces)

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

int main()
{
int count, ans;
ll s1, s2, s3, s4;
cin >> s1 >> s2 >> s3 >> s4;
ans=0;
count = 1;
if(s1!=s2 && s1!=s3 && s1!=s4)
{
count++;
}
if(s2!=s3 && s2!=s4)
{
count++;
}
if(s3!=s4)
{
count++;
}
ans = (4-count);
cout << ans << endl;
}

Solution of 467A. George and Accommodation (Codeforces)

#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()
{
int n, p, q, seat;
sf("%d", &n);
int count = 0;
while(n--)
{
sf("%d%d", &p, &q);
seat = (q-p);
if(seat>=2)
{
count++;
}
}
pf("%d\n", count);
}

Solution of 460A. Vasya and Socks (Codeforces)

Solution of 110A. Nearly Lucky Number (Codeforces)

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
typedef long long ll;

int main()
{
string s;
cin >> s;
ll len = s.length();
ll count =0;
for(int i=0; i<len; i++)
{
if(s[i]=='7' || s[i]=='4')
{
count++;
}
}
if(count == 4 || count == 7)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}

}

Solution of 236A. Boy or Girl (Codeforces)

#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");
}
}

Solution of 339A. Helpful Maths ( Codeforces)

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

int main()
{
string s;
int i, k, len;
cin >> s;
len = s.length();
k=1;
int count = 1;
for(i=0; i<len; i++)
{
a[0] = s[0]-'0';
if(s[i]=='+')
{
a[k] = s[i+1]-'0';
k++;
count++;
}
}
sort(a, a+k);
for(k=0; k<count; k++)
{
cout << a[k];
if(k==(count-1))
{
break;
}
cout <<"+";
}
}

Solution of 119A. Epic Game ( Codeforces )

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

int gcd(int a, int b)
{
if(b==0)
{
return a;
}
return gcd(b, a%b);
}

int main()
{
int a, b, n;
sf("%d%d%d", &a, &b, &n);
while(1)
{
n= n-gcd(a, n);
if(n<=0)
{
pf("0\n");
break;
}
n= n-gcd(b, n);
if(n<=0)
{
pf("1\n");
break;
}
}
}

Solution of 148A. Insomnia cure(Codeforces)

#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()
{
int k, l, m, n, d;
cin >> k >> l >> m >> n >> d;
int count = 0;
for(int i=1; i<=d; i++)
{
if(i%k==0 || i%l ==0 || i%m ==0 || i%n ==0)
{
count++;
}
}
cout << count << endl;
}

Solution of 507A. Amr and Music (Codeforces)

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define pf printf
#define sf scanf
#define MAX 105
int a[MAX], b[MAX], print[MAX];

int main()
{
int n, k, i, p;
int sum, count;
sf("%d%d", &n, &k);
int j=1;
for(i=1; i<=n; i++)
{
sf("%d", &a[i]);
b[j] = a[i];
j++;
}
sort(a, a+i);
if(a[1]>k)
{
pf("0\n");
}
else
{
sum =0;
count = 0;
for(int i=1 ;i<=n; i++)
{
sum = sum + a[i];
count ++;
if(sum>=k)
{
if(sum==k)
{
break;
}
else
{
sum = sum - a[i];
count --;
break;
}
}
}
p = 1;
for(int i=1; i<=count; i++)
{
for(int j=1; j<=n ;j++)
{
if(a[i]==b[j])
{
print[p] = j;
b[j] = 0;
p++;
}
}
}
sort(print, print+p);
pf("%d\n", count);
for(p=1; p<=count; p++)
{
pf("%d ", print[p]);
}
pf("\n");
}
}

Sunday, February 1, 2015

Solution of 1068. Sum ( Timus Online Judge )

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

int main()
{
int n, sum;
scanf("%d", &n);
sum = 0;
if(n>0)
{
sum = (n*(n+1))/2;
}
else if(n<=0)
{
sum = ((n*(n-1))/2)*(-1);
sum = sum + 1;
}
printf("%d\n", sum);
}

Solution of 6A. Triangle (Codeforces)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
#define pf printf
#define sc scanf
#define MAX 100
int arr[MAX];

int main()
{
int i, j, k;
int test, t;
int arr[5];
for(i=0; i<4; i++)
{
sc("%d",&arr[i]);
}
sort(arr, arr+4);
if(arr[0]+arr[1]>arr[2] || arr[1]+arr[2]>arr[3])
{
printf("TRIANGLE\n");
}
else if(arr[0]+arr[1]==arr[2] || arr[1]+arr[2]==arr[3])
{
printf("SEGMENT\n");
}
else
{
printf("IMPOSSIBLE\n");
}
}

Solution of 270A. Fancy Fence (CodeForces)

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

int main()
{
int test, a;
sf("%d", &test);
while(test--)
{
sf("%d", &a);
if( 360 % (180-a) ==0)
{
pf("YES\n");
}
else
{
pf("NO\n");
}
}
}

Programming Problems!!!