プログラムのようなキー練習タイピング
関連タイピング
-
数字と記号入力練習用
プレイ回数33万274打 -
タイピングをマスターしたい方向けの問題です。
プレイ回数7976長文英字344打 -
これがスラスラ打てれば、どんな文章にもひるまなくなる！
プレイ回数10万長文120秒 -
プレイ回数12英字60秒 -
プレイ回数6.9万長文記号580打 -
プレイ回数100長文英字60秒 -
HHKB 英語配列 無刻印を目指して
プレイ回数103長文778打 -
テストで作ったものです。
プレイ回数2.9万短文英字60秒
問題文
(#include <iostream>)
#include <iostream>
(#include <vector>)
#include <vector>
(using namespace std;)
using namespace std;
(int main(int argc, char *argv[]))
int main(int argc, char *argv[])
(int main(int argc, char **argv))
int main(int argc, char **argv)
(int ary[10]={0,1,2,3,4,5,6,7,8,9};)
int ary[10]={0,1,2,3,4,5,6,7,8,9};
(char str[10] = 'h','e','l','l','o','w','o','r','l','d'};)
char str[10] = 'h','e','l','l','o','w','o','r','l','d'};
(for(int i = 0; i < 10; i++){})
for(int i = 0; i < 10; i++){}
(char str[] = "I live in Japan.";)
char str[] = "I live in Japan.";
(char str[ 5 ] = {'h' , 'e' , 'l' , 'l' , 'o'};)
char str[ 5 ] = {'h' , 'e' , 'l' , 'l' , 'o'};
(char str[] = {'f' , 'o' , 'o' , 'b' , 'a'};)
char str[] = {'f' , 'o' , 'o' , 'b' , 'a'};
(class Vector)
class Vector
(#ifndef _VECTOR_H_)
#ifndef _VECTOR_H_
(#define _VECTOR_H_)
#define _VECTOR_H_
(public:)
public:
(private:)
private:
(Foo::get(){})
Foo::get(){}
(Bar::set(){})
Bar::set(){}
(if(c <= 5){})
if(c <= 5){}
(if(x != 0){})
if(x != 0){}
(template< class T > class Sample{})
template< class T > class Sample{}
(void Sample():mArray(0),mSize0(0),mSize1(0){};)
void Sample():mArray(0),mSize0(0),mSize1(0){};
(mArray = new T[ size0 * size1 ];)
mArray = new T[ size0 * size1 ];
(delete[] mArray;)
delete[] mArray;
(const T& operator()( int index0 , int index1 )const)
const T& operator()( int index0 , int index1 )const
(std::ifstream ifs(filename,std::ifstream::binary);)
std::ifstream ifs(filename,std::ifstream::binary);
(Foo<bool> mFoo;)
Foo<bool> mFoo;
(Foo<char> mFoo;)
Foo<char> mFoo;
(Foo<int> mFoo;)
Foo<int> mFoo;
(foo.set(x,y);)
foo.set(x,y);
(OBJ_APPLE,)
OBJ_APPLE,
(OBJ_RINGO,)
OBJ_RINGO,
(for( auto i = 0; i < size; i++ ){})
for( auto i = 0; i < size; i++ ){}
(case 'k':t = OBJ_WALL; break;)
case 'k':t = OBJ_WALL; break;
(case '\n': x = 0; break;)
case '\n': x = 0; break;
(for( auto x = 0; x <= n; x++){min_val = min(min_val, ary[x])};)
for( auto x = 0; x <= n; x++){min_val = min(min_val, ary[x])};
(swap(v[i], v[i + 1]);)
swap(v[i], v[i + 1]);
(abs(x))
abs(x)
(sin(x))
sin(x)
(cos(x))
cos(x)
(tan(x))
tan(x)
(string s;)
string s;
(cin >> s;)
cin >> s;
(cout << s;)
cout << s;
(s += str;)
s += str;
(s += ch;)
s += ch;
(s.size();)
s.size();
(s.substr(l);)
s.substr(l);
(s.substr(l, r);)
s.substr(l, r);
(min(a, b);)
min(a, b);
(max(a, b);)
max(a, b);
(min({a1, a2, an});)
min({a1, a2, an});
(max({a1, a2, an});)
max({a1, a2, an});
(*min_element(c + l, c + r);)
*min_element(c + l, c + r);
(*max_element(c + l, c + r);)
*max_element(c + l, c + r);
(swap(a, b);)
swap(a, b);
(swap(c[j], c[j + 1]);)
swap(c[j], c[j + 1]);
(rand();)
rand();
(clock();)
clock();
(CLOCKS_PER_SEC)
CLOCKS_PER_SEC
(reverse(a, a + n);)
reverse(a, a + n);
(reverse(a, a + n);)
reverse(a, a + n);
(reverse(a + l, a + r);)
reverse(a + l, a + r);
(sort(a, a + n);)
sort(a, a + n);
(sort(a + l, a + r);)
sort(a + l, a + r);
(sort(a, a + n, greater< int >());)
sort(a, a + n, greater< int >());
(vector< int > v;)
vector< int > v;
(v.push_back(x);)
v.push_back(x);
(v[i])
v[i]
(v.size())
v.size()
(v.pop_back();)
v.pop_back();
(v.size())
v.size()
(stack< int > s;)
stack< int > s;
(s.push(x);)
s.push(x);
(s.pop() ;)
s.pop() ;
(s.top();)
s.top();
(s.size();)
s.size();
(s.empty();)
s.empty();
(queue< int > q;)
queue< int > q;
(map<int, string> m;)
map<int, string> m;
(set<int> s;)
set<int> s;
(pair<int, string> p;)
pair<int, string> p;
(tuple<int, int, int> t;)
tuple<int, int, int> t;
(assert(x <= 0);)
assert(x <= 0);
(count(a + l, a + r, x);)
count(a + l, a + r, x);
(find(a + l, a + r, x);)
find(a + l, a + r, x);
(bitset<8> bs(123);)
bitset<8> bs(123);