普及组CSP-J2024初赛模拟卷3

01 #include<bits/stdc++.h>
02 using namespace std;
03 const int SIZE = 100007;
04 int a[SIZE],b[SIZE];
05 int main()
06 {
07     int n,m,p,q,count=0,ret=0;
08     cin >> n >> m;
09     for(int i = 1; i <= n; i++)
10     {
11         cin >> p >> q;
12         a[p]++;
13         a[q+1]--;
14     }
15     for(int i = 1; i <= m; i++)
16     {
17         count += a[i];
18         ret += count;
19     }
20     cout << ret;
21     return 0;
22 }

注：输入流中 1≤p≤q<m。

01 #include<bits/stdc++.h>
02 using namespace std;
03 bool fun(int n)
04 {
05     int i=7;
06     if(n==2 || n==3 || n==5)
07         return true;
08     if(n==1 || n%2==0 || n%3==0 || n%5==0)
09         return false;
10     while(i*i<=n)
11     {
12         if(n%i==0)
13             return false;
14         i+=4;
15         if(n%i==0)
16             return false;
17         i+=2;
18     }
19     return true;
20 }
21 int main()

22 {
23     int n,m;
24     cin>>n>>m;
25     if(fun(n) && fun(m) && fun(n+m+1))
26         cout<<"YES"<<endl;
27     else
28         cout<<"NO"<<endl;
29     return 0;
30 }

01 #include<bits/stdc++.h>
02 using namespace std;
03 int main()
04 {
05     stack<int> s;
06     char a[1005];
07     int back,front,result;
08     cout << "Input: ";
09     cin >> a;
10     for(int i = 0; i < strlen(a); i++)
11     {
12         if(a[i] >= '0' && a[i] <= '9')
13             s.push(a[i] - '0');
14         else
15         {
16             back = s.top();
17             s.pop();
18             front = s.top();
19             s.pop();
20             if(a[i] == '+')
21                 result = front + back;
22             else if(a[i] == '-')
23                 result = front - back;
24             else if(a[i] == '*')
25                 result = front * back;
26             else if(a[i] == '/')
27                 result = front / back;
28             else if(a[i] == '%')
29                 result = front % back;
30             s.push(result);
31         }
32     }
33     cout << "Output: " << s.top() << endl;
34     return 0;
35 }

01 #include<bits/stdc++.h>
02 using namespace std;
03 const int MAXN = 15;
04 bool flag,vis[MAXN];
05 int n,m,i,j,k,a[MAXN];
06 int main()
07 {
08     cin>>n>>m;
09     memset(vis,false,sizeof(vis));
10     for(i=1;i<=m;i++)
11     {
12         a[i]=i;
13         vis[i]=true;
14     }
15     flag=true;
16     while(flag)
17     {
18         for(i=1;i<=m-1;i++)
19             cout<<a[i]<<" ";
20         cout<<a[m]<<endl;
21         ①;
22         for(i=m;i>=1;i--)
23         {
24             ②;
25             for(j=a[i]+1;j<=n;j++)
26                 if(!vis[j])
27                 {
28                     vis[j]=true;
29                     ③;
30                     flag=true;
31                     break;
32                 }
33             if(flag)
34             {
35                 for(k=i+1;k<=m;k++)
36                     for(j=1;④;j++)
37                         if(!vis[j])
38                         {
39                             a[k]=j;
40                             vis[j]=true;
41                             break;
42                         }
43                 ⑤;
44             }
45         }
46     }
47     return 0;
48 }

01 #include<bits/stdc++.h>
02 using namespace std;
03 int n,point[100];
04 bool vis[100];
05 int main()
06 {
07     int cnt;
08     scanf("%d",&n);
09     for(int i = 0; i < n; ++i)
10     {
11         scanf("%d",①);
12         ②;
13     }
14     cnt = 0;
15     for(int i = 0; i < n; ++i)
16     {
17         if(③)
18         {
19             for(int j = i; !vis[j]; ④)
20             {
21                 vis[j] = true;
22             }
23             ⑤;
24         }
25     }
26     printf("%d",cnt);
27     return 0;
28 }