zoukankan      html  css  js  c++  java
  • CF-gym-100523-C(水题)

    Will It Stop?

    Available memory: 64 MB.

       Byteasar was wandering around the library of the University of Warsaw and at one of its facades he noticed a piece of a program with an inscription “Will it stop?”. The question seemed interesting, so Byteasar tried to tackle it after returning home. Unfortunately, when he was writing down the piece of code he made a mistake and noted:

         while n > 1 do

           if n mod 2 = 0 then

            n := n=2

           else

            n := 3 · n + 3

       Byteasar is now trying to figure out, for which initial values of the variable n the program he wrote down stops. We assume that the variable n has an unbounded size, i.e., it may attain arbitrarily large values.

    Input

    The first and only line of input contains one integer n (2<=n<=10^14).

    Output

    In the first and only line of output you should write a single word TAK (i.e., yes in Polish), if the program stops for the given value of n, or NIE (no in Polish) otherwise.

    Example

    For the input data: 4

    the correct result is: TAK

    分析:根据题目给的循环,在里面加一句,如果当前的n已经出现过,接下来又是重复了,则会一直死循环,就直接退出。

     1 #include <cstdio>
     2 #include <cmath>
     3 #include <cstring>
     4 #include <ctime>
     5 #include <iostream>
     6 #include <algorithm>
     7 #include <set>
     8 #include <vector>
     9 #include <sstream>
    10 #include <queue>
    11 #include <typeinfo>
    12 #include <fstream>
    13 #include <map>
    14 #include <stack>
    15 using namespace std;
    16 #define INF 100000
    17 typedef unsigned long long ul;
    18 const int maxn=10010;
    19 map<ul,int> mp;
    20 int main()
    21 {
    22     ul n;
    23     scanf("%I64u",&n);
    24     int flag=1;
    25     while(n>1){
    26         mp[n]=1;
    27         if(n%2==0) n=n/2;
    28         else n=3*n+3;
    29         if(mp[n]==1) {flag=0;break;}
    30     }
    31     if(flag==1) printf("TAK
    ");
    32     else printf("NIE
    ");
    33     return 0;
    34 }
  • 相关阅读:
    bzoj 1176 cdq分治套树状数组
    Codeforces 669E cdq分治
    Codeforces 1101D 点分治
    Codeforces 1100E 拓扑排序
    Codeforces 1188D Make Equal DP
    Codeforces 1188A 构造
    Codeforces 1188B 式子转化
    Codeforces 1188C DP 鸽巢原理
    Codeforces 1179D 树形DP 斜率优化
    git commit -m "XX"报错 pre -commit hook failed (add --no-verify to bypass)问题
  • 原文地址:https://www.cnblogs.com/RRirring/p/4729680.html
Copyright © 2011-2022 走看看