Submission #161684


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RREP(i,x) for(int i=(x);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)

int a, b, c;

int solve(int a, int b, int c){
	return a-1;
}

main(){
	cin >> a >> b >> c;
	cout << solve(a, b, c) << endl;
	return 0;
}

Submission Info

Submission Time
Task A - 植木算
User zerokugi
Language C++ (G++ 4.6.4)
Score 100
Code Size 661 Byte
Status AC
Exec Time 23 ms
Memory 804 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 22 ms 700 KB
subtask0_sample02.txt AC 21 ms 804 KB
subtask0_sample03.txt AC 20 ms 804 KB
subtask1_01.txt AC 23 ms 780 KB
subtask1_02.txt AC 21 ms 804 KB
subtask1_03.txt AC 21 ms 804 KB
subtask1_04.txt AC 21 ms 804 KB
subtask1_05.txt AC 21 ms 800 KB
subtask1_06.txt AC 22 ms 800 KB
subtask1_07.txt AC 22 ms 800 KB
subtask1_08.txt AC 21 ms 800 KB
subtask1_09.txt AC 22 ms 804 KB
subtask1_10.txt AC 21 ms 804 KB
subtask1_11.txt AC 21 ms 804 KB
subtask1_12.txt AC 20 ms 796 KB
subtask1_13.txt AC 21 ms 804 KB
subtask1_14.txt AC 21 ms 700 KB