Program to find century for a year

Given a year the task is that we will find the century in the given year. The first century start from 1 to 100 and the second century start from 101 to 200 and so on .
Examples:

Input : year = 1970
Output : 20 century 

Input : year = 1800
Output : 18 century 

CPP

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ code for find the century 
// in a given year
#include <bits/stdc++.h>
using namespace std;
  
void find_century(int year)
{
    // No negative value is allow for year
    if (year <= 0)
        cout << "0 and negative is not allow"
             << "for a year";
  
    // If year is between 1 to 100 it
    // will come in 1st century
    else if (year <= 100)
        cout << "1st century\n";
  
    else if (year % 100 == 0)
        cout << year/ 100 <<" century";
    else
        cout << year/ 100 + 1 << " century";        
}
  
// Driven code
int main()
{
    int year = 2001;
    find_century(year);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code for find the century
// in a given year
class GFG {
static void find_century(int year) {
  
    // No negative value is allow for year
    if (year <= 0)
    System.out.print("0 and negative is not allow"
                    + "for a year");
  
    // If year is between 1 to 100 it
    // will come in 1st century
    else if (year <= 100)
        System.out.print("1st century\n");
  
    else if (year % 100 == 0)
        System.out.print(year / 100 + " century");
  
    else
        System.out.print(year / 100 + 1 + " century");
}
  
// Driver code
public static void main(String[] args) {
    int year = 2001;
    find_century(year);
}
}
// This code is contributed by Anant Agarwal.

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# code for find the century in a given year
using System;
  
class GFG {
      
    static void find_century(int year) {
      
        // No negative value is allow for year
        if (year <= 0)
        Console.WriteLine("0 and negative is not"
                           + " allow for a year");
      
        // If year is between 1 to 100 it
        // will come in 1st century
        else if (year <= 100)
            Console.WriteLine("1st century\n");
      
        else if (year % 100 == 0)
            Console.WriteLine(year / 100 + " century");
      
        else
            Console.WriteLine(year / 100 + 1 +
                                          " century");
    }
      
    // Driver code
    public static void Main() {
          
        int year = 2001;
          
        find_century(year);
    }
}
  
// This code is contributed by vt_m.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP code for find the century 
// in a given year
  
function find_century( $year)
{
      
    // No negative value is
    // allow for year
    if ($year <= 0)
        echo "0 and negative is not allow"
              , "for a year";
  
    // If year is between 1 to 100 it
    // will come in 1st century
    else if($year <= 100)
        echo "1st century\n";
  
    else if ($year % 100 == 0)
        echo $year / 100 ," century";
    else
        echo floor($year / 100) + 1 
                      , " century";     
}
  
    // Driver Code
    $year = 2001;
    find_century($year);
  
// This code is contributed by anuj_67.
?>

chevron_right



Output:

21 century


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : vt_m



Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.