Submission #31244286

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ri int
int m,n;
typedef pair<int,int> pii;
#define fi first
#define se second
set<pii>s;
int main(){
	scanf("%d%d",&n,&m);
	for(ri i=1;i<=max(n,m);i+=2)
		for(ri j=min(i,n),jj=j+2;j<=jj;++j)
			for(ri k=min(i,m),kk=k+2;k<=kk;++k)
				if(j<=n&&k<=m)
					s.emplace(j,k);
	printf("%d\n",(int)s.size());
	for(const auto &i:s)printf("%d %d\n",i.fi,i.se);
	return 0;
}

Submission Info

Submission Time
Task C - One Three Nine
User RrU
Language C++ (GCC 9.2.1)
Score 700
Code Size 434 Byte
Status AC
Exec Time 196 ms
Memory 23948 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   10 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 1
AC × 52
Set Name Test Cases
Sample example_00.txt
All example_00.txt, test_00.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, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt
Case Name Status Exec Time Memory
example_00.txt AC 9 ms 3568 KiB
test_00.txt AC 30 ms 6368 KiB
test_01.txt AC 92 ms 14808 KiB
test_02.txt AC 8 ms 3940 KiB
test_03.txt AC 108 ms 16360 KiB
test_04.txt AC 81 ms 13920 KiB
test_05.txt AC 165 ms 23876 KiB
test_06.txt AC 168 ms 23948 KiB
test_07.txt AC 5 ms 3568 KiB
test_08.txt AC 2 ms 3536 KiB
test_09.txt AC 2 ms 3540 KiB
test_10.txt AC 2 ms 3684 KiB
test_11.txt AC 85 ms 14208 KiB
test_12.txt AC 169 ms 18852 KiB
test_13.txt AC 125 ms 19092 KiB
test_14.txt AC 65 ms 11268 KiB
test_15.txt AC 196 ms 22868 KiB
test_16.txt AC 18 ms 4828 KiB
test_17.txt AC 34 ms 6672 KiB
test_18.txt AC 37 ms 7164 KiB
test_19.txt AC 25 ms 5620 KiB
test_20.txt AC 41 ms 7904 KiB
test_21.txt AC 27 ms 5976 KiB
test_22.txt AC 15 ms 4872 KiB
test_23.txt AC 41 ms 7640 KiB
test_24.txt AC 11 ms 4232 KiB
test_25.txt AC 16 ms 4952 KiB
test_26.txt AC 24 ms 5444 KiB
test_27.txt AC 16 ms 4808 KiB
test_28.txt AC 23 ms 5160 KiB
test_29.txt AC 6 ms 3692 KiB
test_30.txt AC 30 ms 6180 KiB
test_31.txt AC 23 ms 5888 KiB
test_32.txt AC 134 ms 19820 KiB
test_33.txt AC 103 ms 15848 KiB
test_34.txt AC 88 ms 13864 KiB
test_35.txt AC 81 ms 12904 KiB
test_36.txt AC 49 ms 9136 KiB
test_37.txt AC 50 ms 9012 KiB
test_38.txt AC 54 ms 9264 KiB
test_39.txt AC 135 ms 19456 KiB
test_40.txt AC 76 ms 12440 KiB
test_41.txt AC 148 ms 21356 KiB
test_42.txt AC 54 ms 9580 KiB
test_43.txt AC 117 ms 17580 KiB
test_44.txt AC 38 ms 7320 KiB
test_45.txt AC 73 ms 11052 KiB
test_46.txt AC 145 ms 20712 KiB
test_47.txt AC 162 ms 23348 KiB
test_48.txt AC 116 ms 17208 KiB
test_49.txt AC 17 ms 5288 KiB
test_50.txt AC 37 ms 6984 KiB