QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#51549 | #4413. Cyber Language | Winner | AC ✓ | 2ms | 3840kb | C++11 | 588b | 2022-10-02 16:38:35 | 2022-10-02 16:38:39 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
#define x first
#define y second
const int N = 2e6 + 20;
const int mod = 998244353;
const int INF = 0x3f3f3f3f;
void solve(){
string s;
getline(cin, s);
stringstream str;
str << s;
while(str >> s){
printf("%c", (char) (s[0] + 'A' - 'a'));
}
puts("");
}
int main(){
int T = 1;
scanf("%d", &T);
getchar();
while(T--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3840kb
input:
10 qing lian xi wo bao gao wo dai ni men da da shi suo qu bao dao yong yuan de shen xiao si wo le shi zhen de ni shuo de dou dui yin yang guai qi
output:
QLXW BG WDNMD DSSQ BD YYDS XSWL SZD NSDDD YYGQ
result:
ok 10 lines