Day of the Programmer

Problem Statement :

```Marie invented a Time Machine and wants to test it by time-traveling to visit Russia on the Day of the Programmer (the 256th day of the year) during a year in the inclusive range from 1700 to 2700.

From 1700 to 1917, Russia's official calendar was the Julian calendar; since 1919 they used the Gregorian calendar system. The transition from the Julian to Gregorian calendar system occurred in 1918, when the next day after January 31st was February 14th. This means that in 1918, February 14th was the 32nd day of the year in Russia.

In both calendar systems, February is the only month with a variable amount of days; it has 29 days during a leap year, and 28 days during all other years. In the Julian calendar, leap years are divisible by 4; in the Gregorian calendar, leap years are either of the following:

Divisible by 400.
Divisible by 4 and not divisible by 100.
Given a year, y, find the date of the 256th day of that year according to the official Russian calendar during that year. Then print it in the format dd.mm.yyyy, where dd is the two-digit day, mm is the two-digit month, and yyyy is y.

For example, the given year = 1984. 1984 is divisible by 4, so it is a leap year. The 256th day of a leap year after 1918 is September 12, so the answer is 12. 08. 1984.

Function Description

Complete the dayOfProgrammer function in the editor below. It should return a string representing the date of the 256th day of the year given.

dayOfProgrammer has the following parameter(s):

year: an integer

Input Format

A single integer denoting year y.

Constraints

1700 \le y \le 2700

Output Format

Print the full date of Day of the Programmer during year y in the format dd.mm.yyyy, where dd is the two-digit day, mm is the two-digit month, and yyyy is y.```

Solution :

```                            ```Solution in C :

python 3  :

#!/bin/python3

import sys

y = int(input().strip())

if y<1918 :
if y%4==0:
print("12.09."+str(y))
else:
print("13.09."+str(y))

elif y>1918:
if y%400==0 or (y%4==0 and y%100!=0):
print("12.09."+str(y))
else:
print("13.09."+str(y))
else:
print("26.09.1918")

Java  :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int y = in.nextInt();

if(y==1918)
{
System.out.println("26.09." + y);
}
else if(y>=1919)
{
if(y%400==0 || (y%4==0 && y%100!=0))
{
System.out.println("12.09." + y);
}
else
{
System.out.println("13.09." + y);
}
}
else if(y<=1917)
{
if(y%4==0)
{
System.out.println("12.09." + y);
}
else
{
System.out.println("13.09." + y);
}
}
}
}

C++  :

#include <bits/stdc++.h>

using namespace std;

int main(){
int y;
cin >> y;
if(y<1918){
if(y%4==0)cout<<"12.09."<<y<<endl;
else cout<<"13.09."<<y<<endl;
}
else if(y==1918){
cout<<"26.09."<<y<<endl;
}
else{
if(y%400==0){
cout<<"12.09."<<y<<endl;
}
else if(y%4==0&&y%100!=0){
cout<<"12.09."<<y<<endl;
}
else cout<<"13.09."<<y<<endl;
}
return 0;
}

C  :

#include <stdio.h>

int main(){
int y;
scanf("%d",&y);
if(y<1918){
if(y%4){
printf("13.09.%4d\n",y);
}
else{
printf("12.09.%4d\n",y);
}
}
else if(y== 1918){
printf("26.09.1918\n");
}
else{
if((y%400 == 0) || (y%4 == 0 && y%100)){
printf("12.09.%4d\n",y);
}
else{
printf("13.09.%4d\n",y);
}
}
return 0;
}```
```

Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below

Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing