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<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+10;
int ans[MAXN][31];
void print(int n){
for(int i=0;i<=n+1;i++){
for(int j=0;j<30;j++)printf("%d%c",ans[i][j]," \n"[j==29]);
}
}
int main(){
int n,m;
scanf("%d%d",&n,&m);
queue<pair<int,int> > q1[30],q2[3... | C++ | 0b204773f8d06362b7569bd82224b218 | 464c4875816dacdc79de0bc73c30efff | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+20;
ll n,m,a[N][35],b[N];
ll l[N],r[N],q[N];
struct node{
int l,r;
ll sum;
}t[N<<2];
void push_up(int o)
{
t[o].sum=t[o<<1].sum & t[o<<1|1].sum;
}
void build(int o,int l,int r)
{
t[o].l=l,t[o].r=r;
if(l==r)
{
t[o].sum=b[l];
re... | C++ | 0b204773f8d06362b7569bd82224b218 | 4bf7858b1e9c16599a66a41143eedea6 | 1,800 | PASSED |
#include<stdio.h>
#include<cstring>
#define lc rt<<1
#define rc rt<<1|1
using namespace std;
typedef long long ll;
const int Size=100003;
const int INF=0x7fffffff;
struct node {
int l,r;
ll v,lazy;
} tree[Size<<2];
int n,m;
int l[Size];
int r[Size];
int x[Size];
inline void Pushup(int rt) {
tree[rt].v=tree[lc].v&tre... | C++ | 0b204773f8d06362b7569bd82224b218 | 5c89d1d5255b17d1afe14895a9c4b731 | 1,800 | PASSED |
#include <iostream>
#include <cstdio>
using namespace std;
const int N=1234567;
int a[N],tree[N],L[N],R[N],q[N],sum[N];
int mb=30,n,m;
void build(int node,int start,int end)
{
if(start==end)
{
tree[node]=a[start];
return;
}
int mid=(start+end)>>1;
build(node*2,start,mid);
build(node*2+1,mid+1,end);
tree[... | C++ | 0b204773f8d06362b7569bd82224b218 | 205a9328ee99e1e4c312d8a538397f3e | 1,800 | PASSED |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a);i<=(b);i++)
#define ROF(i,a,b) for(int i = (a);i>=(b);i--)
#define MST(a,x) memset(a,x,sizeof(a))
#define ll long long
#define PB push_back
#define PH push
#define MP make_pair
#define FT first
#define SD second
#define N 100005
#define M 305
#define INF 100000... | C++ | 0b204773f8d06362b7569bd82224b218 | 810a8fcd33988d56598965826039c980 | 1,800 | PASSED |
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.*;
import java.math.*;
import java.io.*;
import java.text.*;
import java.math.BigInteger;
public class Main
{
//Life's a bitch
public static boolean[] sieve(long n)
{
boolean[] prime = n... | Java | 9329cb499f003aa71c6f51556bcc7b05 | eed5fe8560c222db7aaff9955e9abf85 | 1,300 | PASSED |
import java.io.*;
import java.math.*;
import java.util.*;
public class C {
static MyScanner in = new MyScanner();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StringTokeniz... | Java | 9329cb499f003aa71c6f51556bcc7b05 | 5ce87625b7298f68b1161689779995c6 | 1,300 | PASSED |
import java.util.*;
public class solution
{
static int n, m, curr;
static long answer;
static ArrayList<Integer>[] adj;
static int[] cost;
static boolean[] vis;
public static void main(String[] args)
{
answer = 0;
Scanner console = new Scanner(System.in);
n = console.... | Java | 9329cb499f003aa71c6f51556bcc7b05 | c2aeb189b393ba2132e6eaae90326310 | 1,300 | PASSED |
// package endsem;
import java.util.*;
import java.lang.Math;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
public class Cf_two {
static class graph_dfs{
int num_vert;
List<Integer> adjList[];
int[] vis;
graph_dfs(int num_vert){
th... | Java | 9329cb499f003aa71c6f51556bcc7b05 | 905aeb3ec12dbb279bc2a88ae47f0315 | 1,300 | PASSED |
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int N=sc.nextInt();
int m=sc.nextInt();
int[] arr=new int[N+1];
for(int i=1;i<=N;i++){
arr[i]=sc.nextInt();
}
Map<Integer,List<Integer... | Java | 9329cb499f003aa71c6f51556bcc7b05 | abfb4ecb0cd02dac973fef0cf3f38bb7 | 1,300 | PASSED |
// package com.company.codeforces;
import java.io.*;
import java.util.*;
public class Solution {
static int mod = (int) 1e9 + 7;
static int val[];
static boolean vis[];
static ArrayList<Integer> graph[];
static long ans=0;
public static void main(String[] args) {
Scanner input = n... | Java | 9329cb499f003aa71c6f51556bcc7b05 | e502ce3c7c4ff433ba7d96d80e8d783a | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool visited[1000000]={false};std::vector<long long int> v[1000000];
std::vector<long long int> mp;std::vector<long long int> vj;
void dfs(long long int s)
{
visited[s]=true;
vj.push_back(mp[s]);
for (int i = 0; i < v[s].size(); ++i)
{
if (vis... | C++ | 9329cb499f003aa71c6f51556bcc7b05 | 09d0d64e8d0fc5a4e06eac71afd865dc | 1,300 | PASSED |
#include<bits/stdc++.h>
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ms memset
#define MOD 1000000007
#define sp fixed<<setprecision
#define sz sizeof
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
typedef long long ll;
type... | C++ | 9329cb499f003aa71c6f51556bcc7b05 | b7683a8e45b55f73da8ae04771afb682 | 1,300 | PASSED |
#include<bits/stdc++.h>
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ms memset
#define MOD 1000000007
#define sp fixed<<setprecision
#define sz sizeof
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
typedef long long ll;
type... | C++ | 9329cb499f003aa71c6f51556bcc7b05 | abc6858ba0438dcc1ccc470fe2a9e123 | 1,300 | PASSED |
// Lets go to the next level
// AIM EXP at CF *__* asap
// Hit A,B,C faster and reach Expert
// Remember you were also a novice when you started,
// hence never be rude to anyone who wants to learn something!Be calm and help everyone.
// Never open the rank list until and unless you are done with solving problems!
//A... | C++ | 9329cb499f003aa71c6f51556bcc7b05 | 027c5877be683399f23d3d21c1d529ca | 1,300 | PASSED |
# include<cstdio>
# include<cstring>
# include<algorithm>
using namespace std;
const int N = 3e5 + 5;
typedef long long ll;
int a[N][2];
ll s[N][2],s1[N][2],s2[N][2];
int n;
int main()
{
scanf("%d",&n);
for (int i = 1 ; i <= n ; ++i) scanf("%d",&a[i][0]),s[i][0] = s[i - 1][0] + (ll)(i - 1) * a[i][0];
for (int i = 1 ... | C++ | 948429d3788b212e7763774f8cab097b | 745008600d1543eab62264642a178b46 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define pb push_back
#define PII pair<int,int>
#define MP make_pair
#define fr first
#define sc second
typedef long long ll;
typedef unsigned long long ull;
const int N = 3e5 + 7;
using namespace std;
int n;
ll a[... | C++ | 948429d3788b212e7763774f8cab097b | e19b76452d5c4029cf25bfba77ea285b | 1,800 | PASSED |
#include<cstdio>
#include<cctype>
#include<iostream>
#include<algorithm>
#define LL long long
using namespace std;
int read(){
int ret=0;char ch=getchar();bool f=1;
for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');
for(; isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;
return f?ret:-ret;
}
int n,mp[2][300005];
LL... | C++ | 948429d3788b212e7763774f8cab097b | 11dcf7f8920e59fb373d420b0d8b24bc | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 300 * 1000 + 9;
int n;
int a[2][N];
long long sum123[2][N];
long long sum321[2][N];
long long sum111[2][N];
int main() {
scanf("%d", &n);
for(int i = 0; i < 2; ++i)
for(int j = 0; j < n; ++j)
scanf("%d", &a[i][j]);
for(int i = 0; i < 2; ++i)
... | C++ | 948429d3788b212e7763774f8cab097b | 4ff681844516e26dbd82c3d5060ef3a6 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define PB push_back
#define INF 2147483647 // 2e9+
#define INFL 9223372036854775807 // 9e18+
#define MP make_pair
#define PII pair<int,int>
#define VI ... | C++ | 948429d3788b212e7763774f8cab097b | 3f3b03e8ac63384ecbe9ace5f861e89f | 1,800 | PASSED |
#include<stack>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 3e5 + 10;
typedef long long LL;
int n;
LL Ans;
LL b[maxn][2], a[maxn][2], ans[maxn][2], ans2[maxn][2];
int main()
{
cin >> n;
for (int i = 0; i < 2; i++)
for (int j = ... | C++ | 948429d3788b212e7763774f8cab097b | 340a68cc8dad68744ceb0c3cc4190767 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 300000
int n;
ll a[3][maxn+5]= {0};
ll s[maxn+5];
ll sum[4][maxn+5];
void readin() {
scanf("%d",&n);
for(int i=1; i<=2; i++) {
for(int j=1; j<=n; j++) {
scanf("%lld",&a[i][j]);
}
}
}
void init() {
for(int i=n; i>=1; i--) s[i]=... | C++ | 948429d3788b212e7763774f8cab097b | b0f864663485be3be2bc2bcafe8227e4 | 1,800 | PASSED |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 300020
#define ll long long
using namespace std;
ll n,ans;
ll a[3][N],pr[3][N];
ll f[3][N],g[3][N];
inline void Work(ll x,ll y,ll tm,bool flag,ll val)
{
if(y>n)return;
f[x][y]=val+tm*a[x][y];
if(!flag)Work(x,y+1,tm+1,1,f[x][y]);
e... | C++ | 948429d3788b212e7763774f8cab097b | e4bde7f1ed5b3ab7bb9bc048c824d6e1 | 1,800 | PASSED |
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=3e5+1000;
typedef long long ll;
ll map[2][N];
ll suml[N],sumr[N];
int m,n;
int main()
{
scanf("%d",&n);
for(int i=0;i<=1;i++)
for(int j=1;j<=n;j++)
scanf("%lld",&map[i][j]);
ll ans=0;
for(int i=1;i<=n;i++)
{
suml[i]=suml... | C++ | 948429d3788b212e7763774f8cab097b | 0d9d3ca3087fb69a6a1bb42d5cbe2827 | 1,800 | PASSED |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#define LL long long
using namespace std;
int n;
LL sum[300100];
LL mush[300100][2];
LL whole[300100][2][2];
LL LLMAX(LL a,LL b){
if (a>b) return a;
else return b;
}
int main()
{
scanf("%... | C++ | 948429d3788b212e7763774f8cab097b | c6f3a5fa6762d4297f2e5544b11025b2 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k,a[256];
string s;
memset(a,0,sizeof(a));
cin>>k>>s;
if(s.length()%k!=0)
{
cout<<-1<<endl;
goto barra;
}
for(int i=0;i<s.length();i++)
a[s[i]]++;
s="";
for(int i=0;i<256;i++)
{
... | C++ | f5451b19cf835b1cb154253fbe4ea6df | 17ce9fd7b7ac28360353ac64f291eea2 | 1,000 | PASSED |
#include<iostream>
#include<map>
using namespace std;
map<char,int> mp;
int main()
{
int n;
char c;
cin>>n;
while(cin>>c)
{
mp[c]++;
}
int last=-1;
char lastc;
for(map<char,int>::iterator i=mp.begin();i!=mp.end();i++)
{
if(i->second%n>=1)
{
cout<<"-1";
return 0;
}
}
for(int x=0;x<n;x++)
... | C++ | f5451b19cf835b1cb154253fbe4ea6df | a43094454b82e83657d2f90a23b17f85 | 1,000 | PASSED |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int k,freq[27];
string s;
for(int i=0;i<27;i++)
freq[i]=0;
cin>>k;
cin>>s;
for(int i=0;i<s.length();i++)
freq[s[i]-'a']++;
for(int i=0;i<27;i++)
{
if(freq[i]%k)
{
cout<<-1;
... | C++ | f5451b19cf835b1cb154253fbe4ea6df | caf3910feafb2285e5d0d551e0b86740 | 1,000 | PASSED |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int k;
cin >> k;
string str;
cin >> str;
int a[26] = { 0 };
for (int i = 0; i < str.length(); i++)
a[str[i] - 'a']++;
bool flag = false;
for (int i = 0; i < 26; i++)
if (a[i] % k)
flag = true;
if (str.length() % k || flag) {
cout ... | C++ | f5451b19cf835b1cb154253fbe4ea6df | 32ccaf40abf47c177be242a914dd77ae | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin>>k;
string s,x="",sf="";
cin>>s;
if(s.size()%k==0)
{
int h[26]={0};
for(int i=0;i<s.size();i++)
{
h[s[i]-'a']++;
}
for(int i=0;i<26;i++)
{
if(h[i]%k==0)
{
... | C++ | f5451b19cf835b1cb154253fbe4ea6df | ff2e4b1b584be869995fbffd99576846 | 1,000 | PASSED |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author dwij
*/
#include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define endl '\n'
/**********************************************/
class AKStri... | C++ | f5451b19cf835b1cb154253fbe4ea6df | d4cc79e906a339f5c8b5286a7e4fd34b | 1,000 | PASSED |
#include<iostream>
#include<fstream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int k,met=0,ind=0,on=1,n;
string s,s1;
char a;
int main(){
//ifstream cin("input.txt");
//ofstream cout("output.txt");
cin>>k;
cin>>s;
for(int i=0;i<s.size();i++){
for(int j=i+1;j<s.size();j++){... | C++ | f5451b19cf835b1cb154253fbe4ea6df | 7db5eb2c938957add2b9167c17b78cbc | 1,000 | PASSED |
#include <iostream>
using namespace std;
#include <string.h>
int main(){
int k;
char s [10001];
cin >> k >> s;
if(k == 1) cout << s;
else{
int sS = strlen(s);
if(sS % k == 0){
int division = sS/k;
int alphabet [26]={};
int first_l ... | C++ | f5451b19cf835b1cb154253fbe4ea6df | 1c0b358bb9e89950e18e625d79bd9e64 | 1,000 | PASSED |
#include <iostream>
#include<vector>
#include<cmath>
using namespace std;
int main() {
int k, re[26]={0}, size, times;
string word, sub="";
bool can = true;
cin >> k >> word;
size = word.length();
for(int i = 0; i < size && can; i++){
re[word[i] - 'a']++;
}
for(int i = 0;... | C++ | f5451b19cf835b1cb154253fbe4ea6df | 26491b550418953e975177c5686b46c0 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a,b,c; int n; cin>>n>>a;
sort(a.begin(),a.end());
for(int i=0;i<a.size();i+=n){ b+=a[i]; }
for(int i=0;i<n;i++){ c+=b; }
b=c; sort(b.begin(),b.end());
if(b!=a) cout<<-1;
else cout<<c;
return 0;
} | C++ | f5451b19cf835b1cb154253fbe4ea6df | 810b1c030644813d196f0469d4deb3f5 | 1,000 | PASSED |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
private static Scanner sc;
private static Printer pr;
private static long aLong=(long)(Math.pow(10,9)+7);
private static void solve() throws IOException {
int n = sc.nextInt();
int k=sc.nextInt();
... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | cd4e3b5a80f2f36ef911150033178899 | 1,200 | PASSED |
import java.io.InputStream;
public class Sport_Coding
{
static IO io=new IO(System.in);
static int n, k;
static String s;
static boolean[] ar;
public static void main(String[] args)throws Exception
{
n = io.nextInt(); k = io.nextInt();
s = io.next(); ar = new boolean... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | 71699000f453874e339bf70e4e20eb3a | 1,200 | PASSED |
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
String s=sc.next();
StringBuffer sb = new StringBuffer();
int[] freq=new int[26];
for(int i=0;i<n;i++)
{
freq[s.charAt(i)-'a']++;
}
int ... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | bca621e247346e1cecb5a2478ab42bcc | 1,200 | PASSED |
//package math_codet;
import java.io.*;
import java.util.*;
public class lets_do {
public static void main(String[] args)
{
InputReader in=new InputReader(System.in);
StringBuffer str=new StringBuffer();
int n=in.nextInt();
int k=in.nextInt();
String s=in.next();
... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | 773d3ea1096c424bc239006b16a7524e | 1,200 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
*
* @author thachlp
*/
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application l... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | d2e926f279343e8999515dcf13edbd62 | 1,200 | PASSED |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;
public class alphabeticRemovals {
static class FastReader {
StringTokenizer st;
BufferedReader br;
public FastReader(InputStream s) {
br = n... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | 1518947832ccfce52f8bdd9ddb239d85 | 1,200 | PASSED |
//package com.prituladima.codeforce.contests.contest999;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
/**
* Created by prituladima on 6/23/18.
*/
public class C {
private static class Staff {
public Staff(c... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | 966e676418e6cfa101787d681da83d75 | 1,200 | PASSED |
import java.util.*;
public class asd
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
int n=s.nextInt();
int k=s.nextInt();
String str=s.next();
int arr[]=new int[26];
for(int i=0;i<str.length();i++)
{
char ch=str.ch... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | 3a7bb8f4e97cebae76bc4dddaaab7005 | 1,200 | PASSED |
import java.util.Scanner;
public class Alp {
public static void main(String [] args) {
Scanner in = new Scanner(System.in);
int [] alph = new int[26];
int [] toDel = new int[26];
in.nextInt();
int z = in.nextInt();
char [] word = in.next().toCharArray();
for(char w:word) {
alph[w-'a']++;
}... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | f3b921f1387b659c3cb2dffab37e8bd5 | 1,200 | PASSED |
import java.util.Scanner;
public class Ex03_2 {
private static int[] array = new int[26]; // count
private static int visit[];
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int s = sc.nextInt();
int k = sc.nextInt();
String temp = sc.next()... | Java | 9f095a5f5b39d8c2f99c4162f2d7c5ff | 5e83249d5ca6a576a6e3d4e41b3d5c30 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5,mod=1e9+7;
int t,k,x1,x2,f[N],sum[N];
signed main(){
scanf("%lld%lld",&t,&k);
f[0]=1;
for(int i=1;i<N;i++){
if(i>=k) f[i]=(f[i-1]+f[i-k])%mod;
else f[i]=f[i-1]%mod;
sum[i]=(sum[i-1]+f[i])%mod;
}
while(t--){
scanf("%lld%ll... | C++ | 16c016c0735be1815c7b94c5c50516f1 | c6571dbd9c60f3cb76512ae25859b7b1 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std ;
#define gg getchar() ;
const int N = 1e5 + 3 ;
int qwq () {
int x = 0 , f = 1 ; char ch = gg ;
while (ch < '0' || ch > '9') {if (ch == '-') f = -1 ; ch = gg}
while (ch >= '0' && ch <= '9') {x = x *10 + ch - '0' , ch = gg} ;
return x * f ;
}
#define con continue
type... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 27d594c17d7dea2d82b2aed2cdd8c809 | 1,700 | PASSED |
#include<bits/stdc++.h>
const int N=100000+10;
const long long p=1000000007;
using namespace std;
int t,k,a,b;
long long f[N],sum[N];
int read()
{
int a,f=1;
char c;
c=getchar();
while(c<'0'||c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
a=c-'0';
c=getchar();
while(c>='0'&&c<='9')
{
a=a*10+c-'0';
c=g... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 64742c54d18c236fa5aa4a716f9d6d6a | 1,700 | PASSED |
#include<iostream>
using namespace std;
const int N=100005,M=1000000007;
int n,k,dp[N]={1},q[N];
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
cin>>n>>k;
for(int i=1;i<=N;i++){
dp[i]=dp[i-1];
if(i>=k) dp[i]=(dp[i-k]+dp[i])%M;
q[i]=(q[i-1]+dp[i])%M; }
while(n--){
int a,b;
cin>>a>>b... | C++ | 16c016c0735be1815c7b94c5c50516f1 | c5e3f4a8a346867f95ebe342005c5173 | 1,700 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define MOD 1000000007
using namespace std;
int n,k;
int dp[100005],sum[100005];
int main(void){
cin >> n >> k;
dp[0] = 1;
for(int i = 1;i <= 100005;i ++){
if(i >= k) dp[i] = dp[i]+dp[i-k];
dp[i] += dp[i-1];
dp[i]%=MOD;
}
for(int i = 1;i <= 100005;i... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 31f2d29682be747728a83f799eba9c9e | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
struct node{
ll a, b;
};
struct Solution{
ll n, k, maxn;
vector<node> a;
vector<ll> f, fsum;
void Solve(){
scanf("%lld%lld", &n, &k);
a.resize(n + 1);
for(int i = 1; i <= n; i++)... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 202b153ec666fcaf4a0eababd77e9993 | 1,700 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
int f[100005],s[100005],n,k;
signed main(){
cin>>n>>k;
f[0]=1;
for(int i=1;i<=100000;i++){
f[i]+=f[i-1];
if(i>=k) f[i]+=f[i-k];f[i]%=mod;
s[i]=s[i-1]+f[i];
s[i]%=mod;
}//cout<<n<<endl;
for(int i=1;i<=n;i++){
int l,r;
... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 9ca0df80e260dc404921d23a26db0591 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int x=1000000007;
int t,k,a,b,p[100005],sum[100005];
int main()
{
scanf("%d%d",&t,&k);
for(int i=0;i<k;i++)
p[i]=1;
for(int i=k;i<=100000;i++)
{
p[i]=p[i-1]+p[i-k];
if(p[i]>=x) p[i]=p[i]%x;
}
for(int i=1;i<=100000;i++)
{
... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 7c8d1e194a7e04a13bb6fd2231bb9854 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long m=1e9+7;
int t,k;
long long f[100005];
long long a[100005];
int main()
{
cin>>t>>k;
for(int i=1;i<k;i++)f[i]=1,a[i]=a[i-1]+f[i];
f[k]=2,a[k]=a[k-1]+2;
for(int i=k+1;i<=100000;i++)f[i]=(f[i-1]+f[i-k])%m,a[i]=(a[i-1]+f[i])%m;
while(t--)
{
int l,r;
... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 90e358bf2ec5108711d5ae491433c646 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long n,k,l[1000005],r[1000005],dp[1000005],maxx,mod=1000000007;
int main()
{
scanf("%lld%lld",&n,&k);
dp[0] = 1;
for (int i=1;i<=n;++i)
{
scanf("%lld%lld",&l[i],&r[i]);
maxx = max(maxx,r[i]);
}
for (int i=1;i<=maxx+1;++i)
if (i <= k) dp[i] = dp[i-1] % m... | C++ | 16c016c0735be1815c7b94c5c50516f1 | 265aa39e27bd5079f001eca77b10a78e | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void)
{
int t; cin >> t;
while(t--)
{
vector<pair<int, int>> v;
char s[250000], t[250000];
int n, k, j = 0, idx;
scanf("%d %d", &n, &k);
cin >> s;
for(int i = 0; i < k - 1; i++)
{
t[j] = '(', t[j + 1] = ')';
j += 2;
}... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 2266d68e3b4585b110d0045028fc35b0 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void)
{
int t; cin >> t;
while(t--)
{
vector<pair<int, int>> v;
string s, t;
int n, k, j = 0, idx;
scanf("%d %d", &n, &k);
cin >> s;
t = s;
for(int i = 0; i < k - 1; i++)
{
t[j] = '(', t[j + 1] = ')';
j += 2;
}
fo... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 6736785d0bea1a48b504aa811ce2a11a | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL))
#define ll long long int
#define pb push_back
#define INF LONG_LONG_MAX
#define mod 998244353
#define mp make_pair
#define inf 1e18+5
#define ff first
#define ss second
const int N = 1e5... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 7ac4b4317303f0e7e21bbce7c094e75d | 1,700 | PASSED |
#include <bits/stdc++.h>
#define LL long long
#define N int(1e5+5)
#define CL(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define mod int(1e9+7)
using namespace std;
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);
// cout.tie(0);
int t;
scanf("%d",&t);
while(t--)
{
... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 1e2e41ed588011fe532b79b2ee51205b | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i=a;i<b;i++)
#define vi vector<int>
#define vii vector<ll>
#define all(x) x.begin(),x.end()
#define mod 998244353
#define pb push_back
#define ii pair<int,int>
#define iii pair<ll,ll>
#define MAX 10000000000000
#define pi 3.1415926535
typedef long lo... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | e978ff1b3025d2b5db9049d170aeb1bb | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e5+1;
bool cmp (pair <int,int> a,pair <int,int> b){
if (a.first == b.first)return a.second < b.second;
return a.first < b.first;
}
int main () {
int t;
scanf("%d",&t);
while (t--){
int i, n, k;
string s... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 030c3da6a91af4783311eb0d29b215bd | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define II pair <int, int>
#define fi first
#define se second
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FOD(i, a, b) for(int i = a; i >= b; i--)
#define fast_machine ios ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int N = 2e3 + ... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 8d928968562aabfed7e1cade0d2f6735 | 1,700 | PASSED |
//https://codeforces.com/contest/1262/problem/C
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
int n;
int a[maxn];
int b[maxn];
bool vis[maxn];//标记
struct node{
int l, r;
};
int main(){
int T;
cin >> T;
while (T--){
vector<node>v;
int n, ... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 54a65eab01e76018683365f54b9789d2 | 1,700 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
char dz[2005];
char flag[2005];
int ansl[2005],ansr[2005];
int main()
{
for(int i=1;i<=2000;i++)
{
if(i%2==1) dz[i]='(';
else dz[i]=')';
}
int t;
c... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | 453edac11d92056cb2753fa6e7acdb11 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(0);\
cin.tie(0);\
cout.tie(0);
typedef long long ll;
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
const int maxn = 1e6 + 5;
const int maxm = 2e6 + 5;
int n,k;
char s[maxn];
vector<pii> a... | C++ | 27faaaba7a79b7d4ba7f330cb13c0704 | ae80900eab87327245960df7bcf62d8f | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
if (a % b == 0) cout << 0 << endl;
else cout << b - a % b << endl;
}
return 0;
}
| C++ | d9fd10700cb122b148202a664e7f7689 | 829617750e67385c63a4a182064f3c97 | 800 | PASSED |
#include <bits/stdc++.h>
int main()
{
int no_of_test_cases,a,b;
scanf("%d",&no_of_test_cases);
for(int i=0;i<no_of_test_cases;i++) {
scanf("%d %d",&a,&b);
if(a % b == 0) {
std :: cout << 0 << std::endl;
}
else {
std :: cout << b - (a % b) <<std :: endl;
}
}
}
| C++ | d9fd10700cb122b148202a664e7f7689 | 09a99cbfa27361793b5c84bba8619f56 | 800 | PASSED |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
#define num_bits(num) __builtin_popcount(num)
#define em empty()
#define inf INT_MAX
#define mn_inf INT_MIN
#define endl '\n'
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
t... | C++ | d9fd10700cb122b148202a664e7f7689 | cff84dee8510e0dd3f682666a899289b | 800 | PASSED |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
#define num_bits(num) __builtin_popcount(num)
#define em empty()
#define inf INT_MAX
#define mn_inf INT_MIN
#define endl '\n'
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
t... | C++ | d9fd10700cb122b148202a664e7f7689 | 7fd70075ab92a1f6ff9ebdb36f124215 | 800 | PASSED |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
//We have to do get char unlocked and put char unlocked
long long int fastscan()
{
//variable to indicate sign of input number
register int c;
long long int number = 0;
// extract current character from buffer
c = getcha... | C++ | d9fd10700cb122b148202a664e7f7689 | 00f03075d3155c533afbed59f2d17dbe | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
for(int x=0;x<t;x++)
{
long long int a,b;
cin>>a>>b;
if(a%b==0)
{
cout<<"0"<<endl;
}
else
{
cout<<b-(a%b)<<endl;
}
}
return 0;
} | C++ | d9fd10700cb122b148202a664e7f7689 | c90f5e91ca8252b30686d9a09008c89e | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t; cin >> t;
int a;
int b;
int count;
int i;
int array[t];
for (i = 0; i < t; i++)
{
cin >> a;
cin >> b;
count = 0;
if (a % b == 0)
{
array[i] = 0;
}
else if (a > b)
{
array[i] = b - (a%b);
}
else if (a < b)
{
array[i] =... | C++ | d9fd10700cb122b148202a664e7f7689 | bfd675e5844bb718129eb1ff414bba79 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b;
long long w,c;
cin>>w;
while(w--){
cin>>a>>b;
if(a%b==0)
c=0;
else if(a>b)
c=b-a%b;
else if(a<b)
c=b-a;
cout<<c<<endl;
}
return 0;
}
| C++ | d9fd10700cb122b148202a664e7f7689 | c52a3c4b770c289c9894132bf9e9bee1 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t ;
cin >> t;
int a , b ;
for(int i=0;i<t;i++){
cin>>a>>b;
if(a < b){
cout << b - a << endl ;
}
else if(a == b){
cout << 0 << endl ;
}
else{
int c = a / b ;
... | C++ | d9fd10700cb122b148202a664e7f7689 | cab14e70f2b5f3d57de665bbe74a8d96 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
long int t,i;
cin>>t;
for(i=0;i<t;i++)
{
long int a,b,s=0;
cin>>a>>b;
if(a%b!=0)
{
cout<<b-a%b<<endl;
}
else
cout<<"0"<<endl;}
return 0;
} | C++ | d9fd10700cb122b148202a664e7f7689 | 80b7da22756e6b713bde195cac65272d | 800 | PASSED |
#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define dep(i,a,b) for(int i = a; i >= b; i--)
#define Rep(i,a) for(int i = 0; i < a; i++)
#define pb(a) push_... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | 891faf861b7c5bbe7d0db654fd0bd87d | 3,000 | PASSED |
#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define dep(i,a,b) for(int i = a; i >= b; i--)
#define Rep(i,a) for(int i = 0; i < a; i++)
#define pb(a) push_... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | 05ad6a4240e954e194f4b7246e135ba8 | 3,000 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | cb7756c3f63992dddef18a821c24957c | 3,000 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
type... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | b5c48420472e2874d536e7a40b0cee45 | 3,000 | PASSED |
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 1100
using namespace std;
struct node{int y,nex;}e[N];
int n,m,a[N],b[N][N],c[10],f[N][N],sa1[N],sa2[N],pos[10],fir[10];
int len,rk[N],w[N],g[10],ap,mx[N];
char s[N][N];
void init()
{
scanf("%s",s[0]+1);
m=strlen(s[0]+1)... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | cad0556ed7863f9a1e8c4190aaf496b6 | 3,000 | PASSED |
/*
* Autistic
*/
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | 16b7d88768eb7a5f04827888578a3a9b | 3,000 | PASSED |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | c1d3f5de48c2f479efdd172a70288474 | 3,000 | PASSED |
#include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
//f[i][k][d]
//cnt[i][k][d] how many a[i] = d while rank[i+1][k] >= d
#define forw(i, a, b) for (int i = a; i <= b; ++i)
#define down(i, a, b) for (int i = b; i >= a; --i)
#define iter(i, n) forw(i, 1, n)
#define iter_r(i, n) down(i, 1, n)
#... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | d1bec33bbc03e13c84c36ed80c240197 | 3,000 | PASSED |
#include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
#define forw(i, a, b) for (int i = a; i <= b; ++i)
#define down(i, a, b) for (int i = b; i >= a; --i)
#define iter(i, n) forw(i, 1, n)
#define iter_r(i, n) down(i, 1, n)
#define iter0(i, n) for (int i = 0; i < n; ++i)
co... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | 69175384eb560cdf3ca82203802fd1bc | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MN = 1010;
void radix_sort(int *A, int *B, int *C, int N, int M) {
vector<int> D(M, 0);
for(int i = 0; i < N; i++) D[ B[ A[i] ] ]++;
for(int i = 1; i < M; i++) D[i] += D[i - 1];
for(int i = N - 1; i >= 0; i--) C[ --D[ B[ A[i] ] ] ] = A[i];
}
int ... | C++ | aac93dcf47ef358c4d2fa6aba321ce3a | 4afc1b342e40464ca111800936d15ae3 | 3,000 | PASSED |
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
using namespace std;
int ans,n;
int main()
{
int x,y;
cin>>n;
for(int i=1;i<=n;i++)
cin>>x>>y,ans+=(x>0);
cout<<(ans==1||ans==n-1||ans==0||ans==n?"Yes":"No");
return 0;
} | C++ | cf7bf89a6038586b69d3b8021cee0b27 | e8dfd6d982faf4708f5d6f9fed61429d | 800 | PASSED |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
int n,a,b,ans=0,sum=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a>>b;
if (a<0)
ans++;
else
sum++;
}
if(ans==1||sum==1||ans==0||sum==0)
cout<<"Yes";
else
cout<<... | C++ | cf7bf89a6038586b69d3b8021cee0b27 | 0809f9cb8d6ae1497701188c85327e34 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,l,r,x,y;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",&x,&y),
l+=(x<0),r+=(x>0);
if(r<=1||l<=1)puts("Yes");
else puts("No");
return 0;
} | C++ | cf7bf89a6038586b69d3b8021cee0b27 | 3571ec72e38ec25ea2a6eb483d958d3f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,a,b,ans,sum;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>a>>b,a<0?ans++:sum++;
if(ans==1||sum==1||ans==0||sum==0)cout<<"Yes";
else cout<<"No";
return 0;
} | C++ | cf7bf89a6038586b69d3b8021cee0b27 | d747b156f99c9f09432524f6878e4699 | 800 | PASSED |
// luogu-judger-enable-o2
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int n,a,b,ans=0,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a>>b;
a<0?ans++:sum++;
}
if(ans==1||sum==1||ans==0||sum==0)cout<<"Yes";
... | C++ | cf7bf89a6038586b69d3b8021cee0b27 | acf872a511476a3193bc1b74de4d4269 | 800 | PASSED |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int left = 0,right = 0,x;
int n;
cin >> n;
while(n --)
{
cin >> x;
right += ((x / abs(x)) + 1) / 2;
left -= ((x / abs(x)) - 1) / 2;
cin >> x;
}
if(right <= 1 || left <= 1)
{
cou... | C++ | cf7bf89a6038586b69d3b8021cee0b27 | 375c73e5c734bc5f05ef0967736cbdc6 | 800 | PASSED |
#include<iostream>
using namespace std;
int n,a,b,ans,sum;
int main()
{
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> a >> b;
bool(a<0)?ans++:sum++;
}
bool(ans==1 || sum==1 || !ans || !sum)?cout << "Yes\n":cout << "No\n";
return 0;
} | C++ | cf7bf89a6038586b69d3b8021cee0b27 | 2bafe91ee2d71c400531b93c4dff48cc | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+7;
int n,sum1,sum2;
int main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)
{
int x,y;
cin>>x>>y;
if(x>0) sum1++;
else sum2++;
}
if(sum1<=1 |... | C++ | cf7bf89a6038586b69d3b8021cee0b27 | 55bf05e6b111139d754840ee4cadacec | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{ int a,b,c=0,d=0,n,e=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a>>b;
if(a>0) c++;
else d++;
if(c>1&&d>1)
{
cout<<"NO";
return 0;
}
}
cout<<"YES";
return 0;
}
| C++ | cf7bf89a6038586b69d3b8021cee0b27 | e63a78351ed7f1e12afb02baf88f8a3a | 800 | PASSED |
#include<iostream>
#include<cstdio>
using namespace std;
int n,count1,count2;
struct NODE
{
int x,y;
}node[100010];
int main()
{
ios::sync_with_stdio(false);
scanf("%d",&n);
for(register int i=1;i<=n;i++)
{
scanf("%d%d",&node[i].x,&node[i].y);
if(node[i].x<0) count1++;
if(node[i].x>0) count2++;
}
if(cou... | C++ | cf7bf89a6038586b69d3b8021cee0b27 | d92375f7e507694027940a857de395bf | 800 | PASSED |
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
const int mod=777777777;
const int N=77777+1;
const int M=2*N;
bool good[4][4];
struct Node
{
int dp[4][4];
Node(){}
Node(int x)
{
for(int i=0;i<4;i++) for(int j=0;j<4;j++) dp[i][j]=0;
if(x==0) dp[1][1]=dp[2][2]=... | C++ | c99e67aa06313df68b1ea660243d23a9 | 6760b290c1d68c8b99de1152b009c7f6 | 2,400 | PASSED |
//ITNOG
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i, s, e) for(int i = s; i < e; i ++)
typedef long double ld;
const int maxN = 77777 + 5;
const int mod = 777777777;
int c[4][4];
int seg[3][3][4 * maxN];
void build(int s, int e, int ind)
{
if(e - s == 1)
{
rep(i,0,3... | C++ | c99e67aa06313df68b1ea660243d23a9 | ba9e665ed77a6f5fb0a5321906d368c6 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define S second
#define F first
using namespace std;
const int maxn = 77777 + 1 , mod = 777777777;
int n , Q;
vector <pair <int , int> > good;
struct node{
ll dp[4][4];
node(){
for (int i = 0 ; i < 4 ; i++){
for (int j = 0 ; j < 4 ; j++){
dp[i][j] = 0;
}
}... | C++ | c99e67aa06313df68b1ea660243d23a9 | ab82048c1337cdca1a7ed7a7bd9c6f4e | 2,400 | PASSED |
//You only fail when you stop trying...
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define inf 1000000000000
#define mod 777777777
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define S second
#define F first
#define boost1 ios::sync_with_st... | C++ | c99e67aa06313df68b1ea660243d23a9 | 9bc28559c0b42c719b6c50c725c5bd85 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define f(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int x,v,N,Q,L[4][4];
long long T[265000][4][4],z;
void u(int x, int v, int n, int a, int b)
{
if(a>x||b<x) return;
if(a==b)f(i,1,3)f(j,1,3)T[n][i][j]=i!=j?0:(i==v||v==0?1:0);
else
{
u(x,v,2*n,a,(a+b)/2),u(x,v,... | C++ | c99e67aa06313df68b1ea660243d23a9 | e0f885c4c734aa2ec772bd5ac0fd71f9 | 2,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.