Submission #161782


Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>

using namespace std;

#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
typedef complex<int> P;
typedef pair<int,int> pii;
const double EPS = 1e-10;
const double PI  = acos(-1.0);



bool solve(){
	int n;
	cin>> n;
	cout<< n-1<< endl;
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	
	solve();
	return 0;
}

 

Submission Info

Submission Time
Task A - 植木算
User yokabb
Language C++ (G++ 4.6.4)
Score 100
Code Size 747 Byte
Status AC
Exec Time 31 ms
Memory 920 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 23 ms 912 KB
subtask0_sample02.txt AC 31 ms 800 KB
subtask0_sample03.txt AC 23 ms 720 KB
subtask1_01.txt AC 23 ms 792 KB
subtask1_02.txt AC 24 ms 792 KB
subtask1_03.txt AC 24 ms 800 KB
subtask1_04.txt AC 22 ms 796 KB
subtask1_05.txt AC 25 ms 796 KB
subtask1_06.txt AC 24 ms 920 KB
subtask1_07.txt AC 23 ms 788 KB
subtask1_08.txt AC 22 ms 792 KB
subtask1_09.txt AC 24 ms 720 KB
subtask1_10.txt AC 23 ms 792 KB
subtask1_11.txt AC 24 ms 788 KB
subtask1_12.txt AC 24 ms 792 KB
subtask1_13.txt AC 23 ms 796 KB
subtask1_14.txt AC 21 ms 740 KB