Added full Codeforces archive

Author: mukel

Codeforces/1/A[ Theatre Square ].java

@@ -0,0 +1,72 @@
+import java.util.*;
+import java.io.*;
+import java.math.*;
+
+public class Main implements Runnable
+{   
+    public void solve() throws IOException
+    {
+            
+        long n = nextInt();
+        long m = nextInt();
+        long a = nextInt();
+        
+        writer.println(((n+a-1)/a) * ((m+a-1)/a));
+    }
+
+    public static void main(String[] args)
+    {
+        new Main().run();
+    }
+
+    BufferedReader reader;
+    StringTokenizer tokenizer;
+    PrintWriter writer;
+
+    public void run()
+    {
+        try
+        {
+            reader = new BufferedReader(new InputStreamReader(System.in));
+            tokenizer = null;
+            writer = new PrintWriter(System.out);
+            solve();
+            reader.close();
+            writer.close();
+        }
+        catch (Exception e)
+        {
+            e.printStackTrace();
+            System.exit(1);
+        }
+    }
+
+    int nextInt() throws IOException
+    {
+        return Integer.parseInt(nextToken());
+    }
+
+    long nextLong() throws IOException
+    {
+        return Long.parseLong(nextToken());
+    }
+
+    double nextDouble() throws IOException
+    {
+        return Double.parseDouble(nextToken());
+    }
+
+    BigInteger nextBigInteger() throws IOException
+    {
+        return new BigInteger(nextToken());
+    }
+
+    String nextToken() throws IOException
+    {
+        while (tokenizer == null || !tokenizer.hasMoreTokens())
+        {
+            tokenizer = new StringTokenizer(reader.readLine());
+        }
+        return tokenizer.nextToken();
+      }
+}     

Codeforces/1/B[ Spreadsheet ].cpp

@@ -0,0 +1,66 @@
+// Alfonso2 Peterssen (mukel)
+#include <cstdio>
+#include <iostream>
+#include <sstream>
+
+#include <algorithm>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <deque>
+#include <set>
+#include <map>
+
+#include <cstdlib>
+#include <cmath>
+#include <cstring>
+#include <complex>
+
+using namespace std;
+
+typedef long long int64;
+
+#define SZ(c) ((int)(c).size())
+#define ALL(c) (c).begin(), (c).end()
+#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
+#define FOR(i, l, h) for (int i = (int)(l); i <= (int)(h); ++i)
+#define FOREACH(it, c) for (typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
+
+int Q;
+string line;
+int row, col;
+char buf[100];
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+
+    for (cin >> Q; Q--;)
+    {
+        cin >> line;
+        if (sscanf( line.c_str(), "R%dC%d", &row, &col ) == 2)
+        {
+            string ans;
+            while (col > 0)
+            {
+                col--;
+                ans += (char)(&#39;A&#39; + col % 26);
+                col /= 26;
+            }
+            reverse(ALL(ans));
+            cout << ans << row << "\n";
+        }
+        else
+        {
+            sscanf( line.c_str(), "%[A-Z]%d", &buf, &row );
+            col = 0;
+            for (int i = 0; buf[i]; ++i)
+                col = col * 26 + (buf[i] - &#39;A&#39; + 1);
+            cout << "R" << row << "C" << col << "\n";
+        }
+    }
+
+
+
+    return 0;
+}

Codeforces/1/C[ Ancient Berland Circus ].cpp

@@ -0,0 +1,139 @@
+// Alfonso2 Peterssen (mukel)
+#include <cstdio>
+#include <iostream>
+#include <sstream>
+
+#include <algorithm>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <deque>
+#include <set>
+#include <map>
+
+#include <cstdlib>
+#include <cmath>
+#include <cstring>
+#include <complex>
+
+using namespace std;
+
+typedef long long int64;
+
+#define SZ(c) ((int)(c).size())
+#define ALL(c) (c).begin(), (c).end()
+#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
+#define FOR(i, l, h) for (int i = (int)(l); i <= (int)(h); ++i)
+#define FOREACH(it, c) for (typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
+
+typedef complex< double > point;
+
+#define xx real()
+#define yy imag()
+
+
+point rotate(const point p, double angle)
+{
+    return p * point(cos(angle), sin(angle));
+}
+
+point rotateAt(point p, point at, double angle)
+{
+    return rotate(p - at, angle) + at;
+}
+
+point perp(const point p)
+{
+    return point(-p.yy, p.xx);
+}
+
+const double EPS = 1e-5;
+
+point cutPoint(point p1, point p2, point q1, point q2)
+{
+    double a1 = p2.yy - p1.yy;
+    double b1 = p1.xx - p2.xx;
+    double c1 = a1 * p1.xx + b1 * p1.yy;
+
+    double a2 = q2.yy - q1.yy;
+    double b2 = q1.xx - q2.xx;
+    double c2 = a2 * q1.xx + b2 * q1.yy;
+
+    double det = a1 * b2 - a2 * b1;
+
+    return point((b2 * c1 - b1 * c2) / det, (a1 * c2 - a2 * c1) / det);
+}
+
+
+double sqr(double x)
+{
+    return x * x;
+}
+
+double dist(point a, point b)
+{
+    return sqrt(sqr(a.xx - b.xx) + sqr(a.yy - b.yy));
+}
+
+point readPoint()
+{
+    double x, y;
+    cin >> x >> y;
+    return point(x, y);
+}
+
+point A, B, C;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+
+/*
+    cout << "0 0" << endl;
+    cout << "1 0" << endl;
+    cout << cos(M_PI/3) << " " << sin(M_PI/3) << endl;
+    return 0;*/
+
+    A = readPoint();
+    B = readPoint();
+    C = readPoint();
+
+    A -= C;
+    B -= C;
+
+    point a2 = A * 0.5;
+    point b2 = B * 0.5;
+
+    point center = cutPoint(a2, a2 + perp(A), b2, b2 + perp(B));
+
+    //cout << "center = " << center.xx << " " << center.yy << endl;
+
+    for (int i = 3; i <= 100; ++i)
+    {
+        double innerAngle = 2 * M_PI / i;//M_PI * (i - 2) / i;
+
+        int cnt = 0;
+        for (int j = 1; j < i; ++j)
+        {
+            point p = rotateAt(point(0, 0), center, j * innerAngle);
+            if (dist(p, A) < EPS) cnt++;
+            if (dist(p, B) < EPS) cnt++;
+
+        }
+
+        if (cnt == 2)
+        {
+            //cout << i << endl;
+            double r = dist(point(0, 0), center);
+            double area = i * r * r * sin(2 * M_PI / i) / 2;
+            printf( "%.12lf\n", area );
+            break;
+        }
+    }
+
+    return 0;
+}
+
+
+
+

Codeforces/101/A[ Homework ].cpp

@@ -0,0 +1,88 @@
+/*
+Alfonso2 Peterssen(mukel)
+Universidad de La Habana
+Codeforces Round 79 Beta Div. 1
+*/
+#include <cstdio>
+#include <iostream>
+#include <sstream>
+
+#include <algorithm>
+#include <numeric>
+#include <vector>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <set>
+#include <map>
+
+#include <cstdlib>
+#include <cstring>
+#include <cmath>
+#include <complex>
+
+using namespace std;
+
+typedef long long int64;
+
+#define PB(x) push_back(x)
+#define SZ(c) ((int)((c).size()))
+#define MP(x, y) make_pair((x), (y))
+#define ALL(c) (c).begin(), (c).end()
+#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
+#define FOR(i, b, e) for (int i = (int)b; i <= (int)(e); ++i)
+#define FOREACH(it, c) for (typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
+#define DBG(x) cout << #x << " = " << x << endl
+
+const int ALPHA = 1 << 8;
+
+int N, K;
+char buf[1 << 18];
+int del[ALPHA];
+int freq[ALPHA];
+int order[ALPHA];
+int cnt;
+
+bool myComp(int i, int j)
+{
+	return freq[i] < freq[j];
+}
+
+int main()
+{
+	scanf( "%s", &buf );
+	scanf( "%d", &K );
+	
+	int n = strlen(buf);
+	
+	REP(i, n)
+		freq[ buf[i] ]++;
+		
+	REP(i, ALPHA) if (freq[i])
+		order[cnt++] = i;
+		
+	sort(order, order + cnt, myComp);
+		
+		
+	int remain = cnt;
+	
+	REP(i, cnt)
+	{
+		int j = order[i];
+		if (K - freq[j] >= 0)
+		{
+			del[j] = true;
+			remain--;
+			K -= freq[j];
+		}
+	}
+	
+	printf( "%d\n", remain );
+	
+	REP(i, n)
+	      if (!del[ buf[i] ]) printf( "%c", buf[i] );
+	      
+	printf( "\n" );
+
+	return 0;
+}