#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cstdio>
#include <algorithm>
using namespace std;
1.
int isPrime(int n){
if(n <= 1) return 0;
int sqr = (int)sqrt(1.0 * n);
for(int i = 2; i <= sqr; i++){
if(n % i == 0) return 0;
}
return 1;
}
int main(){
int n;
scanf("%d",&n);
int flag = isPrime(n);
printf("%d",flag);
system("pause");
return 0;
}
2.
int cmp1(int a, int b){
return a < b;
}
int cmp2(int a, int b){
return a > b;
}
int main(){
int n;
int arr[4];
int Max;
int Min;
scanf("%d",&n);
while(n != 6174){
for(int i = 0;i < 4;i++){
arr[i] = n % 10;
n = n / 10;
}
sort(arr,arr+4,cmp2);
Max = arr[0]*1000 + arr[1]*100 + arr[2]*10 + arr[3];
sort(arr,arr+4,cmp1);
Min = arr[0]*1000 + arr[1]*100 + arr[2]*10 + arr[3];
n = Max - Min;
printf("%d-%d=%d\n",Max,Min,n);
}
printf("%d",n);
system("pause");
return 0;
}
*/
3.
int gcd(int a, int b){
if (b == 0) return a;
else return gcd(b, a%b);
}
int main(){
int m,n;
while(scanf("%d%d",&m,&n) != EOF){
printf("%d\n",gcd(m,n));
}
printf("%d", 7%1);
system("pause");
return 0;
}
4.
int main(){
char str1[10000];
gets(str1);
int count_P = 0;
int count_T = 0;
int sum = 0;
int len = strlen(str1);
for(int i = 0; i < len; i++){
}
for(int i = 0; i < len; i++){
if(str1[i] == 'A'){
for(int j = 0; j < i; j++){
if(str1[j] == 'P'){
count_P++;
}
}
for(int j = i+1; j < len; j++){
if(str1[j] == 'T'){
count_T++;
}
}
}
sum += count_P * count_T;
count_P = 0;
count_T = 0;
}
printf("%d\n",sum);
system("pause");
return 0;
}
2020.5.2/週六
by 922