锘??xml version="1.0" encoding="utf-8" standalone="yes"?>
Time Limit: 2000MS |
Memory Limit: 65536K |
|
Total Submissions: 104347 |
Accepted: 17506 |
Description
浼佷笟鍠滄鐢ㄥ鏄撹璁頒綇鐨勭數璇濆彿鐮併傝鐢佃瘽鍙風爜瀹規槗琚浣忕殑涓涓姙娉曟槸灝嗗畠鍐欐垚涓涓鏄撹浣忕殑鍗曡瘝鎴栬呯煭璇備緥濡傦紝浣犻渶瑕佺粰婊戦搧鍗㈠ぇ瀛︽墦鐢佃瘽鏃訛紝鍙互鎷ㄦ墦TUT-GLOP銆傛湁鏃訛紝鍙皢鐢佃瘽鍙風爜涓儴鍒嗘暟瀛楁嫾鍐欐垚鍗曡瘝銆傚綋浣犳櫄涓婂洖鍒伴厭搴楋紝鍙互閫氳繃鎷ㄦ墦310-GINO鏉ュ悜Gino's璁竴浠?/span>pizza銆傝鐢佃瘽鍙風爜瀹規槗琚浣忕殑鍙︿竴涓姙娉曟槸浠ヤ竴縐嶅ソ璁扮殑鏂瑰紡瀵瑰彿鐮佺殑鏁板瓧榪涜鍒嗙粍銆傞氳繃鎷ㄦ墦蹇呰儨瀹㈢殑“涓変釜鍗?/span>”鍙風爜3-10-10-10錛屼綘鍙互浠庝粬浠偅閲岃pizza銆?/span>
鐢佃瘽鍙風爜鐨勬爣鍑嗘牸寮忔槸涓冧綅鍗佽繘鍒舵暟錛屽茍鍦ㄧ涓夈佺鍥涗綅鏁板瓧涔嬮棿鏈変竴涓繛鎺ョ銆傜數璇濇嫧鍙風洏鎻愪緵浜嗕粠瀛楁瘝鍒版暟瀛楃殑鏄犲皠錛屾槧灝勫叧緋誨涓嬶細
A, B, 鍜?/span>C 鏄犲皠鍒?/span> 2
D, E, 鍜?/span>F 鏄犲皠鍒?/span> 3
G, H, 鍜?/span>I 鏄犲皠鍒?/span> 4
J, K, 鍜?/span>L 鏄犲皠鍒?/span> 5
M, N, 鍜?/span>O 鏄犲皠鍒?/span> 6
P, R, 鍜?/span>S 鏄犲皠鍒?/span> 7
T, U, 鍜?/span>V 鏄犲皠鍒?/span> 8
W, X, 鍜?/span>Y 鏄犲皠鍒?/span> 9
Q鍜?/span>Z娌℃湁鏄犲皠鍒頒換浣曟暟瀛楋紝榪炲瓧絎︿笉闇瑕佹嫧鍙鳳紝鍙互浠繪剰娣誨姞鍜屽垹闄ゃ?/span> TUT-GLOP鐨勬爣鍑嗘牸寮忔槸888-4567錛?/span>310-GINO鐨勬爣鍑嗘牸寮忔槸310-4466錛?/span>3-10-10-10鐨勬爣鍑嗘牸寮忔槸310-1010銆?/span>
濡傛灉涓や釜鍙風爜鏈夌浉鍚岀殑鏍囧噯鏍煎紡錛岄偅涔堜粬浠氨鏄瓑鍚岀殑錛堢浉鍚岀殑鎷ㄥ彿錛?/span>
浣犵殑鍏徃姝e湪涓烘湰鍦扮殑鍏徃緙栧啓涓涓數璇濆彿鐮佽杽銆備綔涓鴻川閲忔帶鍒剁殑涓閮ㄥ垎錛屼綘鎯寵媯鏌ユ槸鍚︽湁涓や釜鍜屽涓叕鍙告嫢鏈夌浉鍚岀殑鐢佃瘽鍙風爜銆?/span>
Input
杈撳叆鐨勬牸寮忔槸錛岀涓琛屾槸涓涓鏁存暟錛屾寚瀹氱數璇濆彿鐮佽杽涓彿鐮佺殑鏁伴噺錛堟渶澶?/span>100000錛夈備綑涓嬬殑姣忚鏄竴涓數璇濆彿鐮併傛瘡涓數璇濆彿鐮佺敱鏁板瓧錛屽ぇ鍐欏瓧姣嶏紙闄や簡Q鍜?/span>Z錛変互鍙婅繛鎺ョ緇勬垚銆傛瘡涓數璇濆彿鐮佷腑鍙細鍒氬ソ鏈?/span>7涓暟瀛楁垨鑰呭瓧姣嶃?/span>
Output
瀵逛簬姣忎釜鍑虹幇閲嶅鐨勫彿鐮佷駭鐢熶竴琛岃緭鍑猴紝杈撳嚭鏄彿鐮佺殑鏍囧噯鏍煎紡绱ц窡涓涓┖鏍肩劧鍚庢槸瀹冪殑閲嶅嬈℃暟銆傚鏋滃瓨鍦ㄥ涓噸澶嶇殑鍙風爜錛屽垯鎸夌収鍙風爜鐨勫瓧鍏稿崌搴忚緭鍑恒傚鏋滆緭鍏ユ暟鎹腑娌℃湁閲嶅鐨勫彿鐮侊紝杈撳嚭涓琛岋細
No duplicates.
Sample Input
12
4873279
ITS-EASY
888-4567
3-10-10-10
888-GLOP
TUT-GLOP
967-11-11
310-GINO
F101010
888-1200
-4-8-7-3-2-7-9-
487-3279
Sample Output
310-1010 2
487-3279 4
888-4567 3
Source
East Central North America 1999
Translator
鍖椾含澶у紼嬪簭璁捐瀹炰範2007
Time Limit: 500MS |
Memory Limit: 10000K |
|
Total Submissions: 52024 |
Accepted: 12083 |
Description
瀵規暟鍊煎緢澶с佺簿搴﹀緢楂樼殑鏁拌繘琛岄珮綺懼害璁$畻鏄竴綾誨崄鍒嗗父瑙佺殑闂銆傛瘮濡傦紝瀵瑰浗鍊鴻繘琛岃綆楀氨鏄睘浜庤繖綾婚棶棰樸?/span>
鐜板湪瑕佷綘瑙e喅鐨勯棶棰樻槸錛氬涓涓疄鏁?/span>R( 0.0 < R < 99.999 )錛岃姹傚啓紼嬪簭綺劇‘璁$畻 R 鐨?/span> n 嬈℃柟(Rn)錛屽叾涓?/span>n 鏄暣鏁板茍涓?/span> 0 < n <= 25銆?/span>
Input
T杈撳叆鍖呮嫭澶氱粍 R 鍜?/span> n銆?/span> R 鐨勫煎崰絎?/span> 1 鍒扮 6 鍒楋紝n 鐨勫煎崰絎?/span> 8 鍜岀 9 鍒椼?/span>
Output
瀵逛簬姣忕粍杈撳叆錛岃姹傝緭鍑轟竴琛岋紝璇ヨ鍖呭惈綺劇‘鐨?/span> R 鐨?/span> n 嬈℃柟銆傝緭鍑洪渶瑕佸幓鎺夊墠瀵肩殑 0 鍚庝笉瑕佺殑 0 銆傚鏋滆緭鍑烘槸鏁存暟錛屼笉瑕佽緭鍑哄皬鏁扮偣銆?/span>
Sample Input
95.123 12
0.4321 20
5.1234 15
6.7592 9
98.999 10
1.0100 12
Sample Output
548815620517731830194541.899025343415715973535967221869852721
.00000005148554641076956121994511276767154838481760200726351203835429763013462401
43992025569.928573701266488041146654993318703707511666295476720493953024
29448126.764121021618164430206909037173276672
90429072743629540498.107596019456651774561044010001
1.126825030131969720661201
Source
East Central North America 1988
Translator
鍖椾含澶у紼嬪簭璁捐瀹炰範錛?/span>Xie Di
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 129751 | Accepted: 70436 |
Description
Input
Output
Sample Input
1 2
Sample Output
3
Hint
#include <iostream>It's important that the return type of main() must be int when you use G++/GCC,or you may get compile error.
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
cout << a+b << endl;
return 0;
}
#include <stdio.h>Here is a sample solution to problem 1000 using Pascal:
int main()
{
int a,b;
scanf("%d %d",&a, &b);
printf("%d\n",a+b);
return 0;
}
program p1000(Input,Output);Here is a sample solution to problem 1000 using Java:
var
a,b:Integer;
begin
Readln(a,b);
Writeln(a+b);
end.
import java.io.*;Old program for jdk 1.4
import java.util.*;
public class Main
{
public static void main(String args[]) throws Exception
{
Scanner cin=new Scanner(System.in);
int a=cin.nextInt(),b=cin.nextInt();
System.out.println(a+b);
}
}
import java.io.*;Here is a sample solution to problem 1000 using Fortran:
import java.util.*;
public class Main
{
public static void main (String args[]) throws Exception
{
BufferedReader stdin =
new BufferedReader(
new InputStreamReader(System.in));
String line = stdin.readLine();
StringTokenizer st = new StringTokenizer(line);
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
System.out.println(a+b);
}
}
PROGRAM P1000
IMPLICIT NONE
INTEGER :: A, B
READ(*,*) A, B
WRITE(*, "(I0)") A + B
END PROGRAM P1000
Source
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 129751 | Accepted: 70436 |
Description
Input
Output
Sample Input
1 2
Sample Output
3
Hint
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
cout << a+b << endl;
return 0;
}
#include <stdio.h>涓嬮潰鏄繖閬撻鐨勪竴涓狿ascal紼嬪簭銆?
int main()
{
int a,b;
scanf("%d %d",&a, &b);
printf("%d\n",a+b);
return 0;
}
program p1000(Input,Output);涓嬮潰鏄繖閬撻鐨勪竴涓狫ava紼嬪簭錛岃繖閲孞ava緙栬瘧鍣ㄩ噰鐢ㄧ殑鏄疛DK 1.5銆?
var
a,b:Integer;
begin
Readln(a,b);
Writeln(a+b);
end.
import java.io.*;鑰岃佺増鏈殑JDK 1.4紼嬪簭濡備笅錛?
import java.util.*;
public class Main
{
public static void main(String args[]) throws Exception
{
Scanner cin=new Scanner(System.in);
int a=cin.nextInt(),b=cin.nextInt();
System.out.println(a+b);
}
}
import java.io.*;涓嬮潰鏄繖閬撻鐨勪竴涓狥ortran紼嬪簭銆?
import java.util.*;
public class Main
{
public static void main (String args[]) throws Exception
{
BufferedReader stdin =
new BufferedReader(
new InputStreamReader(System.in));
String line = stdin.readLine();
StringTokenizer st = new StringTokenizer(line);
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
System.out.println(a+b);
}
}
PROGRAM P1000
IMPLICIT NONE
INTEGER :: A, B
READ(*,*) A, B
WRITE(*, "(I0)") A + B
END PROGRAM P1000
Source
Translator