Uva 10252 - Common Permutation

By -

Comments

Post a Comment

Popular posts from this blog

SPOJ-CMG - Collecting Mango

By -
#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<cmath> #include<algorithm> #define psb push_back #define ppb pop_back #define all(x) x.begin(),x.end() #define N 1000100 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; LL ar[N] , num[N]; int main() {     int t , tc=0;     //cin >> t;     sf("%d",&t);     while(t--)     {         LL n, x, arlen=-1, nmlen=-1 , i , maxi=-1 , zar;         char c;         //cin >> n;         sf("%lld",&n);         //cout << "Case " << ++tc << ":\n";       ...
Read more

Codefores A. Vitya in the Countryside

By -
//Next Codeforces Round #354 (Div. 2) #include<bits/stdc++.h> //#include<cstdio> //#include<iostream> //#include<algorithm> //#include<vector> //#include<cstring> //#include<cmath> //#include<map> using namespace std; #define fast ios_base::sync_with_stdio(false) #define bfast cin.tie(0) #define outs(x) cout << x << " " #define outn(x) cout << x << "\n" #define sf scanf #define pf printf typedef long long LL; typedef vector<int>vii; typedef vector<LL>vll; int ar[100]; int main() {     fast;     int n ,  i;     while(cin >> n)     {         if(n == 1)         {             cin >> ar[0];             if(ar[0] == 15) outn("DOWN");     ...
Read more

LightOJ 1093 - Ghajini

By -
// Accepted // RMQ and RMQ #include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(false) #define bfast cin.tie(0) #define outs(x) cout << x << " " #define outn(x) cout << x << "\n" #define sf scanf #define pf printf #define nl puts("") #define psb push_back typedef long long LL; typedef vector<int>vii; typedef vector<LL>vll; const int mod = 1000007; const int high = 100003; const int inf = 1 << 30; LL ar[high], br[high], treemini[4 * high], treemaxi[4 * high]; void buildmini(int node, int b , int e) {     if(b > e) return;     if(b == e)     {         treemini[node] = ar[b];         return;     }     int Left = node << 1;     int Right = Left + 1;     int mid = (b + e) >> 1;     buildmini(Left, b , mid);    ...
Read more