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

LightOj 1003 - Drunk

By -
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<map> #include<string> #include<stack> #define sf scanf #define pf printf #define mx 20010 #define white 0 #define gray 1 #define black 2 using namespace std; typedef map<string, int>mpsi; typedef vector < vector <int> >vvii; typedef vector<int>vi; vi G[mx]; int color[mx]; bool cycle = false; void graph_clear() {     for(int i=0; i<mx; i++)     {         G[i].clear();     } } void DFS_Visit(int u) {     color[u] = gray;     int i , v;     for(i=0; i<G[u].size(); i++)     {         v = G[u][i];         if(color[v] == white)         {        ...
Read more

Uva 11105 - Semi-prime H-numbers

By -
// Accepted // Header file begin #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<utility> #include<queue> #include<algorithm> #include<cstdlib> // End //.......... // Macro #define sf scanf #define pf printf #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define mem(c,v) memset(c,v,sizeof(c)) #define cp(a) cout<<" "<<a<<" " #define nl puts("") #define sq(x) ((x)*(x)) #define all(x) x.begin(),x.end() #define reall(x) x.rbegin(),x.rend() #define s_wap(x,y) x^=y;y^=x;x^=y; #define sz size() #define gc getchar() #define pb push_back #define freader freopen("input.txt","r",stdin) // End......... // Size #define mx7 20000100 #define mx6 1500...
Read more

TOJ 1, 10, 100, 1000...

By -
// Accepted // Time: 0.156 // Accepted #include<iostream> #include<cstdio> #include<cmath> #include<algorithm> #include<vector> #include<cstring> #include<string> #include<map> #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; //LL ar[2147516417]; vll dp; void sequence() {     LL i , sum=2;     //dp[2]=1;     dp.push_back(1);     dp.push_back(2);     for(i=2; i<=2147483648; i++)     {         sum += i;         if(sum > 2147483648)         {             //dp[sum] = 1;             //cout << sum;             break; ...
Read more