其他

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome.Let's

time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter the lessons n groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the i-th group

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe cows have just learned what a primitive root is! Given a prime p, a primitive root  is an integer x (1 ≤ x < p) such that none of integers x 

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the game they put numbers on the board's squares by some

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEmuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.He wants the fence to be a

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputImagine that you have a twin brother or sister. Having another person that looks exactly like you seems very unusual. It's hard to say if having

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price —

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day a highly important task was commissioned to Vasya — writing a program in a night. The program consists of n lines of code. Vasya is already

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus is the director of a large corporation. There are n secretaries working for the corporation, each of them corresponds via the famous

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a rectangular cake, represented as an r × c grid. Each cell either has an evil strawberry, or is empty. For example, a 3 × 4 cake may

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne Sunday Petr went to a bookshop and bought a new book on sports programming. The book had exactly n pages.Petr decided to start reading it

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Scrooge, a very busy man, decided to count the time he wastes on all sorts of useless stuff to evaluate the lost profit. He has already counted

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1squares. You are

 描述

 描述 輸出質數表輸出從0到給定的N之間（包含N）的所有質數。1<N<1000。注意1不是質數，2是質數。輸入 輸入有m+1行，第一行輸入測試資料的組數m，下面的m行每行輸入一個數N。輸出 輸出有m行，每行輸出從0到對應給定的N之間（包含N）的所有質數。範例輸入 2511範例輸出 2 3 52 3 5 7 11簡單的判斷#include<stdio.h> main() { int m,n,i,num; int p[1002]; long int s; int temp;

 描述逸出字元是 C 語言中表示字元的一種特殊形式。通常使用逸出字元表示 ASCII 碼字元集中不可列印的控制字元和特定功能的字元，如用於表示字元常量的單撇號 （'），用於表示字串常量的雙撇號（"）和反斜線（\）等。逸出字元用反斜線（\）後面跟一個字元或一個八進位或十六進位數表示。\a 響鈴（BEL）\b 退格（BS）\f 換頁（FF）\n 換行（LF）\r 斷行符號（CR）\t 水平製表（HT）\v 垂直製表（VT）\\ 反斜線\? 問號字元\' 單引號字元\" 雙引號字元\0 Null