Submission #161685
Source Code Expand
#include <cstdlib>
#include <cstring>
#include <memory>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <cmath>
#include <string>
#include <sstream>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ZERO(a) memset(a,0,sizeof(a))
void _fill_int(int* p,int val,int rep) {int i; FOR(i,rep) p[i]=val;}
#define FILL_INT(a,val) _fill_int((int*)a,val,sizeof(a)/4)
#define MINUS(a) _fill_int((int*)a,-1,sizeof(a)/4)
ll GETi() { ll i;scanf("%lld",&i); return i;}
//-------------------------------------------------------
void solve() {
int f,i,j,k,l,x,y;
string S;
cin>>x;
cout<<(x-1)<<endl;
}
int main(int argc,char** argv){
string s;
if(argc==1) ios::sync_with_stdio(false);
for(int i=1;i<argc;i++) s+=argv[i],s+='\n';
for(int i=s.size()-1;i>=0;i--) ungetc(s[i],stdin);
solve();
return 0;
}
Submission Info
Submission Time
2014-04-19 21:00:17+0900
Task
A - 植木算
User
kmjp
Language
C++ (G++ 4.6.4)
Score
100
Code Size
1138 Byte
Status
AC
Exec Time
24 ms
Memory
932 KB
Compile Error
./Main.cpp: In function ‘ll GETi()’:
./Main.cpp:29:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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
21 ms
928 KB
subtask0_sample02.txt
AC
21 ms
920 KB
subtask0_sample03.txt
AC
22 ms
932 KB
subtask1_01.txt
AC
21 ms
920 KB
subtask1_02.txt
AC
21 ms
804 KB
subtask1_03.txt
AC
23 ms
728 KB
subtask1_04.txt
AC
22 ms
928 KB
subtask1_05.txt
AC
21 ms
928 KB
subtask1_06.txt
AC
24 ms
772 KB
subtask1_07.txt
AC
22 ms
800 KB
subtask1_08.txt
AC
21 ms
928 KB
subtask1_09.txt
AC
22 ms
732 KB
subtask1_10.txt
AC
20 ms
800 KB
subtask1_11.txt
AC
20 ms
804 KB
subtask1_12.txt
AC
24 ms
744 KB
subtask1_13.txt
AC
20 ms
800 KB
subtask1_14.txt
AC
21 ms
796 KB