Submission #161693


Source Code Expand

#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<string>
#include<string.h>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<complex>
#include<map>
#include<set>
#include<bitset>
#include<iostream>
#include<sstream>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; i++)
#define rrep(i,n) for(int i = 1; i <= n; i++)
#define drep(i,n) for(int i = n-1; i >= 0; i--)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y);
#define mins(x,y) x = min(x,y);
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;

const int MX = 100005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int dx[] = {-1,0,1,0}, dy[] = {0,-1,0,1}; //<^>v



int main(){
	int n;
	cin >> n;
	cout << n-1 << endl;
	
	
	return 0;
}




Submission Info

Submission Time
Task A - 植木算
User Ross_Peraudo
Language C++ (G++ 4.6.4)
Score 100
Code Size 1222 Byte
Status AC
Exec Time 22 ms
Memory 924 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 17
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 21 ms 796 KB
subtask0_sample02.txt AC 22 ms 800 KB
subtask0_sample03.txt AC 22 ms 920 KB
subtask1_01.txt AC 21 ms 920 KB
subtask1_02.txt AC 21 ms 800 KB
subtask1_03.txt AC 22 ms 672 KB
subtask1_04.txt AC 20 ms 796 KB
subtask1_05.txt AC 21 ms 800 KB
subtask1_06.txt AC 21 ms 804 KB
subtask1_07.txt AC 19 ms 800 KB
subtask1_08.txt AC 20 ms 924 KB
subtask1_09.txt AC 21 ms 800 KB
subtask1_10.txt AC 21 ms 804 KB
subtask1_11.txt AC 21 ms 800 KB
subtask1_12.txt AC 22 ms 792 KB
subtask1_13.txt AC 21 ms 924 KB
subtask1_14.txt AC 21 ms 796 KB