اولین دوره مسابقات برنامه نویسی دانشگاه پیام نور

لینک ثبت نام

سوالات مسابقه انتخابی به همراه جواب ها و داده ها

دانلود سوال

دانلود جواب ها

دانلود داده ها

دومین مسابقه برنامه دانشگاه پیام نور

مسابقات انتخابی مسابقات برنامه نویسی غرب آسیا

با سلام

نظر به در پیش رو داشتن مسابقات برنامه نویسی غرب آسیا ، مسابقه انتخابی تیم برنامه نویسی دانشگاه در مورخ 94/8/4 در محل آزمایشگاه های کامپیوتر واقع در ساختمان 1 برگزار میشود

سوال از طریق شماره تماس [phone]

و لینگ تلگرام :   https://telegram.me/joinchat/BzglQQIoGVJSPoqME2Z3Cw

سوالات تمرینی 9

A. Boy or Girl

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network.

But yesterday, he came to see "her" in the real world and found out "she" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.

This is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.

Input

The first line contains a non-empty string, that contains only lowercase English letters — the user name. This string contains at most 100 letters.

Output

If it is a female by our hero's method, print "CHAT WITH HER!" (without the quotes), otherwise, print "IGNORE HIM!" (without the quotes).

Sample test(s)

input

wjmzbmr

output

CHAT WITH HER!

input

xiaodao

output

IGNORE HIM!

input

sevenkplus

output

CHAT WITH HER!

Note

For the first example. There are 6 distinct characters in "wjmzbmr". These characters are: "w", "j", "m", "z", "b", "r". So wjmzbmr is a female and you should print "CHAT WITH HER!".

http://codeforces.com/problemset/problem/236/A

سوالات تمرینی 7

A. Football

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.

Input

The first input line contains a non-empty string consisting of characters "0" and "1", which represents players. The length of the string does not exceed 100 characters. There's at least one player from each team present on the field.

Output

Print "YES" if the situation is dangerous. Otherwise, print "NO".

Sample test(s)

input

001001

output

NO

input

1000000001

output

YES

http://codeforces.com/problemset/problem/96/A

سوالات تمرینی 8

A. Stones on the Table

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered neighboring if there are no other stones between them.

Input

The first line contains integer n (1 ≤ n ≤ 50) — the number of stones on the table.

The next line contains string s, which represents the colors of the stones. We'll consider the stones in the row numbered from 1to n from left to right. Then the i-th character s equals "R", if the i-th stone is red, "G", if it's green and "B", if it's blue.

Output

Print a single integer — the answer to the problem.

Sample test(s)

input

3
RRG

output

1

input

5
RRRRR

output

4

input

4
BRBG

output

0

http://codeforces.com/problemset/problem/266/A

سوالات تمرینی 6

A. Way Too Long Words

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome.

Let's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.

This abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.

Thus, "localization" will be spelt as "l10n", and "internationalization» will be spelt as "i18n".

You are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.

Input

The first line contains an integer n (1 ≤ n ≤ 100). Each of the following n lines contains one word. All the words consist of lowercase Latin letters and possess the lengths of from 1 to 100 characters.

Output

Print n lines. The i-th line should contain the result of replacing of the i-th word from the input data.

Sample test(s)

input

4
word
localization
internationalization
pneumonoultramicroscopicsilicovolcanoconiosis

output

word
l10n
i18n
p43s

http://codeforces.com/problemset/problem/71/A

سوالات تمرینی 5

A. Theatre Square

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a × a.

What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.

Input

The input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).

Output

Write the needed number of flagstones.

Sample test(s)

input

6 6 4

output

4

http://codeforces.com/problemset/problem/1/A

سوالات تمرینی 4

 Quirksome Squares

 مربع های حقّه باز

 

عدد 3025 یک خصوصیت مهم و قابل توجه دارد : اگر ارقام آن را طوری از هم جدا کنید به طوری که 2 رشته با طول برابر

(25 و 30) تقسیم کنید و مربع آن ها را با هم جمع کنید به همان عدد اولیه (3025) خواهید رسید:

 

 

در این مسئله شما باید تمام اعداد n رقمی که این خاصیت را دارند را بیابید.(عدد زوج n ورودی داده می شود.)

برای مثال ، اعداد چهار رقمی از 0000  شروع می شوند و به 9999  ختم می شوند. توجه داشته باشید که صفر ها هم باید محاسبه شوند، یعنی 0001  که برابر است با  ²(01+00)   هم یک عدد حقه باز چهار رقمی است.

تعداد ارقام ممکن است 2، 4، 6 و یا 8 باشد ولی در عین حال حداکثر مقدار 32767 است و برنامه شما باید اعداد خروجی را در این بازه نگه دارد امّا باید به فکر سریع بودن برنامه خود باشید.

ورودی:

ورودی یک فایل متنی است که تعداد ارقام( 2 ، 4 ، 6 و یا 8 ) را هر یک در یک خط در بر میگیرد.

خروجی:

خروجی هم یک فایل متنی است که از خط هایی تشکیل شده که هر یک، یک عدد حقه باز را در خود جای می دهد. ( به ترتیب اعداد ورودی، و برای هر عدد ورودی اعداد حقه باز به ترتیب صعودی قرار دارند.

*نکته : دقت کنید که تعداد ارقام اعداد خروجی با عدد معادل آن در ورودی برابر است. قرار دادن صفر ها را هم فراموش نکنید.

 

ورودی نمونه:

2

2

خروجی نمونه:

00

01

81

00

01

81

 

برای دیدن اصل سوال و فرستادن جواب می توانید به نشانی زیر مراجعه کنید:

http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=192