A - Frogger

**Time Limit:**1000MS **Memory Limit:**65536KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of …

A. Duff and Meat

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Duff is addicted to meat! Malek wants to keep her happy for n days. In order to be happy in i-th day, she needs to eat exactly a__i kilograms of meat.

There is a big shop uptown …

Cinema in Akiba

Cinema in Akiba (CIA) is a small but very popular cinema in Akihabara. Every night the cinema is full of people. The layout of CIA is very interesting, as there is only one row so that every audience can enjoy the wonderful movies without any annoyance by other audiences sitting in front of him/her.

The …

D - Geek’s Collection

**Time Limit:**2000MS **Memory Limit:**65536KB 64bit IO Format:%lld & %llu

Submit Status

Description

The word geek is a slang term, with different meanings ranging from “a computer expert or enthusiast” to “a carnival performer who performs sensationally morbid or …

1106 质数检测

基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题

收藏

关注

给出N个正整数，检测每个数是否为质数。如果是，输出"Yes"，否则输出"No"。

Catch him

**Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 664 Accepted Submission(s): 307
**

Problem Description

在美式足球中，四分卫负责指挥整只球队的进攻战术和跑位，以及给接球员传球的任务。四分卫是一只球队进攻组最重要的球员，而且一般身体都相对比较弱小，所以通常球队会安排5-7名大汉来保护他，其中站在四分卫前方、排成一线的5名球员称为进攻锋线，他们通常都是135公斤左右的壮汉。

A. Olesya and Rodion

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them.

Your task is: given the n and t print an …

有若干个活动，第i个开始时间和结束时间是[Si,fi)，同一个教室安排的活动之间不能交叠，求要安排所有活动，最少需要几个教室？

1第一行一个正整数n (n <= 10000)代表活动的个数。
2第二行到第(n + 1)行包含n个开始时间和结束时间。
3开始时间严格小于结束时间，并且时间都是非负整数，小于1000000000

输出

一行包含一个整数表示最少教室的个数。

输入示例