hunnu monthly programming contest designed by openinx

Author: openinx

codeforces/round253/div2/a.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+#include<stdlib.h>
+#include<stdio.h>
+#include<string.h>
+
+int main(){
+    char c;
+    int cnt[100];
+    while((c=getchar())!='{'); 
+    memset(cnt, 0 ,sizeof(cnt));
+    while((c=getchar())!='}'){
+        if(c >= 'a' && c <= 'z' )
+            cnt[c - 'a'] ++ ; 
+    }
+    int size = 0;
+    for(int i = 0 ; i < 100; ++ i)
+        size += (cnt[i] > 0 ? 1: 0);
+    printf("%d\n", size);
+    return 0;
+}
+ 

codeforces/round253/div2/a.out

@@ -0,0 +1,28 @@
+#include<iostream>
+using namespace std ;
+
+char Month[][30]={"January" , "February" , "March" , "April" , "May" , "June" ,"July" , "August" , "September" ,"October" , "November" , "December" } ; 
+
+void random_case(){
+     int id = rand()%12 , K = rand()%101; 
+     
+     printf("%s\n" , Month[id]);
+     printf("%d\n" , K);
+     
+}
+
+int main(){
+    
+    //freopen("1.std.in" ,"w" , stdout);
+          
+    srand((int)time(NULL));
+    int testCase = 500 ;
+    while(testCase--){
+         random_case();
+    }
+    
+    //fclose(stdout);
+    
+    return 0 ;
+    
+}

hunnu_201012_acm_monthly/DateGenerator/a.cpp

@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std ;
+
+const  int MOD = 1000000 ;
+
+void random_case(){
+     int M = rand() % 100 + 1 , N = rand() % 100 + 1 ;
+     
+     printf("%d %d\n" , M , N);
+     
+     for(int i = 0 ; i < N + M ; ++ i){
+           printf("%d\n" , rand()%MOD);
+     }
+}
+
+
+int main(){
+    
+    //freopen("2.std.in" , "w" , stdout);
+    
+    srand((unsigned int) time(NULL));
+    int testCase = 98 ; 
+    printf("%d\n" , testCase);
+    while(testCase--){
+          random_case();
+    }
+    
+    //fclose(stdout);
+    
+    return 0 ;
+}

hunnu_201012_acm_monthly/DateGenerator/b.cpp

@@ -0,0 +1,26 @@
+#include<iostream>
+#include<stdlib.h>
+using namespace std ;
+
+int main(){
+    
+    ///freopen("2.std.in" , "w" , stdout);
+    
+    int testCase = 10 ;
+    printf("%d\n\n" , testCase);
+    
+    printf("%d\n" , 1);
+    printf("%d\n" , 10);
+    printf("%d\n" , 1000000000);
+    
+    srand((unsigned int) time(NULL)); 
+    
+    for(int i = 4 ; i <= testCase ; ++ i){
+          __int64 a = (__int64)rand() , b = (__int64)rand();
+          printf("%d\n" , (int)(a*b%1000000000) );
+    }
+    
+    // fclose(stdout);
+    
+    return 0 ;
+}

hunnu_201012_acm_monthly/DateGenerator/c.cpp

@@ -0,0 +1,123 @@
+#include<iostream>
+using namespace std ; 
+
+const  int maxn = 101 ;
+
+
+/*
+    Êý¾Ý¸ñʽ£º
+    CaseNumber 
+    N M K 
+    ....
+    ....
+    ....
+
+*/
+
+
+void special_case0(){
+    
+    printf("\n\n");
+    
+    printf("3 4 3\n");
+    printf("T.*.\n");
+    printf("*.*.\n");
+    printf("...J\n");
+    printf("3 3 3\n");
+}
+
+
+void special_case1(){
+   
+   printf("\n\n");
+   
+   printf("5 5 4\n");
+   printf("T..*.\n");
+   printf("*.*..\n");
+   printf("*...*\n");
+   printf("..*.*\n");
+   printf("**J.*\n");
+   printf("1 2 2 3\n");
+   
+}
+
+
+
+void random_case(int N , int M , int K , int obstacle){
+     
+     printf("\n\n");
+     
+     printf("%d %d %d\n" , N , M , K);
+     
+     char  bd[200][200] ;
+     int i , j , x, y , tx , ty , jx , jy , cx , cy ;
+     int dx[] = {1,0,-1,0} , dy[] = {0,1,0,-1};
+     
+     for(i = 0 ; i < N ; ++ i)
+        for(j = 0 ; j < M ;++ j)
+        bd[i][j] = '.' ; 
+     
+     for(i = 0 ; i < obstacle ; ++ i){
+         x = rand() % N  ;  y = rand() % M ; 
+         bd[x][y] = '*' ;
+     }
+     
+     tx = rand() % N ;   ty = rand() % M ;   bd[tx][ty] = 'T' ; 
+     
+     while(1){
+          jx = rand()%N ;  jy = rand()%M ;
+          if(!((jx == tx )&&(jy == ty)))  
+              break ; 
+     }
+     bd[jx][jy] = 'J' ; 
+     
+     for(i = 0 ; i < N ; ++ i){
+         for(j = 0 ; j < M ; ++ j)  printf("%c" , bd[i][j]);
+         printf("\n");
+     }
+     
+     
+     for(int step = 0 ; step < K ; ++ step){
+        
+           int d ;
+           while(1){
+                 d = rand() % 4 ;
+                 cx = jx + dx[d]  , cy = jy + dy[d] ; 
+                 if((cx<0||cy<0||cx>=N||cy>=M)|| bd[cx][cy] == '*')   continue ;
+                 break ; 
+           } 
+           
+           jx = cx , jy = cy ;
+           
+           printf("%d " , d );
+           
+     }
+     
+     printf("\n");
+}
+
+
+int main(){
+    
+    //freopen("1.std.in", "w" , stdout);
+    
+    srand((int)time(NULL));
+
+    printf("%d\n" , 10); 
+
+    special_case0();  
+    special_case1();  
+    
+    random_case(20 , 20 , 45 , 145);
+    random_case(30 , 30 , 100, 560);
+    random_case(100 , 100 , 100 , 1000);
+    random_case(100 , 100 , 100 , 2000);
+    random_case(10 , 10 , 70 , 56);
+    random_case(35 , 78 , 100 , 700 );
+    random_case(100 , 100 , 100 , 5000);
+    random_case(5 , 5 , 14 , 15);
+
+    //fclose(stdout);  
+    
+    return 0 ;
+}

hunnu_201012_acm_monthly/DateGenerator/d.cpp

@@ -0,0 +1,68 @@
+#include<iostream>
+using namespace std ;
+
+typedef __int64 lld ;
+
+void special_case0(){
+     
+     //printf("\n");
+     
+     printf("3 1 2 3\n");
+}
+
+void special_case1(){
+     
+    // printf("\n");
+     
+     printf("5 5 1 2 4 3\n");
+}
+
+void special_case2(){
+     
+     //printf("\n");
+     
+     printf("10 1 1 1 1 1 1 1 1 1 1\n");
+}
+
+void random_case(int n , int K){
+     
+     //printf("\n");
+     
+     printf("%d" , n);
+     
+     for(int i = 0 ; i < n ;++ i){
+         lld x = rand() ;
+         printf(" %I64d" , x * x % K);
+     }
+     printf("\n");
+
+}
+
+
+
+int main(){
+    int testCase = 10 ;
+    
+    //freopen("1.std.in" , "w" ,stdout );
+    
+    cout<<testCase <<endl;
+    
+    srand((int)time(NULL));
+    
+    special_case0();
+    special_case1();
+    special_case2();
+    
+    random_case(10     , 200000);
+    random_case(100    , 100);
+    random_case(1000   , 5000);
+    random_case(10000  , 200000);
+    random_case(50000  , 100000);
+    random_case(80000  , 100);
+    random_case(100000 , 200000);
+    
+    //fclose(stdout);
+    
+    return 0 ;
+    
+}