zoukankan      html  css  js  c++  java
  • 【ACM打卡】ZOJ 3191

    3191 

    根据度数 输出时间/时间区间

    -1结束


    3124

    输出与输入一样

    运用数组


    3191

    #include<iostream>
    using namespace std;
    
    int main(){
        int i;
        while(cin>>i&&i!=-1){
            if(i==0) cout<<"Exactly 3 o'clock"<<endl;
            if(i>0&&i<30) cout<<"Between 2 o'clock and 3 o'clock"<<endl;
    
            if(i==30) cout<<"Exactly 2 o'clock"<<endl;
            if(i>30&&i<60) cout<<"Between 1 o'clock and 2 o'clock"<<endl;
    
            if(i==60) cout<<"Exactly 1 o'clock"<<endl;
            if(i>60&&i<90) cout<<"Between 0 o'clock and 1 o'clock"<<endl;
    
            if(i==90) cout<<"Exactly 0 o'clock"<<endl;
            if(i>90&&i<120) cout<<"Between 11 o'clock and 0 o'clock"<<endl;
    
            if(i==120) cout<<"Exactly 11 o'clock"<<endl;
            if(i>120&&i<150) cout<<"Between 10 o'clock and 11 o'clock"<<endl;
    
            if(i==150) cout<<"Exactly 10 o'clock"<<endl;
            if(i>150&&i<180) cout<<"Between 9 o'clock and 10 o'clock"<<endl;
    
            if(i==180) cout<<"Exactly 9 o'clock"<<endl;
            if(i>180&&i<210) cout<<"Between 8 o'clock and 9 o'clock"<<endl;
    
            if(i==210) cout<<"Exactly 8 o'clock"<<endl;
            if(i>210&&i<240) cout<<"Between 7 o'clock and 8 o'clock"<<endl;
    
            if(i==240) cout<<"Exactly 7 o'clock"<<endl;
            if(i>240&&i<270) cout<<"Between 6 o'clock and 7 o'clock"<<endl;
    
            if(i==270) cout<<"Exactly 6 o'clock"<<endl;
            if(i>270&i<300) cout<<"Between 5 o'clock and 6 o'clock"<<endl;
    
            if(i==300) cout<<"Exactly 5 o'clock"<<endl;
            if(i>300&&i<330) cout<<"Between 4 o'clock and 5 o'clock"<<endl;
    
            if(i==330) cout<<"Exactly 4 o'clock"<<endl;
            if(i>330&&i<360) cout<<"Between 3 o'clock and 4 o'clock"<<endl;
    
        }
    }
    

    3134

    #include<stdio.h>
    using namespace std;
    
    int main(){
        char s[1000];
        while(gets(s))
        {
            printf("%s
    ",s);
        }
        return 0;
    }
    


  • 相关阅读:
    事件的解密
    C#世界中的委托
    这次是C#中的接口
    完全二叉树的建立和翻转
    全排列的应用
    网易笔试-按位或运算
    柱状图的最大矩形--单调栈
    Linux将线程绑定到CPU内核运行
    Windows多线程与线程绑定CPU内核
    B+树介绍
  • 原文地址:https://www.cnblogs.com/iriswang/p/11084671.html
Copyright © 2011-2022 走看看