round246

Author: openinx

codeforces/round246/a.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+#include<stdlib.h>
+#include<stdio.h>
+
+int main(){
+    int n , k, x, count = 0  ; 
+    while(scanf("%d%d", &n, &k) != EOF ){
+        count = 0 ; 
+        for(int i = 0 ; i < n ; ++ i){
+            scanf("%d", &x);
+            if(x + k <= 5){
+                count ++ ; 
+            }
+        }
+        printf("%d\n", count / 3);
+    }
+    return 0 ;
+}

codeforces/round246/a.in

@@ -0,0 +1,6 @@
+5 2
+0 4 5 1 0
+6 4
+0 1 2 3 4 5
+6 5
+0 0 0 0 0 0

codeforces/round246/b.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+#include<stdlib.h>
+#include<stdio.h>
+#include<string.h>
+
+#define MAXN 100005
+
+int main(){
+    int n, i, a[MAXN], b[MAXN], ac[MAXN], bc[MAXN] ; 
+    while(scanf("%d", &n) !=EOF ){
+        memset(ac , 0 , sizeof(ac));
+        memset(bc , 0 , sizeof(bc));
+        for(int i = 0 ; i < n ; ++ i){
+            scanf("%d%d", &a[i], &b[i]);
+            ac[ a[i] ] += 1 ; 
+            bc[ b[i] ] += 1 ; 
+        }
+        for(int i = 0 ; i < n ; ++ i){
+            int delta = ac[ b[i] ] ; 
+            printf("%d %d\n", n - 1 + delta , n - 1 - delta);
+        }
+    }
+    return 0 ;
+}

codeforces/round246/b.in

@@ -0,0 +1,8 @@
+2
+1 2
+2 1
+
+3
+1 2
+2 1
+1 3

codeforces/round246/c.cpp

@@ -0,0 +1,107 @@
+#include<iostream>
+#include<stdlib.h>
+#include<string.h>
+#include<stdio.h>
+#include<map>
+#include<algorithm>
+
+using namespace std ;
+
+
+#define MAXN 100001
+
+typedef pair<int, int> PII;
+
+int p[MAXN], p_size = 0, is[MAXN] ;
+
+int val[MAXN], ret[5 * MAXN][2], ret_size ;
+
+
+map< int, int > mp; 
+
+
+int get_primes(){
+    p_size = 0 ;
+    memset(is, 0 , sizeof(is));
+    for(int i = 2 ; i < MAXN;  i += 1)
+        if(is[i] == 0){
+            for(int j = i + i ; j  < MAXN; j += i )
+                is[j] = 1 ; 
+            p[p_size ++ ] = i ; 
+        }
+}
+
+
+int my_swap(int idx1, int idx2){
+    int v1 = val[idx1], v2 = val[idx2];
+    map<int, int>::iterator it ;
+    mp[idx1] = v2; mp[idx2] = v1;
+    swap(val[idx1], val[idx2]);
+}
+
+/*
+int find_prime(int v){
+    int m , l = 0 , r = p_size;
+    while(l + 1 < r){
+        m = (l + r) >> 1;
+        if(p[m] == v)
+            return p[m];
+        if (p[m] < v)
+            l = m ;
+        else
+            r = m - 1; 
+    }
+    return p[l];
+}*/
+
+
+int find_prime(int v){
+    int t = p[0] ; 
+    for(int i = 0 ; i < v ; ++ i){
+        if(p[i] > v) break; 
+        t = p[i];
+    }
+    return t;
+}
+
+
+void print_operation(int x, int y){
+    while(x < y ){
+        int d = y - x + 1 ; 
+        int v = find_prime(d);
+        ret[ret_size][0] = x ; ret[ret_size][1] = y ; ret_size ++ ;
+        printf("=========> %d (x,y,d) = (%d,%d, %d)\n" , v, x, x + v - 1 , d);
+//printf("%d %d\n", x ,  x + (*v) - 1);
+        my_swap(val[x], val[x + v - 1]) ;
+        x = x + v - 1 ; 
+    }
+}
+
+
+int main(){
+    int n ; 
+    get_primes();
+    while(scanf("%d", &n) !=EOF ){
+        mp.clear();
+        for(int i = 1 ; i <= n ; ++ i){
+            scanf("%d", &val[i]);
+            mp[ val[i] ] = i ; 
+        }
+        int start_idx, end_idx ; 
+        ret_size = 0 ; 
+        for(int i = 1 ; i <= n ; ++ i){
+            map<int, int>::iterator it = mp.begin();
+            start_idx = i ; end_idx = it->second ; 
+            int min_value = it->first;
+            print_operation(start_idx, end_idx);
+            it = mp.find(min_value);
+            mp.erase(it);
+        }
+        printf("%d\n", ret_size);
+        for(int i = 0 ; i < ret_size ; ++ i)
+            printf("%d %d\n", ret[i][0], ret[i][1]);
+    }
+    return 0 ; 
+}
+
+

codeforces/round246/c.in

@@ -0,0 +1,8 @@
+3
+3 2 1
+
+2
+1 2
+
+4
+4 2 3 1