Submission #2245503


Source Code Expand

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-13;
const double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
double ABS(double a){return max(a,-a);}
int main(){
	int a;scanf("%d",&a);for(int i=0;i<a;i++)printf("%d %d\n",i+1,i+1);
}

Submission Info

Submission Time
Task A - Problem 1
User tozangezan
Language C++14 (GCC 5.4.1)
Score 52935
Code Size 665 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a;scanf("%d",&a);for(int i=0;i<a;i++)printf("%d %d\n",i+1,i+1);
                      ^

Judge Result

Set Name sample_00 sample_01 random_00 random_01 random_02 random_03 random_04 random_05 random_06 random_07 random_08 full_00 full_01 full_02 full_03 full_04 full_05 full_06 full_07 full_08 sparse_00 sparse_01 sparse_02 sparse_03 sparse_04 sparse_05 sparse_06 sparse_07 random_max full_max
Score / Max Score 3 / 1000000 45 / 1000000 700 / 1000000 4634 / 1000000 2513 / 1000000 3280 / 1000000 344 / 1000000 2526 / 1000000 3281 / 1000000 2491 / 1000000 3323 / 1000000 4095 / 1000000 2579 / 1000000 95 / 1000000 903 / 1000000 2586 / 1000000 5245 / 1000000 444 / 1000000 2288 / 1000000 2410 / 1000000 139 / 1000000 192 / 1000000 143 / 1000000 93 / 1000000 378 / 1000000 82 / 1000000 134 / 1000000 181 / 1000000 2780 / 1000000 5028 / 1000000
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
sample_00 00_sample_00
sample_01 00_sample_01
random_00 10_random_00
random_01 10_random_01
random_02 10_random_02
random_03 10_random_03
random_04 10_random_04
random_05 10_random_05
random_06 10_random_06
random_07 10_random_07
random_08 10_random_08
full_00 20_full_00
full_01 20_full_01
full_02 20_full_02
full_03 20_full_03
full_04 20_full_04
full_05 20_full_05
full_06 20_full_06
full_07 20_full_07
full_08 20_full_08
sparse_00 30_sparse_00
sparse_01 30_sparse_01
sparse_02 30_sparse_02
sparse_03 30_sparse_03
sparse_04 30_sparse_04
sparse_05 30_sparse_05
sparse_06 30_sparse_06
sparse_07 30_sparse_07
random_max 60_random_max_00
full_max 70_full_max_00
Case Name Status Exec Time Memory
00_sample_00 AC 1 ms 128 KB
00_sample_01 AC 0 ms 128 KB
10_random_00 AC 1 ms 128 KB
10_random_01 AC 1 ms 128 KB
10_random_02 AC 1 ms 128 KB
10_random_03 AC 1 ms 128 KB
10_random_04 AC 1 ms 128 KB
10_random_05 AC 1 ms 128 KB
10_random_06 AC 1 ms 128 KB
10_random_07 AC 1 ms 128 KB
10_random_08 AC 1 ms 128 KB
20_full_00 AC 1 ms 128 KB
20_full_01 AC 1 ms 128 KB
20_full_02 AC 1 ms 128 KB
20_full_03 AC 1 ms 128 KB
20_full_04 AC 1 ms 128 KB
20_full_05 AC 1 ms 128 KB
20_full_06 AC 1 ms 128 KB
20_full_07 AC 1 ms 128 KB
20_full_08 AC 1 ms 128 KB
30_sparse_00 AC 1 ms 128 KB
30_sparse_01 AC 1 ms 128 KB
30_sparse_02 AC 1 ms 128 KB
30_sparse_03 AC 1 ms 128 KB
30_sparse_04 AC 1 ms 128 KB
30_sparse_05 AC 1 ms 128 KB
30_sparse_06 AC 1 ms 128 KB
30_sparse_07 AC 1 ms 128 KB
60_random_max_00 AC 1 ms 128 KB
70_full_max_00 AC 1 ms 128 KB