- 博客(27)
- 收藏
- 关注
RSS订阅原创 CSP 201712-2 游戏(C++)
#include <bits/stdc++.h>using namespace std;queue<int> q;int n,k,t;int main(){ cin>>n>>k; for(int i=1;i<=n;i++) q.push(i); while(q.size()!=1){ t++; int tmp=q.front(); q.pop(); if(...
2021-05-10 19:06:57
145
原创 CSP 201903-2 二十四点(C++)
#include <bits/stdc++.h>using namespace std;void solve(){ stack<int> k; string s; cin>>s; k.push(s[0]-'0'); for(int i=1; i<7; i++) { if(s[i]=='x') { int tmp=k.top(); k....
2021-05-09 18:52:56
113
原创 CSP 201409-3 字符串匹配(C++版)
#include <bits/stdc++.h>using namespace std;void solve1(string s){ string str; cin>>str; if(0<=str.find(s)&&str.find(s)<=str.length()) { cout<<str<<endl; return; } return;}v...
2021-05-06 20:59:17
183
原创 CSP 201712-2 游戏(java版)
import java.util.Scanner;public class Main {public static void main(String[] args) { Scanner input=new Scanner(System.in); int n=input.nextInt(); int k=input.nextInt(); int[] nums=new int[n]; for(int i=0;i< nums.length;i++)
2021-04-21 20:59:09
95
原创 CSP 201509-2 日期计算(C++版)
#include <bits/stdc++.h>using namespace std;int main(){int year,sum;cin>>year>>sum;int arr[13],month,day;for(int i=1; i<13; i++){ if(i==4||i==6||i==9||i==11) arr[i]=30; else if(i==2) { if(year%400==0
2021-04-13 19:55:04
155
原创 CSP 201312-2 ISBN号码（C++版）
#include <bits/stdc++.h>using namespace std;int main(){string s;cin>>s;char ch=s[s.length()-1];int arr[9];int k=0;for(int i=0; i<s.length(); i++){ if(i==1||i==5||i>10) continue; arr[k]=s[i]-48; k++;}int t=
2021-04-11 20:31:43
107
原创 CSP 201312-1 出现次数最多的数(Java版)
import java.util.*;public class Main {public static void main(String[] args) { Scanner input = new Scanner(System.in); int n= input.nextInt(); int[] arr=new int[n]; for(int i=0;i<n;i++) arr[i]= input.nextInt(); Arrays.sort(
2021-03-21 16:26:16
103
原创 CSP 201912-1 报数(Java版)
import java.util.Scanner;public class Main {public static void main(String[] args) { Scanner input = new Scanner(System.in); int a = 0, b = 0, c = 0, d = 0, cnt = 0, i; int n = input.nextInt(); for (i = 1; ; i++) { int tmp = i;
2021-03-20 18:49:23
137
原创 CSP 201812-1 小明上学(Java版)
import java.util.Scanner;public class Main {public static void main(String[] args) { Scanner input = new Scanner(System.in); int r = input.nextInt(); int y = input.nextInt(); int g = input.nextInt(); int n = input.nextInt(); int[]
2021-03-15 20:48:18
105
原创 CSP 202006-1 线性分类器(Java版)
import java.util.Scanner;public class Main {public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int[] a = new int[n]; int[] b = new int[n]; String[] c = new Str
2021-03-15 20:23:06
136
原创 CSP 202009-1 称检测点查询(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int x = input.nextInt(); int y = input.ne.
2021-03-14 22:02:05
203
原创 CSP 201909-1 小明种苹果(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int m = input.nextInt(); int[][] arr = ne.
2021-03-14 21:29:23
69
原创 CSP 201803-1 跳一跳(Java版)
import java.util.Scanner;public class Main{ public static void main(String[] args) { Scanner input = new Scanner(System.in); int[] arr = new int[35]; int i; for (i = 1; ; i++) { arr[i] = input.nextInt();...
2021-03-14 20:54:18
109
原创 CSP 201403-1 相反数(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int[] arr = new int[n]; for (int i = 0; i.
2021-03-14 20:24:09
111
原创 CSP 201509-1 数列分段(Java版)
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) .
2021-03-13 22:17:04
124
原创 CSP 201512-1 数位之和(Java版)
import java.util.Scanner;public class Main6 { public static void main(String[] args) { Scanner input = new Scanner(System.in); Long n = input.nextLong(); int cnt = 0; while(n!=0){ cnt+=n%10; n/.
2021-03-13 21:59:25
115
原创 CSP 201604-1 折点计数(Java版)
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) ..
2021-03-13 21:53:49
116
原创 CSP 201609-1 最大波动(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner input = new Scanner(System.in);int n = input.nextInt();int[] arr = new int[n];for (int i = 0; i < n; i++)arr[i] = input.nextInt()
2021-03-13 21:42:32
94
原创 CSP 201612-1 中间数(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner input = new Scanner(System.in);int n = input.nextInt();int[] arr = new int[n];for (int i = 0; i < n; i++)arr[i] = input.nextInt();
2021-03-13 21:33:26
91
原创 CSP 201412-1 门禁系统(Java版)
import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner input = new Scanner(System.in);int n = input.nextInt();int[] arr = new int[n];int[] s = new int[n];for (int i = 0; i < n; i++)arr[i] = input.nextInt();s[
2021-03-13 20:45:28
142
原创 CSP 201409-1 相邻数对(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner input = new Scanner(System.in);int n = input.nextInt();int[] arr = new int[n];for (int i = 0; i < n; i++)arr[i] = input.nextInt();
2021-03-13 20:25:01
61
原创 CSP 201709-1 打酱油(Java版)
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner input = new Scanner(System.in);int m = input.nextInt();m/=10;System.out.println((m/5)7+(m%5)/34+((m%5)%3));}}
2021-03-11 22:31:57
100
原创 CSP 201712-1 最小差值(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner input = new Scanner(System.in);int m = input.nextInt();int[] arr = new int[m];for (int i = 0; i < m; i++)arr[i] = input.nextInt()
2021-03-11 21:55:02
176
1
原创 CSP 201809-1 卖菜（Java版）
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner input = new Scanner(System.in);int n = input.nextInt();int[] arr = new int[n];int[] s = new int[n];int i;for (int k = 0; k < n; k++) {arr[k] = input.nex
2021-03-11 19:26:24
166
原创 CSP 201903-1 小中大(Java版)
import java.util.Arrays;import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner input = new Scanner(System.in);int n = input.nextInt();int[] a = new int[n];for (int i = 0; i < n; i++) {a[i] = input.nextInt();
2021-03-11 17:42:02
128
原创 CSP 202012-1 期末预测之安全指数(Java版)
个人刷题笔记CSP:202012-1 期末预测之安全指数(Java版)import java.util.Scanner;public class Main {public static void main(String[ ] args) {Scanner input = new Scanner(System.in);int n = input.nextInt();int[ ] a = new int[n];int[ ] b = new int[n];int[ ] c = new int[n
2021-03-10 21:59:59
197
原创 PTA实验4-1-5 韩信点兵 (10分)
在中国数学史上，广泛流传着一个“韩信点兵”的故事：韩信是汉高祖刘邦手下的大将，他英勇善战，智谋超群，为汉朝建立了卓越的功劳。据说韩信的数学水平也非常高超，他在点兵的时候，为了知道有多少兵，同时又能保住军事机密，便让士兵排队报数：按从1至5报数，记下最末一个士兵报的数为1；再按从1至6报数，记下最末一个士兵报的数为5；再按从1至7报数，记下最末一个士兵报的数为4；最后按从1至11报数，最末一个士兵报的数为10；请编写程序计算韩信至少有多少兵。输入格式：本题无输入输出格式：输出韩信至少拥有的
2020-10-10 14:59:07
1141
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人