Submission #615743
Source Code Expand
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))
const int INF=1000000000;
const int dir_4[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
int main(){
int n;
scanf("%d",&n);
cout << n/25 << endl;
}
Submission Info
Submission Time
2016-01-23 20:02:37+0900
Task
A - ニコニコ数
User
yokozuna57
Language
C++11 (GCC 4.9.2)
Score
60
Code Size
1074 Byte
Status
AC
Exec Time
26 ms
Memory
928 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:39:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
Judge Result
Set Name
Sample
Subtask1
Score / Max Score
0 / 0
60 / 60
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
Subtask1
sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
26 ms
672 KB
sample_02.txt
AC
26 ms
804 KB
test_01.txt
AC
26 ms
804 KB
test_02.txt
AC
26 ms
804 KB
test_03.txt
AC
26 ms
676 KB
test_04.txt
AC
26 ms
796 KB
test_05.txt
AC
25 ms
800 KB
test_06.txt
AC
25 ms
920 KB
test_07.txt
AC
24 ms
800 KB
test_08.txt
AC
25 ms
928 KB
test_09.txt
AC
24 ms
800 KB
test_10.txt
AC
25 ms
800 KB
test_11.txt
AC
26 ms
804 KB
test_12.txt
AC
25 ms
804 KB
test_13.txt
AC
25 ms
800 KB
test_14.txt
AC
25 ms
796 KB
test_15.txt
AC
23 ms
796 KB