source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <cmath>
using namespace std;
const int N = 1000000;
bool need[N];
long long a[N];
int n, k;
long long f(int i, long long x) {
long long ans = 0;
while(i < n && need[i]) {
ans += abs(x);
x++;
i += k;
}
return ans... | C++ | d42e599073345659188ffea3b2cdd4c7 | 1f74cbb34d0ea401bcdc6a00430a5faf | 2,200 | PASSED |
#include <stdio.h>
long long Sum[200001];
int main()
{
int n, m;
long long a, b;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i) {
scanf("%I64d", &a);
Sum[i] = Sum[i - 1] + a;
}
while(m--) {
scanf("%I64d", &b);
int l = 0;
int r = n;
while(l <... | C | 56bdab2019ee12e18d4f7e17ac414962 | ce7fcefddfdddd4926e8797ac54b1d4b | 1,000 | PASSED |
#include<stdio.h>
#define N 200002
int main(){
int n,m;
scanf("%d%d",&n,&m);
int i,j;
long long sum[N];
long long a[N];
sum[0]=0;
for(i=1;i<=n;i++){
scanf("%lld",&a[i]);
sum[i]=sum[i-1]+a[i];
}
/*
for(i=0;i<=n;i++){
printf(" %d:%lld",i,sum[i]);
}
p... | C | 56bdab2019ee12e18d4f7e17ac414962 | bf61923d19e234bdd248c75e508f1e48 | 1,000 | PASSED |
#include<stdio.h>
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r", stdin);
freopen("output.txt","w", stdout);
#endif
int n,m,i,j;
scanf("%d%d",&n,&m);
int long long dorm[n+1],letter[m];
dorm[0]=0;
for (i=1;i<=n;i++)
{
scanf("%lld",&dorm[i]);
dorm[i]+=dorm[i-1];
}
for(i=0;i<m;i++)
scanf("%... | C | 56bdab2019ee12e18d4f7e17ac414962 | 3dc973896a4744435767c732f279a1a4 | 1,000 | PASSED |
#include<stdio.h>
int main()
{
int n,m,i,j,a=1;
scanf("%d %d",&n,&m);
long long int x[n+1],y[m]; x[0]=0;
for(i=1;i<=n;i++)
{
scanf("%lld",&x[i]);
x[i]+=x[i-1];
}
for(i=0;i<m;i++)
{
scanf("%lld",&y[i]);
for(j=a;y[i]>x[j];j++); a=j;
printf("... | C | 56bdab2019ee12e18d4f7e17ac414962 | 463f6e05827481e90e13a2ec2172d555 | 1,000 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,m;
long long x,k=0;
long long dorm[200001]={0},lett[200001]={0},d[200001]={0};
scanf("%d %d",&n,&m);
for (int i=0; i<n; i++)
{
scanf("%I64d",&x);
if (i==0)
dorm[i]=x;
else
dorm[i]=dorm[i-1]... | C | 56bdab2019ee12e18d4f7e17ac414962 | 69374ef0371e1136b51730d116d6b314 | 1,000 | PASSED |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<ctype.h>
#include<stdbool.h>
#include<math.h>
#define INFINI 10000000
#define LLD "%l" "ld"
struct element
{
int value;
int pos;
};
typedef struct element element;
element tab[1001];
int compare(const void * p1,const void * p2)
{
element ... | C | 56bdab2019ee12e18d4f7e17ac414962 | 9662c31c87c4c1cb91fb761bbe4b4a25 | 1,000 | PASSED |
#include<stdio.h>
int main()
{
long long int n,m,i,comp,p,ara[200005],low,high,mid,ans;
scanf("%lld%lld",&n,&m);
ara[0]=0;
for(i=1;i<=n;i++){
scanf("%lld",&ara[i]);
ara[i]=ara[i]+ara[i-1];
}
ara[n+1]=ara[n]+1;
for(i=1;i<=m;i++){
scanf("%lld",&comp);
... | C | 56bdab2019ee12e18d4f7e17ac414962 | 6966aaa4bce6b2719d7d903df55cfa49 | 1,000 | PASSED |
#include<stdio.h>
int main()
{
int n,m,i,x,y,j;
scanf("%d %d",&n,&m);
long long int a[n],p,b[m],s=0;
for(i=0;i<n;i++)
scanf("%lld",&a[i]);
a[n]=0;
for(i=0;i<m;i++)
scanf("%lld",&b[i]);
i=0;
s=0;
for(j=0;j<m;j++){
while(i<n+1){
if(s<b[j]){
p=s;
s=s+a[i];
i++;
}
if(s>=b[j]){
x=i;
pr... | C | 56bdab2019ee12e18d4f7e17ac414962 | ec28f4ccf4c2fe8d7d50ade151f856d4 | 1,000 | PASSED |
#include<stdio.h>
#define MAX 200000
typedef long long ll;
ll main()
{
ll n,m,a[MAX],b,add=0,l=0;
scanf("%lld %lld %lld",&n,&m,&a[0]);
for(ll i=1;i<n;i++)
{
scanf("%lld",&add);
a[i]=a[i-1]+add;
}
while(m--)
{
scanf("%lld",&b);
ll r=n-1,mid;
while(r>l)
... | C | 56bdab2019ee12e18d4f7e17ac414962 | d061edcd3eec9ac3749c29182ce98681 | 1,000 | PASSED |
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
int binsearch(int n, long long int size[], long long int room) {
int lo = 0;
int hi = n;
while (hi > lo) {
int mid = (hi+lo)/2;
if (size[mid] >= room) {
hi = mid;
} else {
lo = mid+1;
}
}
if (size[lo] >= room) {
lo--;... | C | 56bdab2019ee12e18d4f7e17ac414962 | e44fd4c31e04f90ff8200416326115da | 1,000 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <iomanip>
using namespace std;
#define INF 0x4f4f4f4f
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long ll;
int main(int a... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | d150dd89587b6155ee9e12dd9b359b3a | 1,800 | PASSED |
#include<iostream>
#include<vector>
#include <algorithm>
#include<cmath>
using namespace std;
int main()
{
int n,x=0;
vector <int> a;
vector <int> b;
cin>>n;
for(int i=0;i<
2*n-1;i++){int c;cin>>c;
a.push_back(c);
b.push_back(abs(c));
... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | ecb82ef26c73864922b446f1ba64a62d | 1,800 | PASSED |
#include <cstdio>
#include <algorithm>
#define SIZE 256
using namespace std;
int n;
int a[SIZE];
int main()
{
while(~scanf("%d",&n))
{
int neg = 0,sum = 0;
for(int i=1; i<2*n; i++)
{
scanf("%d",&a[i]);
sum += a[i] > 0? a[i]:(-a[i]);
if(a[i] < 0)
... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | 853d94a08562836d46b9f3c69bfb6946 | 1,800 | PASSED |
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int n;
cin>>n;
int l = 2*n - 1;
int neg = 0;
int x,mn=-1;
int sum=0;
cin>>x;
neg += (x<0);
x = abs(x);
mn = x;
sum+=x;
f... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | 507af2b5ff3a1f4661b8751bb4f79634 | 1,800 | PASSED |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <vector>
#include <queue>
using namespace std;
#define pb push_back
#define ... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | c21af4a73fe18fffec6973d2335b17eb | 1,800 | PASSED |
/*
* main.cpp
*
* Created on: 2013-5-6
* Author: Administrator
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
int a[1000];
int cntm, cntz;
int n, m;
int ans;
int main() {
cntm = cntz = 0;
scanf("%d", &n);
for (int i = 0; i < 2*... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | 825c6152b5b394ad9ec707fefa0b8fe0 | 1,800 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a, n, m=1000000000, i, sum=0, nn=0;
cin>>n;
for(i=0;i<2*n-1;i++) {
cin>>a;
if(a < 0) {
a = -a;
nn++;
}
sum += a;
m = min(m, a);
}
if(n % 2 == 1 || nn % 2 == 0) cout << sum << endl;
else cout << sum - 2*m << endl;
retu... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | 6bd850a5ecea5d4f39aa46e99be3de08 | 1,800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
#define N 105
using namespace std;
int A[2*N-1];
int main(){
int n;
cin>>n;
int ct=0;
int s=0,mini=1<<30;
for(int i=0;i<2*n-1;i++){
cin>>A[i];
if(A[i]<0){
ct++;
A[i]*=-1;
}
mini=min(A[i... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | b432a9078ebb7bffa041bdc4d58de72e | 1,800 | PASSED |
# include <iostream>
# include <fstream>
# include <sstream>
# include <algorithm>
# include <numeric>
# include <cstdio>
# include <cmath>
# include <cstdlib>
# include <cstring>
# include <vector>
# include <list>
# include <set>
# include <map>
# include <stack>
# include <queue>
# include <cctype>
# include <climit... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | 6d951f22e9d7acd51dc856a7f73db639 | 1,800 | PASSED |
# include <iostream>
# include <fstream>
# include <sstream>
# include <algorithm>
# include <numeric>
# include <cstdio>
# include <cmath>
# include <cstdlib>
# include <cstring>
# include <vector>
# include <list>
# include <set>
# include <map>
# include <stack>
# include <queue>
# include <cctype>
# include <climit... | C++ | 9b907b3e96e78c84d11032a0f0b0fa53 | 0a99313a6cc99139b5084fb0c0faf378 | 1,800 | PASSED |
/*
∧＿∧
( ･ω･｡)つ━☆・*。
⊂ ノ ・゜
しーＪ Accepted
*/
// #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define all(x) begin(x), end(x... | C++ | 3c93a76f986b1ef653bf5834716ac72a | da36ffe6662e5977d49e6b6082b51fcd | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char s[200005];
int n, i, j, res = 0, v[200005];
//freopen("in.in", "r+", stdin);
cin >> n;
do
{
cin >> s;
for(i = 0; s[i]; ++i)
if(s[i] == '1')
v[i] = i;
else
v... | C++ | 3c93a76f986b1ef653bf5834716ac72a | c040d87e179f6b9d806d912453ba8a3a | 1,700 | PASSED |
#include <bits/stdc++.h>
#define ENDL "\n"
typedef long long int lli;
typedef unsigned long long int ulli;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lli t;
cin>>t;
while(t--)
{
string s;
cin>>s;
lli cnt=0;
lli... | C++ | 3c93a76f986b1ef653bf5834716ac72a | 139b3408b61d34eb93db2510697e22a9 | 1,700 | PASSED |
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#define ll long long
using namespace std;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
char s[maxn];
int v[maxn];
int main()
{
int t;
scanf("%d", &t);
wh... | C++ | 3c93a76f986b1ef653bf5834716ac72a | 26561de4cedd8c6df81ed01cc0aa6f17 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree
<T, null_t... | C++ | 3c93a76f986b1ef653bf5834716ac72a | 6f9aef3141b4cec9ca68a161757df862 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gcd __gcd
#define nof1 __builtin_popcountll
#define noflea... | C++ | 3c93a76f986b1ef653bf5834716ac72a | 39279953cdf529ff73a22def47f90ab4 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gcd __gcd
#define nof1 __builtin_popcountll
#define noflea... | C++ | 3c93a76f986b1ef653bf5834716ac72a | cf338f42f9cb75ffbbf77cee7d4d2354 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = int(3e5) + 99;
int t;
string s;
int nxt[N];
int main() {
cin >> t;
for(int tc = 0; tc < t; ++tc){
cin >> s;
for(int i = 0; i < s.size(); ++i)
if(s[i] == '1') nxt[i] = i;
else nxt[i] = (i == 0? -1 : nxt[i - 1]);
int res = 0;
for(int r = 0;... | C++ | 3c93a76f986b1ef653bf5834716ac72a | 52a36460d94eb65415dd61c47d931044 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int cnt[200005];
void query(){
int n,ans=0;
string s;
cin>>s;
n=s.size();
for(int now=0,i=1; i<n; ++i){
if(s[i-1]=='1') cnt[i]=now=0;
else cnt[i]=++now;
}
for(int i=0; i<n; ++i){
if(s[i]=='0') continue;
int num=0;... | C++ | 3c93a76f986b1ef653bf5834716ac72a | d80b6c2e7a339d1871220e4cf3162601 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define ini(arr, val) memset(arr, (val), sizeof(arr))
#define loop(i,n) for(ll i=0; i<n; i++)
#define loop1(i,n) for(ll i=1; i<=n; i++)
#define all(a) (a).begin(),(a).end()
#define exist(s,e) (s.find(e)!=s.end())
#define dbg(x) cout ... | C++ | 3c93a76f986b1ef653bf5834716ac72a | ce6851e13a4119446c78899745087339 | 1,700 | PASSED |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define N 1e9+5
typedef vector<int> v;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while(t--){
int n;
cin >> n;
int a[n+5];
for(int i(0); i < n; ++... | C++ | 1eaff8e0ec4614753699128af74b2471 | 72ada3ac200ad352ce604fd607bfb7c1 | 800 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int root(int arr[],int i){
while(arr[i]!=i){
arr[i]=arr[arr[i]];
i=arr[i];
}
return i;
}
void Union(int arr[],int Size[],int a,int b){
int rootA=ro... | C++ | 1eaff8e0ec4614753699128af74b2471 | d03b54f29edc1297377dcc9bd3a2e82b | 800 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int arr[n] ={0};
for(int i=0; i<n; i++){
cin>>arr[i];
}
int s =0;
int e = n-1;
int temp = 0;
while(... | C++ | 1eaff8e0ec4614753699128af74b2471 | 8f4c88945d965605d13dc7e3f436d40f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int in;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
in t;
cin>>t;
while(t--)
{
in n,i;
cin>>n;
in a[n];
for(i=0;i<n;++i)
cin>>a[i];
for(i=n-1;i>=0;--i... | C++ | 1eaff8e0ec4614753699128af74b2471 | c1d88ae4c145acbdfb84ee071cf6cd84 | 800 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
vector<int> origin;
vector<int> arr;
vector<int> ans;
int n;
bool finish = false;
int visited[10001];
bool visitedonenum[101];
bool chk() {
for(int i=0;i<n;++i) {
if(origin[i] != ans[i]) {
... | C++ | 1eaff8e0ec4614753699128af74b2471 | 9421b63c52da32f95c1f4895586f50df | 800 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t;cin>>t;
while(t--){
int a[100],n;cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=n-1;i>=0;i--)cout<<a[i]<<" ";
cout<<endl;
}
return 0;
} | C++ | 1eaff8e0ec4614753699128af74b2471 | 61bedceca8665aaec2d3f14adc05e038 | 800 | PASSED |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define eb emplace_back
#define pii pair<int,i... | C++ | 1eaff8e0ec4614753699128af74b2471 | 23e75245b3d4a0f06f0360d891be3b5d | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
int res=0;
reverse(v.begin(),v.end());
for(int i=0;i<n;i++){
cout<<v[i]... | C++ | 1eaff8e0ec4614753699128af74b2471 | d8277bda0430ee6a09aad9260356553b | 800 | PASSED |
//A
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
#define MAX 100000
#define INF 987654321
#define MOD 1000000007
using namespace std;
using ll=long long;
using pii=pair<int, int>;
const int dx[]={0, 0, 1, -1, -1, -1, 1, 1};
const int dy[]={1, -1, 0, 0, -1, 1, -1, 1};
int main()
{
... | C++ | 1eaff8e0ec4614753699128af74b2471 | 813c2d996dbecb97d948d7b60b031ef6 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int p[1005];
int main(){
int tc,n;
cin>>tc;
while(tc--){
cin>>n;
for(int i=0;i<n;i++)
cin>>p[i];
for(int i=n-1;i>=0;i--)
cout<<p[i]<<" ";
cout<<"\n";
}
return 0;
}
| C++ | 1eaff8e0ec4614753699128af74b2471 | 6df27658900c633bd9232e72b7aebd06 | 800 | PASSED |
#include <iostream>
#include <vector>
int main(int argc, char const *argv[])
{
int n, k, c;
std::cin >> n >> k >> c;
std::vector<int> holidays(c + 1);
holidays[0] = 0;
for (int i = 1; i < c + 1; ++i)
{
std::cin >> holidays[i];
}
int num_of_presents = 0;
for (int i = 0; i < c; ++i)
{
num_of_presents +=... | C++ | 07b750dbf7f942eab80d4260103c7472 | 4b58134b80831e97e7c5a8615f3ad637 | 1,300 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | C++ | 07b750dbf7f942eab80d4260103c7472 | f5cb0420c6c67bfebbfa4e82a3263a97 | 1,300 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | C++ | 07b750dbf7f942eab80d4260103c7472 | 7741b33a89a6c8505fec6d24d16352b5 | 1,300 | PASSED |
#include<cstdio>
using namespace std;
int n, k, a[370], c, present, l, last;
int main()
{
scanf("%d %d", &n, &k);
scanf("%d", &c);
for(int i = 0; i < c; i++)
scanf("%d", a+i);
last = 0;
if(c > 0 && a[0] == 0)
present++;
for(int i = 1; i <= n; i++)
{
while(a[l] < i && l <= n)
l++;
i... | C++ | 07b750dbf7f942eab80d4260103c7472 | f7d1f7440c07a685d54aa6ccea0540d3 | 1,300 | PASSED |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int n, k, c, x, y = 0, ans = 0;
cin >> n >> k >> c;
bool days[n+1];
for(int i = 0; i <= n; i++) days[i] = false;
while(c--) {
cin >> x;
days[x] = true;
}
x = 0;
while(x <= n) {
if(days[x] || y == k) {
y = 0;
... | C++ | 07b750dbf7f942eab80d4260103c7472 | b25a5e20adfc660949ce2fbc5cd18418 | 1,300 | PASSED |
///////////////////////////////////////////////////
#include <iostream>
#include <cstdio>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <cassert>
#include <map>
#include <string>
#include <cstring>
using namespace std;
#define mp m... | C++ | 07b750dbf7f942eab80d4260103c7472 | 62c8f454fc18a28435dfc15c81316a65 | 1,300 | PASSED |
/*
* p1.cpp
*
* Created on: Oct 24, 2014
* Author: Ayman Mostafa
*/
#include <bits/stdc++.h>
using namespace std;
long long min(long long x[3])
{
int min,z=0;
if(x[0]>0) min=0;
else if(x[1]>0) min=1;
else if(x[2]>0) min=2;
while(z++<3)
if(x[z-1]<x[min]&&x[z-1]>0)
min=z-1;
return x[min];
}
void swa... | C++ | 07b750dbf7f942eab80d4260103c7472 | a506836fe777d3b986740d074708fbb3 | 1,300 | PASSED |
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n,k,c;
cin>>n>>k>>c;
if(k==1)cout<<n;
else{
int present=0,x[c],day=0;
for(int i=0;i<c;i++)cin>>x[i];
int i=0;
while(day<=n)
{
int temp=day+k;
if(x[i]<... | C++ | 07b750dbf7f942eab80d4260103c7472 | 5cfc2c569cc3f6f45aaaec8e89994fb8 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n , k , c ,x ;
vector<int> vec ;
cin >> n >> k >> c ;
if(!c)return cout << n/k << endl,0 ;
bool l = true ;
for(int i = 0;i<c;i++){
cin >> x ;
if(!i&&x)vec.push_back(0);
vec.push_back(x);
if(i==c-1&&x... | C++ | 07b750dbf7f942eab80d4260103c7472 | 32848a210365c34b5a82baa28fbced3b | 1,300 | PASSED |
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stdlib.h>
#include<math.h>
#include<string>
using namespace std;
int main()
{
int n,k,c,p=0,m=0,i,l=0;
cin>>n>>k>>c;
int h[c];
for(i=0;i<c;i++)
cin>>h[i];
for(i=0;i<=n;i++)
{
if... | C++ | 07b750dbf7f942eab80d4260103c7472 | e2f57596e65dc2ad0e6058b3de7ac93e | 1,300 | PASSED |
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class C {
static long[][] trees;
public static void main(String[] args) throws Throwable{
BufferedReader in =new BufferedReader(new InputStreamReader(System.in));
i... | Java | a850dd88a67a6295823e70e2c5c857c9 | 5724a31830057dfe111ef69ecdd87722 | 1,500 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Problem545C {
public static void main(String[] args) {
InputReader in = new InputReader();
PrintWriter out = new PrintWriter(System.out);
new P... | Java | a850dd88a67a6295823e70e2c5c857c9 | 7870221167d44be7e0bb8ff095da91c7 | 1,500 | PASSED |
import java.util.Scanner;
public class WoodCutters {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
long n=sc.nextInt();
long[] position=new long[(int) (n+1)];
long[] height=new long[(int) (n+1)];
for(int i=1;i<=n;i++)
{
position[i]=sc.nextInt();
height[i]=sc.nextInt... | Java | a850dd88a67a6295823e70e2c5c857c9 | 03e16cd05ee4cdda25af43ed925563f2 | 1,500 | PASSED |
import java.util.Scanner;
public class Main {
public static void main(String []args){
Scanner s=new Scanner(System.in);
int n=s.nextInt();
long p[][]=new long[n][2];
int i,j;
for(i=0;i<n;i++){
p[i][0]=s.nextLong();
p[i][1]=s.nextLong();
}
int count=2;
long occup=0;
for(i=1;i<n-1;i++){
if(p[... | Java | a850dd88a67a6295823e70e2c5c857c9 | 1478effc9f62bf74b088d0a7864bc90b | 1,500 | PASSED |
//package codeforces;
import java.util.Scanner;
/**
* Created by nitin.s on 30/05/15.
*/
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] x = new int[n];
int[] h = new int[n];
for(int i = 0; i < ... | Java | a850dd88a67a6295823e70e2c5c857c9 | 29b3c96716b1b1722a528ed19d5c06c4 | 1,500 | PASSED |
//package c303;
import java.util.Scanner;
public class q3
{
public static void main(String rag[])
{
Scanner s=new Scanner(System.in);
int n=s.nextInt();
long x[]=new long[n];
long h[]=new long[n];
for(int i=0;i<n;i++)
{
x[i]=s.nextLong();
... | Java | a850dd88a67a6295823e70e2c5c857c9 | 92d93229d89089904f499cf20421f57a | 1,500 | PASSED |
import java.util.Scanner;
/**
* Created by yakoub on 04/09/15.
*/
public class WoodCutter {
public static void main(String args[]) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int steady[] = new int[n];
int left[] = new int[n];
int right[] = new i... | Java | a850dd88a67a6295823e70e2c5c857c9 | 5a71293ec5213af59a6ae5072e85d29e | 1,500 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class WoodCutters {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));... | Java | a850dd88a67a6295823e70e2c5c857c9 | 049bc4524261a2b9c05cef19945f372f | 1,500 | PASSED |
import java.util.Scanner;
public class Test
{
private static int[] x = new int[100010];
private static int[] h = new int[100010];
private static int[][] dp = new int[100010][3]; // dp[i][0] 表示向左倒， dp[i][1]表示不动，dp[i][2]表示向右倒
// srm 168 div2
public static void main(String[] args)
... | Java | a850dd88a67a6295823e70e2c5c857c9 | 08a64d09cd2216adc42ad2c207904d93 | 1,500 | PASSED |
//package srm303;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Woodcuters {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.... | Java | a850dd88a67a6295823e70e2c5c857c9 | 88c4ae2950fdd4c3ec866b78c17db772 | 1,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
int m,n;
double a[100005];//a[i]是第i的概率
cin>>m>>n;
double k=0;
for(int i=1;i<=m;i++)
{
a[i] = pow(i*1.0/m , n);
a[i] -= k; //k存的是前几项的概率和
k += a[i];
}
double sum=0;
for(int i=1;i<=m;i++)
{
sum+= a[i]*i;
}
printf("%.... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | c5dfce890067d498d83cf52794ec7e4a | 1,600 | PASSED |
#include <iostream>
using namespace std;
double lgput(double n,int k)
{
if(k == 1)
return n;
if(k & 1)
return 1.0*lgput(n,(k>>1))*lgput(n,(k>>1))*n;
else
return 1.0*lgput(n,(k>>1))*lgput(n,(k>>1));
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
double rez... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | 9dfb2a0fada8ce0f82dde1c6dd28f184 | 1,600 | PASSED |
/// __Macro's__
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define II pair<int,int>
#define III pair<int, II>
#define VL vector<ll>
#define VI vector<int>
#define VII vector<II>
#define VIII... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | 39e7800229a6dc77d871069f5ab83a7d | 1,600 | PASSED |
#include <bits/stdc++.h>
#define Long long long
#define forn(i, n) for(int i = 0; i < n; ++i)
#define rep(a, b, n) for(int i = 0; i < b; ++i)
#define fi first
#define se second
#define pii pair<int, int>
#define pb push_back
#define psi pair<int, pii>
#define endl '\n'
using namespace std;
const int MAXN = 100 * 1000 ... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | 40e0e557ef2f2da5f7fb81cae07bd070 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
double n , m;
cin >> n >> m;
double ans = pow(1.0 / n , m);
for(int i = 2 ; i <= n ; i++)
ans += i * (pow((double)(i / n) , m) - pow((double)((i - 1) / n) , m));
cout << std::setprecision(13) << ans;
return 0;
}
| C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | 85ecd23e6c83a89858605203fc20248c | 1,600 | PASSED |
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
// ios_base::sync_with_stdio(false);
int n,m;
double ans=0.0,btm;
cin>>n>>m;
for(int i=1;i<=n;++i)
{
ans+=(pow((double)i/n,m)-pow((double)(i-1)/n,m... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | f06fe6ba93121fcffa14460978dfa858 | 1,600 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <cstring>
#include <vector>
#include <cmath>
/*double pow(double a,int n)
{
double ans=1.0;
for(int i=1;i<=n;i++)
ans*=a;
return ans;
}*/
using namespace std;
int main()
{
double m,n,ans;
while(scanf("%lf%lf",... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | a3450b8f4ff5a070fa92f2dd7a171562 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double n,m;
cin>>m>>n;
long double ans=0;
for(long double i=1;i<=m;i++)
{
ans+=(i*(pow(i/m,n)-pow((i-1)/m,n) ) );
}
cout<<setprecision(10)<<ans;
return 0;
} | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | ff77d0c465f891e63820f647b7de5e00 | 1,600 | PASSED |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <tuple>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <sstream... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | 25de1b16b1290e92202cc704a37c0fa6 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int,int> > vp;
#define pb push_back
#define mp make_pair
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
double m,n;
cin>>m>>n;
double ans=0;
for(int i=1;i<=m;i++)
ans-=pow(1-(1.0*i/m),n);
ans+=m;
pri... | C++ | f70ac2c4e0f62f9d6ad1e003aedd86b2 | 8af372d95d0d7f88e52d7c1fd84932fc | 1,600 | PASSED |
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
struct node{
int x,y;
}a[400005];
int b[400005];
bool cmp(node m,node n)
{
return m.y>n.y;
}
int main()
{
int n,k;
while(cin>>n>>k)
{
for(int i=0;i<400005;i++)a[i].y=0;
for(int i=0;i<n;i++)
{
... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | 8a1288037da503afd97a5dc2ad30eb3a | 1,600 | PASSED |
#include<bits/stdc++.h>
#define foru(i,a,b) for(int i=a;i<=b;i++)
#define ford(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
const int N=2*1e5+1;
struct so{
int f,v;
};
int a[N];
so d[N];
int n,k;
bool sosanh(so a,so b){
return a.f>b.f;
}
int check(int m){
int i=0;
int s=0;
while (s<k && i<n) {
... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | f4de198ce662b7d1c0aedccb9becbf00 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define For(n) for(ll i=0;i<n;i++)
#define Forj(n) for(int j=0;j<n;j++)
typedef long long ll;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define M 1e15+1
bool p(int x,int k,map<int,int> &mp)
{
int c=0;
for(auto i:mp)
c+=i.second/x;
return c>=k;
}
int main()
{
std:... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | 87de9c2b39314e1bdfff72c21b58518a | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define For(n) for(ll i=0;i<n;i++)
#define Forj(n) for(int j=0;j<n;j++)
typedef long long ll;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define M 1e15+1
bool p(int x,int k,map<int,int> &mp)
{
int c=0;
for(auto i:mp)
c+=i.second/x;
return c<k;
}
int main()
{
std::... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | e6f0443bb5a860b45bcc12c1b7db03fc | 1,600 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int a[200010] = {0};
pair<int,int> p[200010];
vector<int> t;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i,j,n,k;
cin >> n >> k;
for(i=0;i<n;i++){
int c;
cin >> c;
a[c-1]++;
}
for(i=0;i<2... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | bc83b755d51cb597f09ea1d230978597 | 1,600 | PASSED |
// https://codeforces.com/contest/1077/problem/D
#include <bits/stdc++.h>
#define watch(x) cerr << (#x) << " is " << (x) << endl;
using namespace std;
#define endl '\n'
#define cerr if(false) cerr
#define pii pair<int, int>
#define fi first
#define se second
signed main() {
ios::sync_with_stdio(0);
cin.sync_wi... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | c66665898b37e839c967eeadb1290ab2 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> freqq;
vector<int> get(int cut, int k){
vector<int> resp;
for(int i = freqq.size()-1; i>=0 && k > 0; --i){
int x = freqq[i].first/cut;
while(x-- && k--){
resp.push_back(freqq[i].second);
}
}
retur... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | b9b1c3f39d793520f2555ab0b59f2378 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, k, a[N], vis[N];
vector< pair<int, int> > ans;
int main() {
cin>>n>>k;
for (int i = 0; i < n; i++) {
cin>>a[i];
vis[a[i]]++;
}
for (int i=0; i<N; i++) {
for (int j = 1; j <= vis[i]; j++) {
ans.push_back({vis[i]/j,i});
}... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | 53b3368d16ae96e93f96710e2b88e314 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
vector<int> a(200010),b(200010,1);
for(int i=0;i<n;i++)
{
int t;
cin>>t;
a[t]++;
}
priority_queue<pair<int, int> > pq;
for(int i=0;i<a.size();i++)
{
if(a[i]!=0)
{
pq.push(make_pair(a[i],i));
}
}
while(k--)
{
... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | 315e5e28d855c2892d6f940e2205af87 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Prioridade
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(int i = a; i < (b); i++)
#define IN... | C++ | cfccf06c4d0de89bf0978dc6512265c4 | ef50ab2d0ec67b521df69fda87714f13 | 1,600 | PASSED |
/* ^^ ====== ^^
ID: meixiuxiu
PROG: test
LANG: C++11
*/
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <sstream>
#include <... | C++ | 21432a74b063b008cf9f04d2804c1c3f | 2dcb7b6d0a5e12a2684d6bf31add3ad6 | 2,000 | PASSED |
#include <vector>
#include <iostream>
#include <cmath>
#include <algorithm>
//#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664
using namespace std;
double PI=4*atan(1.0);
int main()
{
double n,a,w,h,b,c,e,f,g,x,y,a1,a2,b1,b2,c1,c2,... | C++ | 21432a74b063b008cf9f04d2804c1c3f | e7e666035956ba0d82f83e27f7320cee | 2,000 | PASSED |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#include<queue>
#include<iomanip>
using namespace std;
#define MAXN 100100
#define eps 1e-7
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Fore(i,a,b) for(int i=a;i>=b;i--)
#define lson l,mid,rt<<1
#define rson m... | C++ | 21432a74b063b008cf9f04d2804c1c3f | 35e47a17e791c2bd0eef4aa48b85527f | 2,000 | PASSED |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
#include<string>
#include<vector>
#include<stack>
#include<cmath>
#include<set>
#include<stack>
#define CLR(x) memset(x,0,sizeof(x))
#define REP(x,y) for (int x = 0; x < y; x++)
#define REPI(x,y) for (int x = 1; x <= y; x++)
#define... | C++ | 21432a74b063b008cf9f04d2804c1c3f | b3edb27ab5178edcceb069646d0960cf | 2,000 | PASSED |
#include<bits/stdc++.h>
#define D(x) cout<<#x<<"="<<x<<endl
using namespace std;
typedef long long ll;
int main()
{
double w,h,a;
scanf("%lf%lf%lf",&w,&h,&a);
if (w<h)
swap(w,h);
if (a==90)
{
printf("%lf",h*h);
return 0;
}
if (a>90)
a=180-a;
double ans=w*h;
w/=2,h/=2;
a/=180/acos(-1);
double x=(h-h/c... | C++ | 21432a74b063b008cf9f04d2804c1c3f | 9310d614ce5f2e4c9f9dedde8aa4ad01 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,t;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef pair<pll,ll> plll;
ll z;
ll power(ll x, ll y)
{
ll res = 1;
x = x % z;
while (y > 0)
{ if (y & 1)
res = (res*x) % z;
y = y>>1; x = (x*x) % z; ... | C++ | 21432a74b063b008cf9f04d2804c1c3f | 5f3ccea954e54641944153db9a811558 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
#define Long long long
#define forn(i, n) for(int i = 0; i < n; ++i)
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
using namespace std;
int const MAXN = 5005;
double h, w, ang;
double calc(dou... | C++ | 21432a74b063b008cf9f04d2804c1c3f | a11742ab6cc1d07ff165d7b5f8b49e51 | 2,000 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string.h>
#include<cstdio>
#include<math.h>
#include<cstdlib>
#include<map>
#include<utility>
#include<stack>
#include<fstream>
using namespace std;
#define ll long long int
vector <ll> v;
vector <ll> v1;
vector <ll> v2;
const ll inf=100000000000005;
... | C++ | 21432a74b063b008cf9f04d2804c1c3f | 2d08e42ace18604e8d5dad60c932bdec | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define Pi acos(-1.0)
typedef long long ll;
const ll N=1e3+7;
const ll mod=1e9+7;
double w,h,a,ans,x1,x2,y_1,y2;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>w>>h>>a;
ans=w*h;
if(a>90)a=180-a;
a=a*Pi/180;
if(w<h)swap(w,h)... | C++ | 21432a74b063b008cf9f04d2804c1c3f | 08f0a7d1abde0eb54862db8b1e474462 | 2,000 | PASSED |
#include <cstdio>
#include <cmath>
#include <algorithm>
const double pi = acos(-1);
int main() {
double w, h, a;
scanf("%lf%lf%lf", &w, &h, &a);
if (w < h) std::swap(w, h);
if (a >= 90.0) a = 180.0 - a;
a *= pi / 180.0;
if (a > 2.0 * atan(h / w)) {
printf("%.10lf\n", h * h / sin(a));
} else {
double t = (w... | C++ | 21432a74b063b008cf9f04d2804c1c3f | b92737831cc129ed829e01de086655f6 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
const int N = 2e5 + 10, M = 1e9 + 7;
int n, m;
ll sum[N], dp[N];
int main(){
scanf("%d%d", &n, &m);
vector<pair<int, int>>v;
map<int, int>ma;
ma[0] = 1, ma[n] = 1;
for(int i = 0;... | C++ | cb47d710361979de0f975cc34fc22c7a | 36bf22ad5f32cdbde60e8377327036ba | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool cmp(const pair<int, int>& a, const pair<int, int>& b){
if(a.second==b.second){
return a.first>b.second;
}
return a.second<b.second;
}
const ll M = 1e9+7;
template<typename T>
class fenwick{
int n;
vector<T> tree;
publi... | C++ | cb47d710361979de0f975cc34fc22c7a | fc7c05efd4844bd2e508f3d93072f5c9 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
const int MAXM = 1e5 + 5;
const ll MOD = 1e9 + 7;
int n, m, s, t;
vector<pii> V;
vector<pair<pii, l... | C++ | cb47d710361979de0f975cc34fc22c7a | ca597cac006c8d6183e0fae361e110d6 | 1,700 | PASSED |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<string>
#include<map>
#include<list>
#include<queue>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<math.h>
#include<set>
#include<stack>
#include<fstream>
#include<numeric>
#include<strin... | C++ | cb47d710361979de0f975cc34fc22c7a | 2fcd643774a98bf39b6fd1166ad8b2af | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long mod=1000000007;
long long add(long long a,long long b){
return (a+b)%mod;
}
long long mul(long long a,long long b){
return (a*b)%mod;
}
vector <int> ycol;
map <int,vector <int> > dp;
map <int,bool> vis;
map <int,long long> ans;
long long solve(int n)... | C++ | cb47d710361979de0f975cc34fc22c7a | c229410e246a3219c8f810637e9fa0ef | 1,700 | PASSED |
#include <bits/stdc++.h>
#include<string.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define fr(i,s,e) for(i=s;i<e;i++)
#define rf(i,s,e) for(i=s-1;i>=e;i--)
#define pb push_back
#define eb ... | C++ | cb47d710361979de0f975cc34fc22c7a | 4556f80b4fe168e534f2a14db6c29a89 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int tree[200010];
void update(int x,int val){
while(x+1 <= 200010){
tree[x] = (tree[x] + val)%MOD;
x += (x & -x);
}
}
void update(int st,int ed,int val){
update(st,val);
update(ed+1,(MOD-val)%MOD);
}
int query(int x){
int ans = 0;
while(x... | C++ | cb47d710361979de0f975cc34fc22c7a | a6c3e39dd16df62d7b4005f1121dd9e1 | 1,700 | PASSED |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define pb push_back
#define inf 10000000000000000
#define N 1000000007
#define speed ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
template<class L,class R> ostream& operator<<(ostream& cout,pai... | C++ | cb47d710361979de0f975cc34fc22c7a | d7c7345bc9ed0ea3a93f664d5f950503 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front;
#define fbo find_by_order
#define ook order_of_key
#define lb lower... | C++ | cb47d710361979de0f975cc34fc22c7a | e3c5da0eff772b755a1c205bdd3fd44d | 1,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.