Source code for submission s1127

Go to diff to previous submission

fl.cpp

  1. #include <cstdio>
  2. using namespace std;
  3.  
  4. int N;
  5. int citatel;
  6. int jmenovatel;
  7.  
  8. inline int NSD(int a, int b)
  9. {
  10.     if(a < b)
  11.     {
  12.         int tmp = a;
  13.         a = b;
  14.         b = tmp;
  15.     }
  16.     int c = a%b;
  17.     //printf("   -== %d %d %d\n", a, b, c);
  18.     while(c != 0)
  19.     {
  20.         //printf("   --- %d %d %d\n", a, b, c);
  21.         a = b;
  22.         b = c;
  23.         c = a%b;
  24.     }
  25.     return b;
  26. }
  27.  
  28. int main()
  29. {
  30.     char znak;
  31.     int nsd;
  32.     int pocet;
  33.     while((znak = getchar()) != EOF) // "1"
  34.     {
  35.         if((znak = getchar()) == EOF) // "/"
  36.             return 0;
  37.  
  38.         scanf("%d", &N);
  39.  
  40.         //int a=2*N, b=2*N;
  41.         pocet = 1;
  42.  
  43.         int b_cit, b_jmen;
  44.         /**
  45.         for(int a=2*N-1; a>N; a--) // pocminka ??
  46.         {
  47.             b_cit = a*N;
  48.             b_jmen = a-N;
  49.  
  50.             nsd = NSD(b_cit, b_jmen);
  51.             //printf("... cit=%d, jmen=%d, nsd=%d\n", b_cit, b_jmen, nsd);
  52.             if(nsd == b_jmen)
  53.             {
  54.                 pocet++;
  55.                 //printf("Nalezeno! 1/%d + 1/%d\n", a, b_cit/b_jmen);
  56.             }
  57.         }
  58.         **/
  59.         printf("%d\n", pocet);
  60.  
  61.  
  62.         if((znak = getchar()) == EOF) // New Line
  63.             return 0;
  64.     }
  65.  
  66.  
  67.     /**
  68.     for(int i=1; i<=10000; i++)
  69.     {
  70.         for(int j=i; j<=10000; j++)
  71.         {
  72.             if(i*j > N*(i+j))
  73.             {
  74.                 //printf("Break: 1/%d + 1/%d\n", i, j);
  75.                 ; //break;
  76.             }
  77.  
  78.             // mensi
  79.             cit_new = i+j;
  80.             jmen_new = i*j;
  81.  
  82.             nsd = NSD(jmen_new, cit_new);
  83.             cit_new /= nsd;
  84.             jmen_new /= nsd;
  85.  
  86.             if(cit_new == 1 && jmen_new == N)
  87.             {
  88.                 pocet++;
  89.                 printf("Nalezeno! 1/%d + 1/%d\n", i, j);
  90.             }
  91.         }
  92.     }
  93.     **/
  94.  
  95.  
  96.  
  97.  
  98.  
  99.     return 0;
  100. }
  101.  

Diff to submission s847

fl.cpp

--- c5.s847.cteam093.fl.cpp.0.fl.cpp
+++ c5.s1127.cteam093.fl.cpp.0.fl.cpp
@@ -6,5 +6,5 @@
 int jmenovatel;
 
-int NSD(int a, int b)
+inline int NSD(int a, int b)
 {
     if(a < b)
@@ -42,4 +42,5 @@
 
         int b_cit, b_jmen;
+        /**
         for(int a=2*N-1; a>N; a--) // pocminka ??
         {
@@ -55,4 +56,5 @@
             }
         }
+        **/
         printf("%d\n", pocet);