PAT 甲級 A1001 (2019/02/10)
1 #include<cstdio> 2 #include<cstdlib> 3 int main(){ 4 long A,B,C,SUM; 5 scanf("%ld%ld",&A,&B); 6 SUM = A + B; 7 C = abs(SUM); 8 if(C < 1000) 9 printf("%ld",SUM); 10 if(C >= 1000 && C < 1000000) 11 printf("%ld,%03ld",SUM/1000,C%1000); 12 if(C >= 1000000) 13 printf("%ld,%03ld,%03ld",SUM/1000000,(C/1000)%1000,C%1000); 14 return 0; 15 }
PAT 甲級 A1001 (2019/02/10)
相關推薦
PAT 甲級 A1001 (2019/02/10)
bsp () span can int turn return urn printf 1 #include<cstdio> 2 #include<cstdlib> 3 int main(){ 4 long A,B,C,SUM
PAT 甲級 A1035 (2019/02/10)
amp ring code password lse col turn isa count 1 #include<cstdio> 2 #include<cstring> 3 struct user{ 4 char id[20
PAT 甲級 A1005 (2019/02/10)
lse sum str () int class har one spa 1 #include<cstdio> 2 #include<cstring> 3 char str[10][6] = {"zero", "one", "two",
PAT 甲級 A1073 (2019/02/10) NULL(18/20)
star array pos printf scan length art pre turn 1 #include<cstdio> 2 #include<cstring> 3 int main(){ 4 char Array
PAT 甲級 A1009 (2019/02/01)
span nbsp spa can color print product main scan 1 #include<cstdio> 2 struct Poly{ 3 int exp; //次數 4 double
PAT 甲級 A1036 (2019/02/08)
int truct printf cor emp info || nbsp har 1 #include<cstdio> 2 struct stu_info{ 3 char name[20]; 4 char id[20];
PAT 甲級 A1011 (2019/02/01)
cst print ble pan for rod return scan scanf 1 #include<cstdio> 2 int main(){ 3 double a, b, c, MAX, product = 1.0; 4
PAT 甲級 A1006 (2019/02/03)
for return a10 sin int temp space color ostream 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4
PAT 甲級 A1082 (2019/02/14) NULL(12/25)
a10 class str cst () tin %d con include 1 #include<cstdio> 2 #include<cstring> 3 char strnumber[16][5] = {"ling", "yi"
PAT 甲級 A1062 (2019/02/15)
inf char 函數 pre strcmp 函數返回值 sin sum class 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> // STL
PAT 甲級 A1012 (2019/02/15)
ostream bsp char 枚舉 數學 sort %d 計算 查詢 1 #include<iostream> 2 #include<cstdio> 3 #include<algorithm> 4 using nam
PAT 甲級 A1019 (2019/02/08)
lag pat scan return bsp spa -- () col 1 #include<cstdio> 2 bool Judge(int A[], int num){ 3 for(int i = 0; i < num; i+
PAT 甲級 A1063 (2019/02/22)
遍歷集合 不能 集合 find com sca end a10 sam 1 #include<cstdio> 2 #include<set> 3 using namespace std; 4 const int MAXN = 51;
PAT 甲級 A1002 (2019/01/30)
class col double n) ++ spa ons bsp print 1 #include<cstdio> 2 const int MAXN = 1001; 3 double sum[MAXN]; 4 int main(){ 5
PAT 甲級 A1065 (2019/01/29)
class pre clu code sum () tdi long false 1 #include<cstdio> 2 int main(){ 3 int n, countCase = 1; 4 long long a, b
PAT 甲級 A1042 (2019/01/24)
include scanf ons span %d con pre for ret 1 #include <cstdio> 2 const int N = 54; 3 char Color[5] = {‘S‘, ‘H‘, ‘C‘, ‘D‘, ‘J‘
PAT 甲級 A1046 (2019/01/28)
長度 () name lse urn ret i++ clu include 1 #include<cstdio> 2 #include<algorithm> 3 using namespace std; 4 const int M
pat 甲級 1095(map應用+排序)
題目連結:https://pintia.cn/problem-sets/994805342720868352/problems/994805371602845696 題目要求: 給出汽車的進站和出站的時間,查詢k次,每一次查找出這個時間內有多少車還在,最後一行輸出停留時間最長的汽車。 如
pat 甲級 1090(bfs遍歷)
題目連結:https://pintia.cn/problem-sets/994805342720868352/problems/994805376476626944 思路:一開始用的bfs求每一次的利潤,後來就是有好多點過不去,參考了網上的做法,可以先算出 樹的深度,然後求根據深度求出最大結
pat 甲級 1086(二叉樹)
題目連結: 思路:就是輸入中序建立的二叉樹,要求輸出後序遍歷的二叉樹,就是一個逆序建樹的過程, 讓我想了好久 注意:(1)可以用陣列,但陣列需要開的大一些,不然段錯誤 (2)對於堆疊,push就是建樹,pop就是返回它的上一級。 #include<iostream>