Problem A | 这是道简单题 |
#include <stdio.h>
int main()
{
for(int i = 100;i<=999;i++)
{
for(int j = 100;j<=999;j++)
{
if(i%10 == j/100 &&i/10%10 == j/10%10 && j%10 == i/100 &&i+j ==1333)
{
printf("%d %d\n",i,j);
}
}
}
}
Problem B | 这真是道简单题 |
快速排序
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int a[10];
for(int i = 0 ; i< 10;i++){
scanf("%d",&a[i]);
}
sort(a,a+10);
for(int i =0 ;i<10;i++)
{
printf("%d ",a[i]);
}
}
冒泡排序
#include<stdio.h>
int main()
{
int a[10];
int i,j,t;
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<9;i++)
{
for(j=0;j<9-i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
for(i=0;i<10;i++)
{
printf("%d\n",a[i]);
}
return 0;
}
Problem C | 小C的难题 |
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int a, b[999], c, sum = 0;
scanf("%d", &a);
for(int i = 0; i < a; i ++) {
scanf("%d", &b[i]);
}
scanf("%d", &c);
for(int i = 0; i < a; i ++) {
if (b[i] > c)sum += b[i];
}
printf("%d", sum);
}
Problem D | A+B? |
#include <stdio.h>
int main()
{
int n,a,b;
while(scanf("%d%d%d",&n,&a,&b)!=EOF)
{
int p = b%n;
int ans = (n+a+p)%n;
if(ans)
{
printf("%d\n",(n+a+p)%n);
}
else
{
printf("%d\n",n);
}
}
return 0;
}
Problem E | 马青是个坏孩子 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>
using namespace std;
#define LL long long
const int INF = 0x3f3f3f3f;
char s1[100005], s2[100005];
int main()
{
int a, b, n, t;
scanf("%d", &t);
while (t--)
{
scanf("%d%d%d", &n, &a, &b);
if (a < b)
swap(a, b);
scanf("%s", s1);
scanf("%s", s2);
int cnt = 0;
for (int i = 0; i < n; i++)
if (s1[i] == s2[i]) cnt++;
if (n - cnt >= a - b&&a + b - 2 * cnt <= n - cnt) printf("Not lying\n");
else printf("Lying\n");
}
return 0;
}
Problem F | 小鸣同学的白日梦 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[1500], n, flag = 0;
scanf("%d", &n);
for (int i = 0; i < n; i ++) {
scanf("%d", &a[i]);
}
for (int i = 0; i <n; i ++) {
for (int j = 0; j < n; j ++) {
if (a[i] + a[j] == 0)
{
flag = 1;break;
}
}
if (flag)break;
}
if (flag) printf("Yes!\n");
else printf("No!\n");
}
如有疑问请联系QQ:1585793015