UVa 11614 Etruscan Warriors Never Play Chess

By -
The Accepted Code is on github
Solution Link: Solution Link of UVa 11614 Etruscan Warriors Never Play Chess

Comments

Post a Comment

Popular posts from this blog

LeetCode Reverse Integer

By -
 Problem Description:  https://leetcode.com/problems/reverse-integer/description/ Accepted Solution /* I have learned some crucial things during solving the problem. For example, if you want to check integer overflows for several operations, you have to manage the following conditions: int a = <something>;  int x = <something>; if (x < 0 && a > INT_MAX + x) // a - x would overflow   // `a - x` would overflow if (x > 0 && a < INT_MIN + x) // a - x would underflow if (a == -1 && x == INT_MIN) // a * x can overflow if (x == -1 && a == INT_MIN) // a * x (or a / x) can overflow if (x != 0 && a > INT_MAX / x) // a * x would overflow if (x != 0 && a < INT_MIN / x) // a * x would underflow Hence, check the appropriate conditions in perfect positions at your code. Also, keep your attention when you are dealing with a negative number. Moreover, a negative number is unsuitable for direct...
Read more

LightOj 1370 - Bi-shoe and Phi-shoe

By -
// Accepted #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define cp(a) cout<<" "<<a<<" "<<endl #define ull unsigned long long int #define nl puts("") #defin...
Read more

URI/BEE 3165/beecrowd | 3165 - Twin Prime

By -
/* You have to find out two nearest prime numbers of N which have the maximum size less than or equals to N and the gap between them is two. In this code/algorithm, since the input data is subtle by 10^3, in that case, any naive formulation to find prime numbers is acceptable. Thus, we have applied Sieve to make separate all composite and prime numbers and then the Twin_Prime() function figure out the two adjacent prime numbers in such as way that each number is updated by its adjacent prime number which has a difference is two. */ #include<stdio.h> #define high 1007 #define sf scanf #define pf printf int primes[high], flag[high]; void init() {     int i=0;     for(; i<high; i++)     {         flag[i] = 0;     } } void Sieve() {     int i=0, j=0;     for(i=2; i<high; i++)     {         if(flag[i] == 0)         {           ...
Read more