Initial commit

Author: jhonber

README

@@ -0,0 +1,2 @@
+### Programming contest
+  Solutions for some problems

codeforces/April Fools Day Contest/D.cpp

@@ -0,0 +1,58 @@
+using namespace std;
+#include<algorithm>
+#include<iostream>
+#include<sstream>
+#include<string>
+#include<vector>
+#include<queue>
+#include<stack>
+#include<map>
+#include<set>
+#include<bitset>
+
+#include<climits>
+#include<cstring>
+#include<cstdio>
+#include<cmath>
+
+template <class T> string toStr(const T &x)
+{ stringstream s; s << x; return s.str(); }
+
+template <class T> int toInt(const T &x)
+{ stringstream s; s << x; int r; s >> r; return r; }
+
+#define MPI acos(-1)
+#define fr(i,j,n) for(int i=j;i<n;++i)
+#define FR(i,n) fr(i,0,n)
+#define foreach(x,v) for(typeof (v).begin() x = (v).begin(); x!= (v).end(); x++)
+#define all(x) x.begin(),x.end()
+#define rall(x) x.rbegin(),x.rend()
+#define RI(x) scanf("%d",&x)
+#define DRI(x) int x;RI(x)
+#define RII(x,y) scanf("%d%d",&x,&y)
+#define DRII(x,y) int x,y;RII(x,y)
+#define PI(x) printf("%d ",x)
+#define PIS(x) printf("%d\n",x)
+#define D(x) cout<< #x " = "<<(x)<<endl
+#define Dd(x) printf("#x = %lf\n", x)
+#define Dbg if(1)
+#define PB push_back
+#define MK make_pair
+#define F first
+#define S second
+#define MAXN 1000000000
+typedef long long ll;
+typedef vector<ll> vl;
+typedef vector<int> vi;
+typedef set<int> sti;
+
+int main(){
+	int n;
+	cin >> n;
+	if(n==1) cout << 2 ;
+	else if(n==2) cout << 3;
+	else if(n==3) cout << 1;
+	else if(n==4) cout << 2;
+	else cout << 1;
+	return 0;
+}

codeforces/CROC-MBTU 2012, Final Round (Online version, Div. 2)/A.cpp

@@ -0,0 +1,63 @@
+using namespace std;
+#include<bits/stdc++.h>
+#define __ ios_base::sync_with_stdio(0);cin.tie(0);
+
+#define PI acos(-1)
+#define fr(i,j,n) for(int i=j;i<n;++i)
+#define FR(i,n) fr(i,0,n)
+#define all(x) x.begin(),x.end()
+#define D(x) cout<< #x " = "<<(x)<<endl
+#define PB push_back
+#define MK make_pair
+#define F first
+#define S second
+
+template <class T> string toStr(const T &x)
+{ stringstream s; s << x; return s.str(); }
+
+template <class T> int toInt(const T &x)
+{ stringstream s; s << x; int r; s >> r; return r; }
+
+int dx[8] = {-1,-1,-1,0,1,1, 1, 0};
+int dy[8] = {-1, 0, 1,1,1,0,-1,-1};
+
+typedef long long ll;
+typedef vector<ll> vl;
+typedef vector<int> vi;
+typedef vector<string> vs;
+typedef vector<vi> vvi;
+typedef pair <int,int> pii;
+
+int main(){ 
+	int n, tmp;
+	cin >>n;
+	vi v(n);
+	int bad = 0;
+	FR(i,n){
+		cin >> v[i];
+		if(v[i]<0) bad++;
+	}
+	int t = ceil(bad/2.0);
+	if(!t) t++;
+	cout << t << endl;
+	int c = 0, c2=0, j = 0;
+	vi v2;
+	FR(i,n-1){
+		if(v[i] < 0) c++;
+		if(c==2 && v[i+1]<0){
+			v2.PB(i-j+1);
+			j = i+1;
+			c = 0;
+		}
+		
+		c2++;
+	}
+
+	int c3=0;
+	FR(i,v2.size()){
+		cout << v2[i] << " ";
+		c3 += v2[i];
+	}
+	if(c3<n) cout <<(n-c3);
+	return 0; 
+}

codeforces/Codeforces Beta Round 1/A.cpp

@@ -0,0 +1,31 @@
+using namespace std;
+#include<algorithm>
+#include<iostream>
+#include<sstream>
+#include<string>
+#include<vector>
+#include<queue>
+#include<stack>
+#include<map>
+#include<set>
+#include<bitset>
+
+#include<climits>
+#include<cstring>
+#include<cstdio>
+#include<cmath>
+
+template <class T> string toStr(const T &x)
+{ stringstream s; s << x; return s.str(); }
+
+template <class T> int toInt(const T &x)
+{ stringstream s; s << x; int r; s >> r; return r; }
+
+
+
+int main(){
+	double n, m, a;
+	cin >> n >> m >> a;
+	printf("%0.0lf\n", ceil(m/a) * ceil(n/a));
+	return 0;
+}

codeforces/Codeforces Beta Round 11/A.cpp

@@ -0,0 +1,64 @@
+using namespace std;
+#include<algorithm>
+#include<iostream>
+#include<sstream>
+#include<string>
+#include<vector>
+#include<queue>
+#include<stack>
+#include<map>
+#include<set>
+#include<bitset>
+
+#include<climits>
+#include<cstring>
+#include<cstdio>
+#include<cmath>
+
+#define PI acos(-1)
+#define fr(i,j,n) for(int i=j;i<n;++i)
+#define FR(i,n) fr(i,0,n)
+#define foreach(x,v) for(typeof (v).begin() x = (v).begin(); x!= (v).end(); x++)
+#define all(x) x.begin(),x.end()
+#define rall(x) x.rbegin(),x.rend()
+#define D(x) cout<< #x " = "<<(x)<<endl
+#define Dd(x) printf("#x = %lf\n", x)
+#define Dbg if(1)
+#define PB push_back
+#define MAXN 1000
+
+typedef long long int ll;
+typedef vector<ll> vl;
+typedef vector< string > vs;
+typedef vector<int> vi;
+typedef vector<int,int> vii;
+typedef vector<vi> vvi;
+typedef pair <int,int> pii;
+typedef pair <string,string> pss;
+typedef vector<pss> vpss;
+typedef pair <double,double> pdd;
+
+
+int main(){
+	int n,d,a,b;
+	cin >> n >> d;
+	cin >> a;
+
+	int ans = 0;
+	FR(i,n-1){
+		cin >> b;
+		if(a>b){
+			double x = ceil(((double)a - (double)b) / (double)d);
+			b += d*x;
+			ans += x;
+		}
+		if(a==b) {
+			b += d;
+			ans++;
+		}
+		a = b;
+	}
+
+	cout << ans << endl;
+	return 0;
+}

codeforces/Codeforces Beta Round 2/A.cpp

@@ -0,0 +1,91 @@
+using namespace std;
+#include<algorithm>
+#include<iostream>
+#include<sstream>
+#include<string>
+#include<vector>
+#include<queue>
+#include<stack>
+#include<map>
+#include<set>
+#include<bitset>
+
+#include<climits>
+#include<cstring>
+#include<cstdio>
+#include<cmath>
+
+template <class T> string toStr(const T &x)
+{ stringstream s; s << x; return s.str(); }
+
+template <class T> int toInt(const T &x)
+{ stringstream s; s << x; int r; s >> r; return r; }
+
+#define PI acos(-1)
+#define fr(i,j,n) for(int i=j;i<n;++i)
+#define FR(i,n) fr(i,0,n)
+#define foreach(x,v) for(typeof (v).begin() x = (v).begin(); x!= (v).end(); x++)
+#define all(x) x.begin(),x.end()
+#define rall(x) x.rbegin(),x.rend()
+#define D(x) cout<< #x " = "<<(x)<<endl
+#define Dd(x) printf("#x = %lf\n", x)
+#define Dbg if(1)
+#define PB push_back
+#define MK make_pair
+#define MAXNODES 1000
+#ifdef NO
+#ifdef ONLINE_JUDGE
+freopen("input.txt","r",stdin);
+freopen("output.txt","w",stdout);
+#endif
+#endif
+
+typedef long long ll;
+typedef vector<ll> vl;
+typedef vector<int> vi;
+typedef vector<vi> vvi;
+typedef map<string,int> msi;
+typedef vector< pair<string,int> > vpsi;
+
+int main(){
+  int n;
+  cin >> n;
+  msi mapa,mapa2;
+  vpsi v;
+  int  max = -INT_MAX;
+  string res;
+  
+  FR(i,n){
+    string name;
+    int s;
+    cin >> name >> s;
+    mapa[name] += s;
+    v.PB(MK(name,s));
+  }
+
+  FR(i,v.size()) if( mapa[v[i].first] > max ) max = mapa[v[i].first];
+
+  msi win;
+  msi::iterator it = mapa.begin();
+  for(;it!=mapa.end();++it)
+    if(it->second==max)
+      win[it->first]++;
+
+
+  FR(i,v.size()){
+    mapa2[v[i].first] += v[i].second;
+    if(mapa2[v[i].first] >= max && win[v[i].first]) {
+      cout << v[i].first << endl;
+      return 0;
+    }
+  }
+ 
+  return 0;
+}
+
+
+
+
+
+
+

codeforces/Codeforces Beta Round 22 (Div. 2 Only)/A.cpp

@@ -0,0 +1,58 @@
+using namespace std;
+#include<algorithm>
+#include<iostream>
+#include<sstream>
+#include<string>
+#include<vector>
+#include<queue>
+#include<stack>
+#include<map>
+#include<set>
+#include<bitset>
+#include<climits>
+#include<cstring>
+#include<cstdio>
+#include<cmath>
+
+#define PI acos(-1)
+#define fr(i,j,n) for(int i=j;i<n;++i)
+#define FR(i,n) fr(i,0,n)
+#define foreach(x,v) for(typeof (v).begin() x = (v).begin(); x!= (v).end(); x++)
+#define all(x) x.begin(),x.end()
+#define rall(x) x.rbegin(),x.rend()
+#define D(x) cout<< #x " = "<<(x)<<endl
+#define Dbg if(1)
+#define PB push_back
+#define MK make_pair
+
+typedef long long int ll;
+typedef vector<ll> vl;
+typedef vector<int> vi;
+typedef vector<string> vs;
+typedef vector<vi> vvi;
+typedef pair <int,int> pii;
+
+
+int main(){
+	int n;
+	cin >> n;
+	if(n==1){
+		int t;
+		cin >> t;
+		cout << "NO" << endl;
+		return 0;
+	}
+	set<int> st;
+	FR(i,n){
+		int t;
+		cin >> t;
+		st.insert(t);
+	}
+	if(st.size()==1){
+		cout << "NO" << endl;
+		return 0;
+	}
+	set<int> ::iterator it=st.begin();
+	it++;
+	cout << *it << endl;
+}