C :

#include<stdio.h>
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
    	char s[100];
    	char s0[]="ystIsSmartBabyEgg";
    	int flag=0,i;
    	scanf("%s",s);
    	for(i=0;s[i]!='\0'&&s0[i]!='\0';i++)
    	if(s[i]!=s0[i])
    	flag=1;
    	if(flag)
		printf("Wrong Answer\n");
		else
		{
			if(s0[i]=='\0'&&s[i]!='\0')
			printf("Wrong Answer\n");
			else
			printf("Accepted\n");
		}
	}
    return 0;
}

C++ :

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10;
typedef pair<int,int> PII;
typedef priority_queue<int , vector<int>, greater<int>> minqueue;  //从小到大 queue
typedef priority_queue<int, vector<int>, less<int>> maxqueue;      //从大到小 queue

int gcd(int a, int b){  //最大公因数 
    return b ? gcd(b, a % b) : a;
}

int lcm(int a, int b){ //最小公倍数 
    return a * b / __gcd(a, b);
}

int qmi(int base, int power, int p)  //快速幂求余 
{
	int result = 1;   
	while (power > 0)           
	{
		if (power & 1)         							
			result = result * base % p;   
		base = base * base % p ;       						
		power >>= 1;         						
	}
	return result % p;       
}

int l,n,k;
int a[N];

bool check(int mid)
{
	if(mid==0) return false;
	int x=k;
	for(int i=1;i<n;i++){
		x-=(a[i+1]-a[i])/mid;
		if((a[i+1]-a[i])%mid==0) x++;
		if(x<0) return false;
	}
	return true;
}

int bsearch(int l,int r)
{
	while(l<r)
	{
		int mid=(l+r)/2;
		if(check(mid)) r=mid;
		else l=mid+1;
	}
	return l;
}

void solve()
{
	string s;
	cin>>s;
	if(s!="ystIsSmartBabyEgg") cout<<"Wrong Answer"<<'\n';
	else cout<<"Accepted"<<'\n';
}

signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t;
	t=1;
	cin>>t; 
	while(t--)     
	{
		solve();
	}
	return 0;
}

Java :

import java.util.Scanner;

public class Main {
public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int t= sc.nextInt();
    for (int i = 0; i <t; i++){
        String s=sc.next();
        if(s.equals("ystIsSmartBabyEgg")){
            System.out.println("Accepted");
        }
        else {
            System.out.println("Wrong Answer");

        }
    }
}
}

Python :

# coding=utf-8
def check_submissions(t, submissions):
    expected_output = "ystIsSmartBabyEgg"  # 假设这是签到题要求的输出结果
    results = []
    
    for submission in submissions:
        if submission == expected_output:
            results.append("Accepted")
        else:
            results.append("Wrong Answer")
    
    return results

# 读取输入
t = int(input())
submissions = [input() for _ in range(t)]

# 检查提交并打印结果
results = check_submissions(t, submissions)
for result in results:
    print(result)