problem_id stringlengths 6 6 | src_id stringlengths 10 10 | split stringclasses 1
value | language stringclasses 1
value | src_code stringlengths 60 490k | gem5_src_per_tc_ticks stringlengths 16 2.01k | gem5_src_excluded stringclasses 324
values | gem5_src_status stringclasses 2
values | gem5_src_sum_ticks_all int64 193M 1,762B | oracle_tgt_id stringlengths 10 10 | oracle_tgt_code stringlengths 54 149k | gem5_oracle_tgt_per_tc_ticks stringlengths 16 1.95k | gem5_oracle_tgt_status stringclasses 2
values | our_speedup_usable float64 0.66 70.3 | our_speedup_all float64 0.2 70.3 | timed_case_ids stringclasses 416
values | correctness_kept_case_ids stringclasses 385
values | usable_case_ids stringclasses 679
values | n_timed int64 1 108 | n_kept int64 0 107 | n_usable int64 1 107 | n_cases_available int64 1 108 | src_n_fail int64 0 5 | ceiling_speedup float64 1 72.6 | flag_low_headroom bool 2
classes | flag_single_case bool 2
classes | flag_empty_kept bool 2
classes | pie_speedup float64 1.1 71.5 | pie_src_agg_runtime float64 0 1.45 | pie_oracle_tgt_agg_runtime float64 0 1.03 | pie_fastest_agg_runtime float64 0 0.36 | pie_src_verdict stringclasses 1
value | pie_oracle_tgt_verdict stringclasses 1
value | pie_fastest_agg_runtime_updated float64 0 0.36 | pie_src_reward_updated float64 0.1 1 | pie_src_reward_updated_pct_bin float64 1 10 | gem5_fastest_id stringlengths 10 10 | gem5_fastest_per_tc_ticks stringlengths 16 1.94k | gem5_fastest_usable_case_ids stringclasses 659
values | gem5_fastest_sum_ticks_usable int64 0 1,027B | our_fastest_speedup float64 0.99 73.4 ⌀ | pie_n_tests float64 | pie_test_accuracy float64 | pie_src_code_accuracy float64 | pie_src_code_compilation float64 | pie_src_code_tc2time stringclasses 0
values | pie_oracle_tgt_code_tc2time stringclasses 0
values | pie_fastest_code stringclasses 0
values | pie_fastest_code_len float64 | pie_fastest_code_runtime float64 | pie_fastest_code_tc2time stringclasses 0
values | pie_tests_case_ids stringclasses 0
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03347 | s342556182 | train | cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
int n,now;
ll ans=0;
int a[200010];
int main(){
scanf("%d",&n);
int i,j;
for(i=1;i<=n;++i){
scanf("%d",&a[i]);
}
if(a[1]!=0){
printf("-1\n");re... | {"0": 1008111962, "1": 1010773192, "2": 1010617894, "3": 1010644206, "4": 1009024874, "5": 1008111962, "6": 1009022872, "7": 1008308730, "8": 1010657934, "9": 1009022872, "10": 1008306728, "11": 1009022872, "12": 1008317310, "13": 1008387094, "14": 1009221642, "15": 1008371364, "16": 1008387094, "17": 1009284276, "18":... | [] | ok | 104,913,081,130 | s547670801 | #include<cstdio>
#include<cctype>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<algorithm>
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define reg register
typedef long long ll;
template<typename T>inline T read(){
reg T x=0;reg short f=1;reg char c=getchar();
for(;!isdigit(... | {"0": 189830212, "1": 192545210, "2": 192456836, "3": 192542922, "4": 189894276, "5": 189830212, "6": 189894276, "7": 189674342, "8": 192456836, "9": 189894276, "10": 189750418, "11": 189894276, "12": 189750418, "13": 189888556, "14": 189888556, "15": 189750418, "16": 189888556, "17": 189888556, "18": 189750418, "19": ... | ok | 5.308412 | 5.308412 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.254061 | false | false | false | 5.438973 | 0.104392 | 0.019193 | 0.019126 | Accepted | Accepted | 0.019126 | 0.99921 | 9 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.315502 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s946772374 | train | cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
typedef long long ll;
using namespace std;
ll a[200000+50]={0};
int main ()
{
ll n,i;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
if(a[0]!=0)
{
cout<<"-1"<<endl;
return 0;
}
for(i=1;i<n;i++)
{
if(a[i]-a[i-1]>1&&a[i]!=1)
... | {"0": 1021551102, "1": 1023012562, "2": 1022629894, "3": 1022434842, "4": 1022900450, "5": 1021551102, "6": 1022900450, "7": 1021715552, "8": 1022462012, "9": 1022900450, "10": 1021617168, "11": 1022900450, "12": 1021617168, "13": 1022164572, "14": 1023691526, "15": 1022433698, "16": 1022164572, "17": 1023709544, "18":... | [] | ok | 106,340,548,028 | s991434731 | #include <stdio.h>
#include <string.h>
#define R register
#define MN 200005
typedef long long ll;
namespace IO{
inline int read(){
R int x; R bool f; R char c;
for (f=0; (c=getchar())<'0'||c>'9'; f=c=='-');
for (x=c^'0'; (c=getchar())>='0'&&c<='9'; x=(x<<1)+(x<<3)+(c^'0'));
return f?-x:x;
}
}
nam... | {"0": 189679776, "1": 192335572, "2": 192256064, "3": 192335572, "4": 189680062, "5": 189679776, "6": 189680062, "7": 189465276, "8": 192256064, "9": 189680062, "10": 189511036, "11": 189680062, "12": 189511036, "13": 189511036, "14": 189511036, "15": 189511036, "16": 189511036, "17": 189511036, "18": 189511036, "19": ... | ok | 5.387451 | 5.387451 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.325548 | false | false | false | 5.526899 | 0.105743 | 0.019132 | 0.019126 | Accepted | Accepted | 0.019126 | 0.999925 | 10 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.387826 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s470895760 | train | cpp | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<queue>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std ;
const int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int n;
long long a[200000+5];
int main()
{
while(~scanf("%d",&n))
{
... | {"0": 1010856418, "1": 1011125830, "2": 1011078354, "3": 1010946508, "4": 1011889450, "5": 1010856418, "6": 1011889450, "7": 1011019438, "8": 1011081500, "9": 1011889450, "10": 1011084074, "11": 1011889450, "12": 1011010858, "13": 1011123542, "14": 1012070202, "15": 1011088078, "16": 1011123542, "17": 1012093940, "18":... | [] | ok | 105,185,856,490 | s991434731 | #include <stdio.h>
#include <string.h>
#define R register
#define MN 200005
typedef long long ll;
namespace IO{
inline int read(){
R int x; R bool f; R char c;
for (f=0; (c=getchar())<'0'||c>'9'; f=c=='-');
for (x=c^'0'; (c=getchar())>='0'&&c<='9'; x=(x<<1)+(x<<3)+(c^'0'));
return f?-x:x;
}
}
nam... | {"0": 189679776, "1": 192335572, "2": 192256064, "3": 192335572, "4": 189680062, "5": 189679776, "6": 189680062, "7": 189465276, "8": 192256064, "9": 189680062, "10": 189511036, "11": 189680062, "12": 189511036, "13": 189511036, "14": 189511036, "15": 189511036, "16": 189511036, "17": 189511036, "18": 189511036, "19": ... | ok | 5.328952 | 5.328952 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.267721 | false | false | false | 5.475154 | 0.104753 | 0.019132 | 0.019126 | Accepted | Accepted | 0.019126 | 0.999924 | 10 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.329323 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s436472631 | train | cpp | #include<bits/stdc++.h>
using namespace std;
int n,a,l;
long long ans;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
int main(){
n=read(),a=read();
if(a>0){
... | {"0": 1004368508, "1": 1007265402, "2": 1007174454, "3": 1007174454, "4": 1004411122, "5": 1004368508, "6": 1004411122, "7": 1004166878, "8": 1007174454, "9": 1004411122, "10": 1003909192, "11": 1004411122, "12": 1003909192, "13": 1004384810, "14": 1004384810, "15": 1003909192, "16": 1004384810, "17": 1004384810, "18":... | [] | ok | 104,462,635,134 | s456036022 | #include <cstdio>
#include <algorithm>
#include <cstring>
#define INF 0x3f3f3f3f
#define LL long long
#define MAX 100010
using namespace std;
int a[200010];
long long sum=0;
int main()
{
int N;
scanf("%d",&N);
for(int i=0; i<N; i++)
scanf("%d",&a[i]);
if(a[0]!=0)
{
p... | {"0": 192738546, "1": 195667472, "2": 195468130, "3": 195468130, "4": 193615136, "5": 192738546, "6": 193615136, "7": 192866674, "8": 195468130, "9": 193615136, "10": 192870392, "11": 193615136, "12": 192870392, "13": 192870964, "14": 193824202, "15": 192878114, "16": 192870964, "17": 193824202, "18": 192790026, "19": ... | ok | 5.195142 | 5.195142 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.231502 | false | false | false | 5.271269 | 0.103997 | 0.019729 | 0.019126 | Accepted | Accepted | 0.019126 | 0.992892 | 7 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.29268 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s911234191 | train | cpp |
#include<iostream>
using namespace std;
typedef long long ll;
ll a[200005];
int main(){
ll n;while(cin>>n){
a[0]=0;
ll sum=0;
bool flag=true;
for(int i=1;i<=n;i++){
cin>>a[i];
if(a[1]!=0||a[i]>a[i-1]+1){
//cout<<"-1"<<endl;
flag=false;//break;
}
else if(a[i-1]!=0&&a[i]==(a[i-1]+1))... | {"0": 1021220200, "1": 1022985678, "2": 1022584134, "3": 1022588710, "4": 1022690526, "5": 1021220200, "6": 1022688810, "7": 1021275112, "8": 1022689954, "9": 1022688810, "10": 1021479888, "11": 1022688810, "12": 1021711548, "13": 1021794488, "14": 1023453002, "15": 1022405670, "16": 1021794488, "17": 1023454432, "18":... | [] | ok | 106,334,123,324 | s431723443 | #include <cstdio>
const int maxn=200000;
int read()
{
int x=0,f=1;
char ch=getchar();
while((ch<'0')||(ch>'9'))
{
if(ch=='-')
{
f=-f;
}
ch=getchar();
}
while((ch>='0')&&(ch<='9'))
{
x=x*10+ch-'0';
ch=getchar();
}
return x... | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | ok | 5.3875 | 5.3875 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.325227 | false | false | false | 5.527539 | 0.106094 | 0.019194 | 0.019126 | Accepted | Accepted | 0.019126 | 0.999219 | 10 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.3875 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s981378820 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> l4;
const int maxn = 2e5+1;
int a[maxn], n;
inline void end()
{
puts("-1");
exit(0);
}
int main()
{
scanf("%d", &n);
for (int i = 1... | {"0": 1015507350, "1": 1021294846, "2": 1021103512, "3": 1020753162, "4": 1016166580, "5": 1015507350, "6": 1016166580, "7": 1015514786, "8": 1021094360, "9": 1016166580, "10": 1015499342, "11": 1016166580, "12": 1015483326, "13": 1015498484, "14": 1016671656, "15": 1015509924, "16": 1015498484, "17": 1016742584, "18":... | [] | ok | 105,697,042,594 | s431723443 | #include <cstdio>
const int maxn=200000;
int read()
{
int x=0,f=1;
char ch=getchar();
while((ch<'0')||(ch>'9'))
{
if(ch=='-')
{
f=-f;
}
ch=getchar();
}
while((ch>='0')&&(ch<='9'))
{
x=x*10+ch-'0';
ch=getchar();
}
return x... | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | ok | 5.355222 | 5.355222 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.293321 | false | false | false | 5.48565 | 0.10529 | 0.019194 | 0.019126 | Accepted | Accepted | 0.019126 | 0.999212 | 9 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.355222 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s022636624 | train | cpp | #include<bits/stdc++.h>
#define fi first
#define se second
#define LL long long
using namespace std;
const int maxn = 2e5 + 5;
typedef pair<int, int> P;
int a[maxn];
int main() {
#ifdef TT
freopen("xxx.in", "r", stdin);
#endif // TT
int n, i, x;
LL ans = 0;
scanf("%d", &n);
for(... | {"0": 1007354348, "1": 1014283556, "2": 1014283556, "3": 1014283556, "4": 1008405970, "5": 1007354348, "6": 1008387094, "7": 1007585436, "8": 1014265824, "9": 1008387094, "10": 1007598020, "11": 1008387094, "12": 1007594874, "13": 1007652932, "14": 1008395102, "15": 1007661226, "16": 1007652932, "17": 1008385378, "18":... | [] | ok | 104,868,615,280 | s431723443 | #include <cstdio>
const int maxn=200000;
int read()
{
int x=0,f=1;
char ch=getchar();
while((ch<'0')||(ch>'9'))
{
if(ch=='-')
{
f=-f;
}
ch=getchar();
}
while((ch>='0')&&(ch<='9'))
{
x=x*10+ch-'0';
ch=getchar();
}
return x... | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | ok | 5.313249 | 5.313249 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.251834 | false | false | false | 5.458332 | 0.104766 | 0.019194 | 0.019126 | Accepted | Accepted | 0.019126 | 0.999207 | 9 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.313249 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s918779571 | train | cpp | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int a[N];
void kill() {
cout << "-1\n";
exit(0);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = -1;
for (int i = 1; i <= n; i+... | {"0": 1033736704, "1": 1035027136, "2": 1035148686, "3": 1035183864, "4": 1034077902, "5": 1033736704, "6": 1034077902, "7": 1033834802, "8": 1035180432, "9": 1034077902, "10": 1033852820, "11": 1034077902, "12": 1033801626, "13": 1034038434, "14": 1034712822, "15": 1034409662, "16": 1034038434, "17": 1034732270, "18":... | [] | ok | 107,570,106,358 | s431723443 | #include <cstdio>
const int maxn=200000;
int read()
{
int x=0,f=1;
char ch=getchar();
while((ch<'0')||(ch>'9'))
{
if(ch=='-')
{
f=-f;
}
ch=getchar();
}
while((ch>='0')&&(ch<='9'))
{
x=x*10+ch-'0';
ch=getchar();
}
return x... | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | ok | 5.450122 | 5.450122 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.387125 | false | false | false | 5.561724 | 0.106751 | 0.019194 | 0.019126 | Accepted | Accepted | 0.019126 | 0.999225 | 10 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.450122 | null | null | null | null | null | null | null | null | null | null | null |
p03347 | s673529842 | train | cpp | #include <iostream>
#include <string.h>
using namespace std;
int N[210000];
long long ans,n;
bool mtime()
{
for(int i=1; i<n; i++)
{
if(N[i]-N[i-1]>1||N[i]>i)
return true;
}
return false;
}
int main()
{
cin>>n;
for(int i=0; i<n; i++)
{
c... | {"0": 1024866128, "1": 1024687664, "2": 1024406240, "3": 1023927762, "4": 1026512344, "5": 1024866128, "6": 1026512344, "7": 1025159850, "8": 1024425688, "9": 1026512344, "10": 1025392654, "11": 1026512344, "12": 1025292554, "13": 1025521640, "14": 1027074906, "15": 1026203178, "16": 1025521640, "17": 1027422396, "18":... | [] | ok | 106,711,802,340 | s431723443 | #include <cstdio>
const int maxn=200000;
int read()
{
int x=0,f=1;
char ch=getchar();
while((ch<'0')||(ch>'9'))
{
if(ch=='-')
{
f=-f;
}
ch=getchar();
}
while((ch>='0')&&(ch<='9'))
{
x=x*10+ch-'0';
ch=getchar();
}
return x... | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | ok | 5.406636 | 5.406636 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 104 | 104 | 104 | 0 | 5.344141 | false | false | false | 5.526009 | 0.106065 | 0.019194 | 0.019126 | Accepted | Accepted | 0.019126 | 0.999219 | 10 | s431723443 | {"0": 189687498, "1": 192430238, "2": 192349872, "3": 192349872, "4": 189557368, "5": 189687498, "6": 189557368, "7": 189465276, "8": 192349872, "9": 189557368, "10": 189533630, "11": 189557368, "12": 189533630, "13": 189458698, "14": 189615712, "15": 189533630, "16": 189458698, "17": 189615712, "18": 189533630, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,737,190,902 | 5.406636 | null | null | null | null | null | null | null | null | null | null | null |
p00994 | s209285323 | train | cpp | #include<iostream>
#include<sstream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define each(i,c) for(__typeof(c.begin()) i=c.begin... | {"1": 1022195746, "3": 9530900522, "4": 18146234106, "7": 9530559038, "8": 18146384828, "10": 18149927224, "13": 1022195746, "14": 18147830844, "17": 1022195746, "18": 18150009306, "21": 1022195746, "22": 18262153052, "25": 1022195746, "26": 18555597632, "29": 1022195746, "30": 23045011704, "32": 1022195746, "33": 2304... | [0, 2, 5, 6, 9, 11, 12, 15, 16, 19, 20, 23, 24, 27, 28, 31, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, 53, 54, 56, 57, 59, 60, 62, 63, 64, 67, 68, 71, 72, 75, 76, 79, 83, 84, 85, 86, 88, 89, 90, 91, 93, 94, 95, 98, 99, 100, 101, 102, 104] | ok | 379,304,446,664 | s499176717 | #include<iostream>
#include<sstream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define each(i,c) for(__typeof(c.begin()) i=c.begin... | {"0": 13570714300, "1": 1022009560, "2": 4149866292, "3": 2741334596, "4": 3445761748, "5": 13570714300, "6": 4149870296, "7": 2741440416, "8": 3445469170, "9": 13570714300, "10": 3446470170, "11": 4855013592, "12": 13570739468, "13": 1022009560, "14": 3446625468, "15": 4855688838, "16": 13570739468, "17": 1022009560, ... | ok | 2.869262 | 3.665683 | [1, 3, 7, 13, 17, 21, 25, 29, 32, 35, 47, 51, 52, 55, 61, 65, 66, 69, 70, 73, 77, 78, 80, 81, 82, 87, 96, 97, 103] | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [1, 3, 7, 13, 17, 21, 25, 29, 32, 35, 47, 51, 52, 55, 61, 65, 66, 69, 70, 73, 77, 78, 80, 81, 82, 87, 96, 97, 103] | 29 | 105 | 29 | 105 | 0 | 27.156486 | false | false | false | 2.891816 | 0.139056 | 0.048086 | 0.028939 | Accepted | Accepted | 0.029121 | 0.827489 | 5 | s209285323 | {"1": 1022195746, "3": 9530900522, "4": 18146234106, "7": 9530559038, "8": 18146384828, "10": 18149927224, "13": 1022195746, "14": 18147830844, "17": 1022195746, "18": 18150009306, "21": 1022195746, "22": 18262153052, "25": 1022195746, "26": 18555597632, "29": 1022195746, "30": 23045011704, "32": 1022195746, "33": 2304... | [1, 3, 7, 13, 17, 21, 25, 29, 32, 35, 47, 51, 52, 55, 61, 65, 66, 69, 70, 73, 77, 78, 80, 81, 82, 87, 96, 97, 103] | 151,207,315,688 | 1 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s512577812 | train | cpp | #include <cstdio>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
#include <string>
#include <cstdio>
#define ll long long
#define TLE std::ios::sync_with_stdio(false);cin.tie(NULL);cout.tie... | {"0": 1041026558, "1": 1039271662, "2": 1039898288, "3": 1041144104, "4": 1040293826, "5": 1039271662, "6": 1041089764, "7": 1040275236, "8": 1039437542, "9": 1041089764, "10": 1040188864, "11": 1039437542, "12": 1041743274, "13": 1040280384, "14": 1039273092, "15": 1041088334, "16": 1040816634, "17": 1039273092, "18":... | [] | ok | 108,104,263,696 | s459566321 | #include<stdio.h>
int main(){
int na;
int a[10];
int angka[3][3];
int tanda[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &angka[i][j]);
}
}
scanf("%d", &na);
for(int c=0;c<na;c++){
scanf("%d", &a[c]);
for(int l = 0 ; l < 3 ; l++ ) {
for(int k = 0 ; k < 3 ; ... | {"0": 194540918, "1": 194357878, "2": 194346724, "3": 194542348, "4": 194346724, "5": 194357878, "6": 194540918, "7": 194387622, "8": 194346724, "9": 194540918, "10": 194389624, "11": 194346724, "12": 194540918, "13": 194389624, "14": 194346724, "15": 194540918, "16": 194388480, "17": 194346724, "18": 194609272, "19": ... | ok | 5.347748 | 5.348028 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.413875 | false | false | false | 5.392154 | 0.107433 | 0.019924 | 0.019823 | Accepted | Accepted | 0.019823 | 0.998849 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.357977 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s167612977 | train | cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
int main()
{
int s[5][5];
for(int i=1; i<=3; i++)
{
for(int j=1; j<=3; j... | {"0": 1026626172, "1": 1024397088, "2": 1025526788, "3": 1026750296, "4": 1025388364, "5": 1024397088, "6": 1026632750, "7": 1025381214, "8": 1024408814, "9": 1026632750, "10": 1025365484, "11": 1024408814, "12": 1026576980, "13": 1025273106, "14": 1024408814, "15": 1026499760, "16": 1025295128, "17": 1024408814, "18":... | [] | ok | 106,574,883,844 | s459566321 | #include<stdio.h>
int main(){
int na;
int a[10];
int angka[3][3];
int tanda[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &angka[i][j]);
}
}
scanf("%d", &na);
for(int c=0;c<na;c++){
scanf("%d", &a[c]);
for(int l = 0 ; l < 3 ; l++ ) {
for(int k = 0 ; k < 3 ; ... | {"0": 194540918, "1": 194357878, "2": 194346724, "3": 194542348, "4": 194346724, "5": 194357878, "6": 194540918, "7": 194387622, "8": 194346724, "9": 194540918, "10": 194389624, "11": 194346724, "12": 194540918, "13": 194389624, "14": 194346724, "15": 194540918, "16": 194388480, "17": 194346724, "18": 194609272, "19": ... | ok | 5.272327 | 5.272368 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.337284 | false | false | false | 5.314774 | 0.105891 | 0.019924 | 0.019823 | Accepted | Accepted | 0.019823 | 0.998829 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.282413 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s150683111 | train | cpp | #include<iostream>
#include<algorithm>
using namespace std;
int a[5][5];
int b[15];
int ans=0,t=0,teil=0,head=0;
int main()
{
int n;
for(int i=1;i<=3;i++)
{
for(int j=1;j<=3;j++)
{
cin>>a[i][j];
}
}
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>b[i];
}
for(int i=1;i<=3;i++)
{
ans=0;... | {"0": 1026444276, "1": 1024559822, "2": 1025460150, "3": 1026536368, "4": 1025488750, "5": 1024559822, "6": 1026481456, "7": 1025459864, "8": 1024559822, "9": 1026481456, "10": 1025471876, "11": 1024559822, "12": 1026522926, "13": 1025471876, "14": 1024559822, "15": 1026440272, "16": 1025471876, "17": 1024559822, "18":... | [] | ok | 106,594,911,280 | s459566321 | #include<stdio.h>
int main(){
int na;
int a[10];
int angka[3][3];
int tanda[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &angka[i][j]);
}
}
scanf("%d", &na);
for(int c=0;c<na;c++){
scanf("%d", &a[c]);
for(int l = 0 ; l < 3 ; l++ ) {
for(int k = 0 ; k < 3 ; ... | {"0": 194540918, "1": 194357878, "2": 194346724, "3": 194542348, "4": 194346724, "5": 194357878, "6": 194540918, "7": 194387622, "8": 194346724, "9": 194540918, "10": 194389624, "11": 194346724, "12": 194540918, "13": 194389624, "14": 194346724, "15": 194540918, "16": 194388480, "17": 194346724, "18": 194609272, "19": ... | ok | 5.273294 | 5.273359 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.338287 | false | false | false | 5.31598 | 0.105915 | 0.019924 | 0.019823 | Accepted | Accepted | 0.019823 | 0.998829 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.283382 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s032307562 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int arr[3][3];
for (int i=0;i<3;i++){
for (int j=0;j<3;j++){
cin>>arr[i][j];
}
}
int t,stop=0,win=0;
cin>>t;
for (int k=0;k<t;k++){
int b;
cin>>b;
for (i... | {"0": 1023923186, "1": 1024686806, "2": 1023009416, "3": 1024540374, "4": 1025516778, "5": 1024686806, "6": 1023923186, "7": 1025533366, "8": 1024692240, "9": 1023923186, "10": 1025516778, "11": 1024692240, "12": 1023923186, "13": 1025454716, "14": 1024692240, "15": 1026751154, "16": 1025533366, "17": 1024692240, "18":... | [] | ok | 106,571,432,968 | s459566321 | #include<stdio.h>
int main(){
int na;
int a[10];
int angka[3][3];
int tanda[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &angka[i][j]);
}
}
scanf("%d", &na);
for(int c=0;c<na;c++){
scanf("%d", &a[c]);
for(int l = 0 ; l < 3 ; l++ ) {
for(int k = 0 ; k < 3 ; ... | {"0": 194540918, "1": 194357878, "2": 194346724, "3": 194542348, "4": 194346724, "5": 194357878, "6": 194540918, "7": 194387622, "8": 194346724, "9": 194540918, "10": 194389624, "11": 194346724, "12": 194540918, "13": 194389624, "14": 194346724, "15": 194540918, "16": 194388480, "17": 194346724, "18": 194609272, "19": ... | ok | 5.272026 | 5.272197 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.337111 | false | false | false | 5.315721 | 0.10591 | 0.019924 | 0.019823 | Accepted | Accepted | 0.019823 | 0.998829 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.282111 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s690249945 | train | cpp | #define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip> // std::setprecision
#include <map>
#include <unordered_map>
#include <string>
#include <set>
#include <unordered_set>
#include <sstream>
using namespace std;
int main()
{
... | {"0": 1034660484, "1": 1032060458, "2": 1033346314, "3": 1034653906, "4": 1033438978, "5": 1032060458, "6": 1034570108, "7": 1033420102, "8": 1032172570, "9": 1034570108, "10": 1033434974, "11": 1032172570, "12": 1034627880, "13": 1033363188, "14": 1031736992, "15": 1034901010, "16": 1033435546, "17": 1031736992, "18":... | [] | ok | 107,351,101,858 | s353395467 | #include<stdio.h>
int main(){
int N, G[10];
int a[3][3], ck[3][3];
for(int i = 0 ; i < 3 ; i++ ) {
scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
}
scanf("%d",&N);
for(int j = 0 ; j < N ; j++ ){
scanf("%d",&G[j]);
for(int x = 0 ; x < 3 ; x++ ) {
... | {"0": 194647882, "1": 194298676, "2": 194461982, "3": 194664756, "4": 194461982, "5": 194298676, "6": 194647882, "7": 194488866, "8": 194298676, "9": 194647882, "10": 194470562, "11": 194298676, "12": 194647882, "13": 194470562, "14": 194298676, "15": 194647882, "16": 194516608, "17": 194298676, "18": 194694214, "19": ... | ok | 5.308988 | 5.309263 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.376157 | false | false | false | 5.374313 | 0.106913 | 0.019893 | 0.019823 | Accepted | Accepted | 0.019823 | 0.999193 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.320612 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s087768920 | train | cpp | #include<iostream>
#include <string.h>
#include<string>
#include <map>
#include <utility>
using namespace std;
int main()
{
/*long long h, a, attacks = 0;
cin >> h >> a;
while (h > 0)
{
attacks++;
h -= a;
}
cout << attacks << endl;*/
/*long long n;
string s;
cin >> n;
getline(cin,... | {"0": 1031762732, "1": 1030426826, "2": 1031112368, "3": 1032331300, "4": 1031113226, "5": 1030426826, "6": 1032253222, "7": 1031112654, "8": 1030612726, "9": 1032253222, "10": 1031103216, "11": 1030612726, "12": 1032183438, "13": 1031090918, "14": 1030502044, "15": 1031753580, "16": 1031087772, "17": 1030502044, "18":... | [] | ok | 107,200,217,982 | s353395467 | #include<stdio.h>
int main(){
int N, G[10];
int a[3][3], ck[3][3];
for(int i = 0 ; i < 3 ; i++ ) {
scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
}
scanf("%d",&N);
for(int j = 0 ; j < N ; j++ ){
scanf("%d",&G[j]);
for(int x = 0 ; x < 3 ; x++ ) {
... | {"0": 194647882, "1": 194298676, "2": 194461982, "3": 194664756, "4": 194461982, "5": 194298676, "6": 194647882, "7": 194488866, "8": 194298676, "9": 194647882, "10": 194470562, "11": 194298676, "12": 194647882, "13": 194470562, "14": 194298676, "15": 194647882, "16": 194516608, "17": 194298676, "18": 194694214, "19": ... | ok | 5.301825 | 5.3018 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.368601 | false | false | false | 5.385447 | 0.107135 | 0.019893 | 0.019823 | Accepted | Accepted | 0.019823 | 0.999195 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.313434 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s454322342 | train | cpp | #include<iostream>
#include<fstream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
int main()
{
int a[50][50],b[50],c[50][50]={0},d[50]={0};
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
... | {"0": 1032256082, "1": 1030209466, "2": 1031004832, "3": 1032260086, "4": 1030947060, "5": 1030209466, "6": 1032125666, "7": 1030937622, "8": 1030211182, "9": 1032125666, "10": 1030941054, "11": 1030211182, "12": 1032260086, "13": 1030938480, "14": 1030211182, "15": 1032109650, "16": 1030990818, "17": 1030211182, "18":... | [] | ok | 107,182,485,124 | s353395467 | #include<stdio.h>
int main(){
int N, G[10];
int a[3][3], ck[3][3];
for(int i = 0 ; i < 3 ; i++ ) {
scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
}
scanf("%d",&N);
for(int j = 0 ; j < N ; j++ ){
scanf("%d",&G[j]);
for(int x = 0 ; x < 3 ; x++ ) {
... | {"0": 194647882, "1": 194298676, "2": 194461982, "3": 194664756, "4": 194461982, "5": 194298676, "6": 194647882, "7": 194488866, "8": 194298676, "9": 194647882, "10": 194470562, "11": 194298676, "12": 194647882, "13": 194470562, "14": 194298676, "15": 194647882, "16": 194516608, "17": 194298676, "18": 194694214, "19": ... | ok | 5.300883 | 5.300923 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.367713 | false | false | false | 5.348523 | 0.1064 | 0.019893 | 0.019823 | Accepted | Accepted | 0.019823 | 0.999188 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.31249 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s880148632 | train | cpp | #include<bits/stdc++.h>
using namespace std;
int a[5][5];
bool vis[5][5];
int main()
{
ios::sync_with_stdio(false),cin.tie(0);
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
cin>>a[i][j];
}
}
int n;cin>>n;
int num;
for(int i=1;i<=n;i++){
cin>>num;
for(int k=1;k<=3;k++){
for(int j... | {"0": 1037211604, "1": 1036387352, "2": 1036695946, "3": 1037211604, "4": 1036773166, "5": 1036387352, "6": 1037211604, "7": 1036831510, "8": 1036387352, "9": 1037211604, "10": 1036773166, "11": 1036387352, "12": 1037135242, "13": 1036773166, "14": 1036387352, "15": 1037211604, "16": 1036831796, "17": 1036387352, "18":... | [] | ok | 107,811,364,232 | s353395467 | #include<stdio.h>
int main(){
int N, G[10];
int a[3][3], ck[3][3];
for(int i = 0 ; i < 3 ; i++ ) {
scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
}
scanf("%d",&N);
for(int j = 0 ; j < N ; j++ ){
scanf("%d",&G[j]);
for(int x = 0 ; x < 3 ; x++ ) {
... | {"0": 194647882, "1": 194298676, "2": 194461982, "3": 194664756, "4": 194461982, "5": 194298676, "6": 194647882, "7": 194488866, "8": 194298676, "9": 194647882, "10": 194470562, "11": 194298676, "12": 194647882, "13": 194470562, "14": 194298676, "15": 194647882, "16": 194516608, "17": 194298676, "18": 194694214, "19": ... | ok | 5.332293 | 5.332026 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.399207 | false | false | false | 5.385719 | 0.10714 | 0.019893 | 0.019823 | Accepted | Accepted | 0.019823 | 0.999195 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.343968 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s729760771 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int n,a[15][15],b[15];
for(int i=1;i<=3;i++)
for(int j=1;j<=3;j++)
cin>>a[i][j];
cin>>n;
for(int i=1;i<=n;i++)
cin>>b[i];
for(int i=1;i<=3;i++)
{
for(int j=1;j<=3;j++)
{
for(int k=1;k<=n;k++)
{
if(a[i][j]==b[k])
... | {"0": 1026108226, "1": 1024446852, "2": 1025224486, "3": 1026267528, "4": 1025275966, "5": 1024446852, "6": 1026092782, "7": 1025238500, "8": 1024383646, "9": 1026092782, "10": 1025268530, "11": 1024383646, "12": 1026248652, "13": 1025222770, "14": 1024383646, "15": 1026101362, "16": 1025372348, "17": 1024383646, "18":... | [] | ok | 106,575,728,116 | s500401455 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int a[3][3];
int n, b,c[3][3]={0},count;
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
scanf("%d",&a[i][j] );
}
}
scanf("%d",&n );
for(int k=0; k<n; k++)
{
scanf("%d",&b);
for(int i=0; i<3; i++){
for... | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | ok | 5.282483 | 5.282294 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.337326 | false | false | false | 5.342308 | 0.105901 | 0.019823 | 0.019823 | Accepted | Accepted | 0.019823 | 1 | 10 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.282483 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s599592011 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int a[3][3];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
cin>>a[i][j];
}
}
int t,b;
cin>>t;
while(t--)
{
cin>>b;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(a[i][j]==b)
a[i][j]=0;
}
}
}
bo... | {"0": 1026548094, "1": 1024558678, "2": 1025450140, "3": 1026636182, "4": 1025450140, "5": 1024558678, "6": 1026531220, "7": 1025388078, "8": 1024558678, "9": 1026531220, "10": 1025388078, "11": 1024558678, "12": 1026548380, "13": 1025388078, "14": 1024558678, "15": 1026512630, "16": 1025450140, "17": 1024558678, "18":... | [] | ok | 106,594,784,582 | s500401455 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int a[3][3];
int n, b,c[3][3]={0},count;
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
scanf("%d",&a[i][j] );
}
}
scanf("%d",&n );
for(int k=0; k<n; k++)
{
scanf("%d",&b);
for(int i=0; i<3; i++){
for... | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | ok | 5.283355 | 5.283239 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.33828 | false | false | false | 5.352273 | 0.106098 | 0.019823 | 0.019823 | Accepted | Accepted | 0.019823 | 1 | 10 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.283355 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s754237410 | train | cpp | #include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<utility>
#define PI acos(-1.0)
using namespace std;
int a[3][3];
int main(... | {"0": 1030992534, "1": 1029360904, "2": 1030427684, "3": 1031034862, "4": 1030430258, "5": 1029360904, "6": 1030996538, "7": 1030430830, "8": 1029517632, "9": 1030996538, "10": 1030427684, "11": 1029517632, "12": 1031084626, "13": 1030431116, "14": 1029517632, "15": 1031084626, "16": 1030427684, "17": 1029517632, "18":... | [] | ok | 107,081,096,408 | s776406696 | #include<stdio.h>
int main(){
int arr[3][3], flag[3][3] = {0};
for(int i = 0; i < 3; i++){
for(int j = 0; j < 3; j++){
scanf("%d", &arr[i][j]);
}
}
int n;
scanf("%d", &n);
int brr[n];
for(int i = 0; i < n; i++){
scanf("%d", &brr[i]);
for(int j = 0; j < 3; j++){
for(int k = 0; k < 3;... | {"0": 195214448, "1": 194048712, "2": 194419082, "3": 195214448, "4": 194396202, "5": 194048712, "6": 195214448, "7": 194410216, "8": 194066730, "9": 195214448, "10": 194453688, "11": 194066730, "12": 195214448, "13": 194431952, "14": 194066730, "15": 195214448, "16": 194420798, "17": 194066730, "18": 195318838, "19": ... | ok | 5.30024 | 5.299954 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 0 | 5.362635 | false | false | false | 5.341629 | 0.10629 | 0.019898 | 0.019823 | Accepted | Accepted | 0.019823 | 0.999128 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.307521 | null | null | null | null | null | null | null | null | null | null | null |
p02760 | s979893528 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int a[15],b,i,p[15]={0};
for(i=1;i<=9;i++)
cin>>a[i];
int n;
cin>>n;
for(int j=0;j<n;j++)
{
cin>>b;
for(i=1;i<=9;i++)
if(b==a[i])
p[i]=1;
}
if(p[5]==1)
{
if(p[2]==1&&p[8]==1) cout<<"Yes"<<endl;
else if(p[1]==1&&p[9]==1) co... | {"0": 1026198602, "1": 1024383074, "2": 1025279398, "3": 1026367914, "4": 1025278826, "5": 1024383074, "6": 1026198602, "7": 1025217908, "8": 1024279542, "9": 1026198602, "10": 1025278826, "11": 1024279542, "12": 1026207754, "13": 1025217336, "14": 1024279542, "15": 1026208040, "16": 1025241932, "17": 1024279542, "18":... | [] | ok | 106,526,620,772 | s776406696 | #include<stdio.h>
int main(){
int arr[3][3], flag[3][3] = {0};
for(int i = 0; i < 3; i++){
for(int j = 0; j < 3; j++){
scanf("%d", &arr[i][j]);
}
}
int n;
scanf("%d", &n);
int brr[n];
for(int i = 0; i < n; i++){
scanf("%d", &brr[i]);
for(int j = 0; j < 3; j++){
for(int k = 0; k < 3;... | {"0": 195214448, "1": 194048712, "2": 194419082, "3": 195214448, "4": 194396202, "5": 194048712, "6": 195214448, "7": 194410216, "8": 194066730, "9": 195214448, "10": 194453688, "11": 194066730, "12": 195214448, "13": 194431952, "14": 194066730, "15": 195214448, "16": 194420798, "17": 194066730, "18": 195318838, "19": ... | ok | 5.274617 | 5.27251 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 104 | 99 | 99 | 104 | 5 | 5.334867 | false | false | false | 5.318721 | 0.105835 | 0.019898 | 0.019823 | Accepted | Accepted | 0.019823 | 0.999123 | 9 | s500401455 | {"0": 194378184, "1": 193897132, "2": 194061010, "3": 194373608, "4": 194053860, "5": 193897132, "6": 194357592, "7": 194087322, "8": 193915150, "9": 194357592, "10": 194081888, "11": 193915150, "12": 194359308, "13": 194071020, "14": 193915150, "15": 194323844, "16": 194131366, "17": 193915150, "18": 194449112, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 8... | 19,204,077,464 | 5.281862 | null | null | null | null | null | null | null | null | null | null | null |
p03326 | s578285828 | train | cpp | #include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define MAX_SIZE 1010
int n, m;
LL r, a;
LL x[MAX_SIZE], y[MAX_SIZE], z[MAX_SIZE], t[MAX_SIZE];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> x[i] >> y[i] >> z[i];
int P[8][3] = { { 1,1,1 },{ 1,1,-1... | {"0": 1031064606, "1": 1036956492, "2": 1031064606, "3": 1031090060, "4": 1036951630, "5": 1029649764, "6": 1031064606, "7": 1036951630, "8": 1029710968, "9": 1031064606, "10": 1037020270, "11": 1031470726, "12": 1037020270, "13": 1036953632, "14": 1037020270, "15": 1037020270, "16": 1037444694, "17": 1037444694, "18":... | [] | ok | 108,761,047,538 | s146695590 | #include <cstdio>
#include <algorithm>
using namespace std;
#define LL long long
#define MAX_SIZE 1010
int n, m;
LL r, a;
LL x[MAX_SIZE], y[MAX_SIZE], z[MAX_SIZE], t[MAX_SIZE];
int main()
{
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%lld %lld %lld", &x[i], &y[i], &z[i]);
int P[8][3... | {"0": 198606122, "1": 201776146, "2": 198740828, "3": 198740828, "4": 201855368, "5": 198605836, "6": 198835208, "7": 201786156, "8": 198606122, "9": 198740828, "10": 201689202, "11": 198894410, "12": 201776146, "13": 201823622, "14": 201818760, "15": 201770426, "16": 202233746, "17": 202155382, "18": 202203430, "19": ... | ok | 5.146274 | 5.146274 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 105 | 105 | 105 | 105 | 0 | 5.394893 | false | false | false | 5.188694 | 0.059618 | 0.01149 | 0.011007 | Accepted | Accepted | 0.011007 | 0.990062 | 6 | s683472248 | {"0": 193961768, "1": 195447824, "2": 193954904, "3": 194127934, "4": 195447824, "5": 193764428, "6": 194049856, "7": 195221312, "8": 193768432, "9": 194049856, "10": 195447824, "11": 194127934, "12": 195447824, "13": 195447824, "14": 195501592, "15": 195509600, "16": 195447824, "17": 195439816, "18": 195424944, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 20,485,007,114 | 5.3093 | null | null | null | null | null | null | null | null | null | null | null |
p03326 | s038434584 | train | cpp | #include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define MAX_SIZE 1010
int n, m;
LL r, a;
LL x[MAX_SIZE], y[MAX_SIZE], z[MAX_SIZE], t[MAX_SIZE];
int main()
{
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> x[i] >> y[i] >> z[i];
int... | {"0": 1041395784, "1": 1044173702, "2": 1041390064, "3": 1041450982, "4": 1044155970, "5": 1040505180, "6": 1041432106, "7": 1044173416, "8": 1040341588, "9": 1041325142, "10": 1044155970, "11": 1041564524, "12": 1044536350, "13": 1044536350, "14": 1044672200, "15": 1044536350, "16": 1044598126, "17": 1044536350, "18":... | [] | ok | 109,607,840,342 | s146695590 | #include <cstdio>
#include <algorithm>
using namespace std;
#define LL long long
#define MAX_SIZE 1010
int n, m;
LL r, a;
LL x[MAX_SIZE], y[MAX_SIZE], z[MAX_SIZE], t[MAX_SIZE];
int main()
{
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%lld %lld %lld", &x[i], &y[i], &z[i]);
int P[8][3... | {"0": 198606122, "1": 201776146, "2": 198740828, "3": 198740828, "4": 201855368, "5": 198605836, "6": 198835208, "7": 201786156, "8": 198606122, "9": 198740828, "10": 201689202, "11": 198894410, "12": 201776146, "13": 201823622, "14": 201818760, "15": 201770426, "16": 202233746, "17": 202155382, "18": 202203430, "19": ... | ok | 5.186342 | 5.186342 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 105 | 105 | 105 | 105 | 0 | 5.436897 | false | false | false | 5.228292 | 0.060073 | 0.01149 | 0.011007 | Accepted | Accepted | 0.011007 | 0.990154 | 6 | s683472248 | {"0": 193961768, "1": 195447824, "2": 193954904, "3": 194127934, "4": 195447824, "5": 193764428, "6": 194049856, "7": 195221312, "8": 193768432, "9": 194049856, "10": 195447824, "11": 194127934, "12": 195447824, "13": 195447824, "14": 195501592, "15": 195509600, "16": 195447824, "17": 195439816, "18": 195424944, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 20,485,007,114 | 5.350637 | null | null | null | null | null | null | null | null | null | null | null |
p03326 | s647654395 | train | cpp | # include "iostream"
# include "cstdio"
# include "algorithm"
using namespace std;
const int maxm=1000+10;
int n, //n个蛋糕
m; //取出m个蛋糕
long long
dp[9][maxm],
ans,now;
int main(){
long long x,y,z;
register int i,j;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
scanf("%lld%lld%lld",&x,&... | {"0": 1014294138, "1": 1017482752, "2": 1014294138, "3": 1014294138, "4": 1017482752, "5": 1014147992, "6": 1014294138, "7": 1017482752, "8": 1014209768, "9": 1014294138, "10": 1017606018, "11": 1014419120, "12": 1017709836, "13": 1017709836, "14": 1017709836, "15": 1017606018, "16": 1017856268, "17": 1017856268, "18":... | [] | ok | 106,797,554,864 | s683472248 | # include "cstdio"
# include "algorithm"
const int maxm=1000+10;
int n, //n个蛋糕
m; //取出m个蛋糕
long long
dp[5][maxm],
ans,now1,now2;
inline long long read(){
long long s=0,w=1;
char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch=='-') w=-w;
ch=getchar();
}
while(ch>='0' && ch<='... | {"0": 193961768, "1": 195447824, "2": 193954904, "3": 194127934, "4": 195447824, "5": 193764428, "6": 194049856, "7": 195221312, "8": 193768432, "9": 194049856, "10": 195447824, "11": 194127934, "12": 195447824, "13": 195447824, "14": 195501592, "15": 195509600, "16": 195447824, "17": 195439816, "18": 195424944, "19": ... | ok | 5.21345 | 5.21345 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 105 | 105 | 105 | 105 | 0 | 5.297498 | false | false | false | 5.334926 | 0.058721 | 0.011007 | 0.011007 | Accepted | Accepted | 0.011007 | 1 | 10 | s683472248 | {"0": 193961768, "1": 195447824, "2": 193954904, "3": 194127934, "4": 195447824, "5": 193764428, "6": 194049856, "7": 195221312, "8": 193768432, "9": 194049856, "10": 195447824, "11": 194127934, "12": 195447824, "13": 195447824, "14": 195501592, "15": 195509600, "16": 195447824, "17": 195439816, "18": 195424944, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 20,485,007,114 | 5.21345 | null | null | null | null | null | null | null | null | null | null | null |
p03326 | s687787432 | train | cpp | # include "iostream"
# include "cstdio"
# include "cmath"
# include "algorithm"
using namespace std;
const int maxm=1000+10;
int n, //n个蛋糕
m; //取出m个蛋糕
long long
dp[5][maxm],
ans,now1,now2;
inline long long read(){
long long s=0,w=1;
char ch=getchar();
while(ch<'0' || ch>'9'){
if... | {"0": 1009221928, "1": 1010372506, "2": 1009221928, "3": 1009303438, "4": 1010364784, "5": 1009190468, "6": 1009308586, "7": 1010403108, "8": 1009241662, "9": 1009308586, "10": 1010367358, "11": 1009409258, "12": 1010393098, "13": 1010364784, "14": 1010554402, "15": 1010364784, "16": 1010422842, "17": 1010394242, "18":... | [] | ok | 106,064,171,642 | s683472248 | # include "cstdio"
# include "algorithm"
const int maxm=1000+10;
int n, //n个蛋糕
m; //取出m个蛋糕
long long
dp[5][maxm],
ans,now1,now2;
inline long long read(){
long long s=0,w=1;
char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch=='-') w=-w;
ch=getchar();
}
while(ch>='0' && ch<='... | {"0": 193961768, "1": 195447824, "2": 193954904, "3": 194127934, "4": 195447824, "5": 193764428, "6": 194049856, "7": 195221312, "8": 193768432, "9": 194049856, "10": 195447824, "11": 194127934, "12": 195447824, "13": 195447824, "14": 195501592, "15": 195509600, "16": 195447824, "17": 195439816, "18": 195424944, "19": ... | ok | 5.177649 | 5.177649 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 105 | 105 | 105 | 105 | 0 | 5.26112 | false | false | false | 5.285694 | 0.058179 | 0.011007 | 0.011007 | Accepted | Accepted | 0.011007 | 1 | 10 | s683472248 | {"0": 193961768, "1": 195447824, "2": 193954904, "3": 194127934, "4": 195447824, "5": 193764428, "6": 194049856, "7": 195221312, "8": 193768432, "9": 194049856, "10": 195447824, "11": 194127934, "12": 195447824, "13": 195447824, "14": 195501592, "15": 195509600, "16": 195447824, "17": 195439816, "18": 195424944, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 20,485,007,114 | 5.177649 | null | null | null | null | null | null | null | null | null | null | null |
p03326 | s999571995 | train | cpp | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,k,i;
long long int x,y,z,a[8][1000],sum=0,ans=0;
cin>>n>>k;
for(i=0;i<n;i++){
cin>>x>>y>>z;
a[0][i]=x+y+z;
a[1][i]=x+y-z;
a[2][i]=x-y+z;
a[3][i]=x-y-z;
a[4][i]=-x+y+z;
a[5][i]=-x+y-z;
a... | {"0": 1031010266, "1": 1037444408, "2": 1031130958, "3": 1031128384, "4": 1037383204, "5": 1029960932, "6": 1031015128, "7": 1037383204, "8": 1030004976, "9": 1031123522, "10": 1037092628, "11": 1031012268, "12": 1037383776, "13": 1037289396, "14": 1037383204, "15": 1037444408, "16": 1037444408, "17": 1037444408, "18":... | [] | ok | 108,787,822,286 | s383477757 | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,m;
long x,y,z,s[8][1000],sum,ans=0;
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++){
scanf("%ld %ld %ld",&x,&y,&z);
s[0][i]=x+y+z;
s[1][i]=x+y-z;
s[2][i]=x-y+z;
s[3][i]=x-y-z;
s[4][i]=-1*x+y+z;
s[5][... | {"0": 206804884, "1": 210676752, "2": 206840920, "3": 206845782, "4": 210198274, "5": 206757980, "6": 206834628, "7": 210257190, "8": 206628994, "9": 206841206, "10": 210264912, "11": 206836344, "12": 210644720, "13": 210663882, "14": 210670460, "15": 210671032, "16": 210800018, "17": 210800018, "18": 210964182, "19": ... | ok | 4.932902 | 4.932902 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 105 | 105 | 105 | 105 | 0 | 5.396221 | false | false | false | 5.153242 | 0.059838 | 0.011612 | 0.011007 | Accepted | Accepted | 0.011007 | 0.987614 | 6 | s683472248 | {"0": 193961768, "1": 195447824, "2": 193954904, "3": 194127934, "4": 195447824, "5": 193764428, "6": 194049856, "7": 195221312, "8": 193768432, "9": 194049856, "10": 195447824, "11": 194127934, "12": 195447824, "13": 195447824, "14": 195501592, "15": 195509600, "16": 195447824, "17": 195439816, "18": 195424944, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 20,485,007,114 | 5.310607 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s890038124 | train | cpp | #include <iostream>
#include <vector>
int main(void) {
int N;
std::vector<int> nest,primes;
std::vector<int> mod;
std::cin >> N;
nest.resize(55556);
int idx = 2;
while(idx < 55556) {
if(nest[idx] == 0) {
int i = 1;
while(true) {
... | {"0": 1989403416, "1": 1989927082, "2": 1989447746, "3": 1990773642, "4": 1991224950, "5": 1989782080, "6": 1994849714, "7": 1990358084, "8": 1987368240, "9": 1987570156, "10": 1987702860, "11": 1987766924, "12": 1988227384, "13": 1990071798, "14": 1990124422, "15": 1992597750, "16": 1991061644, "17": 1989488930, "18":... | [] | ok | 207,120,442,100 | s786870249 | #include <iostream>
int f(int n){for(int i=3;i<n;i+=2)if(n%i == 0)return 0;return 1;}int main(){int N;std::cin>>N;int c=0,i=0;while(c<N){int n=11+i*10;if(f(n)){std::cout<<n<<" ";c++;}i++;}}
| {"0": 1024582130, "1": 1028157988, "2": 1025822798, "3": 1034818070, "4": 1046282094, "5": 1026826658, "6": 1109513834, "7": 1030710538, "8": 1020677658, "9": 1021152704, "10": 1021366060, "11": 1021500766, "12": 1022735142, "13": 1029089204, "14": 1029724124, "15": 1063511306, "16": 1040850954, "17": 1025341174, "18":... | ok | 1.882836 | 1.885142 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 10.372618 | false | false | false | 1.888845 | 0.206297 | 0.109219 | 0.020372 | Accepted | Accepted | 0.020372 | 0.522137 | 3 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.554957 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s793941975 | train | cpp | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> prime;
for(int i=0;i<55555;i++){
prime.push_back(1);
}
for(int i=2;i<sqrt(55555);i++){
if(prime[i]){
... | {"0": 2118316772, "1": 2119014612, "2": 2118906218, "3": 2120502670, "4": 2122021330, "5": 2119098124, "6": 2127438456, "7": 2119944970, "8": 2115267726, "9": 2115885200, "10": 2116502388, "11": 2116721464, "12": 2117334076, "13": 2119364962, "14": 2119719030, "15": 2123707300, "16": 2121473640, "17": 2118556440, "18":... | [] | ok | 220,703,626,572 | s981579752 | #include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int p = 10;
for(int i=0;i<N;i++){
while(1){
bool isPrime = true;
p++;
for(int j=2;j*j<=p;j++) if(p % j == 0) isPrime = false;
if(isPrime && p%5 == 1) {
... | {"0": 1035201024, "1": 1044222036, "2": 1040286104, "3": 1065104898, "4": 1098961292, "5": 1041119222, "6": 1231760244, "7": 1051577956, "8": 1022428836, "9": 1023213334, "10": 1023704968, "11": 1024872992, "12": 1030219476, "13": 1045358314, "14": 1048686496, "15": 1136070078, "16": 1083249310, "17": 1037374052, "18":... | ok | 1.897772 | 1.903547 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 11.052866 | false | false | false | 1.910293 | 0.220019 | 0.115175 | 0.020372 | Accepted | Accepted | 0.020372 | 0.525144 | 3 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.722569 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s341077677 | train | cpp | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<set>
using namespace std;
int INF = 1e9 + 7;
typedef long long ll;
typedef pair<int, int> P;
vector<int> arr(55560);
void Eratosthenes() {
int n = 55556;
for (int i = 1; i <= n; i+... | {"0": 1893632884, "1": 1893953776, "2": 1893878558, "3": 1894922458, "4": 1895322000, "5": 1893945196, "6": 1898425958, "7": 1894347598, "8": 1892990528, "9": 1893394074, "10": 1893579402, "11": 1893632884, "12": 1893945196, "13": 1894288110, "14": 1894294116, "15": 1896448840, "16": 1895319712, "17": 1893825934, "18":... | [] | ok | 197,158,325,364 | s579039691 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD=1e9+7;
ll INF=1e18;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
bool is_prime[60000];
int prime[60000];
void eratos(int n){
for(int i=0; i<=n; i++) is_prime[i]... | {"0": 1368253172, "1": 1369014504, "2": 1368776552, "3": 1369782128, "4": 1370994768, "5": 1368796572, "6": 1373560760, "7": 1369407182, "8": 1367698904, "9": 1367893098, "10": 1368038100, "11": 1368088722, "12": 1368253172, "13": 1369103736, "14": 1369261036, "15": 1371983756, "16": 1370306366, "17": 1368339830, "18":... | ok | 1.382889 | 1.382938 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 9.873714 | false | false | false | 1.382812 | 0.196206 | 0.141889 | 0.020372 | Accepted | Accepted | 0.020372 | 0.30891 | 2 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.43199 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s430251382 | train | cpp | #include <iostream>
#include <vector>
#define N 55555
using namespace std;
int n, pr[N+5];
vector<int> vt;
int main() {
int i, j, k, x, sum;
cin>>n;
for(i=2; i<=N; i++) pr[i] = 1;
for(i=2; i<=N; i++) {
if(pr[i]) for(j=i*2; j<=N; j+=i) pr[j] = 0;
}
for(i=11; i<=N; i+=5) {
if(pr[i]) {
cout<<... | {"0": 1784811886, "1": 1785343560, "2": 1785085588, "3": 1786219578, "4": 1786990920, "5": 1785207996, "6": 1790342840, "7": 1785830046, "8": 1783446808, "9": 1783885532, "10": 1784182400, "11": 1784223584, "12": 1784715218, "13": 1785428216, "14": 1785729088, "15": 1788366008, "16": 1786737238, "17": 1785008940, "18":... | [] | ok | 185,878,365,244 | s330222502 | #include <iostream>
using namespace std;
int n;
int main() {
int i, j;
cin>>n;
for(i=11; n; i+=10) {
for(j=2; j*j<=i; j++) if(i%j==0) break;
if(j*j>i) {
cout<<i<<' ';
n--;
}
}
return 0;
} | {"0": 1022831810, "1": 1023948640, "2": 1023304854, "3": 1025665498, "4": 1028763164, "5": 1023714978, "6": 1038006112, "7": 1024577840, "8": 1020977386, "9": 1021199322, "10": 1021449572, "11": 1021561112, "12": 1022165144, "13": 1023951786, "14": 1024375066, "15": 1031084054, "16": 1027200174, "17": 1023162998, "18":... | ok | 1.736106 | 1.736497 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 9.308812 | false | false | false | 1.741078 | 0.18518 | 0.106359 | 0.020372 | Accepted | Accepted | 0.020372 | 0.478257 | 3 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.292905 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s459916765 | train | cpp | # include <iostream>
using namespace std;
const int N=55556,M=56;
int a[N],b[N],c[M];
int n,l;
void work (void)
{
int i,j;
i=1;
j=1;
while (i<=n)
{
if (b[j]%5==1)
{
c[i]=b[j];
i++;
}
j++;
}
for (i=1;i<=n;i++)
cout<<c[i]<<" ";
}
int main (void)
{
int i,j,t;
l=1;
cin>>n;... | {"0": 1794766688, "1": 1795408186, "2": 1795269476, "3": 1796384590, "4": 1797356704, "5": 1795375296, "6": 1800874790, "7": 1796027376, "8": 1791419344, "9": 1791818600, "10": 1792014796, "11": 1792101454, "12": 1792414338, "13": 1795638988, "14": 1795789424, "15": 1798536740, "16": 1796948582, "17": 1795083290, "18":... | [] | ok | 186,910,287,850 | s145453500 | # include <iostream>
using namespace std;
const int N=56;
int a[N]={0,11,31,41,61,71,101,131,151,181,191,211,241,251,271,281,311,331,401,421,431,461,491,521,541,571,601,631,641,661,691,701,751,761,811,821,881,911,941,971,991,1021,1031,1051,1061,1091,1151,1171,1181,1201,1231,1291,1301,1321,1361,1381};
int n;
void w... | {"0": 1022318440, "1": 1022798348, "2": 1022603010, "3": 1023298562, "4": 1024480028, "5": 1022703110, "6": 1027480168, "7": 1023192456, "8": 1021024004, "9": 1021303426, "10": 1021434700, "11": 1021498192, "12": 1021617168, "13": 1023004268, "14": 1023000836, "15": 1025529934, "16": 1023972378, "17": 1022406528, "18":... | ok | 1.754189 | 1.754199 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 9.360491 | false | false | false | 1.757328 | 0.185995 | 0.105839 | 0.020372 | Accepted | Accepted | 0.020372 | 0.483962 | 3 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.305741 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s033868717 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> calc(int n)
{
const int sz = 55556;
vector<int> sieve(sz, 1);
sieve[0] = sieve[1] = 0;
for (int i = 2; i < (int)sieve.size(); ++i) {
for (int m = 2; i * m < sz; ++m) {
sieve[i * m] = 0;
}
}
int... | {"0": 3200712658, "1": 3201528330, "2": 3201055572, "3": 3203337280, "4": 3204533332, "5": 3201179410, "6": 3210096032, "7": 3202457258, "8": 3197665900, "9": 3197783732, "10": 3197914434, "11": 3198389766, "12": 3199277224, "13": 3201640728, "14": 3201884114, "15": 3206636290, "16": 3204015386, "17": 3200988934, "18":... | [] | ok | 333,280,762,958 | s019510322 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000000;
void sieve(vector<int>& primes)
{
int n = primes.size();
primes[0] = primes[1] = 0;
for (int i = 2; i * i < n; ++i) {
if (not primes[i]) { continue; }
for (int j = i * i; j < n; j += i) {
... | {"0": 1532581336, "1": 1533523420, "2": 1533042940, "3": 1535715896, "4": 1537180216, "5": 1533160772, "6": 1542863894, "7": 1534885924, "8": 1528983170, "9": 1529821722, "10": 1530023638, "11": 1530023638, "12": 1531707892, "13": 1533494248, "14": 1533807418, "15": 1539500534, "16": 1536747498, "17": 1532740066, "18":... | ok | 2.084645 | 2.084835 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 16.690743 | false | false | false | 2.09187 | 0.333276 | 0.159319 | 0.020372 | Accepted | Accepted | 0.020372 | 0.555942 | 3 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 4.11121 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s362077319 | train | cpp | #include <iostream>
#include <string>
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
... | {"0": 1576859284, "1": 1577412694, "2": 1577101526, "3": 1578174026, "4": 1579051188, "5": 1577243954, "6": 1582709128, "7": 1577474756, "8": 1575203916, "9": 1575689258, "10": 1575678676, "11": 1575944942, "12": 1576404544, "13": 1577474756, "14": 1577474756, "15": 1580179172, "16": 1578724290, "17": 1576927066, "18":... | [] | ok | 164,241,936,716 | s804500848 | #include <cmath>
#include <iostream>
#include <string>
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
// five-five-everywhere.cpp ---
// author: Seong Yong-ju <sei40kr@gmail.com>
using namespace std;
int n;
bool isprime[55556] = {false, false};
int main() {
ios::syn... | {"0": 1257251424, "1": 1257879480, "2": 1257639526, "3": 1259071242, "4": 1260262432, "5": 1257800258, "6": 1264488654, "7": 1258180066, "8": 1255099846, "9": 1255906652, "10": 1255921238, "11": 1256061664, "12": 1256735480, "13": 1258111426, "14": 1258173202, "15": 1262029626, "16": 1259821992, "17": 1257370972, "18":... | ok | 1.25293 | 1.25298 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 8.225257 | false | false | false | 1.252289 | 0.16369 | 0.130713 | 0.020372 | Accepted | Accepted | 0.020372 | 0.230099 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.026045 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s017500884 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N;
vector<int> v;
for (int i = 11; i <= 55555; i += 5) {
int no = 0;
for (i... | {"0": 3822116584, "1": 3822585624, "2": 3822371696, "3": 3823603212, "4": 3824236988, "5": 3822346242, "6": 3826095702, "7": 3822789256, "8": 3821964146, "9": 3822079976, "10": 3822295906, "11": 3822502398, "12": 3822768950, "13": 3822750646, "14": 3822734058, "15": 3825021486, "16": 3823807988, "17": 3822096850, "18":... | [] | ok | 397,718,570,964 | s814146886 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N;
vector<int> p;
for (int i = 11; p.size() < N; i += 5) {
int flag = 1;
fo... | {"0": 1049961484, "1": 1052273222, "2": 1050933312, "3": 1057123782, "4": 1064490856, "5": 1051739546, "6": 1093264172, "7": 1054067872, "8": 1045405790, "9": 1045872828, "10": 1046527196, "11": 1046826352, "12": 1048082750, "13": 1052753988, "14": 1053548496, "15": 1072510010, "16": 1061474128, "17": 1050329852, "18":... | ok | 3.579081 | 3.581709 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 19.917797 | false | false | false | 3.598707 | 0.396784 | 0.110257 | 0.020372 | Accepted | Accepted | 0.020372 | 0.761205 | 4 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 4.905829 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s736360841 | train | cpp | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using... | {"0": 2029495468, "1": 2030047734, "2": 2029867268, "3": 2031439982, "4": 2033731414, "5": 2029989962, "6": 2038902580, "7": 2030996396, "8": 2046134376, "9": 2046597982, "10": 2046740696, "11": 2047006962, "12": 2048165262, "13": 2030501616, "14": 2030770170, "15": 2035424248, "16": 2033037864, "17": 2029724554, "18":... | [] | ok | 211,804,835,528 | s125495548 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using... | {"0": 1023329164, "1": 1023968946, "2": 1023890296, "3": 1024858692, "4": 1025503908, "5": 1023970948, "6": 1029104076, "7": 1024449712, "8": 1022433698, "9": 1022438560, "10": 1023022858, "11": 1023137830, "12": 1023218482, "13": 1023956648, "14": 1024393942, "15": 1026769458, "16": 1025414390, "17": 1023703824, "18":... | ok | 1.984516 | 1.985148 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 10.607213 | false | false | false | 2.005844 | 0.212477 | 0.105929 | 0.020372 | Accepted | Accepted | 0.020372 | 0.554634 | 3 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.611998 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s515873026 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i... | {"0": 1457764308, "1": 1458438982, "2": 1458107794, "3": 1459180294, "4": 1460861688, "5": 1458256228, "6": 1466042006, "7": 1458857686, "8": 1455411386, "9": 1455880998, "10": 1456534508, "11": 1456534508, "12": 1457574976, "13": 1458631174, "14": 1458647190, "15": 1462440694, "16": 1460200742, "17": 1457861262, "18":... | [] | ok | 151,958,906,528 | s815389324 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i... | {"0": 1249244282, "1": 1250194088, "2": 1249529424, "3": 1251399864, "4": 1252895644, "5": 1250007616, "6": 1257775948, "7": 1250789254, "8": 1247178504, "9": 1247763374, "10": 1247838878, "11": 1247984452, "12": 1248695162, "13": 1250317354, "14": 1250589912, "15": 1254957418, "16": 1252391998, "17": 1249527708, "18":... | ok | 1.166026 | 1.166074 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 7.610122 | false | false | false | 1.164137 | 0.151269 | 0.12994 | 0.020372 | Accepted | Accepted | 0.020372 | 0.162938 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.874573 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s037249705 | train | cpp | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(... | {"0": 1034269808, "1": 1045172700, "2": 1040534352, "3": 1077151790, "4": 1136012878, "5": 1042035280, "6": 1444394666, "7": 1055442388, "8": 1022433126, "9": 1023148698, "10": 1023211904, "11": 1023880858, "12": 1028538940, "13": 1046681064, "14": 1052105912, "15": 1212361150, "16": 1106947556, "17": 1036937616, "18":... | [] | ok | 123,590,425,244 | s040516429 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v... | {"0": 1033309420, "1": 1034314996, "2": 1033520488, "3": 1036104212, "4": 1037785892, "5": 1033619730, "6": 1045372900, "7": 1035162986, "8": 1030440554, "9": 1031001114, "10": 1031124666, "11": 1031690660, "12": 1032443984, "13": 1034402798, "14": 1034772310, "15": 1040688506, "16": 1037215322, "17": 1033458426, "18":... | ok | 1.150425 | 1.144454 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 6.189424 | false | false | false | 1.14416 | 0.122964 | 0.107471 | 0.020372 | Accepted | Accepted | 0.020372 | 0.151016 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.532778 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s225531041 | train | cpp | #include <iostream>
#include <algorithm>
#include <functional>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <string>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <cstring>
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
using ll =... | {"0": 3988819406, "1": 3989626212, "2": 3989258130, "3": 3990383826, "4": 3990916358, "5": 3989242114, "6": 3993802956, "7": 3989878750, "8": 3987466626, "9": 3988074090, "10": 3988526256, "11": 3988526828, "12": 3989115988, "13": 3989620492, "14": 3989805820, "15": 3991756054, "16": 3990673830, "17": 3989130002, "18":... | [] | ok | 415,077,192,530 | s982514964 | #include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
std::vector<int> eratosthenes() {
bool is_prime[55556];
std::vector<int> ret;
std::fill(is_prime, is_prime + 55555, true);
is_prime[0] = is_prime[1... | {"0": 1536286752, "1": 1536483520, "2": 1536483520, "3": 1537592342, "4": 1538605926, "5": 1536492958, "6": 1542759504, "7": 1537115866, "8": 1531793406, "9": 1532938836, "10": 1533303200, "11": 1533292332, "12": 1534299910, "13": 1536585908, "14": 1536693444, "15": 1539591196, "16": 1538246710, "17": 1536325362, "18":... | ok | 2.593925 | 2.594179 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 20.787119 | false | false | false | 2.601068 | 0.413971 | 0.159154 | 0.020372 | Accepted | Accepted | 0.020372 | 0.647402 | 4 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 5.11999 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s782438405 | train | cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
typedef long long int ll;
#define FOR(i,n,m) for(ll i=(ll)(m);i<(ll)(n);++i)
#define REP(i,n) FOR(i,n,0)
#define IREP(i,n) for(ll i=(ll)(n);i>=0;--i)
#define OF64 std::setprecision(10)
co... | {"0": 3807283766, "1": 3808351118, "2": 3807971024, "3": 3809630968, "4": 3810451216, "5": 3808083708, "6": 3814303350, "7": 3809229996, "8": 3804736078, "9": 3806113168, "10": 3806489544, "11": 3806790702, "12": 3807844040, "13": 3808487254, "14": 3808547314, "15": 3811362698, "16": 3810063686, "17": 3807765676, "18":... | [] | ok | 396,294,056,158 | s611535310 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
typedef long long int ll;
#define FOR(i,n,m) for(ll i=(ll)(m);i<(ll)(n);++i)
#define REP(i,n) FOR(i,n,0)
#define IREP(i,n) for(ll i=(ll)(n);i>=0;--i)
#define OF64 std::setprecision(10)
co... | {"0": 1434192188, "1": 1434911478, "2": 1434637490, "3": 1436032598, "4": 1436715280, "5": 1434776772, "6": 1440869716, "7": 1435532098, "8": 1432435004, "9": 1433162874, "10": 1433402542, "11": 1433514082, "12": 1434007432, "13": 1435056766, "14": 1435056766, "15": 1438151572, "16": 1436687824, "17": 1434200768, "18":... | ok | 2.651442 | 2.651583 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 19.846457 | false | false | false | 2.660681 | 0.395553 | 0.148666 | 0.020372 | Accepted | Accepted | 0.020372 | 0.658047 | 4 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 4.888355 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s450492152 | train | cpp | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
int t[1000];
int p[56];
int r[1000];
int o;
int book[1000000];
int main()
{
int u=0;
for(int i=2; i<10000; i++)
{
if(book[i]==0)
for(int j=2; j<10000; j++)
... | {"0": 1125312760, "1": 1126062938, "2": 1125827274, "3": 1126509384, "4": 1127337068, "5": 1125846150, "6": 1130712726, "7": 1126316048, "8": 1123323344, "9": 1124294314, "10": 1124290024, "11": 1124665828, "12": 1124939244, "13": 1126315190, "14": 1126316048, "15": 1128257416, "16": 1126758204, "17": 1125588178, "18":... | [] | ok | 117,265,575,570 | s085640695 | #include <stdio.h>
#include <string.h>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
#define LL long long
using namespace std;
/*int main()
{
int x=11,j=0,i=0;
while(j<56)
{
for( i=2; i<x/2; i++)
if(x%i==0)br... | {"0": 1011572276, "1": 1012121682, "2": 1011640058, "3": 1013343188, "4": 1014641056, "5": 1012008712, "6": 1017804502, "7": 1012905894, "8": 1009861996, "9": 1010018438, "10": 1010144278, "11": 1010582716, "12": 1011055760, "13": 1012595298, "14": 1012846120, "15": 1015506778, "16": 1013931204, "17": 1011643204, "18":... | ok | 1.111563 | 1.111613 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 5.872675 | false | false | false | 1.113662 | 0.116801 | 0.10488 | 0.020372 | Accepted | Accepted | 0.020372 | 0.123623 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.44657 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s623274394 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef pair<int,pair<int,int>> iii;
typedef vector<pair<int,int>> vii;
typedef vector<vector<int>> vvi;
#define pb push_back
#define mp make_pair
#defin... | {"0": 1408122430, "1": 1408514822, "2": 1408197934, "3": 1409059080, "4": 1409903066, "5": 1408368676, "6": 1411781228, "7": 1408727606, "8": 1407240692, "9": 1407495804, "10": 1407693144, "11": 1407744052, "12": 1408101552, "13": 1408562012, "14": 1408632654, "15": 1410885190, "16": 1409726604, "17": 1408196218, "18":... | [] | ok | 146,635,653,450 | s085640695 | #include <stdio.h>
#include <string.h>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
#define LL long long
using namespace std;
/*int main()
{
int x=11,j=0,i=0;
while(j<56)
{
for( i=2; i<x/2; i++)
if(x%i==0)br... | {"0": 1011572276, "1": 1012121682, "2": 1011640058, "3": 1013343188, "4": 1014641056, "5": 1012008712, "6": 1017804502, "7": 1012905894, "8": 1009861996, "9": 1010018438, "10": 1010144278, "11": 1010582716, "12": 1011055760, "13": 1012595298, "14": 1012846120, "15": 1015506778, "16": 1013931204, "17": 1011643204, "18":... | ok | 1.389923 | 1.390025 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 7.343532 | false | false | false | 1.391517 | 0.145943 | 0.10488 | 0.020372 | Accepted | Accepted | 0.020372 | 0.327006 | 2 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.808823 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s188961600 | train | cpp | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue> //priority_queue
#include <map>
#include <set> //multiset set<int,greater<int>>大到小
#include <vector>// vector<int>().swap(v);清空释放内存
#include <stack>
#include <cmath> // auto &Name : STLName Name.
#include <utility>... | {"0": 1784129204, "1": 1784823612, "2": 1784247608, "3": 1786032820, "4": 1786994924, "5": 1784460964, "6": 1792515010, "7": 1785443946, "8": 1781046982, "9": 1781717080, "10": 1782111760, "11": 1782372020, "12": 1782828476, "13": 1784951168, "14": 1785038684, "15": 1788847346, "16": 1786703776, "17": 1784179826, "18":... | [] | ok | 185,895,575,008 | s247045246 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <queue>
#define LL long long
#define N 55555
#define maxn 10005
#define INF 0x3f3f3f3f
#define mase(a,b) memset(a,b,sizeof(a))
#define MIN(a,b) (a<b?a:b)
... | {"0": 1021876284, "1": 1023310288, "2": 1022736286, "3": 1025557962, "4": 1029029430, "5": 1022930766, "6": 1040162266, "7": 1023942062, "8": 1017786198, "9": 1018857268, "10": 1019066906, "11": 1019384366, "12": 1020754020, "13": 1023291698, "14": 1023684090, "15": 1032315856, "16": 1027116376, "17": 1022292700, "18":... | ok | 1.735827 | 1.736265 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 9.309674 | false | false | false | 1.750042 | 0.185468 | 0.105979 | 0.020372 | Accepted | Accepted | 0.020372 | 0.48147 | 3 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.293213 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s123978451 | train | cpp | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb ... | {"0": 1524212404, "1": 1525062682, "2": 1524707184, "3": 1525600362, "4": 1526832736, "5": 1524861052, "6": 1529472802, "7": 1525298918, "8": 1521689026, "9": 1522082848, "10": 1522343680, "11": 1522343680, "12": 1522966016, "13": 1525135040, "14": 1525251442, "15": 1527868628, "16": 1526451784, "17": 1524301922, "18":... | [] | ok | 158,757,797,198 | s792198972 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb ... | {"0": 1227903534, "1": 1235171366, "2": 1233045242, "3": 1243638682, "4": 1251460782, "5": 1233528582, "6": 1267028906, "7": 1239156490, "8": 1161297852, "9": 1189889558, "10": 1195146810, "11": 1204528754, "12": 1220116612, "13": 1235577772, "14": 1237219984, "15": 1257445332, "16": 1248203814, "17": 1229934992, "18":... | ok | 1.225233 | 1.226334 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 7.950611 | false | false | false | 1.226486 | 0.158156 | 0.128951 | 0.020372 | Accepted | Accepted | 0.020372 | 0.211966 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.958427 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s813846739 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 =... | {"0": 1456379210, "1": 1457101360, "2": 1456760162, "3": 1457998828, "4": 1458723552, "5": 1456871702, "6": 1462218186, "7": 1457433120, "8": 1454952642, "9": 1455119380, "10": 1455358190, "11": 1455357904, "12": 1456384930, "13": 1457157416, "14": 1457182298, "15": 1459965078, "16": 1458282826, "17": 1456520494, "18":... | [] | ok | 151,725,481,050 | s708916050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 =... | {"0": 1230158644, "1": 1231238008, "2": 1230895380, "3": 1232147774, "4": 1232825880, "5": 1231082424, "6": 1236442350, "7": 1231643842, "8": 1229266610, "9": 1229564908, "10": 1229553182, "11": 1229998770, "12": 1230731216, "13": 1231361846, "14": 1231401028, "15": 1234091430, "16": 1232420618, "17": 1230589932, "18":... | ok | 1.183112 | 1.18312 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 7.598432 | false | false | false | 1.182881 | 0.151531 | 0.128103 | 0.020372 | Accepted | Accepted | 0.020372 | 0.17862 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.871643 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s527807678 | train | cpp | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
bool p[100001] = {};
vector<ll> g;
int main() {
ll n; cin >> n;
ll size = 100001;
rep(i, 0, size) p... | {"0": 1799625542, "1": 1800138912, "2": 1799804006, "3": 1800870786, "4": 1801981038, "5": 1800023940, "6": 1804937134, "7": 1800290778, "8": 1797698188, "9": 1797935854, "10": 1798348266, "11": 1798406324, "12": 1799275478, "13": 1800290778, "14": 1800388304, "15": 1802620534, "16": 1801362420, "17": 1799720780, "18":... | [] | ok | 187,388,260,202 | s255720427 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
bool p[100001];
int main()
{
ll n; cin >> n;
ll maxV = 100000;
rep(i, 0, maxV)p[i] = ... | {"0": 1507798006, "1": 1508273624, "2": 1508205270, "3": 1509920412, "4": 1511804866, "5": 1508231010, "6": 1516504704, "7": 1509246882, "8": 1504744670, "9": 1506051690, "10": 1506031956, "11": 1506021660, "12": 1506651432, "13": 1508712920, "14": 1509048112, "15": 1513356702, "16": 1511185390, "17": 1508012220, "18":... | ok | 1.191926 | 1.192004 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 9.384428 | false | false | false | 1.192892 | 0.187041 | 0.156797 | 0.020372 | Accepted | Accepted | 0.020372 | 0.181466 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.311536 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s292091323 | train | cpp | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
bool p[100000] = {};
vector<ll> ans;
int main() {
ll n = 100000;
rep(i, 0, n)p[i] = tru... | {"0": 1802975746, "1": 1803148204, "2": 1802979178, "3": 1803977604, "4": 1804863632, "5": 1803038952, "6": 1808462656, "7": 1803566336, "8": 1800596226, "9": 1801364136, "10": 1801935850, "11": 1801938424, "12": 1801966166, "13": 1803311510, "14": 1803425052, "15": 1805821446, "16": 1804206976, "17": 1802938280, "18":... | [] | ok | 187,726,999,746 | s255720427 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
bool p[100001];
int main()
{
ll n; cin >> n;
ll maxV = 100000;
rep(i, 0, maxV)p[i] = ... | {"0": 1507798006, "1": 1508273624, "2": 1508205270, "3": 1509920412, "4": 1511804866, "5": 1508231010, "6": 1516504704, "7": 1509246882, "8": 1504744670, "9": 1506051690, "10": 1506031956, "11": 1506021660, "12": 1506651432, "13": 1508712920, "14": 1509048112, "15": 1513356702, "16": 1511185390, "17": 1508012220, "18":... | ok | 1.194081 | 1.194159 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 9.401392 | false | false | false | 1.194866 | 0.187351 | 0.156797 | 0.020372 | Accepted | Accepted | 0.020372 | 0.182983 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.315717 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s035250702 | train | cpp | #include <bits/stdc++.h>
using namespace std;
vector<bool> bs(2);
void f(int n)
{if (n <= 1) return;
bs.resize(n + 1, true);
for (int i = 2; i * i <= n; ++i)
if (bs[i]) for (int j = i + i; j <= n; j += i) bs[j] = false;}
int main()
{int N; cin >> N;
f(55555);
int c = 0;
for (int j = 2; j <... | {"0": 1192862814, "1": 1193562656, "2": 1193454262, "3": 1195007814, "4": 1196970060, "5": 1193562656, "6": 1202149234, "7": 1194264214, "8": 1190075744, "9": 1190634302, "10": 1190717242, "11": 1190730970, "12": 1192256780, "13": 1193709946, "14": 1193994802, "15": 1198541344, "16": 1195985076, "17": 1192996948, "18":... | [] | ok | 124,478,081,728 | s353572918 | #include <bits/stdc++.h>
using namespace std;
bool f(int64_t n)
{if (n <= 1) return false;
for (auto i = 2LL; i * i <= n; ++i) if (!(n % i)) return false;
return true;}
int main()
{int N; cin >> N;
for (int i = 2; i <= 55555 and N; ++i)
if (f(i) and i % 5 == 1) {--N; cout << i << (N ? " " : "\n")... | {"0": 1028824654, "1": 1031481594, "2": 1030220048, "3": 1037912876, "4": 1047054294, "5": 1030711396, "6": 1080058408, "7": 1033935188, "8": 1022429408, "9": 1023213906, "10": 1023306856, "11": 1023952930, "12": 1026235782, "13": 1031733560, "14": 1033065176, "15": 1056639012, "16": 1042689648, "17": 1029417818, "18":... | ok | 1.138979 | 1.139857 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 6.233878 | false | false | false | 1.146541 | 0.124401 | 0.108501 | 0.020372 | Accepted | Accepted | 0.020372 | 0.152841 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.535671 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s159966330 | train | cpp | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
// output
#define SPBR(w, n) std::cout<<(w + 1 == ... | {"0": 1612251212, "1": 1612882128, "2": 1612691652, "3": 1613658332, "4": 1614343302, "5": 1612758290, "6": 1617311982, "7": 1613227330, "8": 1609573680, "9": 1610308414, "10": 1610493742, "11": 1610588122, "12": 1610981658, "13": 1612886418, "14": 1613095198, "15": 1615436966, "16": 1613924884, "17": 1612490880, "18":... | [] | ok | 167,890,007,428 | s898867781 | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
// output
... | {"0": 1398530562, "1": 1399704020, "2": 1398730190, "3": 1400830860, "4": 1402839152, "5": 1399155472, "6": 1407090542, "7": 1400050652, "8": 1397205524, "9": 1397367686, "10": 1397446050, "11": 1397947980, "12": 1398145606, "13": 1399761220, "14": 1399969142, "15": 1404566020, "16": 1402258286, "17": 1398530562, "18":... | ok | 1.150934 | 1.150981 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 8.407953 | false | false | false | 1.158451 | 0.168069 | 0.145081 | 0.020372 | Accepted | Accepted | 0.020372 | 0.155644 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.071063 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s634528812 | train | cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int mx = 55556;
vector<bool> a(mx);
fill(a.begin(), a.end(), true);
a[0] = a[1] = false;
for(int i = 2; i < mx; i++) {
if(a[i]) {
for(int j = i * 2; j < mx; j += i) {
a[j] = false;
}
}... | {"0": 1629848506, "1": 1630445388, "2": 1629842214, "3": 1631176404, "4": 1631844214, "5": 1629840784, "6": 1634693918, "7": 1630538624, "8": 1628629574, "9": 1628907280, "10": 1628915002, "11": 1629121494, "12": 1629218734, "13": 1630547776, "14": 1630547776, "15": 1632710508, "16": 1631478134, "17": 1629849936, "18":... | [] | ok | 169,718,109,704 | s556336144 | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int cnt = 0;
for(int i = 2; i < 55556; i++) {
for(int j = 2; j * j <= i; j++) {
if(i % j == 0) {
goto NEXT;
}
}
if(i % 5 == 1) {
cout << i << " ";
cnt++;
}... | {"0": 1041736124, "1": 1045298254, "2": 1044039854, "3": 1050993372, "4": 1060124494, "5": 1044482010, "6": 1092114452, "7": 1047129798, "8": 1036695946, "9": 1037428678, "10": 1037706670, "11": 1038087908, "12": 1040143962, "13": 1045492734, "14": 1046515470, "15": 1069231592, "16": 1055756130, "17": 1042765724, "18":... | ok | 1.534152 | 1.535416 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 8.499505 | false | false | false | 1.540873 | 0.169234 | 0.10983 | 0.020372 | Accepted | Accepted | 0.020372 | 0.399054 | 2 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.09356 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s283883692 | train | cpp | #include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& ... | {"0": 1069077724, "1": 1088942426, "2": 1081213562, "3": 1139790366, "4": 1235495976, "5": 1083176094, "6": 1689010466, "7": 1105048516, "8": 1045582824, "9": 1046882122, "10": 1047822490, "11": 1049595690, "12": 1057694638, "13": 1092531726, "14": 1099450924, "15": 1346199998, "16": 1186416374, "17": 1073365436, "18":... | [] | ok | 135,826,834,572 | s116628305 | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using vll = V<ll>;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
void Solve();
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<setprecis... | {"0": 1054280370, "1": 1059301386, "2": 1057172402, "3": 1067756118, "4": 1079267904, "5": 1057550780, "6": 1123034198, "7": 1062070724, "8": 1045299684, "9": 1046977932, "10": 1047234760, "11": 1048141380, "12": 1051579672, "13": 1059727812, "14": 1061333702, "15": 1092974740, "16": 1073975760, "17": 1055664324, "18":... | ok | 1.213307 | 1.205499 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 6.802225 | false | false | false | 1.202756 | 0.134795 | 0.112071 | 0.020372 | Accepted | Accepted | 0.020372 | 0.19859 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.688317 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s103822245 | train | cpp | #include<bits/stdc++.h>
#define MAXN 95555
using namespace std;
vector<int> Prime;
int flag[MAXN];
void siv() {
Prime.push_back(2);
for(int i = 4 ; i <= MAXN ; i += 2) flag[i] = 1;
for(int i = 3 ; i * i <= MAXN ; i += 2) {
if(!flag[i]) {
for(int j = i * i , k = (i * 2) ; j <= MAXN ; j += k) ... | {"0": 2002513942, "1": 2003213784, "2": 2002874874, "3": 2004258256, "4": 2005076502, "5": 2002874874, "6": 2009315022, "7": 2003755754, "8": 2000306880, "9": 2000537682, "10": 2000730160, "11": 2000981840, "12": 2002036322, "13": 2003345916, "14": 2003454024, "15": 2006441008, "16": 2004465606, "17": 2002710138, "18":... | [] | ok | 208,547,060,722 | s227381034 | #include<stdio.h>
#include<algorithm>
#define maxn 200005
#define inf 0x3f3f3f3f
using namespace std;
typedef long int ll;
bool prime[60000];
int ans[60000], p;
int main()
{
for (int i = 2; i < 60000; ++i){
if (!prime[i]) for (int j = 2; j * i < 60000; ++j) prime[j * i] = 1;
}
int n;
... | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | ok | 2.572556 | 2.572809 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 10.444064 | false | false | false | 2.585575 | 0.208034 | 0.080459 | 0.020372 | Accepted | Accepted | 0.020372 | 0.67981 | 4 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 2.572556 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s167931620 | train | cpp | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n)... | {"0": 2556420724, "1": 2556874892, "2": 2556654386, "3": 2557173190, "4": 2558166468, "5": 2556790236, "6": 2560985856, "7": 2557018178, "8": 2554918366, "9": 2554959836, "10": 2555103694, "11": 2555234968, "12": 2555659392, "13": 2556774220, "14": 2556874892, "15": 2559194924, "16": 2557810684, "17": 2556538270, "18":... | [] | ok | 266,062,570,774 | s203975962 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n)... | {"0": 1791661300, "1": 1792009362, "2": 1791661300, "3": 1792286210, "4": 1793121044, "5": 1791941008, "6": 1796041390, "7": 1792154078, "8": 1788680894, "9": 1789344700, "10": 1789510294, "11": 1789704202, "12": 1790324250, "13": 1792009362, "14": 1792091444, "15": 1794062270, "16": 1792983764, "17": 1791551190, "18":... | ok | 1.426647 | 1.426677 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 13.324448 | false | false | false | 1.427403 | 0.26571 | 0.186149 | 0.020372 | Accepted | Accepted | 0.020372 | 0.324291 | 2 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 3.281962 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s014976079 | train | cpp | #include <bits/stdc++.h>
const int MOD = (int)1e9+7;using namespace std;using ll = long long;using ld = long double;using P = pair<ll,ll>;const string rt = "\n", sp = " ";/* GCD */template<typename M, typename N> constexpr common_type_t<M,N> gcd(M a, N b){return b != 0 ? gcd(b, a % b) : a;}/* LCM */template<typename M... | {"0": 1112462780, "1": 1142974118, "2": 1131512668, "3": 1207658738, "4": 1295001422, "5": 1134914066, "6": 1590869566, "7": 1166809358, "8": 1050192858, "9": 1055980640, "10": 1059821906, "11": 1066060710, "12": 1089596794, "13": 1147089658, "14": 1158690676, "15": 1383740072, "16": 1255187076, "17": 1119653678, "18":... | [] | ok | 136,822,415,158 | s415641408 | #include <bits/stdc++.h>
const int MOD = (int)1e9+7;using namespace std;using ll = long long;using ld = long double;using P = pair<ll,ll>;const string rt = "\n", sp = " ";/* GCD */template<typename M, typename N> constexpr common_type_t<M,N> gcd(M a, N b){return b != 0 ? gcd(b, a % b) : a;}/* LCM */template<typename M... | {"0": 1054326988, "1": 1057532476, "2": 1056063580, "3": 1063455250, "4": 1071694338, "5": 1056855514, "6": 1099777536, "7": 1060056712, "8": 1047874256, "9": 1048318700, "10": 1049245626, "11": 1049747842, "12": 1052750270, "13": 1057894838, "14": 1059363734, "15": 1080205984, "16": 1068326974, "17": 1054911286, "18":... | ok | 1.233203 | 1.225391 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 6.852084 | false | false | false | 1.225338 | 0.136395 | 0.111312 | 0.020372 | Accepted | Accepted | 0.020372 | 0.216188 | 1 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.699834 | null | null | null | null | null | null | null | null | null | null | null |
p03362 | s197688002 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chma... | {"0": 1496835626, "1": 1497112760, "2": 1496970046, "3": 1497840058, "4": 1498990636, "5": 1496936584, "6": 1501220578, "7": 1497451384, "8": 1494187552, "9": 1494509588, "10": 1494630566, "11": 1494756406, "12": 1495511732, "13": 1497255760, "14": 1497477982, "15": 1499644146, "16": 1498183544, "17": 1496931722, "18":... | [] | ok | 155,847,920,228 | s600567033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chma... | {"0": 1041199874, "1": 1042959060, "2": 1042284100, "3": 1046519188, "4": 1052030694, "5": 1042531204, "6": 1070359576, "7": 1044628728, "8": 1037616866, "9": 1038083332, "10": 1038091340, "11": 1038733124, "12": 1039769588, "13": 1043163550, "14": 1044354168, "15": 1057108338, "16": 1049393774, "17": 1041683214, "18":... | ok | 1.421891 | 1.422529 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 100 | 100 | 104 | 4 | 7.804884 | false | false | false | 1.424963 | 0.155034 | 0.108799 | 0.020372 | Accepted | Accepted | 0.020372 | 0.343344 | 2 | s227381034 | {"0": 776489714, "1": 777089742, "2": 776794018, "3": 778002654, "4": 779406056, "5": 776946170, "6": 783062566, "7": 777546198, "8": 775177260, "9": 775472126, "10": 775667750, "11": 775788156, "12": 776295806, "13": 777241894, "14": 777394046, "15": 780680472, "16": 778625848, "17": 776633286, "18": 780187408, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 77,953,665,504 | 1.922518 | null | null | null | null | null | null | null | null | null | null | null |
p00724 | s107025303 | train | cpp | //Tue Dec 22 22:01:34 JST 2009
#include<set>
#include<iostream>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
#define CONNECT true
#define UNCONNECT false
#define CANMOVE tru... | {"0": 3099572476, "1": 3273185058, "2": 2034295406, "3": 6651628412, "4": 1293799078, "5": 3186652612, "6": 1473362748, "7": 1184596842, "8": 2146725438, "9": 2565592172, "10": 19038910462, "11": 1382905524, "12": 11729850132, "13": 19054241206, "14": 19172386662, "15": 4795747242, "16": 1160581136, "17": 1586532376, "... | [100, 101] | ok | 364,429,475,410 | s745619459 | #include<set>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
int gx,gy;
#define CONNECT true
#define UNCONNECT false
#define CANMOVE ... | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | ok | 1.136748 | 1.106672 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 8... | 97 | 100 | 97 | 102 | 2 | 16.492909 | false | false | false | 1.141316 | 0.048413 | 0.042419 | 0.033653 | Accepted | Accepted | 0.033653 | 0.406118 | 2 | s745619459 | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 8... | 270,212,806,578 | 1.136748 | null | null | null | null | null | null | null | null | null | null | null |
p00724 | s518187423 | train | cpp | //Tue Dec 22 22:01:34 JST 2009
#include<set>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
#define CONNECT true
#define UNCONNECT false... | {"0": 3094094432, "1": 3274079952, "2": 2035043582, "3": 6257189224, "4": 1295710702, "5": 3151526950, "6": 1476207590, "7": 1187446546, "8": 2147838836, "9": 2571385960, "10": 8330011118, "11": 1386612084, "12": 8193033992, "13": 8441417556, "14": 8425953536, "15": 4712752044, "16": 1163210620, "17": 1591628324, "18":... | [100, 101] | ok | 324,161,703,866 | s745619459 | #include<set>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
int gx,gy;
#define CONNECT true
#define UNCONNECT false
#define CANMOVE ... | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | ok | 1.106403 | 0.98439 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 100 | 100 | 100 | 102 | 0 | 16.883422 | false | false | false | 1.133997 | 0.048103 | 0.042419 | 0.033653 | Accepted | Accepted | 0.033653 | 0.393357 | 2 | s745619459 | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 8... | 270,212,806,578 | 1.106403 | null | null | null | null | null | null | null | null | null | null | null |
p00724 | s051335841 | train | cpp | //Tue Dec 22 22:01:34 JST 2009
#include<set>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
#define CONNECT true
#define UNCONNECT false... | {"0": 3172210756, "1": 3365664016, "2": 2067314392, "3": 6887666214, "4": 1301319734, "5": 3227718494, "6": 1496918852, "7": 1189924450, "8": 2191621432, "9": 2620470996, "10": 10728139994, "11": 1395523558, "12": 10136642802, "13": 11066190850, "14": 10846850872, "15": 4870676096, "16": 1165886436, "17": 1625282230, "... | [100, 101] | ok | 342,901,206,648 | s745619459 | #include<set>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
int gx,gy;
#define CONNECT true
#define UNCONNECT false
#define CANMOVE ... | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | ok | 1.148206 | 1.041297 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 100 | 100 | 100 | 102 | 2 | 17.859438 | false | false | false | 1.157529 | 0.049101 | 0.042419 | 0.033653 | Accepted | Accepted | 0.033653 | 0.432557 | 2 | s745619459 | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 8... | 270,212,806,578 | 1.148206 | null | null | null | null | null | null | null | null | null | null | null |
p00724 | s320524262 | train | cpp | //Tue Dec 22 22:01:34 JST 2009
#include<set>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
#define CONNECT true
#define UNCONNECT false... | {"0": 3087211842, "1": 3269415006, "2": 2032791046, "3": 6609487170, "4": 1294117682, "5": 3149512652, "6": 1475560658, "7": 1186127514, "8": 2143152154, "9": 2562635790, "10": 10330841664, "11": 1383908526, "12": 9758062886, "13": 10656106032, "14": 10451102376, "15": 4725545682, "16": 1161691388, "17": 1586175448, "1... | [100, 101] | ok | 333,332,957,672 | s745619459 | #include<set>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define mp make_pair
int dx[]={0,1,1,0,-1,-1};
int dy[]={-1,-1,0,1,1,0};
int gx,gy;
#define CONNECT true
#define UNCONNECT false
#define CANMOVE ... | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | ok | 1.117249 | 1.012241 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 100 | 100 | 100 | 102 | 2 | 17.361092 | false | false | false | 1.131678 | 0.048005 | 0.042419 | 0.033653 | Accepted | Accepted | 0.033653 | 0.3892 | 2 | s745619459 | {"0": 2666836458, "1": 2876356912, "2": 1770561650, "3": 6185297404, "4": 1206819328, "5": 2727548252, "6": 1428834550, "7": 1130505376, "8": 1844608766, "9": 2197519896, "10": 19560538426, "11": 1268434024, "12": 11893335454, "13": 19904685658, "14": 19624009548, "15": 5038796906, "16": 1119201798, "17": 1482332852, "... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 8... | 270,212,806,578 | 1.117249 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s917588126 | train | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int MAXN=200005;
int n,k;
long long a[MAXN],s[MAXN],b[MAXN];
map<long long,int> mp;
int lowbit(int x)
{
return (x&-x);
}
void modify(int x,int num)
{
while(x<=n+1){
a[x]+=(long long)nu... | {"0": 2589365922, "1": 2590086356, "2": 2593143982, "3": 2589485184, "4": 2589682524, "5": 2590535090, "6": 2589963662, "7": 2592658354, "8": 2590658642, "9": 2592494762, "10": 2590086356, "11": 2589515500, "12": 2589515500, "13": 2589515500, "14": 2589515500, "15": 2589515500, "16": 2589485184, "17": 2589485184, "18":... | [] | ok | 269,317,811,906 | s418390390 | #include<bits/stdc++.h>
using namespace std;
long long aa;bool bb;char ch;
long long scan()
{
while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
ch=='-'?(bb=1,aa=0):(bb=0,aa=ch-48);
while(ch=getchar(),(ch>='0'&&ch<='9'))
aa=aa*10+ch-48;
return (bb?(-aa):(aa));
}
//用树状数组求逆序数
long long Length;
struct No... | {"0": 1022808930, "1": 1022911890, "2": 1023058608, "3": 1023009416, "4": 1022909602, "5": 1023032296, "6": 1022799778, "7": 1023723558, "8": 1023014278, "9": 1023273108, "10": 1022911890, "11": 1023140404, "12": 1023140404, "13": 1023140404, "14": 1023140404, "15": 1023140404, "16": 1023009416, "17": 1023009416, "18":... | ok | 2.531915 | 2.531937 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 13.487471 | false | false | false | 2.543989 | 0.180699 | 0.07103 | 0.013156 | Accepted | Accepted | 0.013156 | 0.654572 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 13.460506 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s976025198 | train | cpp | #include <iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<algorithm>
#define N 200500
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a));
using namespace std;
LL sum[N],t[N];
LL tree[N];
int n,k,a,m,nn;
void add(int x)
{
while(x<=nn)
{
t... | {"0": 6050086900, "1": 6050873400, "2": 6051668480, "3": 6050132088, "4": 6050348304, "5": 6050699512, "6": 6050887700, "7": 6051727682, "8": 6050823350, "9": 6051844942, "10": 6050873400, "11": 6050184140, "12": 6050184140, "13": 6050184140, "14": 6050184140, "15": 6050184140, "16": 6050132088, "17": 6050132088, "18":... | [] | ok | 629,234,543,366 | s418390390 | #include<bits/stdc++.h>
using namespace std;
long long aa;bool bb;char ch;
long long scan()
{
while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
ch=='-'?(bb=1,aa=0):(bb=0,aa=ch-48);
while(ch=getchar(),(ch>='0'&&ch<='9'))
aa=aa*10+ch-48;
return (bb?(-aa):(aa));
}
//用树状数组求逆序数
long long Length;
struct No... | {"0": 1022808930, "1": 1022911890, "2": 1023058608, "3": 1023009416, "4": 1022909602, "5": 1023032296, "6": 1022799778, "7": 1023723558, "8": 1023014278, "9": 1023273108, "10": 1022911890, "11": 1023140404, "12": 1023140404, "13": 1023140404, "14": 1023140404, "15": 1023140404, "16": 1023009416, "17": 1023009416, "18":... | ok | 5.915537 | 5.915621 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 31.512147 | false | false | false | 5.962115 | 0.423487 | 0.07103 | 0.013156 | Accepted | Accepted | 0.013156 | 0.858958 | 5 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 31.448974 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s640476442 | train | cpp | #include <iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<algorithm>
#define N 200500
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a));
using namespace std;
LL sum[N],t[N];
LL tree[N];
int n,k,a,m,nn;
void add(int x)
{
while(x<=nn)
{
t... | {"0": 6050086900, "1": 6050873400, "2": 6051668480, "3": 6050132088, "4": 6050348304, "5": 6050699512, "6": 6050887700, "7": 6051727682, "8": 6050823350, "9": 6051844942, "10": 6050873400, "11": 6050184140, "12": 6050184140, "13": 6050184140, "14": 6050184140, "15": 6050184140, "16": 6050132088, "17": 6050132088, "18":... | [] | ok | 629,234,543,366 | s357552126 | #include<bits/stdc++.h>
#define int long long
using namespace std;
struct SPLAY
{
static const int N=200005;
int ch[N][2],fa[N],size[N],cnt[N],val[N],sz,root;
int newnode(int v,int f)
{
sz++;
ch[sz][0]=ch[sz][1]=0;
fa[sz]=f;
size[sz]=cnt[sz]=1;
val[sz]=v;
return sz;
}
void pushup(int k... | {"0": 1034991386, "1": 1035943766, "2": 1038043578, "3": 1034991386, "4": 1034983664, "5": 1035943766, "6": 1035456422, "7": 1037610574, "8": 1036679358, "9": 1038035284, "10": 1035943766, "11": 1034984236, "12": 1034984236, "13": 1034984236, "14": 1034984236, "15": 1034984236, "16": 1034991386, "17": 1034991386, "18":... | ok | 5.845535 | 5.845624 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 31.512147 | false | false | false | 5.89552 | 0.423487 | 0.071832 | 0.013156 | Accepted | Accepted | 0.013156 | 0.857002 | 5 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 31.448974 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s919503427 | train | cpp | #include<iostream>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<cstdio>
#include<map>
using namespace std;
typedef long long ll;
const int MAX=200000+10;
int n,k;
ll a[MAX];
ll b[MAX];
ll s[MAX];
map<ll, int>mp;
int lowbit(int x)
{
return (x&-x);
}
ll sum(int x)
{
ll ans=0;
w... | {"0": 2664373140, "1": 2665340964, "2": 2667722486, "3": 2664368278, "4": 2664528438, "5": 2665157352, "6": 2665177944, "7": 2667510274, "8": 2665826592, "9": 2667366988, "10": 2665340964, "11": 2664368278, "12": 2664368278, "13": 2664368278, "14": 2664368278, "15": 2664368278, "16": 2664368278, "17": 2664368278, "18":... | [] | ok | 277,119,921,078 | s351289081 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "YES" : "NO")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 2e5 + 10;
const int SIZ =... | {"0": 1047422090, "1": 1047844798, "2": 1048606416, "3": 1047223606, "4": 1048036704, "5": 1048036132, "6": 1047811050, "7": 1048610992, "8": 1048839792, "9": 1048018400, "10": 1047844798, "11": 1047420946, "12": 1047420946, "13": 1047420946, "14": 1047420946, "15": 1047420946, "16": 1047223606, "17": 1047223606, "18":... | ok | 2.543839 | 2.543869 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 13.878201 | false | false | false | 2.555878 | 0.185883 | 0.072727 | 0.013156 | Accepted | Accepted | 0.013156 | 0.655109 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 13.850439 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s977374245 | train | cpp | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <iostream>
using namespace std;
typedef long long int LL;
const LL INF=1000000000000000ll;
const int maxn=100000*64;
struct ACM
{
struct Node
{
LL val;
int lson,rson;
}seg[maxn];
int sz;
... | {"0": 1011990694, "1": 1013717848, "2": 1016988258, "3": 1011626044, "4": 1012135982, "5": 1012741730, "6": 1013372360, "7": 1016515786, "8": 1014011856, "9": 1015203332, "10": 1013654356, "11": 1012067628, "12": 1012067628, "13": 1012067628, "14": 1012067628, "15": 1012067628, "16": 1011626044, "17": 1011626044, "18":... | [] | ok | 105,233,380,538 | s576980208 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 200000;
ll cnt = 0ll;
int n;
ll K, a[MAX_N + 10], s[MAX_N + 10], b[MAX_N + 10], t[MAX_N + 10];
void merge_sort(ll* A, int x, int y, ll* T) {
if (y - x > 1) {
int m = x + (y... | {"0": 195468130, "1": 196036126, "2": 196963910, "3": 195578240, "4": 195856518, "5": 196036126, "6": 195986362, "7": 196963910, "8": 196249482, "9": 196962480, "10": 196036126, "11": 195578240, "12": 195578240, "13": 195578240, "14": 195578240, "15": 195578240, "16": 195578240, "17": 195578240, "18": 195578240, "19": ... | ok | 5.172494 | 5.172607 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.270101 | false | false | false | 5.260106 | 0.070566 | 0.013415 | 0.013156 | Accepted | Accepted | 0.013156 | 0.995475 | 8 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.259705 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s846230360 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define maxn 200010
#define lowb(x) (x & (-x))
int t[maxn], n, c[maxn], d[maxn];
long long a[maxn], b[maxn];
void add(int x) {
for (int i = x; i <= n + 1; i += lowb(i)) {
t[i]++;
}
}
long long query(int x) {
long long s = 0;
for (int i = x; i > 0; i -= lo... | {"0": 1021929766, "1": 1022413392, "2": 1023329164, "3": 1021923760, "4": 1022267818, "5": 1022413392, "6": 1022413392, "7": 1023220770, "8": 1022698534, "9": 1023328592, "10": 1022413392, "11": 1021985536, "12": 1021985536, "13": 1021985536, "14": 1021985536, "15": 1021985536, "16": 1021923760, "17": 1021923760, "18":... | [] | ok | 106,289,120,366 | s576980208 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 200000;
ll cnt = 0ll;
int n;
ll K, a[MAX_N + 10], s[MAX_N + 10], b[MAX_N + 10], t[MAX_N + 10];
void merge_sort(ll* A, int x, int y, ll* T) {
if (y - x > 1) {
int m = x + (y... | {"0": 195468130, "1": 196036126, "2": 196963910, "3": 195578240, "4": 195856518, "5": 196036126, "6": 195986362, "7": 196963910, "8": 196249482, "9": 196962480, "10": 196036126, "11": 195578240, "12": 195578240, "13": 195578240, "14": 195578240, "15": 195578240, "16": 195578240, "17": 195578240, "18": 195578240, "19": ... | ok | 5.224279 | 5.224501 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.322973 | false | false | false | 5.309385 | 0.071227 | 0.013415 | 0.013156 | Accepted | Accepted | 0.013156 | 0.995526 | 8 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.312363 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s072130528 | train | cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using rset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
using ll = long long;
using db = double;
using vi = vector<int>;
const int maxn = 1000000... | {"0": 1037176426, "1": 1038780314, "2": 1040868686, "3": 1037496460, "4": 1038161982, "5": 1038268660, "6": 1038499462, "7": 1040687076, "8": 1038908442, "9": 1040310700, "10": 1038780314, "11": 1037274524, "12": 1037274524, "13": 1037274524, "14": 1037274524, "15": 1037274524, "16": 1037496460, "17": 1037496460, "18":... | [] | ok | 107,781,386,856 | s576980208 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 200000;
ll cnt = 0ll;
int n;
ll K, a[MAX_N + 10], s[MAX_N + 10], b[MAX_N + 10], t[MAX_N + 10];
void merge_sort(ll* A, int x, int y, ll* T) {
if (y - x > 1) {
int m = x + (y... | {"0": 195468130, "1": 196036126, "2": 196963910, "3": 195578240, "4": 195856518, "5": 196036126, "6": 195986362, "7": 196963910, "8": 196249482, "9": 196962480, "10": 196036126, "11": 195578240, "12": 195578240, "13": 195578240, "14": 195578240, "15": 195578240, "16": 195578240, "17": 195578240, "18": 195578240, "19": ... | ok | 5.297935 | 5.297851 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.397706 | false | false | false | 5.351978 | 0.071798 | 0.013415 | 0.013156 | Accepted | Accepted | 0.013156 | 0.99557 | 8 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.38726 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s930954105 | train | cpp | #include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
map<ll,int> t;
int cnt;
const int N=2e5+5;
int n;ll k,a[N]={0},as[N];
int bit[N]={0};
void add(int x,int val) {
while(x<cnt) bit[x]+=val,x+=x&-x;
}
int sum(int x) {
int s=0;while(x) s+... | {"0": 1021619456, "1": 1023012848, "2": 1024691668, "3": 1021619456, "4": 1022423116, "5": 1022747440, "6": 1022619884, "7": 1024943348, "8": 1023323730, "9": 1024670504, "10": 1023012848, "11": 1021552532, "12": 1021552532, "13": 1021552532, "14": 1021552532, "15": 1021552532, "16": 1021619456, "17": 1021619456, "18":... | [] | ok | 106,195,930,698 | s576980208 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 200000;
ll cnt = 0ll;
int n;
ll K, a[MAX_N + 10], s[MAX_N + 10], b[MAX_N + 10], t[MAX_N + 10];
void merge_sort(ll* A, int x, int y, ll* T) {
if (y - x > 1) {
int m = x + (y... | {"0": 195468130, "1": 196036126, "2": 196963910, "3": 195578240, "4": 195856518, "5": 196036126, "6": 195986362, "7": 196963910, "8": 196249482, "9": 196962480, "10": 196036126, "11": 195578240, "12": 195578240, "13": 195578240, "14": 195578240, "15": 195578240, "16": 195578240, "17": 195578240, "18": 195578240, "19": ... | ok | 5.219897 | 5.21992 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.318306 | false | false | false | 5.294843 | 0.071032 | 0.013415 | 0.013156 | Accepted | Accepted | 0.013156 | 0.995511 | 8 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.307907 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s630244630 | train | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
using std::scanf;
using std::printf;
using std::memset;
struct node
{
long long data;
int id;
bool operator< (const node& o) const
{ return this->data < o.data;}
};
typedef long long llong;
const int maxn = 200010;
llong treeset[maxn];
l... | {"0": 3476731258, "1": 3477301256, "2": 3478132086, "3": 3476967494, "4": 3477278662, "5": 3477271226, "6": 3477737120, "7": 3478439822, "8": 3477969066, "9": 3478333430, "10": 3477301256, "11": 3476725824, "12": 3476725824, "13": 3476725824, "14": 3476725824, "15": 3476725824, "16": 3476967494, "17": 3476967494, "18":... | [] | ok | 361,573,611,828 | s576980208 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 200000;
ll cnt = 0ll;
int n;
ll K, a[MAX_N + 10], s[MAX_N + 10], b[MAX_N + 10], t[MAX_N + 10];
void merge_sort(ll* A, int x, int y, ll* T) {
if (y - x > 1) {
int m = x + (y... | {"0": 195468130, "1": 196036126, "2": 196963910, "3": 195578240, "4": 195856518, "5": 196036126, "6": 195986362, "7": 196963910, "8": 196249482, "9": 196962480, "10": 196036126, "11": 195578240, "12": 195578240, "13": 195578240, "14": 195578240, "15": 195578240, "16": 195578240, "17": 195578240, "18": 195578240, "19": ... | ok | 17.771817 | 17.772671 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 18.107653 | false | false | false | 18.12991 | 0.243218 | 0.013415 | 0.013156 | Accepted | Accepted | 0.013156 | 0.998871 | 9 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 18.071458 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s082010726 | train | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
using std::scanf;
using std::printf;
using std::memset;
struct node
{
long long data;
int id;
bool operator< (const node& o) const
{ return this->data < o.data;}
};
typedef long long llong;
const int maxn = 200010;
llong treeset[maxn];
l... | {"0": 3476731258, "1": 3477301256, "2": 3478132086, "3": 3476967494, "4": 3477278662, "5": 3477271226, "6": 3477737120, "7": 3478439822, "8": 3477969066, "9": 3478333430, "10": 3477301256, "11": 3476725824, "12": 3476725824, "13": 3476725824, "14": 3476725824, "15": 3476725824, "16": 3476967494, "17": 3476967494, "18":... | [] | ok | 361,573,611,828 | s576980208 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 200000;
ll cnt = 0ll;
int n;
ll K, a[MAX_N + 10], s[MAX_N + 10], b[MAX_N + 10], t[MAX_N + 10];
void merge_sort(ll* A, int x, int y, ll* T) {
if (y - x > 1) {
int m = x + (y... | {"0": 195468130, "1": 196036126, "2": 196963910, "3": 195578240, "4": 195856518, "5": 196036126, "6": 195986362, "7": 196963910, "8": 196249482, "9": 196962480, "10": 196036126, "11": 195578240, "12": 195578240, "13": 195578240, "14": 195578240, "15": 195578240, "16": 195578240, "17": 195578240, "18": 195578240, "19": ... | ok | 17.771817 | 17.772671 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 18.107653 | false | false | false | 18.12991 | 0.243218 | 0.013415 | 0.013156 | Accepted | Accepted | 0.013156 | 0.998871 | 9 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 18.071458 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s552493328 | train | cpp | #include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<set>
#include<queue>
#include<map>
using namespace std;
long long s[200005],ts[200005],in[200005];
void p(int pos)
{
while(pos<=200003)
{
in[pos]+=1;
pos+=pos&(-pos);
}
}
lon... | {"0": 4309021574, "1": 4309497764, "2": 4311000980, "3": 4309250660, "4": 4309567262, "5": 4309649916, "6": 4309783478, "7": 4311167146, "8": 4309533800, "9": 4310844538, "10": 4309497764, "11": 4309136260, "12": 4309136260, "13": 4309136260, "14": 4309136260, "15": 4309136260, "16": 4309250660, "17": 4309250660, "18":... | [] | ok | 448,173,196,900 | s767079411 | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MOD(x) ((x)%mod)
int n;
long long mean;
long long a[200005];
long long s[200005];
long long temp[200005];
long long ans;
void merge(int l,int r)
{
int m=(l+r)/2;
int h1=l,h2=m+1;
int t1=m,t2=r;
if(h1<t1) merge(h1,t1);
if... | {"0": 1010022442, "1": 1010202336, "2": 1011871146, "3": 1010069632, "4": 1010124544, "5": 1010634196, "6": 1010158006, "7": 1011852842, "8": 1010802936, "9": 1011881156, "10": 1010202336, "11": 1010042748, "12": 1010042748, "13": 1010042748, "14": 1010042748, "15": 1010042748, "16": 1010069632, "17": 1010069632, "18":... | ok | 4.266132 | 4.266176 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 22.444571 | false | false | false | 4.274837 | 0.301018 | 0.070416 | 0.013156 | Accepted | Accepted | 0.013156 | 0.801083 | 5 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 22.399575 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s666468094 | train | cpp | #include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 2e5 + 10;
int t[N];
int lowbit(int x){return x&(-x);}
void add(int x){
while(x<N){
t[x]++;
x+=lowbit(x);
}
}
long long sum(int x){
long long ans=0;
while(x){
ans+=t[x];
... | {"0": 1859559416, "1": 1859868010, "2": 1862006432, "3": 1953637972, "4": 1955137470, "5": 1955052814, "6": 1859764764, "7": 1860774058, "8": 1952635256, "9": 1862349346, "10": 1859868010, "11": 1953802422, "12": 1953743792, "13": 1953904810, "14": 1953910816, "15": 1953798418, "16": 1953552744, "17": 1953913104, "18":... | [88, 89] | ok | 200,096,577,252 | s767079411 | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MOD(x) ((x)%mod)
int n;
long long mean;
long long a[200005];
long long s[200005];
long long temp[200005];
long long ans;
void merge(int l,int r)
{
int m=(l+r)/2;
int h1=l,h2=m+1;
int t1=m,t2=r;
if(h1<t1) merge(h1,t1);
if... | {"0": 1010022442, "1": 1010202336, "2": 1011871146, "3": 1010069632, "4": 1010124544, "5": 1010634196, "6": 1010158006, "7": 1011852842, "8": 1010802936, "9": 1011881156, "10": 1010202336, "11": 1010042748, "12": 1010042748, "13": 1010042748, "14": 1010042748, "15": 1010042748, "16": 1010069632, "17": 1010069632, "18":... | ok | 1.942052 | 1.942052 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 102 | 102 | 102 | 104 | 2 | 10.21735 | false | false | false | 1.918367 | 0.135084 | 0.070416 | 0.013156 | Accepted | Accepted | 0.013156 | 0.530375 | 3 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 10.196859 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s181120956 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
using namespace std;
int n;
long long m;
long long sum[300000];
long long c[300000];
long long d[300000];
int lowbit(int x){
return x & -x;
}
void update(int x){
while (x<=n+10){
c[x]... | {"0": 3477855810, "1": 3478207304, "2": 3478966062, "3": 3477851234, "4": 3477993948, "5": 3478211880, "6": 3478064590, "7": 3479100482, "8": 3478377474, "9": 3479027552, "10": 3478207304, "11": 3477874686, "12": 3477874686, "13": 3477874686, "14": 3477874686, "15": 3477874686, "16": 3477851234, "17": 3477851234, "18":... | [] | ok | 361,698,323,272 | s767079411 | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MOD(x) ((x)%mod)
int n;
long long mean;
long long a[200005];
long long s[200005];
long long temp[200005];
long long ans;
void merge(int l,int r)
{
int m=(l+r)/2;
int h1=l,h2=m+1;
int t1=m,t2=r;
if(h1<t1) merge(h1,t1);
if... | {"0": 1010022442, "1": 1010202336, "2": 1011871146, "3": 1010069632, "4": 1010124544, "5": 1010634196, "6": 1010158006, "7": 1011852842, "8": 1010802936, "9": 1011881156, "10": 1010202336, "11": 1010042748, "12": 1010042748, "13": 1010042748, "14": 1010042748, "15": 1010042748, "16": 1010069632, "17": 1010069632, "18":... | ok | 3.442988 | 3.443019 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 18.113898 | false | false | false | 3.445547 | 0.242623 | 0.070416 | 0.013156 | Accepted | Accepted | 0.013156 | 0.750462 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 18.077611 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s838429904 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
using namespace std;
int n;
long long m;
long long sum[300000];
long long c[300000];
long long d[300000];
int lowbit(int x){
return x & -x;
}
void update(int x){
while (x<=n+10){
c[x]... | {"0": 3477855810, "1": 3478207304, "2": 3478966062, "3": 3477851234, "4": 3477993948, "5": 3478211880, "6": 3478064590, "7": 3479100482, "8": 3478377474, "9": 3479027552, "10": 3478207304, "11": 3477874686, "12": 3477874686, "13": 3477874686, "14": 3477874686, "15": 3477874686, "16": 3477851234, "17": 3477851234, "18":... | [] | ok | 361,698,323,272 | s767079411 | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MOD(x) ((x)%mod)
int n;
long long mean;
long long a[200005];
long long s[200005];
long long temp[200005];
long long ans;
void merge(int l,int r)
{
int m=(l+r)/2;
int h1=l,h2=m+1;
int t1=m,t2=r;
if(h1<t1) merge(h1,t1);
if... | {"0": 1010022442, "1": 1010202336, "2": 1011871146, "3": 1010069632, "4": 1010124544, "5": 1010634196, "6": 1010158006, "7": 1011852842, "8": 1010802936, "9": 1011881156, "10": 1010202336, "11": 1010042748, "12": 1010042748, "13": 1010042748, "14": 1010042748, "15": 1010042748, "16": 1010069632, "17": 1010069632, "18":... | ok | 3.442988 | 3.443019 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 18.113898 | false | false | false | 3.445547 | 0.242623 | 0.070416 | 0.013156 | Accepted | Accepted | 0.013156 | 0.750462 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 18.077611 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s886687898 | train | cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int MAXN=200005;
int n,k;
long long a[MAXN],s[MAXN],b[MAXN];
map<long long,int> mp;
int lowbit(int x)
{
return (x&-x);
}
void modify(int x,int num)
{
while(x<=n+1){
... | {"0": 2664188384, "1": 2665299208, "2": 2667513706, "3": 2664380004, "4": 2664439206, "5": 2665172224, "6": 2665176514, "7": 2667595216, "8": 2665670436, "9": 2667335528, "10": 2665299208, "11": 2664125750, "12": 2664125750, "13": 2664125750, "14": 2664125750, "15": 2664125750, "16": 2664380004, "17": 2664380004, "18":... | [] | ok | 277,101,599,632 | s951747995 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define loop(i,n) for(int i = 0;i < int(n);i... | {"0": 1048305830, "1": 1050153104, "2": 1052186278, "3": 1048282664, "4": 1049581390, "5": 1049610848, "6": 1050091042, "7": 1052252630, "8": 1050427378, "9": 1052186278, "10": 1050153104, "11": 1048793460, "12": 1048793460, "13": 1048793460, "14": 1048793460, "15": 1048793460, "16": 1048282664, "17": 1048282664, "18":... | ok | 2.541986 | 2.542079 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 13.877284 | false | false | false | 2.547247 | 0.185879 | 0.072972 | 0.013156 | Accepted | Accepted | 0.013156 | 0.653684 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 13.84954 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s116042756 | train | cpp | #include<iostream>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<cstdio>
#include<map>
using namespace std;
typedef long long ll;
const int MAX=200000+10;
int n,k;
ll a[MAX];
ll b[MAX];
ll s[MAX];
map<ll, int>mp;
int lowbit(int x)
{
return (x&-x);
}
void modify(int x,int num)... | {"0": 2664320516, "1": 2665330382, "2": 2667516566, "3": 2664373140, "4": 2664442638, "5": 2665076128, "6": 2665191100, "7": 2667692456, "8": 2665654134, "9": 2667337244, "10": 2665330382, "11": 2664320230, "12": 2664320230, "13": 2664320230, "14": 2664320230, "15": 2664320230, "16": 2664373140, "17": 2664373140, "18":... | [] | ok | 277,108,125,294 | s951747995 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define loop(i,n) for(int i = 0;i < int(n);i... | {"0": 1048305830, "1": 1050153104, "2": 1052186278, "3": 1048282664, "4": 1049581390, "5": 1049610848, "6": 1050091042, "7": 1052252630, "8": 1050427378, "9": 1052186278, "10": 1050153104, "11": 1048793460, "12": 1048793460, "13": 1048793460, "14": 1048793460, "15": 1048793460, "16": 1048282664, "17": 1048282664, "18":... | ok | 2.542047 | 2.542139 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 13.87761 | false | false | false | 2.547386 | 0.185889 | 0.072972 | 0.013156 | Accepted | Accepted | 0.013156 | 0.653704 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 13.849872 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s537284918 | train | cpp | /**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2019-12-26 02:39:58
**/
#include <iostream>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>... | {"0": 1049472996, "1": 1049522188, "2": 1051877112, "3": 1049301396, "4": 1049560512, "5": 1049992658, "6": 1049541636, "7": 1050978786, "8": 1050615566, "9": 1051656892, "10": 1049522188, "11": 1049489870, "12": 1049489870, "13": 1049489870, "14": 1049489870, "15": 1049489870, "16": 1049301396, "17": 1049301396, "18":... | [] | ok | 109,134,874,420 | s027889377 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cctype>
#include <utility>
using namespace std;
using int64 = long long;
template <class T>
class CoodinateCompression {
public:
CoodinateCompression(const std::vector<T>& vec) : vec_(vec) {
result_.resize(vec_.size());
Co... | {"0": 946957726, "1": 946924836, "2": 947932414, "3": 947225708, "4": 947166792, "5": 947168222, "6": 946970596, "7": 947310078, "8": 947561472, "9": 947538878, "10": 946924836, "11": 947227138, "12": 947227138, "13": 947227138, "14": 947227138, "15": 947227138, "16": 947225708, "17": 947225708, "18": 947225708, "19": ... | ok | 1.108061 | 1.108058 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.465489 | false | false | false | 1.103462 | 0.072912 | 0.066075 | 0.013156 | Accepted | Accepted | 0.013156 | 0.114403 | 1 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.454577 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s412225317 | train | cpp |
#include <iostream>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
#include <bitset>
#include <cassert>
#include <cctype>
#include <iomanip>
#include <ran... | {"0": 1049484722, "1": 1049517326, "2": 1051656892, "3": 1049517612, "4": 1049536488, "5": 1049871394, "6": 1049508174, "7": 1050627292, "8": 1050618712, "9": 1051958336, "10": 1049517326, "11": 1049552504, "12": 1049552504, "13": 1049552504, "14": 1049552504, "15": 1049552504, "16": 1049517612, "17": 1049517612, "18":... | [] | ok | 109,137,658,630 | s227747472 |
#include <cstdio>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cctype>
#include <iomanip>
#include <utility>
using namespace std;
using int64 = long long;
template <class T>
class CoodinateCompression {
public:
CoodinateCompression(const... | {"0": 954885646, "1": 954838170, "2": 955689306, "3": 954955430, "4": 954936554, "5": 954936840, "6": 954851898, "7": 955689306, "8": 955320366, "9": 955310642, "10": 954838170, "11": 955071546, "12": 955071546, "13": 955071546, "14": 955071546, "15": 955071546, "16": 954955430, "17": 954955430, "18": 954955430, "19": ... | ok | 1.098882 | 1.098873 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.465628 | false | false | false | 1.104384 | 0.072888 | 0.065999 | 0.013156 | Accepted | Accepted | 0.013156 | 0.115335 | 1 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.454721 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s508108827 | train | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=200005;
struct node{
long long num;
int id;
bool operator<(const node &another)const
{
if(num==another.num)return id<another.id;
return num<another.num;
}
};
int n,k;
... | {"0": 1832395136, "1": 1832736906, "2": 1833472212, "3": 1832379406, "4": 1832391132, "5": 1832831858, "6": 1832672556, "7": 1833613782, "8": 1832841868, "9": 1833679276, "10": 1832736906, "11": 1832379406, "12": 1832379406, "13": 1832379406, "14": 1832379406, "15": 1832379406, "16": 1832379406, "17": 1832379406, "18":... | [] | ok | 190,576,371,986 | s795787051 | #include<bits/stdc++.h>
using namespace std;
int bit[200003],n,k;
pair<long long,int>a[200003];
int sum(int x){
int ret=0;
for(;x>=1;x-=x&(-x))ret+=bit[x];
return ret;
}
void add(int x){
for(;x<n+2;x+=x&(-x))bit[x]++;
}
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++)scanf("%lld",&a[i].first),a[i].fir... | {"0": 1024529220, "1": 1025068044, "2": 1025675794, "3": 1024512060, "4": 1024544378, "5": 1024852114, "6": 1024818080, "7": 1025667214, "8": 1025056604, "9": 1025673506, "10": 1025068044, "11": 1024500334, "12": 1024500334, "13": 1024500334, "14": 1024500334, "15": 1024500334, "16": 1024512060, "17": 1024512060, "18":... | ok | 1.790347 | 1.790439 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 9.544089 | false | false | false | 1.798502 | 0.128041 | 0.071193 | 0.013156 | Accepted | Accepted | 0.013156 | 0.494822 | 3 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 9.524979 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s112128136 | train | cpp | #include<cstdio>
#include<ctime>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN = 200005;
int n, m;
long long k, ans;
long long a[MAXN];
long long t[MAXN];
long long b[MAXN];
long long Query(int x)
{
long long ret = 0;
while(x)
{
ret += b[x];
x -= (x ... | {"0": 1018844970, "1": 1019006846, "2": 1020767176, "3": 1018677946, "4": 1018931056, "5": 1019304286, "6": 1019005130, "7": 1020767176, "8": 1019268536, "9": 1020878716, "10": 1019006846, "11": 1018894448, "12": 1018894448, "13": 1018894448, "14": 1018894448, "15": 1018894448, "16": 1018677946, "17": 1018677946, "18":... | [] | ok | 105,960,310,170 | s087681343 | #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn=2e5+50;
int n,k,N,r[maxn];
ll ans,a[maxn],sum[maxn];
inline int read(int x=0,char c=getchar()) {
while(c<'0'||c>'9') c=getchar();
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
ll c[m... | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | ok | 5.295944 | 5.296053 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.306506 | false | false | false | 5.351676 | 0.070404 | 0.013156 | 0.013156 | Accepted | Accepted | 0.013156 | 1 | 10 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.295944 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s478376257 | train | cpp | #include <iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<algorithm>
#define N 200500
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a));
using namespace std;
LL sum[N],t[N];
LL tree[N];
int n,k,a,m,nn;
void add(int x)
{
while(x<=nn)//nn为上限,要大于离散化后的最大... | {"0": 6050086900, "1": 6050873400, "2": 6051668480, "3": 6050132088, "4": 6050348304, "5": 6050699512, "6": 6050887700, "7": 6051727682, "8": 6050823350, "9": 6051844942, "10": 6050873400, "11": 6050184140, "12": 6050184140, "13": 6050184140, "14": 6050184140, "15": 6050184140, "16": 6050132088, "17": 6050132088, "18":... | [] | ok | 629,234,543,366 | s911270370 | #include<bits/stdc++.h>
#define lson(x) (x<<1)
#define rson(x) ((x<<1)|1)
using namespace std;
typedef long long ll;
typedef vector<int> vii;
const int maxn=200003;
const int inf=0x3f3f3f3f;
int n,k,b[maxn];
ll pre[maxn],a[maxn],res,sum[maxn<<2];
void update(int id,int l,int r,int pos){
++sum[id];
... | {"0": 1010971676, "1": 1011628046, "2": 1013101518, "3": 1011040316, "4": 1011544534, "5": 1011601162, "6": 1011597730, "7": 1013101518, "8": 1011630048, "9": 1013092938, "10": 1011628046, "11": 1011081214, "12": 1011081214, "13": 1011081214, "14": 1011081214, "15": 1011081214, "16": 1011040316, "17": 1011040316, "18":... | ok | 5.984487 | 5.984584 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 31.512147 | false | false | false | 6.004559 | 0.423487 | 0.070528 | 0.013156 | Accepted | Accepted | 0.013156 | 0.860181 | 5 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 31.448974 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s010613069 | train | cpp | #include <iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<algorithm>
#define N 200500
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a));
using namespace std;
LL sum[N],t[N];
LL tree[N];
int n,k,a,m,nn;
void add(int x)
{
while(x<=nn)//nn为上限,要大于离散化后的最大... | {"0": 6050086900, "1": 6050873400, "2": 6051668480, "3": 6050132088, "4": 6050348304, "5": 6050699512, "6": 6050887700, "7": 6051727682, "8": 6050823350, "9": 6051844942, "10": 6050873400, "11": 6050184140, "12": 6050184140, "13": 6050184140, "14": 6050184140, "15": 6050184140, "16": 6050132088, "17": 6050132088, "18":... | [] | ok | 629,234,543,366 | s911270370 | #include<bits/stdc++.h>
#define lson(x) (x<<1)
#define rson(x) ((x<<1)|1)
using namespace std;
typedef long long ll;
typedef vector<int> vii;
const int maxn=200003;
const int inf=0x3f3f3f3f;
int n,k,b[maxn];
ll pre[maxn],a[maxn],res,sum[maxn<<2];
void update(int id,int l,int r,int pos){
++sum[id];
... | {"0": 1010971676, "1": 1011628046, "2": 1013101518, "3": 1011040316, "4": 1011544534, "5": 1011601162, "6": 1011597730, "7": 1013101518, "8": 1011630048, "9": 1013092938, "10": 1011628046, "11": 1011081214, "12": 1011081214, "13": 1011081214, "14": 1011081214, "15": 1011081214, "16": 1011040316, "17": 1011040316, "18":... | ok | 5.984487 | 5.984584 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 31.512147 | false | false | false | 6.004559 | 0.423487 | 0.070528 | 0.013156 | Accepted | Accepted | 0.013156 | 0.860181 | 5 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 31.448974 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s040590165 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<=(b);++i)
#define ROF(i,a,b) for (int i=(a);i>=(b);--i)
typedef long long ll;
inline int read() {
int x=0,s=1; char ch=getchar();
while (ch<'0'||ch>'9') { if (ch=='-') s=-1; ch=getchar(); }
while (ch>='0'&&ch<='9') { x=x*10+ch-... | {"0": 1828221824, "1": 1828303906, "2": 1829238554, "3": 1828467784, "4": 1828438612, "5": 1828425170, "6": 1828280454, "7": 1829090978, "8": 1828606780, "9": 1829228258, "10": 1828303906, "11": 1828434608, "12": 1828434608, "13": 1828434608, "14": 1828434608, "15": 1828434608, "16": 1828467784, "17": 1828467784, "18":... | [] | ok | 190,159,962,850 | s911270370 | #include<bits/stdc++.h>
#define lson(x) (x<<1)
#define rson(x) ((x<<1)|1)
using namespace std;
typedef long long ll;
typedef vector<int> vii;
const int maxn=200003;
const int inf=0x3f3f3f3f;
int n,k,b[maxn];
ll pre[maxn],a[maxn],res,sum[maxn<<2];
void update(int id,int l,int r,int pos){
++sum[id];
... | {"0": 1010971676, "1": 1011628046, "2": 1013101518, "3": 1011040316, "4": 1011544534, "5": 1011601162, "6": 1011597730, "7": 1013101518, "8": 1011630048, "9": 1013092938, "10": 1011628046, "11": 1011081214, "12": 1011081214, "13": 1011081214, "14": 1011081214, "15": 1011081214, "16": 1011040316, "17": 1011040316, "18":... | ok | 1.808561 | 1.808592 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 9.523235 | false | false | false | 1.8118 | 0.127782 | 0.070528 | 0.013156 | Accepted | Accepted | 0.013156 | 0.499486 | 3 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 9.504138 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s972208699 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
int n;
ll k;
ll a[252521];
ll b[252521]; // for za-atu
ll bit[252521]; // for fenw... | {"0": 1011207340, "1": 1011578854, "2": 1012981398, "3": 1011267686, "4": 1011541102, "5": 1011606024, "6": 1011595156, "7": 1012981398, "8": 1012083644, "9": 1012981398, "10": 1011578854, "11": 1011221926, "12": 1011221926, "13": 1011221926, "14": 1011221926, "15": 1011221926, "16": 1011267686, "17": 1011267686, "18":... | [] | ok | 105,181,198,122 | s246302931 | // #include <bits/stdc++.h>
#include <stdio.h>
#include <utility>
// using namespace std;
using std::swap;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
ll a[252521];
ll t... | {"0": 195357162, "1": 195856518, "2": 196500590, "3": 195342862, "4": 195667472, "5": 195856518, "6": 195667472, "7": 196500590, "8": 195907712, "9": 196584960, "10": 195856518, "11": 195392626, "12": 195392626, "13": 195392626, "14": 195392626, "15": 195392626, "16": 195342862, "17": 195342862, "18": 195342862, "19": ... | ok | 5.172516 | 5.172686 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.267488 | false | false | false | 5.217883 | 0.070489 | 0.013509 | 0.013156 | Accepted | Accepted | 0.013156 | 0.993832 | 7 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.256953 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s332806077 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
int n;
ll k;
ll a[252521];
ll b[252521]; // for za-atu
ll bit[252521]; // for fenw... | {"0": 1011123256, "1": 1011552256, "2": 1012981398, "3": 1011183888, "4": 1011322884, "5": 1011558548, "6": 1011573134, "7": 1012905894, "8": 1011916334, "9": 1012981398, "10": 1011552256, "11": 1011147280, "12": 1011147280, "13": 1011147280, "14": 1011147280, "15": 1011147280, "16": 1011183888, "17": 1011183888, "18":... | [] | ok | 105,179,206,132 | s246302931 | // #include <bits/stdc++.h>
#include <stdio.h>
#include <utility>
// using namespace std;
using std::swap;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
ll a[252521];
ll t... | {"0": 195357162, "1": 195856518, "2": 196500590, "3": 195342862, "4": 195667472, "5": 195856518, "6": 195667472, "7": 196500590, "8": 195907712, "9": 196584960, "10": 195856518, "11": 195392626, "12": 195392626, "13": 195392626, "14": 195392626, "15": 195392626, "16": 195342862, "17": 195342862, "18": 195342862, "19": ... | ok | 5.172421 | 5.172588 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.267388 | false | false | false | 5.218406 | 0.070496 | 0.013509 | 0.013156 | Accepted | Accepted | 0.013156 | 0.993832 | 7 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.256857 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s569248845 | train | cpp | #include <bits/stdc++.h>
// using namespace std;
using std::sort;
using std::lower_bound;
using std::unique;
using std::vector;
using std::set;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop... | {"0": 1010728576, "1": 1011210200, "2": 1012648780, "3": 1010860422, "4": 1011094656, "5": 1011213632, "6": 1011256818, "7": 1012586432, "8": 1011628332, "9": 1012178310, "10": 1011210200, "11": 1010707984, "12": 1010707984, "13": 1010707984, "14": 1010707984, "15": 1010707984, "16": 1010860422, "17": 1010860422, "18":... | [] | ok | 105,114,567,558 | s246302931 | // #include <bits/stdc++.h>
#include <stdio.h>
#include <utility>
// using namespace std;
using std::swap;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
ll a[252521];
ll t... | {"0": 195357162, "1": 195856518, "2": 196500590, "3": 195342862, "4": 195667472, "5": 195856518, "6": 195667472, "7": 196500590, "8": 195907712, "9": 196584960, "10": 195856518, "11": 195392626, "12": 195392626, "13": 195392626, "14": 195392626, "15": 195392626, "16": 195342862, "17": 195342862, "18": 195342862, "19": ... | ok | 5.169279 | 5.169409 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.264151 | false | false | false | 5.220431 | 0.070524 | 0.013509 | 0.013156 | Accepted | Accepted | 0.013156 | 0.993835 | 7 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.253664 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s922944415 | train | cpp | // #include <bits/stdc++.h>
#include <stdio.h>
#include <algorithm>
// using namespace std;
using std::inplace_merge;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
int n;
... | {"0": 948222418, "1": 949195962, "2": 951208830, "3": 948224134, "4": 948390300, "5": 949081848, "6": 949156494, "7": 951017496, "8": 949476242, "9": 950966588, "10": 949195962, "11": 948214696, "12": 948214696, "13": 948214696, "14": 948214696, "15": 948214696, "16": 948224134, "17": 948224134, "18": 948224134, "19": ... | [] | ok | 98,552,971,660 | s246302931 | // #include <bits/stdc++.h>
#include <stdio.h>
#include <utility>
// using namespace std;
using std::swap;
typedef long long ll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
ll a[252521];
ll t... | {"0": 195357162, "1": 195856518, "2": 196500590, "3": 195342862, "4": 195667472, "5": 195856518, "6": 195667472, "7": 196500590, "8": 195907712, "9": 196584960, "10": 195856518, "11": 195392626, "12": 195392626, "13": 195392626, "14": 195392626, "15": 195392626, "16": 195342862, "17": 195342862, "18": 195342862, "19": ... | ok | 4.846745 | 4.846717 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 4.935545 | false | false | false | 4.85728 | 0.065618 | 0.013509 | 0.013156 | Accepted | Accepted | 0.013156 | 0.993259 | 7 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 4.925865 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s351668026 | train | cpp | #include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<unordered_map>
#include<functional>
#include<set>
#include<numeric>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r)... | {"0": 2889372486, "1": 2889978806, "2": 2891849818, "3": 2889372486, "4": 2889372486, "5": 2889599856, "6": 2889599856, "7": 2891238350, "8": 2890386070, "9": 2891461430, "10": 2889978806, "11": 2889372486, "12": 2889372486, "13": 2889372486, "14": 2889372486, "15": 2889372486, "16": 2889372486, "17": 2889372486, "18":... | [] | ok | 300,437,895,472 | s238454742 | #include<cstdio>
#include<algorithm>
int n, k;
long long ans;
long long c[200010], val[200010], sum[200010];
inline void add(long long x, long long y){
for(;x <= n;x += x & -x) c[x] += y;
}
inline long long ask(long long x){
long long ans = 0;
for(;x;x -= x & -x) ans += c[x];
return ans;
}
int ma... | {"0": 195842504, "1": 196235468, "2": 196935596, "3": 195842504, "4": 195972348, "5": 196235468, "6": 196090752, "7": 197280798, "8": 196420510, "9": 197070016, "10": 196235468, "11": 195842504, "12": 195842504, "13": 195842504, "14": 195842504, "15": 195842504, "16": 195842504, "17": 195842504, "18": 195842504, "19": ... | ok | 14.755016 | 14.755648 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 15.045968 | false | false | false | 14.962301 | 0.201798 | 0.013487 | 0.013156 | Accepted | Accepted | 0.013156 | 0.998242 | 9 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 15.015976 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s480493861 | train | cpp | #include <iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<algorithm>
#define N 200500
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a));
using namespace std;
LL sum[N],t[N];
LL tree[N];
int n,k,a,m,nn;
void add(int x)
{
while(x<=nn)//nn为上限,要大于离散化后的最大... | {"0": 6050086900, "1": 6050873400, "2": 6051668480, "3": 6050132088, "4": 6050348304, "5": 6050699512, "6": 6050887700, "7": 6051727682, "8": 6050823350, "9": 6051844942, "10": 6050873400, "11": 6050184140, "12": 6050184140, "13": 6050184140, "14": 6050184140, "15": 6050184140, "16": 6050132088, "17": 6050132088, "18":... | [] | ok | 629,234,543,366 | s238454742 | #include<cstdio>
#include<algorithm>
int n, k;
long long ans;
long long c[200010], val[200010], sum[200010];
inline void add(long long x, long long y){
for(;x <= n;x += x & -x) c[x] += y;
}
inline long long ask(long long x){
long long ans = 0;
for(;x;x -= x & -x) ans += c[x];
return ans;
}
int ma... | {"0": 195842504, "1": 196235468, "2": 196935596, "3": 195842504, "4": 195972348, "5": 196235468, "6": 196090752, "7": 197280798, "8": 196420510, "9": 197070016, "10": 196235468, "11": 195842504, "12": 195842504, "13": 195842504, "14": 195842504, "15": 195842504, "16": 195842504, "17": 195842504, "18": 195842504, "19": ... | ok | 30.902428 | 30.904103 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 31.512147 | false | false | false | 31.399458 | 0.423487 | 0.013487 | 0.013156 | Accepted | Accepted | 0.013156 | 0.999192 | 9 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 31.448974 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s300435992 | train | cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 200040
using namespace std;
int n,k;
long long ans=0,aux[N],sum[N];
long long tree[N];
int lowbit(int x)
{
return x&-x;
}
long long getsum(int x)
{
long long ans=0;
for(int i=x;i;i-=lowbit(i))
ans+=tree[i];
return... | {"0": 6027508630, "1": 6027830952, "2": 6029341604, "3": 6027758594, "4": 6027637616, "5": 6028353188, "6": 6027869276, "7": 6029144836, "8": 6028011990, "9": 6029087922, "10": 6027830952, "11": 6027515208, "12": 6027515208, "13": 6027515208, "14": 6027515208, "15": 6027515208, "16": 6027758594, "17": 6027758594, "18":... | [] | ok | 626,864,408,456 | s238454742 | #include<cstdio>
#include<algorithm>
int n, k;
long long ans;
long long c[200010], val[200010], sum[200010];
inline void add(long long x, long long y){
for(;x <= n;x += x & -x) c[x] += y;
}
inline long long ask(long long x){
long long ans = 0;
for(;x;x -= x & -x) ans += c[x];
return ans;
}
int ma... | {"0": 195842504, "1": 196235468, "2": 196935596, "3": 195842504, "4": 195972348, "5": 196235468, "6": 196090752, "7": 197280798, "8": 196420510, "9": 197070016, "10": 196235468, "11": 195842504, "12": 195842504, "13": 195842504, "14": 195842504, "15": 195842504, "16": 195842504, "17": 195842504, "18": 195842504, "19": ... | ok | 30.786022 | 30.787697 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 31.39345 | false | false | false | 31.251208 | 0.421488 | 0.013487 | 0.013156 | Accepted | Accepted | 0.013156 | 0.999188 | 9 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 31.330509 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s391454392 | train | cpp | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define int long long
#define rint register int
using namespace std;
const int maxn=2e5+5;
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<... | {"0": 1009876010, "1": 1009902894, "2": 1010660222, "3": 1010084218, "4": 1010090510, "5": 1010090510, "6": 1009877440, "7": 1010738586, "8": 1010683674, "9": 1010835826, "10": 1009902894, "11": 1010090510, "12": 1010090510, "13": 1010090510, "14": 1010090510, "15": 1010090510, "16": 1010084218, "17": 1010084218, "18":... | [] | ok | 105,039,741,092 | s238454742 | #include<cstdio>
#include<algorithm>
int n, k;
long long ans;
long long c[200010], val[200010], sum[200010];
inline void add(long long x, long long y){
for(;x <= n;x += x & -x) c[x] += y;
}
inline long long ask(long long x){
long long ans = 0;
for(;x;x -= x & -x) ans += c[x];
return ans;
}
int ma... | {"0": 195842504, "1": 196235468, "2": 196935596, "3": 195842504, "4": 195972348, "5": 196235468, "6": 196090752, "7": 197280798, "8": 196420510, "9": 197070016, "10": 196235468, "11": 195842504, "12": 195842504, "13": 195842504, "14": 195842504, "15": 195842504, "16": 195842504, "17": 195842504, "18": 195842504, "19": ... | ok | 5.158641 | 5.158901 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 5.260404 | false | false | false | 5.225492 | 0.070477 | 0.013487 | 0.013156 | Accepted | Accepted | 0.013156 | 0.994216 | 7 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 5.249878 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s519137826 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using VI = vector<int>;
using VVI = vector<VI>;
int N = 1 << 18;
VI st(2 * N - 1);
int query(int a, int b, int k = 0, int l = 0, int r = N) {
if (r <= a or b <= l) return 0;
if (a <= l and r <= b) return st[k];
return query(a, b, 2 ... | {"0": 3227711344, "1": 3229034380, "2": 3230003062, "3": 3228081714, "4": 3228571632, "5": 3228579926, "6": 3228597658, "7": 3229990192, "8": 3229146778, "9": 3229594082, "10": 3229034380, "11": 3228006782, "12": 3228006782, "13": 3228006782, "14": 3228006782, "15": 3228006782, "16": 3228081714, "17": 3228081714, "18":... | [] | ok | 335,739,252,420 | s841686148 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U... | {"0": 1047044570, "1": 1047015398, "2": 1048107346, "3": 1047043712, "4": 1047021976, "5": 1047444398, "6": 1046959342, "7": 1048086468, "8": 1047459556, "9": 1048028410, "10": 1047015398, "11": 1047006246, "12": 1047006246, "13": 1047006246, "14": 1047006246, "15": 1047006246, "16": 1047043712, "17": 1047043712, "18":... | ok | 3.083501 | 3.083525 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 16.813865 | false | false | false | 3.09622 | 0.225315 | 0.072771 | 0.013156 | Accepted | Accepted | 0.013156 | 0.719006 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 16.780221 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s077001631 | train | cpp | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
template <typename T>
class FenwickTree
{
public:
int N;
vector<T> dat;
FenwickTree(int n, T m = 0)
{
init(n, m);
}
void init(int n, int m)
{
N = n;
dat.resize(n + 1);
for (int i = 0; i < dat.size... | {"0": 3214520452, "1": 3216237310, "2": 3219217144, "3": 3214783286, "4": 3214833336, "5": 3216227300, "6": 3216227300, "7": 3218955168, "8": 3217044116, "9": 3218287072, "10": 3216237310, "11": 3214785288, "12": 3214785288, "13": 3214785288, "14": 3214785288, "15": 3214785288, "16": 3214783286, "17": 3214783286, "18":... | [] | ok | 334,338,313,452 | s948478192 | #include <bits/stdc++.h>
using namespace std;
template <typename T>
class FenwickTree
{
public:
int N;
vector<T> dat;
FenwickTree(int n, T m = 0)
{
init(n, m);
}
void init(int n, int m)
{
N = n;
dat.resize(n + 1);
for (int i = 0; i < dat.size(); i++)
{
dat... | {"0": 1034935044, "1": 1035423246, "2": 1038862968, "3": 1034924176, "4": 1034920458, "5": 1036099064, "6": 1035349744, "7": 1038799190, "8": 1036729980, "9": 1037992670, "10": 1035423246, "11": 1034935330, "12": 1034935330, "13": 1034935330, "14": 1034935330, "15": 1034935330, "16": 1034924176, "17": 1034924176, "18":... | ok | 3.10601 | 3.106073 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 16.743706 | false | false | false | 3.116136 | 0.224729 | 0.072118 | 0.013156 | Accepted | Accepted | 0.013156 | 0.721315 | 4 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 16.710246 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s112671020 | train | cpp |
#include<bits/stdc++.h>
#define LL long long
#define MOD (LL)1000000007
#define pi acos(-1.0)
#define ULL unsigned long long
#define mem_1(str) memset(str,-1,sizeof(str))
#define mem0(str) memset(str,0,sizeof(str))
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define I... | {"0": 9920097902, "1": 9921143232, "2": 9921775006, "3": 9920187706, "4": 9920445964, "5": 9920844648, "6": 9920832064, "7": 9921864238, "8": 9920614990, "9": 9921931162, "10": 9921143232, "11": 9920187134, "12": 9920187134, "13": 9920187134, "14": 9920187134, "15": 9920187134, "16": 9920187706, "17": 9920187706, "18":... | [] | ok | 1,031,703,734,490 | s525225425 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls rt<<1
#define rs rt<<1|1
#define lb(x) (x&-x)
typedef pair<int,int> pii;
const int maxn = 4e5 + 10;
const int maxm = 1e6 + 10 ;
const int inf=0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fLL;
const int st=(1<<20)-1;
const int mod... | {"0": 1009938358, "1": 1010553830, "2": 1011101234, "3": 1010287564, "4": 1010153144, "5": 1010153144, "6": 1010132266, "7": 1011194756, "8": 1010750312, "9": 1010903036, "10": 1010553830, "11": 1010153144, "12": 1010153144, "13": 1010153144, "14": 1010153144, "15": 1010153144, "16": 1010287564, "17": 1010287564, "18":... | ok | 9.81959 | 9.819597 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 51.667855 | false | false | false | 9.851257 | 0.693682 | 0.070416 | 0.013156 | Accepted | Accepted | 0.013156 | 0.915859 | 6 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 51.564291 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s983775200 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
t... | {"0": 1221046684, "1": 1222232440, "2": 1225743948, "3": 1221220000, "4": 1221481976, "5": 1222402324, "6": 1222278772, "7": 1225041818, "8": 1222945152, "9": 1224858206, "10": 1222232440, "11": 1221137060, "12": 1221137060, "13": 1221137060, "14": 1221137060, "15": 1221137060, "16": 1221220000, "17": 1221220000, "18":... | [] | ok | 127,025,706,522 | s196092254 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) ... | {"0": 1036099064, "1": 1036085050, "2": 1037904582, "3": 1035943766, "4": 1036085050, "5": 1036606142, "6": 1036189440, "7": 1037904582, "8": 1036592128, "9": 1037436114, "10": 1036085050, "11": 1036203454, "12": 1036203454, "13": 1036203454, "14": 1036203454, "15": 1036203454, "16": 1035943766, "17": 1035943766, "18":... | ok | 1.179329 | 1.179333 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 6.361464 | false | false | false | 1.182211 | 0.085211 | 0.072077 | 0.013156 | Accepted | Accepted | 0.013156 | 0.182268 | 1 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 6.348831 | null | null | null | null | null | null | null | null | null | null | null |
p03703 | s278794553 | train | cpp | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#def... | {"0": 4446981396, "1": 4447229358, "2": 4450850690, "3": 4447080066, "4": 4447157286, "5": 4447413828, "6": 4446830960, "7": 4449777332, "8": 4449512496, "9": 4450748302, "10": 4447229358, "11": 4446931918, "12": 4446931918, "13": 4446931918, "14": 4446931918, "15": 4446931918, "16": 4447080066, "17": 4447080066, "18":... | [] | ok | 462,480,985,824 | s291822627 | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i,n) for( int i = ... | {"0": 1085456658, "1": 1086410754, "2": 1088748518, "3": 1085453226, "4": 1085481254, "5": 1086508852, "6": 1085972888, "7": 1088032946, "8": 1087517288, "9": 1088398740, "10": 1086410754, "11": 1085481254, "12": 1085481254, "13": 1085481254, "14": 1085481254, "15": 1085481254, "16": 1085453226, "17": 1085453226, "18":... | ok | 4.096531 | 4.096569 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 104 | 102 | 102 | 104 | 0 | 23.161107 | false | false | false | 4.11796 | 0.310658 | 0.07544 | 0.013156 | Accepted | Accepted | 0.013156 | 0.790643 | 5 | s087681343 | {"0": 192334142, "1": 192532626, "2": 192982218, "3": 192529480, "4": 192538918, "5": 192539204, "6": 192394774, "7": 192957622, "8": 192663900, "9": 192915866, "10": 192532626, "11": 192534342, "12": 192534342, "13": 192534342, "14": 192534342, "15": 192534342, "16": 192529480, "17": 192529480, "18": 192529480, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,623,354,894 | 23.114731 | null | null | null | null | null | null | null | null | null | null | null |
p02612 | s642345615 | train | cpp | #include <bits/stdc++.h>
using namespace std;
int solve() {
int n;
cin >> n;
cout << (n + 999) / 1000 * 1000 - n << '\n';
return 0;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
} | {"0": 1035275670, "1": 1035275670, "2": 1035282820, "3": 1035300838, "4": 1035282820, "5": 1035275670, "6": 1035282820, "7": 1035282820, "8": 1035275670, "9": 1035257080, "10": 1035275670, "11": 1035282820, "12": 1035275670, "13": 1035282820, "14": 1035275670, "15": 1035282820, "16": 1035275670, "17": 1035282820, "18":... | [] | ok | 106,656,983,576 | s568928573 | #include<stdio.h>
int main(){
int a=0, b;
scanf("%d", &b);
for(a=0;a<b;a+=1000){
a;
}
printf("%d", a-b);
return 0;
} | {"0": 193907142, "1": 193858236, "2": 193851944, "3": 193822772, "4": 193851944, "5": 193858236, "6": 193851944, "7": 193851944, "8": 193858236, "9": 193851944, "10": 193858236, "11": 193851944, "12": 193858808, "13": 193851944, "14": 193858236, "15": 193851944, "16": 193835642, "17": 193851944, "18": 193858236, "19": ... | ok | 5.34128 | 5.34128 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 103 | 103 | 103 | 103 | 0 | 5.393254 | false | false | false | 5.383335 | 0.105869 | 0.019666 | 0.019577 | Accepted | Accepted | 0.019577 | 0.998968 | 9 | s884406223 | {"0": 193893986, "1": 193893128, "2": 193828778, "3": 193810188, "4": 193828778, "5": 193892842, "6": 193828778, "7": 193828778, "8": 193892842, "9": 193826490, "10": 193892842, "11": 193828778, "12": 193893700, "13": 193828778, "14": 193893128, "15": 193828778, "16": 193894272, "17": 193828778, "18": 193893128, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,964,089,574 | 5.342442 | null | null | null | null | null | null | null | null | null | null | null |
p02612 | s521707637 | train | cpp | // In the name of God
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << (1000 - (n % 1000)) % 1000;
return 0;
}
| {"0": 1034960784, "1": 1034960784, "2": 1034978230, "3": 1034979088, "4": 1034978230, "5": 1034960784, "6": 1034978230, "7": 1034978230, "8": 1034960784, "9": 1034989098, "10": 1034960784, "11": 1034978230, "12": 1034960784, "13": 1034978230, "14": 1034960784, "15": 1034978230, "16": 1034960784, "17": 1034978230, "18":... | [] | ok | 106,601,659,450 | s884406223 | #include <stdio.h>
int main(){
int n;
scanf ("%d", &n);
int uang;
while(uang<n){
uang=uang+1000;
}
if(uang==n){
puts("0");
}
else if(uang>=n){
printf("%d", uang-n);
}
return 0;
} | {"0": 193893986, "1": 193893128, "2": 193828778, "3": 193810188, "4": 193828778, "5": 193892842, "6": 193828778, "7": 193828778, "8": 193892842, "9": 193826490, "10": 193892842, "11": 193828778, "12": 193893700, "13": 193828778, "14": 193893128, "15": 193828778, "16": 193894272, "17": 193828778, "18": 193893128, "19": ... | ok | 5.33967 | 5.33967 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 103 | 103 | 103 | 103 | 0 | 5.390456 | false | false | false | 5.369711 | 0.10572 | 0.019688 | 0.019577 | Accepted | Accepted | 0.019577 | 0.99871 | 9 | s884406223 | {"0": 193893986, "1": 193893128, "2": 193828778, "3": 193810188, "4": 193828778, "5": 193892842, "6": 193828778, "7": 193828778, "8": 193892842, "9": 193826490, "10": 193892842, "11": 193828778, "12": 193893700, "13": 193828778, "14": 193893128, "15": 193828778, "16": 193894272, "17": 193828778, "18": 193893128, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,964,089,574 | 5.33967 | null | null | null | null | null | null | null | null | null | null | null |
p02612 | s774495874 | train | cpp | #include <iostream>
using namespace std;
int main()
{
int n, change;
cin >> n;
cout << (1000 - n % 1000) % 1000 << endl;
return 0;
} | {"0": 1022152560, "1": 1022152560, "2": 1021884292, "3": 1021950358, "4": 1021884292, "5": 1022152560, "6": 1021884292, "7": 1021884292, "8": 1022152560, "9": 1021894874, "10": 1022152560, "11": 1021884292, "12": 1022152560, "13": 1021884292, "14": 1022152560, "15": 1021884292, "16": 1022152560, "17": 1021884292, "18":... | [] | ok | 105,274,439,556 | s112968777 | #include <stdio.h>
int main(void)
{
int N, change;
// printf("Start!\n");
scanf("%d", &N);
change = (10000 - N)%1000;
printf("%d", change);
} | {"0": 193841648, "1": 193841648, "2": 193841648, "3": 193843936, "4": 193841648, "5": 193841648, "6": 193841648, "7": 193841648, "8": 193841648, "9": 193841648, "10": 193841648, "11": 193841648, "12": 193841648, "13": 193841648, "14": 193841648, "15": 193841648, "16": 193841648, "17": 193841648, "18": 193841648, "19": ... | ok | 5.272353 | 5.272353 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 103 | 103 | 103 | 103 | 0 | 5.323343 | false | false | false | 5.327724 | 0.104565 | 0.019627 | 0.019577 | Accepted | Accepted | 0.019577 | 0.999418 | 10 | s884406223 | {"0": 193893986, "1": 193893128, "2": 193828778, "3": 193810188, "4": 193828778, "5": 193892842, "6": 193828778, "7": 193828778, "8": 193892842, "9": 193826490, "10": 193892842, "11": 193828778, "12": 193893700, "13": 193828778, "14": 193893128, "15": 193828778, "16": 193894272, "17": 193828778, "18": 193893128, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,964,089,574 | 5.27319 | null | null | null | null | null | null | null | null | null | null | null |
p02612 | s902305374 | train | cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x=0,y;
cin>>n;
while(1000*x<n)
{
x++;
}
cout<<((1000*x)-n)<<endl;
return 0;
} | {"0": 1022213478, "1": 1022008130, "2": 1022008130, "3": 1022008130, "4": 1022008130, "5": 1022008130, "6": 1022008130, "7": 1022008130, "8": 1022008130, "9": 1021871136, "10": 1022008130, "11": 1022008130, "12": 1022207472, "13": 1022008130, "14": 1022008130, "15": 1022008130, "16": 1022207472, "17": 1022008130, "18":... | [] | ok | 105,278,530,214 | s875921398 | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i >= 0; i++) {
if(i * 1000 >= N) {
printf("%d", i*1000-N);
break;
}
}
return 0;
} | {"0": 193863956, "1": 193849084, "2": 193812190, "3": 193788166, "4": 193812190, "5": 193813334, "6": 193812190, "7": 193812190, "8": 193813334, "9": 193804754, "10": 193813334, "11": 193812190, "12": 193857950, "13": 193812190, "14": 193849084, "15": 193812190, "16": 193871392, "17": 193812190, "18": 193849084, "19": ... | ok | 5.273086 | 5.273086 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 103 | 103 | 103 | 103 | 0 | 5.32355 | false | false | false | 5.325218 | 0.104489 | 0.019621 | 0.019577 | Accepted | Accepted | 0.019577 | 0.999477 | 10 | s884406223 | {"0": 193893986, "1": 193893128, "2": 193828778, "3": 193810188, "4": 193828778, "5": 193892842, "6": 193828778, "7": 193828778, "8": 193892842, "9": 193826490, "10": 193892842, "11": 193828778, "12": 193893700, "13": 193828778, "14": 193893128, "15": 193828778, "16": 193894272, "17": 193828778, "18": 193893128, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 19,964,089,574 | 5.273395 | null | null | null | null | null | null | null | null | null | null | null |
p02303 | s471684736 | train | cpp | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
typedef complex<double> C;
namespace std
{
bool operator < (const C& a, const C& b) {
return real(a) != real(b) ? real(a) ... | {"0": 2723316310, "1": 2721524234, "2": 2724156578, "3": 2721855422, "4": 2726924200, "5": 2721536246, "6": 2726601020, "7": 2722031312, "8": 2722704556, "9": 2727741874, "10": 2723722430, "11": 2727575136, "12": 2723946654, "13": 2724141420, "14": 2728508926, "15": 2723701552, "16": 2728849552, "17": 2724051330, "18":... | [] | ok | 280,698,826,408 | s116409273 | #include <bits/stdc++.h>
#define EPS 1e-12
#define rep(i,n) for(int i=0;i<(int)(n);++i)
using namespace std;
typedef complex<double> C;
const double PI = 4*atan(1.0);
namespace std
{
bool operator < (const C a, const C b) {
return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.im... | {"0": 1073330544, "1": 1072000930, "2": 1073685184, "3": 1072224868, "4": 1075660586, "5": 1071845060, "6": 1075723506, "7": 1072988774, "8": 1073085442, "9": 1076077002, "10": 1073596238, "11": 1076269194, "12": 1073757256, "13": 1073363720, "14": 1076151362, "15": 1073023094, "16": 1076363860, "17": 1073426640, "18":... | ok | 2.537262 | 2.537262 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 103 | 103 | 103 | 103 | 0 | 14.193913 | false | false | false | 2.561335 | 0.280247 | 0.109415 | 0.023055 | Accepted | Accepted | 0.023055 | 0.664223 | 4 | s398239653 | {"0": 1032478304, "1": 1031521634, "2": 1032854394, "3": 1031776746, "4": 1033988098, "5": 1031701242, "6": 1033509906, "7": 1032433402, "8": 1032105074, "9": 1034129382, "10": 1032952778, "11": 1034306988, "12": 1032966792, "13": 1032317286, "14": 1034096206, "15": 1031768166, "16": 1034157410, "17": 1032413382, "18":... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 8... | 106,387,601,320 | 2.638454 | null | null | null | null | null | null | null | null | null | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.