Submission #161710
Source Code Expand
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define ALL(co) co.begin(), co.end()
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> IP;
typedef pair<P, P> PP;
typedef vector<int> Array;
typedef vector<vector<int> > Array2;
typedef vector<int> LArray;
const int INF = 1 << 29;
const LL LINF = 1LL << 60;
int itiv;
inline int getInt() { return (cin >> itiv, itiv); }
void readAll(Array& vec, int n) { for (int i = 0; i < n; i++) cin >> vec[i]; }
inline bool between(int first, int last, int n) { return first <= n && n <= last; }
inline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }
inline bool inRange(int size, int n) { return 0 <= n && n < size; }
int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, -1, 0, 1 };
int dr[] = { 0, -1, 0, 1 }, dc[] = { -1, 0, 1, 0 };
int main(void)
{
int a, b;
cin >> a;
cout << a - 1 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 植木算 |
User |
tnkt37 |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1142 Byte |
Status |
AC |
Exec Time |
24 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All |
subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample01.txt |
AC |
20 ms |
800 KB |
subtask0_sample02.txt |
AC |
20 ms |
800 KB |
subtask0_sample03.txt |
AC |
24 ms |
760 KB |
subtask1_01.txt |
AC |
22 ms |
804 KB |
subtask1_02.txt |
AC |
22 ms |
796 KB |
subtask1_03.txt |
AC |
23 ms |
888 KB |
subtask1_04.txt |
AC |
22 ms |
800 KB |
subtask1_05.txt |
AC |
20 ms |
924 KB |
subtask1_06.txt |
AC |
22 ms |
728 KB |
subtask1_07.txt |
AC |
22 ms |
920 KB |
subtask1_08.txt |
AC |
20 ms |
920 KB |
subtask1_09.txt |
AC |
21 ms |
800 KB |
subtask1_10.txt |
AC |
22 ms |
804 KB |
subtask1_11.txt |
AC |
22 ms |
800 KB |
subtask1_12.txt |
AC |
20 ms |
756 KB |
subtask1_13.txt |
AC |
20 ms |
672 KB |
subtask1_14.txt |
AC |
20 ms |
928 KB |