Submission #354857

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace DepthFirstSearch
{
    class Program
    {
        //static int a, b, c, d, e, n, h;
        static int[] arr;
        static void Main(string[] args)
        {
            Console.SetIn(new StreamReader(Console.OpenStandardInput(20000)));
            //string[] s = Console.ReadLine().Split(' ');
            int n = int.Parse(Console.ReadLine());

            Console.WriteLine((n%12)+1);
            Console.ReadLine();
        }

        static void swap(int pos)
        {
            int tmp = arr[pos];
            arr[pos] = arr[pos - 1];
            arr[pos - 1] = tmp;
        }


        static void areFriends(Person a, Person b)
        {
            a.firends.Add(b.ID);
            b.firends.Add(a.ID);
        }
    }

    public class Tree
    {
        public Node _root;

        public Tree(Node root)
        {
            this._root = root;
        }

        public void addChild(Node root, Node child)
        {
            child.Parent = root;
            root.childs.Add(child);
        }

    }

    public class Point
    {
        public double x { get; set; }
        public double y { get; set; }

        public Point(double x, double y)
        {
            this.x = x;
            this.y = y;
        }

        public void assign(Point p)
        {
            this.x = p.x;
            this.y = p.y;
        }
    }

    public class Line
    {
        public Point a { get; set; }
        public Point b { get; set; }

        public Line(Point a, Point b)
        {
            this.a.assign(a);
            this.b.assign(b);
        }

        public bool isVer()
        {
            if (Math.Abs(a.x - b.x) < 0.01) return true;
            return false;
        }

        public bool isHor()
        {
            if (Math.Abs(a.y - b.y) < 0.01) return true;
            return false;
        }

        public double slope()
        {
            double s = (a.y - b.y) / (a.x - b.x);
            return s;
        }

        public bool isOnLine(Point p)
        {
            //parallel
            if (a.y - b.y == 0)
            {
                if (p.y - a.y == 0)
                    return true;
                else
                    return false;
            }

            //not parallel
            double slope = (a.x - b.x) / (a.y - b.x);

            if (Math.Abs((p.x - b.x) / (p.y - b.x) - slope) <= 0.01)
                return true;
            else
                return false;
        }

        public bool isIntersect(Line l)
        {
            if ((l.isHor() && this.isHor()) || l.isVer() && this.isVer())
                return false;
            return true;
        }
    }

    public class Node
    {
        public HashSet<Node> childs = new HashSet<Node>();
        public Node Parent;
        public int cost;
        public int fuel;
        public int grad;

        public Node(int cost, int fuel, int grad)
        {
            this.cost = cost;
            this.fuel = fuel;
            this.grad = grad;
        }
    }

    public class Person
    {
        public HashSet<int> firends = new HashSet<int>();
        public int ID { get; set; }

        public Person(int id)
        {
            this.ID = id;
        }
    }
}

Submission Info

Judge Result