Submission #3458119
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<math.h> #include<algorithm> #include<numeric> using namespace std; typedef long long LL; typedef unsigned long long ULL; typedef vector<LL> VLL; typedef vector<ULL> VULL; class MYCP { public: //数値を区切って文字列にする static string MakeString_LongLong(vector<long long> const& numbers, string const& str) { if (numbers.size() == 0)return ""; string result = "" + to_string(numbers[0]); for (long long i = 1; i < numbers.size(); i++) { result += str; result += to_string(numbers[i]); } return result; } //空白で区切る為のオーバーロード static string MakeString_LongLong(vector<long long> const& numbers) { if (numbers.size() == 0)return ""; string result = "" + to_string(numbers[0]); for (long long i = 1; i < numbers.size(); i++) { result += " "; result += to_string(numbers[i]); } return result; } //文字列の配列を改行を挟んでまとめる static string MakeString_VectorString(vector<string> const& str) { string result = ""; for (long long i = 0; i < str.size(); i++) { result += str[i] + "\n"; } return result; } //文字列を必要な個数だけ読み取る static vector<string> MyReadLineSplit(LL n) { vector<string> str(n); for (long long i = 0; i < n; i++) { std::cin >> str[i]; } return str; } //数値を必要な個数だけ読み取る static vector<long long> ReadInts(long long number) { vector<long long> a(number); for (int i = 0; i < number; i++) { std::cin >> a[i]; } return a; } //渡された自然数が素数ならtureを返す static bool PrimeCheck_Int(long long number) { if (number < 2)return false; for (ULL i = 2; i*i <= number; i++) { if (number%i == 0)return false; } return true; } //渡された数値以下の素数表を作る static vector<long long> MakePrimeList(long long n) { vector<long long> list; LL i, j, p; bool flag; for (i = 2; i <= n; i++) { flag = true; for (j = 0; j < list.size(); j++) { if (!(list[j] * list[j] <= i))break; if (i%list[j] == 0) { flag = false; break; } } if (flag)list.push_back(i); } return list; } //文字列の分割 static vector<string> split(string const& str, char sep) { vector<std::string> v; // 分割結果を格納するベクター auto first = str.begin(); // テキストの最初を指すイテレータ while (first != str.end()) { // テキストが残っている間ループ auto last = first; // 分割文字列末尾へのイテレータ while (last != str.end() && *last != sep) // 末尾 or セパレータ文字まで進める last++; v.push_back(string(first, last)); // 分割文字を出力 if (last != str.end()) last++; first = last; // 次の処理のためにイテレータを設定 } return v; } //合計を求める static LL Sum(vector<LL> a) { LL i, sum = 0; for (i = 0; i < a.size(); i++) { sum += a[i]; } return sum; } //小文字ならtrueを返す static bool Komoji(char a) { if (a >= 'a'&&a <= 'z')return true; return false; } //大文字ならtrueを返す static bool Oomoji(char a) { if (a >= 'A'&&a <= 'Z')return true; return false; } static LL GreatestCommonFactor(LL a, LL b) { LL temp; if (a < b) { temp = b; b = a; a = temp; } while (true) { temp = a % b; a = b; b = temp; if (b == 0)break; } return a; } static LL LeastCommonMultiple(LL a, LL b) { return (a / GreatestCommonFactor(a, b))*b; } }; //累積和を求めるクラス class Syakutori { private: vector<LL> list; public: void MakeArray(vector<LL> data) { LL i; list = data; list.push_back(0); list[0] = 0; for (i = 1; i < list.size(); i++) { list[i] = list[i - 1] + data[i - 1]; } } LL Sum(LL start, LL end) { if (end < start) { cout << "startがendより大きいです"; return 0; } if (start < 0 || end >= list.size()) { cout << "範囲が異常"; return 0; } return list[end] - list[start]; } }; int main(void) { LL i, j, k, n, a, b, c, length, temp; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - センター採点 |
User | torokon |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 4489 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_all_1.txt, 02_all_2.txt, 02_all_3.txt, 02_all_4.txt, 03_mini_1.txt, 03_mini_2.txt, 03_mini_3.txt, 03_mini_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample1.txt | WA | 1 ms | 256 KB |
00_sample2.txt | WA | 1 ms | 256 KB |
01_rnd_00.txt | WA | 1 ms | 256 KB |
01_rnd_01.txt | WA | 1 ms | 256 KB |
01_rnd_02.txt | WA | 1 ms | 256 KB |
01_rnd_03.txt | WA | 1 ms | 256 KB |
01_rnd_04.txt | WA | 1 ms | 256 KB |
01_rnd_05.txt | WA | 1 ms | 256 KB |
01_rnd_06.txt | WA | 1 ms | 256 KB |
01_rnd_07.txt | WA | 1 ms | 256 KB |
01_rnd_08.txt | WA | 1 ms | 256 KB |
01_rnd_09.txt | WA | 1 ms | 256 KB |
01_rnd_10.txt | WA | 1 ms | 256 KB |
01_rnd_11.txt | WA | 1 ms | 256 KB |
01_rnd_12.txt | WA | 1 ms | 256 KB |
01_rnd_13.txt | WA | 1 ms | 256 KB |
01_rnd_14.txt | WA | 1 ms | 256 KB |
01_rnd_15.txt | WA | 1 ms | 256 KB |
01_rnd_16.txt | WA | 1 ms | 256 KB |
01_rnd_17.txt | WA | 1 ms | 256 KB |
01_rnd_18.txt | WA | 1 ms | 256 KB |
01_rnd_19.txt | WA | 1 ms | 256 KB |
02_all_1.txt | WA | 1 ms | 256 KB |
02_all_2.txt | WA | 1 ms | 256 KB |
02_all_3.txt | WA | 1 ms | 256 KB |
02_all_4.txt | WA | 1 ms | 256 KB |
03_mini_1.txt | WA | 1 ms | 256 KB |
03_mini_2.txt | WA | 1 ms | 256 KB |
03_mini_3.txt | WA | 1 ms | 256 KB |
03_mini_4.txt | WA | 1 ms | 256 KB |