#include<stdio.h>#include<algorithm>#include<string.h>#include<iostream>#include<map>#include<set>#definelllonglong#definef(i, s, e)for(int i = s; i <= e; i++)#defineff(i, s, e)for(int i = s; i >= e; i--)#definemaxn(ll)(2e5+5000)usingnamespace std;// set<int>::iterator it;
map<int,int> w;intmain(void){int t;scanf("%d",&t);while(t--){int a, b, c;
w.clear();scanf("%d%d%d",&a,&b,&c);
w[a]++;
w[b]++;
w[c]++;if(w[a]==1){printf("%d\n", a);}elseif(a == c){printf("%d\n", b);}else{printf("%d\n", c);}}return0;}
B - Not Quite Latin Square
思路:读入一个3*3的矩阵,每个都应出现3次,把少的那个输出即可
AC Code
#include<stdio.h>#include<algorithm>#include<string.h>#include<iostream>#include<map>#include<set>#definelllonglong#definef(i, s, e)for(int i = s; i <= e; i++)#defineff(i, s, e)for(int i = s; i >= e; i--)#definemaxn(ll)(2e5+5000)usingnamespace std;// set<int>::iterator it;char a[10][10];
map<char,int> cnt;intmain(void){int t;scanf("%d",&t);while(t--){
cnt.clear();f(i,0,2){scanf("%s", a[i]);}char tmp ='A';f(i,0,2){f(j,0,2){
cnt[a[i][j]]++;}}f(i,0,2){if(cnt['A'+ i]<3){printf("%c\n",'A'+ i);break;}}}return0;}
C - Can I Square?
思路:简单的模拟,注意sqrt的精度即可
AC Code
#include<stdio.h>#include<algorithm>#include<string.h>#include<iostream>#include<map>#include<set>#include<math.h>#definelllonglong#definef(i, s, e)for(int i = s; i <= e; i++)#defineff(i, s, e)for(int i = s; i >= e; i--)#definemaxn(ll)(2e5+5000)usingnamespace std;// set<int>::iterator it;
ll a;
map<ll,int> cnt;intmain(void){int t;scanf("%d",&t);while(t--){int n;scanf("%d",&n);
ll sum =0;
ll tmp;f(i,1, n){scanf("%lld",&tmp);
sum += tmp;}
ll w =sqrt(sum);int flag =0;for(ll i = w -1; i <= w +1; i++){if(i <0){continue;}if(i * i == sum){printf("YES\n");
flag =1;break;}}if(flag ==0){printf("NO\n");}}return0;}