Submission #618010


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

//typedef
//------------------------------------------
// int
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
// double
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<VVD> VVVD;
// string
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<VVS> VVVS;

typedef long long LL;
typedef long double LD;

typedef pair<int, int> PII;
typedef map<int, string> MIS;
typedef set<int> SI;

//vector
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define REVE(c) reverse(ALL(c))
#define COUNT(c,n) count(ALL(c), (n))
#define MAXV(c) max_element(ALL(c))
#define MINV(c) min_element(ALL(c))
#define SUM(c) accumulate((c).begin(), (c).end(), 0.0)
#define AVE(c) SUM((c)) / (c).size()

// 宣言vector(int)
//------------------------------------------
#define VID(v,n) VI v(n)
#define VIFD(v,n,a) VI v(n,a)
#define VVID(v,n,m) VVI v(n,VI(m))
#define VVIFD(v,n,m,a) VVI v(n,VI(m,a))
#define VVVID(v,n,m,o) VVVI v(n,VVI(m,VI(o)))
#define VVVIFD(v,n,m,o,a) VVVI v(n,VVI(m,VI(o,a)))

// 宣言vector(double)
//------------------------------------------
#define VDD(v,n) VD v(n)
#define VDFD(v,n,a) VD v(n,a)
#define VVDD(v,n,m) VVD v(n,VD(m))
#define VVDFD(v,n,m,a) VVD v(n,VD(m,a))
#define VVVDD(v,n,m,o) VVVD v(n,VVD(m,VD(o)))
#define VVVDFD(v,n,m,o,a) VVVD v(n,VVD(m,VD(o,a)))

// 宣言vector(string)
//------------------------------------------
#define VSD(v,n) VS v(n)
#define VSFD(v,n,a) VS v(n,a)
#define VVSD(v,n,m) VVS v(n,VS(m))
#define VVSFD(v,n,m,a) VVS v(n,VS(m,a))
#define VVVSD(v,n,m,o) VVVS v(n,VVS(m,VS(o)))
#define VVVSFD(v,n,m,o,a) VVVS v(n,VVS(m,VS(o,a)))

#define MISI(a,i,s) (a).insert(map<int,string>::value_type(i,s));

//for文
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(a);i>(b);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n)  RFOR(i,n,0)

// vectorを全て出力する
template<class T> inline void pvall(vector<T> x){
	REP(i, x.size() - 1)
		cout << x[i] << " ";
	cout << x[x.size() - 1];
}
// vectorをaからbまで出力する
template<class T> inline void pvatob(vector<T> x, int a, int b){
	if (a < 0 || b >= x.size() || a > b) return;
	FOR(i, a, b)
		cout << x[i] << " ";
	cout << x[b];
}

//定数
//--------------------------------------------
const LD EPS = 1e-10;
const LD PI = acos(-1.0);
const LL mod = 1000000007;

//数学
//-------------------------------------------
inline LL factorial(int n) {
	if (n > 0) {
		return n * factorial(n - 1);
	}
	else {
		return 1;
	}
}
inline LL npr(int n, int r)
{
	LL value;
	value = factorial(n) / factorial(n - r);
	return value;
}
inline LL ncr(int n, int r)
{
	LL value;
	value = factorial(n) / (factorial(r)*factorial(n - r));
	return value;
}
// string to int stoi()
// string to double stod()
int main()
{
	VSFD(g, 5,"( ^ω^)おっ");
	pvall(g);
	cout << "\n";
	system("pause");
}

Submission Info

Submission Time
Task A - ニコニコ数
User mkc1370
Language C++ (GCC 4.9.2)
Score 0
Code Size 3370 Byte
Status WA
Exec Time 28 ms
Memory 936 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:128:17: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
  system("pause");
                 ^

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 0 / 60
Status
WA × 2
WA × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt
Case Name Status Exec Time Memory
sample_01.txt WA 28 ms 920 KB
sample_02.txt WA 26 ms 808 KB
test_01.txt WA 25 ms 928 KB
test_02.txt WA 25 ms 924 KB
test_03.txt WA 28 ms 924 KB
test_04.txt WA 25 ms 928 KB
test_05.txt WA 25 ms 924 KB
test_06.txt WA 25 ms 928 KB
test_07.txt WA 25 ms 928 KB
test_08.txt WA 25 ms 928 KB
test_09.txt WA 26 ms 936 KB
test_10.txt WA 26 ms 920 KB
test_11.txt WA 27 ms 924 KB
test_12.txt WA 27 ms 928 KB
test_13.txt WA 27 ms 796 KB
test_14.txt WA 27 ms 928 KB
test_15.txt WA 27 ms 924 KB