Submission #146786
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;
cin >> x >> y;
cout << y/x << 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-03-22 21:00:30+0900
Task
A - おいしいたこ焼きの作り方
User
kmjp
Language
C++ (G++ 4.6.4)
Score
100
Code Size
1135 Byte
Status
AC
Exec Time
43 ms
Memory
948 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
All
Score / Max Score
100 / 100
Status
Set Name
Test Cases
All
rand0.txt, rand1.txt, rand10.txt, rand11.txt, rand12.txt, rand13.txt, rand14.txt, rand15.txt, rand16.txt, rand17.txt, rand18.txt, rand19.txt, rand2.txt, rand20.txt, rand21.txt, rand22.txt, rand23.txt, rand24.txt, rand25.txt, rand26.txt, rand27.txt, rand28.txt, rand29.txt, rand3.txt, rand4.txt, rand5.txt, rand6.txt, rand7.txt, rand8.txt, rand9.txt, s1.txt, s2.txt, s3.txt
Case Name
Status
Exec Time
Memory
rand0.txt
AC
22 ms
928 KB
rand1.txt
AC
24 ms
780 KB
rand10.txt
AC
41 ms
804 KB
rand11.txt
AC
22 ms
928 KB
rand12.txt
AC
43 ms
804 KB
rand13.txt
AC
25 ms
800 KB
rand14.txt
AC
21 ms
840 KB
rand15.txt
AC
23 ms
796 KB
rand16.txt
AC
25 ms
940 KB
rand17.txt
AC
22 ms
924 KB
rand18.txt
AC
23 ms
928 KB
rand19.txt
AC
25 ms
896 KB
rand2.txt
AC
23 ms
924 KB
rand20.txt
AC
23 ms
928 KB
rand21.txt
AC
23 ms
848 KB
rand22.txt
AC
24 ms
936 KB
rand23.txt
AC
24 ms
928 KB
rand24.txt
AC
27 ms
800 KB
rand25.txt
AC
22 ms
928 KB
rand26.txt
AC
23 ms
928 KB
rand27.txt
AC
22 ms
924 KB
rand28.txt
AC
24 ms
924 KB
rand29.txt
AC
24 ms
948 KB
rand3.txt
AC
22 ms
728 KB
rand4.txt
AC
24 ms
928 KB
rand5.txt
AC
24 ms
928 KB
rand6.txt
AC
25 ms
792 KB
rand7.txt
AC
25 ms
896 KB
rand8.txt
AC
22 ms
928 KB
rand9.txt
AC
19 ms
920 KB
s1.txt
AC
24 ms
944 KB
s2.txt
AC
42 ms
792 KB
s3.txt
AC
22 ms
928 KB