QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#833035 | #9893. Abbreviation | chimu | AC ✓ | 0ms | 3852kb | C++17 | 849b | 2024-12-26 12:12:22 | 2024-12-26 12:12:23 |
Judging History
answer
#include <iostream>
#include<bits/stdc++.h>
long long z = 1e9 + 7;
using namespace std;
long long quick_power(long long a,long long n,long long m)
{
long long ans = 1;
while(n)
{
if (n % 2) ans = ans * a % m;//奇数
a = a * a % m;//底数平方的最后3位数字
n /= 2;//指数减半
}
return ans;
}
int main() {
int t;
cin >> t;
while(t--)
{
cin.tie(0),cout.sync_with_stdio(0);
string s;
cin >> s;
for(int i = 0 ; i < s.length() ; i++)
{
if(i > 0)
{
if(s[i] != 'a' && s[i] != 'e' && s[i] != 'i' && s[i] != 'y' && s[i] != 'o' && s[i] != 'u' )
cout << s[i];
}
else cout << s[i];
}
cout << endl;
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
5 subconscious oipotato word symbol apple
output:
sbcnscs optt wrd smbl appl
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
100 evuvtgnuocmizhaoodsougfqlayicuyuqhseebmwwqrqyyjuybmrotygzgayhmqafzetjryeendzbiinuangouayqzaupoei gyaeiiqipawkxulaeiloaluymziyvyoiuylaabaxufvndcflemuvataksquannevbyt rbzhdyotmofsouzbealekdlxuqybykg ovqdaavnljzasyoyiaryxliyudylstknljrydaoouanuloeylurroeeuarkyaavtidtihunrngaeiiapai fxmxuxzbqjoemumu...
output:
evvtgncmzhdsgfqlcqhsbmwwqrqjbmrtgzghmqfztjrndzbnngqzp gqpwkxlllmzvlbxfvndcflmvtksqnnvbt rbzhdtmfszblkdlxqbkg ovqdvnljzsrxldlstknljrdnllrrrkvtdthnrngp fxmxxzbqjmmdhkxnmkmpbjzbtbqrjtqxjcbzcdltkdhmrttbsjsdgrmrbjzfrsn yctqtjqgvwbfgmn hfjgcrfnndjpjlqmvkbqrzphklngsrfwwvxfqfbdgflfnkwncqxx unzngvfrpmbxzdmqz...
result:
ok 100 lines
Extra Test:
score: 0
Extra Test Passed