submission_id
stringlengths 10
10
| problem_id
stringlengths 6
6
| language
stringclasses 3
values | code
stringlengths 1
522k
| compiler_output
stringlengths 43
10.2k
|
|---|---|---|---|---|
s653048032
|
p04026
|
C++
|
void solve(){
string s; cin >> s;
for( int i = 0; i + 1 < s.size(); ++i )
if( s[ i ] == s[ i + 1 ] ){
cout << i + 1 << " " << i + 2 << "\n";
return;
}
for( int i = 0; i + 2 < s.size(); ++i )
if( s[ i ] == s[ i + 2 ] ){
cout << i + 1 << " " << i + 3 << "\n";
return;
}
cout << -1 << " " << -1 << "\n";
}
|
a.cc: In function 'void solve()':
a.cc:2:5: error: 'string' was not declared in this scope
2 | string s; cin >> s;
| ^~~~~~
a.cc:2:15: error: 'cin' was not declared in this scope
2 | string s; cin >> s;
| ^~~
a.cc:2:22: error: 's' was not declared in this scope
2 | string s; cin >> s;
| ^
a.cc:5:13: error: 'cout' was not declared in this scope
5 | cout << i + 1 << " " << i + 2 << "\n";
| ^~~~
a.cc:10:13: error: 'cout' was not declared in this scope
10 | cout << i + 1 << " " << i + 3 << "\n";
| ^~~~
a.cc:13:5: error: 'cout' was not declared in this scope
13 | cout << -1 << " " << -1 << "\n";
| ^~~~
|
s759425671
|
p04026
|
C++
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define allsort(v) sort(v.begin(),v.end())
#define allsortg(v)sort(v.begin(),v.end(),greater<int>());
const ll mod = 1e9 + 7;
const int INF = 1e9;
int main() {
cin.sync_with_stdio(false);
string s;
cin >> s;
int c[26] = {};
int maxc = 0;
vector<int>imos(s.size() + 1);
rep(i, s.size()) {
c[s[i] - '0']++;
maxc = max(maxc, c[s[i] - '0']);
imos[i] += maxc;
}
rep(i, s.size()) {
if (imos[i] == 2) {
cout << i - 1 << " "<<i << "\n";
return 0;
}
}
else cout << -1 << " " << -1 << "\n";
return 0;
}
|
a.cc: In function 'int main()':
a.cc:31:9: error: 'else' without a previous 'if'
31 | else cout << -1 << " " << -1 << "\n";
| ^~~~
|
s837951468
|
p04026
|
Java
|
public class Main {
static final Scanner sc = new Scanner(System.in);
static final PrintWriter out = new PrintWriter(System.out,false);
static boolean debug = false;
static void solve() {
String str = sc.next();
List<List<Integer>> pos = new ArrayList<List<Integer>>();
for(int i=0; i<26; i++) {
pos.add(new ArrayList<Integer>());
}
for(int i=0; i<str.length(); i++) {
int c = str.charAt(i) - 'a';
for(int j=pos.get(c).size()-1; j>=0; j--) {
int range = i - pos.get(c).get(j) + 1;
int count = pos.get(c).size() - j + 1;
if(count>(range/2)) {
out.println((pos.get(c).get(j)+1) + " " + (i+1));
return;
}
}
pos.get(c).add(i);
}
out.println("-1 -1");
}
public static void main(String[] args) {
solve();
out.flush();
out.close();
}
}
|
Main.java:3: error: cannot find symbol
static final Scanner sc = new Scanner(System.in);
^
symbol: class Scanner
location: class Main
Main.java:4: error: cannot find symbol
static final PrintWriter out = new PrintWriter(System.out,false);
^
symbol: class PrintWriter
location: class Main
Main.java:3: error: cannot find symbol
static final Scanner sc = new Scanner(System.in);
^
symbol: class Scanner
location: class Main
Main.java:4: error: cannot find symbol
static final PrintWriter out = new PrintWriter(System.out,false);
^
symbol: class PrintWriter
location: class Main
Main.java:9: error: cannot find symbol
List<List<Integer>> pos = new ArrayList<List<Integer>>();
^
symbol: class List
location: class Main
Main.java:9: error: cannot find symbol
List<List<Integer>> pos = new ArrayList<List<Integer>>();
^
symbol: class List
location: class Main
Main.java:9: error: cannot find symbol
List<List<Integer>> pos = new ArrayList<List<Integer>>();
^
symbol: class ArrayList
location: class Main
Main.java:9: error: cannot find symbol
List<List<Integer>> pos = new ArrayList<List<Integer>>();
^
symbol: class List
location: class Main
Main.java:11: error: cannot find symbol
pos.add(new ArrayList<Integer>());
^
symbol: class ArrayList
location: class Main
9 errors
|
s197136109
|
p04026
|
Java
|
import java.util.Scanner;
public class Main {
static boolean flag = false;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
for(int i = 0; i < s.length()-1; i++) {
String subst = s.substring(i, i+2);
if(subst.charAt(0) == subst.charAt(1)) {
System.out.println((i+1) + " " + (i+2));
flag = true;
break;
}
}
if(!flag) {
for(int i = 0; i < s.length()-2; i++) {
String subst = s.substring(i, i+3);
if(subst.charAt(0) == subst.charAt(2)) {
System.out.println((i+1) + " " + (i+3));
flag = true;
break;
}
}
}
if(!flag) System.out.println("-1 -1");
// int half = s.length() / 2;
// int[] count = new int[26];
// for(int i = 0; i < 26; i++) {
// count[i] = 0;
// }
//
//
// for(int i = 2; i < s.length(); i++) {
// int startIndex = 0;
// int endIndex = i;
// while(endIndex <= s.length()) {
// check(s, startIndex, endIndex);
// startIndex++;
// endIndex++;
// if(flag) break;
// }
// if(flag) break;
// }
//
// if(!flag)System.out.println("-1 -1");
// }
//
// static void check(String s, int beginIndex, int endIndex) {
// String subst = s.substring(beginIndex, endIndex);
// HashMap<Character, Integer> count = new HashMap<Character, Integer>();
// for(int i = 0; i < s.length(); i++) {
// char temp = s.charAt(i);
// if(!count.containsKey(temp)) {
// count.put(temp, 1);
// }else {
// count.replace(temp, count.get(temp)+1);
// }
//
// if(count.get(temp) > (endIndex - beginIndex) / 2) {
// System.out.println((beginIndex+1) + " " + (endIndex));
// flag = true;
// break;
// }
// }
}
}
import java.util.Scanner;
public class Main {
static boolean flag = false;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
for(int i = 0; i < s.length()-1; i++) {
String subst = s.substring(i, i+2);
if(subst.charAt(0) == subst.charAt(1)) {
System.out.println((i+1) + " " + (i+2));
flag = true;
break;
}
}
if(!flag) {
for(int i = 0; i < s.length()-2; i++) {
String subst = s.substring(i, i+3);
if(subst.charAt(0) == subst.charAt(2)) {
System.out.println((i+1) + " " + (i+3));
flag = true;
break;
}
}
}
if(!flag) System.out.println("-1 -1");
// int half = s.length() / 2;
// int[] count = new int[26];
// for(int i = 0; i < 26; i++) {
// count[i] = 0;
// }
//
//
// for(int i = 2; i < s.length(); i++) {
// int startIndex = 0;
// int endIndex = i;
// while(endIndex <= s.length()) {
// check(s, startIndex, endIndex);
// startIndex++;
// endIndex++;
// if(flag) break;
// }
// if(flag) break;
// }
//
// if(!flag)System.out.println("-1 -1");
// }
//
// static void check(String s, int beginIndex, int endIndex) {
// String subst = s.substring(beginIndex, endIndex);
// HashMap<Character, Integer> count = new HashMap<Character, Integer>();
// for(int i = 0; i < s.length(); i++) {
// char temp = s.charAt(i);
// if(!count.containsKey(temp)) {
// count.put(temp, 1);
// }else {
// count.replace(temp, count.get(temp)+1);
// }
//
// if(count.get(temp) > (endIndex - beginIndex) / 2) {
// System.out.println((beginIndex+1) + " " + (endIndex));
// flag = true;
// break;
// }
// }
}
}
|
Main.java:75: error: class, interface, enum, or record expected
import java.util.Scanner;
^
1 error
|
s341121718
|
p04026
|
C++
|
#include <iostream>
#include <set>
#include <string>
int main()
{
using namespace std;
string s;
cin >> s;
set<char> st;
set<unsigned long long> counts;
multiset<char> mset;
for( auto c: s){
st.insert( c);
mset.insert( c);
}
for( auto c: st){
counts.insert( mset.count( c));
}
if( counts.crbegin() / s.size()){
cout << -1 << ' ' << -1;
}
else{
cout << 1 << ' ' << s.size();
}
return 0;
}
|
a.cc: In function 'int main()':
a.cc:20:26: error: no match for 'operator/' (operand types are 'std::set<long long unsigned int>::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<long long unsigned int> >'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'})
20 | if( counts.crbegin() / s.size()){
| ~~~~~~~~~~~~~~~~ ^ ~~~~~~~~
| | |
| | std::__cxx11::basic_string<char>::size_type {aka long unsigned int}
| std::set<long long unsigned int>::reverse_iterator {aka std::reverse_iterator<std::_Rb_tree_const_iterator<long long unsigned int> >}
|
s315460714
|
p04026
|
Java
|
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class D {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
/// MAIN CODE
public void run() throws IOException {
// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
char[] cs = io.next();
for(int i = 0; i + 1 < cs.length; i++) {
if(cs[i] == cs[i+1]) {
io.out.println((i+1) + " " + (i+2));
return;
}
}
for(int i = 2; i < cs.length; i++) {
if(cs[i] == cs[i-2]) {
io.out.println((i-1) + " " + (i+1));
return;
}
}
io.out.println("-1 -1");
}
}
/// TEMPLATE
static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }
void main() throws IOException {
// IOFast.setFileIO("rle-size.in", "rle-size.out");
try { run(); }
catch (EndOfFileRuntimeException e) { }
io.out.flush();
}
public static void main(String[] args) throws IOException { new D().main(); }
static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }
static
public class IOFast {
private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
private PrintWriter out = new PrintWriter(System.out);
void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }
private static int pos, readLen;
private static final char[] buffer = new char[1024 * 8];
private static char[] str = new char[500*8*2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];
static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
public String nextString() throws IOException { return new String(next()); }
public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
// public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
}
}
|
Main.java:8: error: class D is public, should be declared in a file named D.java
public class D {
^
1 error
|
s737289149
|
p04026
|
Java
|
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class D {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
/// MAIN CODE
public void run() throws IOException {
// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
char[] cs = io.next();
for(int i = 0; i + 1 < cs.length; i++) {
if(cs[i] == cs[i+1]) {
io.out.println((i+1) + " " + (i+2));
return;
}
}
for(int i = 2; i < cs.length; i += 2) {
if(cs[i] == cs[i-2]) {
io.out.println((i-1) + " " + (i+1));
return;
}
}
io.out.println("-1 -1");
}
}
/// TEMPLATE
static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }
void main() throws IOException {
// IOFast.setFileIO("rle-size.in", "rle-size.out");
try { run(); }
catch (EndOfFileRuntimeException e) { }
io.out.flush();
}
public static void main(String[] args) throws IOException { new D().main(); }
static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }
static
public class IOFast {
private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
private PrintWriter out = new PrintWriter(System.out);
void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }
private static int pos, readLen;
private static final char[] buffer = new char[1024 * 8];
private static char[] str = new char[500*8*2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];
static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
public String nextString() throws IOException { return new String(next()); }
public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
// public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
}
}
|
Main.java:8: error: class D is public, should be declared in a file named D.java
public class D {
^
1 error
|
s292993243
|
p04026
|
C++
|
#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 <ctime>
using namespace std;
int main() {
string s;
cin >> s;
char prepre = s[0];
char pre = s[1];
if (s.size()==2){
if (s[0] == s[1]) printf("1 2\n");
else printf("-1 -1\n");
return 0;
}
for (int i = 2; i < s.size(); i++){
if (prepre == s[i]) {
printf("%d %d\n", i-1,i+1);
return 0;
}
else if (pre == s[i]) {
printf("%d %d\n", i,i+1);
return 0;
}
else{
prepre = pre;
pre = s[i];
printf("%c\n",s[i]);
}
}
printf("-1 -1\n");
return 0;
|
a.cc: In function 'int main()':
a.cc:48:14: error: expected '}' at end of input
48 | return 0;
| ^
a.cc:22:12: note: to match this '{'
22 | int main() {
| ^
|
s713749940
|
p04026
|
C++
|
#include<bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;
#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007
#define TIME chrono::system_clock::now
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}
char str[100005];
int dp[100005][30];
int strsize;
int main(){
int i,j,k,l;
int a[30];
gets(str);
for (i=0;'a'<=str[i] && str[i]<='z';i++){
for (j=i+1;'a'<=str[j] && str[j]<='z';j++){
fill(a,a+30,0);
for (k=i;k<=j;k++){
a[str[k]-'a']++;
}
for (k=0;k<30;k++){
if (a[k]>(j-i+1)/2){
printf("%d %d",i,j);
return 0;
}
}
}
}
cout<<"-1 -1"<<endl;
// 部分点
return 0;
}
|
a.cc: In function 'int main()':
a.cc:30:5: error: 'gets' was not declared in this scope; did you mean 'getw'?
30 | gets(str);
| ^~~~
| getw
|
s371802786
|
p04026
|
C++
|
#include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init))
#define mp(a,b) make_pair(a,b)
#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))
using ll = long long;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;
const int mod = 1000000007;
constexpr int inf = ((1<<30)-1)*2+1 ;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0,1,-1,1,-1};
const int dx[] = {0,-1,0,1,1,-1,-1,1};
inline bool value(int x,int y,int w,int h){
return (x >= 0 && x < w && y >= 0 && y < h);
}
template<typename T>
void Unique(vector<T> &v){
sort(all(v));
v.erase(unique(all(v)),v.end());
}
template<typename T,typename U>
ll FindErase(T &v,U tar){
ll cnt = 0;
for(auto it = v.begin(); it != v.end();){
if(*it == tar){
it = v.erase(it);
++cnt;
}
else{
++it;
}
}
return cnt;
}
template<typename T>
bool SuffixErase(T &v,size_t suf){
if(suf > v.size()) return false;
for(auto it = v.begin(); it != v.end();){
if(distance(v.begin(),it) == suf){
v.erase(it);
return true;
}
else{
++it;
}
}
return false;
}
template<typename T>
T ston(string& str, T n){
istringstream sin(str) ;
T num ;
sin >> num ;
return num ;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
if(s.size() > 100) return ;
map<char,int> m;
int l = 0,w = 3,r = w;
bool f = false;
rep(i,3){
m[s[i]]++;
}
while(w < 100){
l = 0,r = w;
while(r <= s.size()){
rep(i,26){
if(m['a'+i] > w/2){
f = true;
cout << l+1 << ' ' << r+1 << endl;
break;
}
}
m[s[l]]--;
l++;
r++;
m[s[r]]++;
}
++w;
}
if(!f) cout << -1 << ' ' << -1 << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:85:22: error: return-statement with no value, in function returning 'int' [-fpermissive]
85 | if(s.size() > 100) return ;
| ^~~~~~
|
s360914827
|
p04026
|
C++
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <queue>
using namespace std;
#define pb push_back
#define pbk pop_back
#define fs first
#define sc second
#define sz(s) ((int) (s).size())
#define all(x) (x).begin(), (x).end()
#define mt make_tuple
#define mp make_pair
#define next hunext
#define prev huprev
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long double ld;
const int inf = 1e9;
const double pi = 4 * atan(1.0);
const double eps = 1e-9;
const int N = int(1e5) + 100;
char s[N];
vi pos[30];
int main() {
#ifdef LOCAL42
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
scanf("%s", s);
int n = strlen(s);
for (int i = 0; i < n; ++i) {
pos[s[i] - 'a'].pb(i);
}
for (int i = 0; i < 26; ++i) {
pii best(inf, -1);
for (int j = 0; j < sz(pos[i]); ++j) {
if (best.fs < 2 * j - pos[i][j] + 1) {
cout << best.sc + 1 << " " << pos[i][j] + 1 << endl;
return 0;
}
best = min(best, mp(2 * j - pos[i][j], pos[i][j]));
}
}
cout << "-1 -1" << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:51:13: error: 'strlen' was not declared in this scope
51 | int n = strlen(s);
| ^~~~~~
a.cc:16:1: note: 'strlen' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
15 | #include <queue>
+++ |+#include <cstring>
16 |
|
s937676703
|
p04026
|
C++
|
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX = 100000 + 10;
char str[MAX];
int main(){
gets(str);
int len = strlen(str);
int ansl = -1, ansr = -1;
for(int i = 0 ; i < len-1 ; i++){
if(str[i] == str[i+1]){
ansl = i+1, ansr = i+2;
}
}
for(int i = 0 ; i < len-2 ; i++){
if(str[i] == str[i+2]){
ansl = i+1, ansr = i+3;
}
}
printf("%d %d\n", ansl, ansr);
return 0;
}
|
a.cc: In function 'int main()':
a.cc:7:3: error: 'gets' was not declared in this scope; did you mean 'getw'?
7 | gets(str);
| ^~~~
| getw
|
s497558441
|
p04027
|
C++
|
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
class Solution{
private:
const int MOD = 1e9 + 7;
public:
int sum(int N, int C, const vector<int>& X){
int max_num = *max_element(X.begin(), X.end());
vector<vector<long long>> mypow(max_num + 1, vector<long long>(C + 1, 1ll));
for(int i = 2; i <= max_num; i ++)
for(int j = 1; j <= C; j ++)
mypow[i][j] = mypow[i][j - 1] * i % MOD;
vector<vector<long long>> res(C + 1, vector<long long>(N, 1ll));
for(int c = 1; c <= C; c ++){
res[c][0] = mypow[X[0]][c];
for(int i = 1; i < N; i ++){
res[c][i] = 0;
for(int x = 0; x <= c; x ++)
res[c][i] += mypow[X[i]][x] * res[c - x][i - 1], res[c][i] %= MOD;
}
}
return res[C][N - 1];
}
private:
vector<vector<long long>> get_dis(int C, int N){
vector<vector<long long>> res(C + 1, vector<long long>(N, 1ll));
for(int c = 1; c <= C; c ++)
for(int n = 2; n <= N; n ++){
res[c][n] = 0;
for(int x = 0; x <= c; x ++)
res[c][n] += res[c - x][n - 1], res[c][n] %= MOD;
}
return res;
}
vector<vector<long long>> get_mypow(const vector<int>& A, const vector<int>& B, int C){
int max_num = max(*max_element(A.begin(), A.end()), *max_element(B.begin(), B.end()));
vector<vector<long long>> res(max_num + 1, vector<long long>(C + 1, 1ll));
for(int i = 2; i <= max_num; i ++)
for(int j = 1; j <= C; j ++)
res[i][j] = res[i][j - 1] * i % MOD;
return res;
}
};
int main() {
int N, C;
scanf("%d%d", &N, &C);
vector<int> A(N), B(N);
for(int i = 0 ; i < N; i ++) scanf("%d", &A[i]);
for(int i = 0 ; i < N; i ++){
scanf("%d", &B[i]);
assert(B[i] == A[i]);
}
printf("%d\n", Solution().sum(N, C, A));
return 0;
}
|
a.cc: In member function 'int Solution::sum(int, int, const std::vector<int>&)':
a.cc:15:24: error: 'max_element' was not declared in this scope
15 | int max_num = *max_element(X.begin(), X.end());
| ^~~~~~~~~~~
a.cc: In member function 'std::vector<std::vector<long long int> > Solution::get_mypow(const std::vector<int>&, const std::vector<int>&, int)':
a.cc:48:28: error: 'max_element' was not declared in this scope
48 | int max_num = max(*max_element(A.begin(), A.end()), *max_element(B.begin(), B.end()));
| ^~~~~~~~~~~
a.cc: In function 'int main()':
a.cc:67:9: error: 'assert' was not declared in this scope
67 | assert(B[i] == A[i]);
| ^~~~~~
a.cc:4:1: note: 'assert' is defined in header '<cassert>'; this is probably fixable by adding '#include <cassert>'
3 | #include <vector>
+++ |+#include <cassert>
4 |
|
s575602918
|
p04027
|
C
|
#include<bits/stdc++.h>
#define M 1000000007
#define N 505
#define ll long long
#define ri register int
using namespace std;
inline int read()
{
int f=1,x=0;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-'0';ch=getchar();}
return f*x;
}
int n,c,l,sum[505][505],a[505],b[505],f[505][505];
inline int power(int a,int b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a%M;
b>>=1;
a=a*a%M;
}
return ans%M;
}
int main()
{
n=read(),c=read();
for(ri i=1;i<=n;i++)
a[i]=read();
for(ri i=1;i<=n;i++)
b[i]=read();
for(ri i=1;i<=n;i++)
sum[i][0]=b[i]-a[i]+1;
f[0][0]=1;
for(ri i=1;i<=n;i++)
for(ri j=1;j<=c;j++)
for(ri k=a[i];k<=b[i];k++)
sum[i][j]=(sum[i][j]+power(k,j))%M;
for(ri i=1;i<=n;i++)
f[i][0]=(f[i-1][0]*sum[i][0])%M;
for(ri i=1;i<=n;i++)
for(ri j=1;j<=c;j++)
for(ri k=0;k<=j;k++)
f[i][j]=(f[i][j]+f[i-1][j-k]*sum[i][k])%M;
cout<<f[n][c];
return 0;
}
|
main.c:1:9: fatal error: bits/stdc++.h: No such file or directory
1 | #include<bits/stdc++.h>
| ^~~~~~~~~~~~~~~
compilation terminated.
|
s479251969
|
p04027
|
C++
|
#include <bits/stdc++.h> // clang-format off
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#ifdef ONLINE_JUDGE
#define rep(i,N) for(int i = 0; i < (int)(N); i++)
#define repr(i,N) for(int i = (int)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (int)(N) ; i++)
#define repr1(i,N) for(int i = (N) ; (int)(i) > 0 ; i--)
#else
#define rep(i,N) for(long long i = 0; i < (long long)(N); i++)
#define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)
#define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)
#endif
using namespace std; void solve();
using ll = long long; template<class T = ll> using V = vector<T>;
using vi = V<int>; using vl = V<>; using vvi = V< V<int> >;
constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;
//struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); for(int i=0;i<s;i++) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
#define trca(v,N) do { cerr << #v << " = "; array_out(v , N);} while(0)
#define trcc(v) do { cerr << "name : " << #v << "\n"; int cnt = 0; each(x , v){cerr << (cnt++) << " : "; trc(x); } } while(0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main(){solve();}
#endif
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
#define in2(s,t) rep(i,sz(s)){in(s[i] , t[i]);}
#define in3(s,t,u) rep(i,sz(s)){in(s[i] , t[i] , u[i]);}
#define in4(s,t,u,v) rep(i,sz(s)){in(s[i] , t[i] , u[i] , v[i]);}
using vd = V<double>; using vs = V<string>; using vvl = V< V<> >;
template<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}
using P = pair<int,int>; using vp = V<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
// clang-format on
/////////////////////////
template< int mod >
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int) (1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt< mod >(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt< MOD >;
using mint = modint;
namespace FastFourierTransform {
using real = double;
struct C {
real x, y;
C() : x(0), y(0) {}
C(real x, real y) : x(x), y(y) {}
inline C operator+(const C &c) const { return C(x + c.x, y + c.y); }
inline C operator-(const C &c) const { return C(x - c.x, y - c.y); }
inline C operator*(const C &c) const { return C(x * c.x - y * c.y, x * c.y + y * c.x); }
inline C conj() const { return C(x, -y); }
};
const real PI = acosl(-1);
int base = 1;
vector< C > rts = { {0, 0},
{1, 0} };
vector< int > rev = {0, 1};
void ensure_base(int nbase) {
if(nbase <= base) return;
rev.resize(1 << nbase);
rts.resize(1 << nbase);
for(int i = 0; i < (1 << nbase); i++) {
rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
}
while(base < nbase) {
real angle = PI * 2.0 / (1 << (base + 1));
for(int i = 1 << (base - 1); i < (1 << base); i++) {
rts[i << 1] = rts[i];
real angle_i = angle * (2 * i + 1 - (1 << base));
rts[(i << 1) + 1] = C(cos(angle_i), sin(angle_i));
}
++base;
}
}
void fft(vector< C > &a, int n) {
assert((n & (n - 1)) == 0);
int zeros = __builtin_ctz(n);
ensure_base(zeros);
int shift = base - zeros;
for(int i = 0; i < n; i++) {
if(i < (rev[i] >> shift)) {
swap(a[i], a[rev[i] >> shift]);
}
}
for(int k = 1; k < n; k <<= 1) {
for(int i = 0; i < n; i += 2 * k) {
for(int j = 0; j < k; j++) {
C z = a[i + j + k] * rts[j + k];
a[i + j + k] = a[i + j] - z;
a[i + j] = a[i + j] + z;
}
}
}
}
vector< int64_t > multiply(const vector< int > &a, const vector< int > &b) {
int need = (int) a.size() + (int) b.size() - 1;
int nbase = 1;
while((1 << nbase) < need) nbase++;
ensure_base(nbase);
int sz = 1 << nbase;
vector< C > fa(sz);
for(int i = 0; i < sz; i++) {
int x = (i < (int) a.size() ? a[i] : 0);
int y = (i < (int) b.size() ? b[i] : 0);
fa[i] = C(x, y);
}
fft(fa, sz);
C r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);
for(int i = 0; i <= (sz >> 1); i++) {
int j = (sz - i) & (sz - 1);
C z = (fa[j] * fa[j] - (fa[i] * fa[i]).conj()) * r;
fa[j] = (fa[i] * fa[i] - (fa[j] * fa[j]).conj()) * r;
fa[i] = z;
}
for(int i = 0; i < (sz >> 1); i++) {
C A0 = (fa[i] + fa[i + (sz >> 1)]) * t;
C A1 = (fa[i] - fa[i + (sz >> 1)]) * t * rts[(sz >> 1) + i];
fa[i] = A0 + A1 * s;
}
fft(fa, sz >> 1);
vector< int64_t > ret(need);
for(int i = 0; i < need; i++) {
ret[i] = llround(i & 1 ? fa[i >> 1].y : fa[i >> 1].x);
}
return ret;
}
};
template< typename T >
struct ArbitraryModConvolution {
using real = FastFourierTransform::real;
using C = FastFourierTransform::C;
ArbitraryModConvolution() = default;
vector< T > multiply(const vector< T > &a, const vector< T > &b, int need = -1) {
if(need == -1) need = a.size() + b.size() - 1;
int nbase = 0;
while((1 << nbase) < need) nbase++;
FastFourierTransform::ensure_base(nbase);
int sz = 1 << nbase;
vector< C > fa(sz);
for(int i = 0; i < (int)a.size(); i++) {
fa[i] = C(a[i].x & ((1 << 15) - 1), a[i].x >> 15);
}
fft(fa, sz);
vector< C > fb(sz);
if(a == b) {
fb = fa;
} else {
for(int i = 0; i < (int)b.size(); i++) {
fb[i] = C(b[i].x & ((1 << 15) - 1), b[i].x >> 15);
}
fft(fb, sz);
}
real ratio = 0.25 / sz;
C r2(0, -1), r3(ratio, 0), r4(0, -ratio), r5(0, 1);
for(int i = 0; i <= (sz >> 1); i++) {
int j = (sz - i) & (sz - 1);
C a1 = (fa[i] + fa[j].conj());
C a2 = (fa[i] - fa[j].conj()) * r2;
C b1 = (fb[i] + fb[j].conj()) * r3;
C b2 = (fb[i] - fb[j].conj()) * r4;
if(i != j) {
C c1 = (fa[j] + fa[i].conj());
C c2 = (fa[j] - fa[i].conj()) * r2;
C d1 = (fb[j] + fb[i].conj()) * r3;
C d2 = (fb[j] - fb[i].conj()) * r4;
fa[i] = c1 * d1 + c2 * d2 * r5;
fb[i] = c1 * d2 + c2 * d1;
}
fa[j] = a1 * b1 + a2 * b2 * r5;
fb[j] = a1 * b2 + a2 * b1;
}
fft(fa, sz);
fft(fb, sz);
vector< T > ret(need);
for(int i = 0; i < need; i++) {
int64_t aa = llround(fa[i].x);
int64_t bb = llround(fb[i].x);
int64_t cc = llround(fa[i].y);
aa = T(aa).x, bb = T(bb).x, cc = T(cc).x;
ret[i] = aa + (bb << 15) + (cc << 30);
}
return ret;
}
};
template< int mod >
struct NumberTheoreticTransform {
int base, max_base, root;
vector< int > rev, rts;
NumberTheoreticTransform() : base(1), rev{0, 1}, rts{0, 1} {
assert(mod >= 3 && mod % 2 == 1);
auto tmp = mod - 1;
max_base = 0;
while(tmp % 2 == 0) tmp >>= 1, max_base++;
root = 2;
while(mod_pow(root, (mod - 1) >> 1) == 1) ++root;
assert(mod_pow(root, mod - 1) == 1);
root = mod_pow(root, (mod - 1) >> max_base);
}
inline int mod_pow(int x, int n) {
int ret = 1;
while(n > 0) {
if(n & 1) ret = mul(ret, x);
x = mul(x, x);
n >>= 1;
}
return ret;
}
inline int inverse(int x) {
return mod_pow(x, mod - 2);
}
inline unsigned add(unsigned x, unsigned y) {
x += y;
if(x >= mod) x -= mod;
return x;
}
inline unsigned mul(unsigned a, unsigned b) {
return 1ull * a * b % (unsigned long long) mod;
}
void ensure_base(int nbase) {
if(nbase <= base) return;
rev.resize(1 << nbase);
rts.resize(1 << nbase);
for(int i = 0; i < (1 << nbase); i++) {
rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
}
assert(nbase <= max_base);
while(base < nbase) {
int z = mod_pow(root, 1 << (max_base - 1 - base));
for(int i = 1 << (base - 1); i < (1 << base); i++) {
rts[i << 1] = rts[i];
rts[(i << 1) + 1] = mul(rts[i], z);
}
++base;
}
}
void ntt(vector< int > &a) {
const int n = (int) a.size();
assert((n & (n - 1)) == 0);
int zeros = __builtin_ctz(n);
ensure_base(zeros);
int shift = base - zeros;
for(int i = 0; i < n; i++) {
if(i < (rev[i] >> shift)) {
swap(a[i], a[rev[i] >> shift]);
}
}
for(int k = 1; k < n; k <<= 1) {
for(int i = 0; i < n; i += 2 * k) {
for(int j = 0; j < k; j++) {
int z = mul(a[i + j + k], rts[j + k]);
a[i + j + k] = add(a[i + j], mod - z);
a[i + j] = add(a[i + j], z);
}
}
}
}
vector< int > multiply(vector< int > a, vector< int > b) {
int need = a.size() + b.size() - 1;
int nbase = 1;
while((1 << nbase) < need) nbase++;
ensure_base(nbase);
int sz = 1 << nbase;
a.resize(sz, 0);
b.resize(sz, 0);
ntt(a);
ntt(b);
int inv_sz = inverse(sz);
for(int i = 0; i < sz; i++) {
a[i] = mul(a[i], mul(b[i], inv_sz));
}
reverse(a.begin() + 1, a.end());
ntt(a);
a.resize(need);
return a;
}
vector<modint> multiply_for_fps(const vector<modint> &a,const vector<modint> &b){
vector<int> A(a.size()) , B(b.size());
for(int i = 0;i < (int)a.size(); i++) A[i] = a[i].x;
for(int i = 0;i < (int)b.size(); i++) B[i] = b[i].x;
auto C = multiply( A , B );
vector<modint> ret(C.size());
for(int i = 0; i < (int)C.size() ;i++) ret[i].x = C[i];
return ret;
}
};
template< typename T >
struct FormalPowerSeries : vector< T > {
using vector< T >::vector;
using P = FormalPowerSeries;
using MULT = function< P(P, P) >;
static MULT &get_mult() {
static MULT mult = nullptr;
return mult;
}
static void set_fft(MULT f) {
get_mult() = f;
}
void shrink() {
while(this->size() && this->back() == T(0)) this->pop_back();
}
P operator+(const P &r) const { return P(*this) += r; }
P operator+(const T &v) const { return P(*this) += v; }
P operator-(const P &r) const { return P(*this) -= r; }
P operator-(const T &v) const { return P(*this) -= v; }
P operator*(const P &r) const { return P(*this) *= r; }
P operator*(const T &v) const { return P(*this) *= v; }
P operator/(const P &r) const { return P(*this) /= r; }
P operator%(const P &r) const { return P(*this) %= r; }
P &operator+=(const P &r) {
if(r.size() > this->size()) this->resize(r.size());
for(int i = 0; i < (int)r.size(); i++) (*this)[i] += r[i];
return *this;
}
P &operator+=(const T &r) {
if(this->empty()) this->resize(1);
(*this)[0] += r;
return *this;
}
P &operator-=(const P &r) {
if(r.size() > this->size()) this->resize(r.size());
for(int i = 0; i < (int)r.size(); i++) (*this)[i] -= r[i];
shrink();
return *this;
}
P &operator-=(const T &r) {
if(this->empty()) this->resize(1);
(*this)[0] -= r;
shrink();
return *this;
}
P &operator*=(const T &v) {
const int n = (int) this->size();
for(int k = 0; k < n; k++) (*this)[k] *= v;
return *this;
}
P &operator*=(const P &r) {
if(this->empty() || r.empty()) {
this->clear();
return *this;
}
assert(get_mult() != nullptr);
return *this = get_mult()(*this, r);
}
P &operator%=(const P &r) {
return *this -= *this / r * r;
}
P operator-() const {
P ret(this->size());
for(int i = 0; i < this->size(); i++) ret[i] = -(*this)[i];
return ret;
}
P &operator/=(const P &r) {
if(this->size() < r.size()) {
this->clear();
return *this;
}
int n = this->size() - r.size() + 1;
return *this = (rev().pre(n) * r.rev().inv(n)).pre(n).rev(n);
}
P pre(int sz) const {
return P(begin(*this), begin(*this) + min((int) this->size(), sz));
}
P operator>>(int sz) const {
if(this->size() <= sz) return {};
P ret(*this);
ret.erase(ret.begin(), ret.begin() + sz);
return ret;
}
P operator<<(int sz) const {
P ret(*this);
ret.insert(ret.begin(), sz, T(0));
return ret;
}
P rev(int deg = -1) const {
P ret(*this);
if(deg != -1) ret.resize(deg, T(0));
reverse(begin(ret), end(ret));
return ret;
}
P diff() const {
const int n = (int) this->size();
P ret(max(0, n - 1));
for(int i = 1; i < n; i++) ret[i - 1] = (*this)[i] * T(i);
return ret;
}
P integral() const {
const int n = (int) this->size();
P ret(n + 1);
ret[0] = T(0);
for(int i = 0; i < n; i++) ret[i + 1] = (*this)[i] / T(i + 1);
return ret;
}
// F(0) must not be 0
P inv(int deg = -1) const {
assert(((*this)[0]) != T(0));
const int n = (int) this->size();
if(deg == -1) deg = n;
P ret({T(1) / (*this)[0]});
for(int i = 1; i < deg; i <<= 1) {
ret = (ret + ret - ret * ret * pre(i << 1)).pre(i << 1);
}
return ret.pre(deg);
}
// F(0) must be 1
P log(int deg = -1) const {
assert((*this)[0] == 1);
const int n = (int) this->size();
if(deg == -1) deg = n;
return (this->diff() * this->inv(deg)).pre(deg - 1).integral();
}
P sqrt(int deg = -1) const {
const int n = (int) this->size();
if(deg == -1) deg = n;
if((*this)[0] == T(0)) {
for(int i = 1; i < n; i++) {
if((*this)[i] != T(0)) {
if(i & 1) return {};
if(deg - i / 2 <= 0) break;
auto ret = (*this >> i).sqrt(deg - i / 2) << (i / 2);
if(ret.size() < deg) ret.resize(deg, T(0));
return ret;
}
}
return P(deg, 0);
}
P ret({T(1)});
T inv2 = T(1) / T(2);
for(int i = 1; i < deg; i <<= 1) {
ret = (ret + pre(i << 1) * ret.inv(i << 1)) * inv2;
}
return ret.pre(deg);
}
// F(0) must be 0
P exp(int deg = -1) const {
assert((*this)[0] == T(0));
const int n = (int) this->size();
if(deg == -1) deg = n;
P ret({T(1)});
for(int i = 1; i < deg; i <<= 1) {
ret = (ret * (pre(i << 1) + T(1) - ret.log(i << 1))).pre(i << 1);
}
return ret.pre(deg);
}
P pow(int64_t k, int deg = -1) const {
const int n = (int) this->size();
if(deg == -1) deg = n;
for(int i = 0; i < n; i++) {
if((*this)[i] != T(0)) {
T rev = T(1) / (*this)[i];
P C(*this * rev);
P D(n - i);
for(int j = i; j < n; j++) D[j - i] = C[j];
D = (D.log() * k).exp() * (*this)[i].pow(k);
P E(deg);
if(i * k > deg) return E;
auto S = i * k;
for(int j = 0; j + S < deg && j < D.size(); j++) E[j + S] = D[j];
return E;
}
}
return *this;
}
T eval(T x) const {
T r = 0, w = 1;
for(auto &v : *this) {
r += w * v;
w *= x;
}
return r;
}
};
using FPS = FormalPowerSeries< modint >;
// fにa * x^n + bを掛ける
void mul_simple(FPS &f,modint a ,int n, modint b){
for(int i = (int)f.size() - 1 ; i >= 0 ; i--){
f[i] *= b;
if(i >= n) f[i] += f[i - n] * a;
}
}
// fからa * x^n + bを割る
void div_simple(FPS &f,modint a,int n,modint b){
for(int i = 0 ; i < (int)f.size() ; i++){
f[i] /= b;
if(i + n < (int)f.size() ) f[n + i] -= f[i] * a;
}
}
// f / gをdeg(f)次まで求める
FPS div_(FPS &f , FPS g){
int n = f.size();
return (f * g.inv(n)).pre(n);
}
// solve関数内で
//
// FPS::set_fft(mul);
//
// とすること。
/**
NumberTheoreticTransform<MOD> ntt;
auto mul = [&](const FPS::P &a, const FPS::P &b) {
auto ret =ntt.multiply_for_fps(a , b);
return FPS::P(ret.begin(), ret.end());
};
/*///
ArbitraryModConvolution< modint > fft;
auto mul = [&](const FPS::P &a, const FPS::P &b) {
auto ret = fft.multiply(a, b);
return FPS::P(ret.begin(), ret.end());
};
//*/
// 下記のリンクを実装(kitamasa法のモンゴメリ乗算を使わない版)
// http://q.c.titech.ac.jp/docs/progs/polynomial_division.html
// k項間漸化式のa_Nを求める O(k log k log N)
// N ... 求めたい項 (0-indexed)
// Q ... 漸化式 (1 - \sum_i c_i x^i)の形
// a ... 初期解 (a_0 , a_1 , ... , a_k-1)
// x^N を fでわった剰余を求め、aと内積を取る
modint kitamasa(ll N, FPS &Q, FPS &a){
int k = Q.size() - 1;
assert( (int)a.size() == k );
FPS P = a * Q; P.resize(k);
while(N){
auto Q2 = Q;
for(int i = 1; i < (int)Q2.size(); i += 2) Q2[i].x = MOD - Q2[i].x;
auto S = P * Q2;
auto T = Q * Q2;
if(N & 1){
for(int i = 1 ; i < (int)S.size() ; i += 2) P[i>>1].x = S[i].x;
for(int i = 0 ; i < (int)T.size() ; i += 2) Q[i>>1].x = T[i].x;
}
else{
for(int i = 0 ; i < (int)S.size() ; i += 2) P[i>>1].x = S[i].x;
for(int i = 0 ; i < (int)T.size() ; i += 2) Q[i>>1].x = T[i].x;
}
N >>= 1;
}
return P[0];
}
mint dp[444][444];
void solve(){
ini(N , C);
vi A(N) , B(N); in(A ,B);
FPS::set_fft(mul);
mint beki[444][444];
rep(i , 401) rep(j , 401){
if(j) beki[i][j] = beki[i][j - 1] * i;
else beki[i][j] = 1;
}
rep1(i , 400) rep(j , 401){
beki[i][j] += beki[i - 1][j];
}
FPS f{1};
rep(i , N){
FPS g(C + 1);
rep(j , C + 1){
trc( i , j ,A[i] , B[i] , beki[B[i]][j] , beki[A[i] - 1][j]);
g[j] = beki[B[i]][j] - beki[A[i] - 1][j];
}
//trc(g);
f *= g;
//trc(f);
f.resize(C + 1);
}
out(f[C]);
}
|
a.cc:678:13: error: non-local lambda expression cannot have a capture-default
678 | auto mul = [&](const FPS::P &a, const FPS::P &b) {
| ^
|
s545786676
|
p04027
|
C++
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cout << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//#define int long long
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0) v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator - () const noexcept {
return val ? MOD - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= MOD) val -= MOD;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += MOD;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
return os << x.val;
}
friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1) t = t * a;
return t;
}
};
const int MOD = 1000000007;
using mint = Fp<MOD>;
void solve() {
int n, c; cin >> n >> c;
vector<int> a(n), b(n);
rep(i, n) {
cin >> a[i];
}
rep(i, n) {
cin >> b[i];
}
mint dp[440][440];
rep(i, 440) {
dp[0][i] = 0;
}
rep(i, n) {
rep(j, c + 1) {
rep(k, j + 1) {
dp[i + 1][j] += dp[i][k] * modpow(a[i], j - k);
}
}
}
cout << dp[n][c] << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init();
solve();
//cout << "finish" << endl;
return 0;
}
|
a.cc: In function 'void solve()':
a.cc:129:44: error: 'modpow' was not declared in this scope
129 | dp[i + 1][j] += dp[i][k] * modpow(a[i], j - k);
| ^~~~~~
|
s719276219
|
p04027
|
Java
|
import java.util.*;
import java.io.*;
public class arc59e
{
public static void main(String[] args) { new arc59e(); }
FS in = new FS();
PrintWriter out = new PrintWriter(System.out);
int n, c;
long mod = (long)1e9 + 7;
int[] a, b;
long[][] pre, dp;
arc59e() {
n = in.nextInt();
c = in.nextInt();
a = new int[n]; b = new int[n];
for (int i = 0; i < n; a[i++] = in.nextInt());
for (int i = 0; i < n; b[i++] = in.nextInt());
pre = new long[n][c + 1];
for (int i = 0; i < n; i++)
for (int j = 0; j <= c; j++)
for (int k = a[i]; k <= b[i]; k++) {
pre[i][j] += pow(k, j);
pre[i][j] %= mod;
}
dp = new long[n][c + 1];
for (int i = 0; i < n; i++)
Arrays.fill(dp[i], -1L);
out.println(dp(0, c));
out.close();
}
long dp(int idx, int left) {
if (left == 0)
return 1;
if (idx == n)
return 0;
if (dp[idx][left] != -1)
return dp[idx][left];
long ans = 0;
for (int i = 0; i <= left; i++) {
ans += mult(pre[idx][i], dp(idx + 1, left - i));
ans %= mod;
}
return dp[idx][left] = ans;
}
long mult(long a, long b) {
return (a % mod)*(b % mod) % mod;
}
long pow(int a, long b) {
if (b == 0)
return 1;
if (b == 1)
return a % mod;
long mid = pow(a, b / 2);
mid *= mid; mid %= mod;
if ((b & 1) == 0)
return mid;
return (a * mid) % mod;
}
class FS {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
String next() {
while (!st.hasMoreTokens()) {
try { st = new StringTokenizer(br.readLine()); }
catch (Exception e) {}
} return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble() { return Double.parseDouble(next()); }
}
}
|
Main.java:4: error: class arc59e is public, should be declared in a file named arc59e.java
public class arc59e
^
1 error
|
s317405309
|
p04027
|
C++
|
#include<iostream>
#include <cstdio>
#include<algorithm>
#define LL long long
#define INF 0x3f3f3f3f
//#define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int MAXN = 405;
const LL mod = 1e9+7;
LL sum[MAXN];
LL A[MAXN],B[MAXN];
LL dp[MAXN][MAXN];
LL N,C;
using namespace std;
void calc(int a, int b) {
memset(sum,0,sizeof(sum));
for(int i = a; i <= b; ++i)
{
LL t = 1;
for(int j = 0; j <= C; ++j)
{
sum[j] = sum[j]+t;
sum[j] %= mod;
t = t*i%mod;
}
}
}
int main()
{
//io;
cin>>N>>C;
for(int i = 1; i <= N; ++i)
cin>>A[i];
for(int i = 1; i <= N; ++i)
cin>>B[i];
dp[0][0] = 1;
for(int i = 1; i <= N; ++i)
{
calc(A[i],B[i]);//计算A[i]^m + (A[i]+1)^m + ... + B[i]^m
for(int j = 0; j <= C; ++j)
for(int k = 0; k <= j; ++k)
dp[i][j] = (dp[i][j] + dp[i-1][j-k]*sum[k])%mod;
}
cout << dp[N][C] << endl;
return 0;
}
|
a.cc: In function 'void calc(int, int)':
a.cc:17:9: error: 'memset' was not declared in this scope
17 | memset(sum,0,sizeof(sum));
| ^~~~~~
a.cc:5:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
4 | #include<algorithm>
+++ |+#include <cstring>
5 | #define LL long long
|
s232177455
|
p04027
|
C++
|
#include<bits/stdc++.h>
#include<algorithm>
#define LL long long
#define INF 0x3f3f3f3f
//#define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int MAXN = 405;
const LL mod = 1e9+7;
LL sum[MAXN];
LL A[MAXN],B[MAXN];
LL dp[MAXN][MAXN];
LL N,C;
LL calc(int a, int b)
{
memset(sum,0,sizeof(sum));
for(int i = a; i <= b; ++i)
{
LL t = 1;
for(int j = 0; j <= C; ++j)
{
sum[j] = sum[j]+t;
sum[j] %= mod;
t = t*i%mod;
}
}
}
int main()
{
//io;
cin >> N >> C;
for(int i = 1; i <= N; ++i)
cin >> A[i];
for(int i = 1; i <= N; ++i)
cin >> B[i];
dp[0][0] = 1;
for(int i = 1; i <= N; ++i)
{
calc(A[i],B[i]);//计算A[i]^m + (A[i]+1)^m + ... + B[i]^m
for(int j = 0; j <= C; ++j)
for(int k = 0; k <= j; ++k)
dp[i][j] = (dp[i][j] + dp[i-1][j-k]*sum[k])%mod;
}
cout << dp[N][C] << endl;
return 0;
}
|
a.cc: In function 'long long int calc(int, int)':
a.cc:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
27 | }
| ^
a.cc: In function 'int main()':
a.cc:32:5: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
32 | cin >> N >> C;
| ^~~
| std::cin
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:146,
from a.cc:2:
/usr/include/c++/14/iostream:62:18: note: 'std::cin' declared here
62 | extern istream cin; ///< Linked to standard input
| ^~~
a.cc:45:5: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
45 | cout << dp[N][C] << endl;
| ^~~~
| std::cout
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
63 | extern ostream cout; ///< Linked to standard output
| ^~~~
a.cc:45:25: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
45 | cout << dp[N][C] << endl;
| ^~~~
| std::endl
In file included from /usr/include/c++/14/istream:41,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
744 | endl(basic_ostream<_CharT, _Traits>& __os)
| ^~~~
|
s946182055
|
p04027
|
C++
|
#include<bits/stdc++.h>
#include<algorithm>
#define LL long long
#define INF 0x3f3f3f3f
#define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int MAXN = 405;
const LL mod = 1e9+7;
LL sum[MAXN];
LL A[MAXN],B[MAXN];
LL dp[MAXN][MAXN];
LL N,C;
LL calc(int a, int b)
{
memset(sum,0,sizeof(sum));
for(int i = a; i <= b; ++i)
{
LL t = 1;
for(int j = 0; j <= C; ++j)
{
sum[j] = sum[j]+t;
sum[j] %= mod;
t = t*i%mod;
}
}
}
int main()
{
io;
cin >> N >> C;
for(int i = 1; i <= N; ++i)
cin >> A[i];
for(int i = 1; i <= N; ++i)
cin >> B[i];
dp[0][0] = 1;
for(int i = 1; i <= N; ++i)
{
calc(A[i],B[i]);//计算A[i]^m + (A[i]+1)^m + ... + B[i]^m
for(int j = 0; j <= C; ++j)
for(int k = 0; k <= j; ++k)
dp[i][j] = (dp[i][j] + dp[i-1][j-k]*sum[k])%mod;
}
cout << dp[N][C] << endl;
return 0;
}
|
a.cc: In function 'long long int calc(int, int)':
a.cc:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
27 | }
| ^
a.cc: In function 'int main()':
a.cc:6:12: error: 'ios' has not been declared
6 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~
a.cc:31:5: note: in expansion of macro 'io'
31 | io;
| ^~
a.cc:6:36: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
6 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~
a.cc:31:5: note: in expansion of macro 'io'
31 | io;
| ^~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:146,
from a.cc:2:
/usr/include/c++/14/iostream:62:18: note: 'std::cin' declared here
62 | extern istream cin; ///< Linked to standard input
| ^~~
a.cc:6:47: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
6 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~~
a.cc:31:5: note: in expansion of macro 'io'
31 | io;
| ^~
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
63 | extern ostream cout; ///< Linked to standard output
| ^~~~
a.cc:45:25: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
45 | cout << dp[N][C] << endl;
| ^~~~
| std::endl
In file included from /usr/include/c++/14/istream:41,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
744 | endl(basic_ostream<_CharT, _Traits>& __os)
| ^~~~
|
s528986906
|
p04027
|
C++
|
#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#define LL long long
#define INF 0x3f3f3f3f
#define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int MAXN = 405;
const LL mod = 1e9+7;
LL sum[MAXN];
LL A[MAXN],B[MAXN];
LL dp[MAXN][MAXN];
LL N,C;
LL calc(int a, int b)
{
memset(sum,0,sizeof(sum));
for(int i = a; i <= b; ++i)
{
LL t = 1;
for(int j = 0; j <= C; ++j)
{
sum[j] = sum[j]+t;
sum[j] %= mod;
t = t*i%mod;
}
}
}
int main()
{
io;
cin >> N >> C;
for(int i = 1; i <= N; ++i)
cin >> A[i];
for(int i = 1; i <= N; ++i)
cin >> B[i];
dp[0][0] = 1;
for(int i = 1; i <= N; ++i)
{
calc(A[i],B[i]);//计算A[i]^m + (A[i]+1)^m + ... + B[i]^m
for(int j = 0; j <= C; ++j)
for(int k = 0; k <= j; ++k)
dp[i][j] = (dp[i][j] + dp[i-1][j-k]*sum[k])%mod;
}
cout << dp[N][C] << endl;
return 0;
}
|
a.cc: In function 'long long int calc(int, int)':
a.cc:28:1: warning: no return statement in function returning non-void [-Wreturn-type]
28 | }
| ^
a.cc: In function 'int main()':
a.cc:7:12: error: 'ios' has not been declared
7 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~
a.cc:32:5: note: in expansion of macro 'io'
32 | io;
| ^~
a.cc:7:36: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
7 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~
a.cc:32:5: note: in expansion of macro 'io'
32 | io;
| ^~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:146,
from a.cc:2:
/usr/include/c++/14/iostream:62:18: note: 'std::cin' declared here
62 | extern istream cin; ///< Linked to standard input
| ^~~
a.cc:7:47: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
7 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~~
a.cc:32:5: note: in expansion of macro 'io'
32 | io;
| ^~
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
63 | extern ostream cout; ///< Linked to standard output
| ^~~~
a.cc:46:25: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
46 | cout << dp[N][C] << endl;
| ^~~~
| std::endl
In file included from /usr/include/c++/14/istream:41,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
744 | endl(basic_ostream<_CharT, _Traits>& __os)
| ^~~~
|
s736198314
|
p04027
|
C++
|
#include<bits/stdc++.h>
#include<iostream>
#define LL long long
#define INF 0x3f3f3f3f
#define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int MAXN = 405;
const LL mod = 1e9+7;
LL sum[MAXN];
LL A[MAXN],B[MAXN];
LL dp[MAXN][MAXN];
LL N,C;
LL calc(int a, int b)
{
memset(sum,0,sizeof(sum));
for(int i = a; i <= b; ++i)
{
LL t = 1;
for(int j = 0; j <= C; ++j)
{
sum[j] = sum[j]+t;
sum[j] %= mod;
t = t*i%mod;
}
}
}
int main()
{
io;
cin >> N >> C;
for(int i = 1; i <= N; ++i)
cin >> A[i];
for(int i = 1; i <= N; ++i)
cin >> B[i];
dp[0][0] = 1;
for(int i = 1; i <= N; ++i)
{
calc(A[i],B[i]);//计算A[i]^m + (A[i]+1)^m + ... + B[i]^m
for(int j = 0; j <= C; ++j)
for(int k = 0; k <= j; ++k)
dp[i][j] = (dp[i][j] + dp[i-1][j-k]*sum[k])%mod;
}
cout << dp[N][C] << endl;
return 0;
}
|
a.cc: In function 'long long int calc(int, int)':
a.cc:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
27 | }
| ^
a.cc: In function 'int main()':
a.cc:6:12: error: 'ios' has not been declared
6 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~
a.cc:31:5: note: in expansion of macro 'io'
31 | io;
| ^~
a.cc:6:36: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
6 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~
a.cc:31:5: note: in expansion of macro 'io'
31 | io;
| ^~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:146,
from a.cc:2:
/usr/include/c++/14/iostream:62:18: note: 'std::cin' declared here
62 | extern istream cin; ///< Linked to standard input
| ^~~
a.cc:6:47: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
6 | #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
| ^~~~
a.cc:31:5: note: in expansion of macro 'io'
31 | io;
| ^~
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
63 | extern ostream cout; ///< Linked to standard output
| ^~~~
a.cc:45:25: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
45 | cout << dp[N][C] << endl;
| ^~~~
| std::endl
In file included from /usr/include/c++/14/istream:41,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
744 | endl(basic_ostream<_CharT, _Traits>& __os)
| ^~~~
|
s790527141
|
p04027
|
C++
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
static int MOD=1000000007;
static long p[][]=new long[405][405];
static long sum[][]=new long[405][405];
static long dp[][]=new long[405][405];
static long a[]=new long[405];
static long b[]=new long[405];
public static void main(String[] args) {
Scanner in=new Scanner( new BufferedReader(new InputStreamReader(System.in))) ;
for(int i=1;i<=404;i++)//p[i][j]=i^j
{
p[i]= new long[405];
p[i][0]=1;
for(int j=1;j<=404;j++)
{
p[i][j]=(p[i][j-1]*i)%MOD;
}
}
for(int i=1;i<=404;i++)//sum[i][j] 1^j+...+i^j
{
sum[i]=new long[405];
for(int j=0;j<=404;j++)
{
sum[0][j]=0;
sum[i][j]=(sum[i-1][j]%MOD+p[i][j]%MOD)%MOD;
}
}
int n=in.nextInt();
int m=in.nextInt();
for(int i=1;i<=n;i++)
{
a[i]=in.nextLong();
}
for(int i=1;i<=n;i++)
{
b[i]=in.nextLong();
}
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j<=m;j++)
{
for(int k=0;k<=j;k++)
{
long temp=(sum[(int) b[i]][k]%MOD-sum[(int) (a[i]-1)][k]%MOD+MOD)%MOD;
dp[i][j]=(dp[i][j]%MOD+dp[i-1][j-k]*temp%MOD)%MOD;
}
}
}
System.out.println(dp[n][m]);
return;
}
}
|
a.cc:1:1: error: 'import' does not name a type
1 | import java.io.BufferedReader;
| ^~~~~~
a.cc:1:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:2:1: error: 'import' does not name a type
2 | import java.io.InputStreamReader;
| ^~~~~~
a.cc:2:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:3:1: error: 'import' does not name a type
3 | import java.util.Scanner;
| ^~~~~~
a.cc:3:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:4:1: error: 'import' does not name a type
4 | import java.util.TreeMap;
| ^~~~~~
a.cc:4:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:9:1: error: expected unqualified-id before 'public'
9 | public class Main {
| ^~~~~~
|
s509822450
|
p04027
|
C++
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1e9+7;
ll p[406][406];
ll pre[406][406];
ll dp[406][406]={};
ll a[406],b[406];
int main()
{
p[0][0]=1;
for(ll i=1;i<=400;i++)
{
p[i][0]=1;
pre[i][0]=1;
for(ll j=1;j<=400;j++)
{
p[i][j]=(p[i][j-1]*i)%mod;
}
}
pre[0][0]=1;
for(ll i=1;i<=400;i++)
for(ll j=0;j<=400;j++)
{
pre[i][j]=(pre[i-1][j]+p[i][j])%mod;
}
ll n,c;
cin>>n>>c;
for(ll i=1;i<=n;i++)
{
cin>>a[i];
}
for(ll i=1;i<=n;i++)
{
cin>>b[i];
}
dp[0][0]=1;
for(ll i=1;i<=n;i++)
{
for(ll j=0;j<=c;j++)
{
for(ll k=0;k<=j;k++)
{
ll y=(pre[b[i]][j-k]-pre[a[i]-1][j-k])%mod;
dp[i][j]+=dp[i-1][k]*y;
dp[i][j]%mod;
}
}
}
cout<<dp[n][c]&mod<<endl;
}
|
a.cc: In function 'int main()':
a.cc:54:23: error: invalid operands of types 'const long long int' and '<unresolved overloaded function type>' to binary 'operator<<'
54 | cout<<dp[n][c]&mod<<endl;
| ~~~^~~~~~
|
s370586932
|
p04027
|
C++
|
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll f[400][400];
ll modpow(ll x, int k){
if(f[x][k] != -1) return f[x][k];
if(k == 0){
return 1;
}
ll p = modpow(x, k / 2);
p *= p;
p %= mod;
if(k % 2){
p *= x;
p %= mod;
}
f[x][k] = p;
return p;
}
int main()
{
memset(f, -1, sizeof(dp));
int n, c;
cin >> n >> c;
int a[n], b[n];
fr(i, 0, n){
cin >> a[i];
}
fr(i, 0, n){
cin >> b[i];
}
ll dp[n][c + 1];
memset(dp, 0, sizeof(dp));
fr(i, 0, c + 1){
dp[0][i] = pow(a[0], i);
}
fr(i, 1, n){
fr(ctot, 0, c + 1){
fr(cbef, 0, ctot + 1){
dp[i][ctot] += (dp[i - 1][cbef] * modpow(a[i], ctot - cbef))%mod;
dp[i][ctot] %= mod;
}
}
}
cout << dp[n - 1][c] << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:34:26: error: 'dp' was not declared in this scope; did you mean 'dup'?
34 | memset(f, -1, sizeof(dp));
| ^~
| dup
|
s825858372
|
p04027
|
C++
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
typedef pair<int, int> PI;
typedef vector<int> VI;
const LL MOD = 1000000007LL;
LL Pow[401][401]; //i^j
LL Sum[401][401][401]; //Σx^iをx=j~kまで足し合わせる
int A[400];
int B[400];
int N, C;
LL memo[400][401];
LL f(int k, int c) {
if (k == N) return c == 0;
if (memo[k][c] != -1) return memo[k][c];
LL sum = 0;
rep(i, c + 1) {
LL add = Sum[i][A[k]][B[k]];
add = (add * f(k + 1, c - i)) % MOD;
sum = (sum + add) % MOD;
}
return memo[k][c] = sum;
}
int main() {
rep(i, 401) {
Pow[i][0] = 1;
REP(j, 1, 401) {
Pow[i][j] = (Pow[i][j - 1] * i) % MOD;
}
}
rep(i, 401) {
rep(j, 401) {
Sum[i][j][j] = Pow[j][i];
REP(k, j + 1, 401) {
Sum[i][j][k] = (Sum[i][j][k - 1] + Pow[k][i]) % MOD;
}
}
}
cin >> N >> C;
rep(i, N) {
cin >> A[i];
}
rep(i, N) {
cin >> B[i];
}
memset(memo, -1, sizeof(memo));
cout << f(0, C) << endl;
}#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
typedef pair<int, int> PI;
typedef vector<int> VI;
const LL MOD = 1000000007LL;
LL Pow[401][401]; //i^j
LL Sum[401][401][401]; //Σx^iをx=j~kまで足し合わせる
int A[400];
int B[400];
int N, C;
LL memo[400][401];
LL f(int k, int c) {
if (k == N) return c == 0;
if (memo[k][c] != -1) return memo[k][c];
LL sum = 0;
rep(i, c + 1) {
LL add = Sum[i][A[k]][B[k]];
add = (add * f(k + 1, c - i)) % MOD;
sum = (sum + add) % MOD;
}
return memo[k][c] = sum;
}
int main() {
rep(i, 401) {
Pow[i][0] = 1;
REP(j, 1, 401) {
Pow[i][j] = (Pow[i][j - 1] * i) % MOD;
}
}
rep(i, 401) {
rep(j, 401) {
Sum[i][j][j] = Pow[j][i];
REP(k, j + 1, 401) {
Sum[i][j][k] = (Sum[i][j][k - 1] + Pow[k][i]) % MOD;
}
}
}
cin >> N >> C;
rep(i, N) {
cin >> A[i];
}
rep(i, N) {
cin >> B[i];
}
memset(memo, -1, sizeof(memo));
cout << f(0, C) << endl;
}
|
a.cc:51:2: error: stray '#' in program
51 | }#include "bits/stdc++.h"
| ^
a.cc:51:3: error: 'include' does not name a type
51 | }#include "bits/stdc++.h"
| ^~~~~~~
a.cc:59:10: error: redefinition of 'const LL MOD'
59 | const LL MOD = 1000000007LL;
| ^~~
a.cc:9:10: note: 'const LL MOD' previously defined here
9 | const LL MOD = 1000000007LL;
| ^~~
a.cc:60:4: error: redefinition of 'LL Pow [401][401]'
60 | LL Pow[401][401]; //i^j
| ^~~
a.cc:10:4: note: 'LL Pow [401][401]' previously declared here
10 | LL Pow[401][401]; //i^j
| ^~~
a.cc:61:4: error: redefinition of 'LL Sum [401][401][401]'
61 | LL Sum[401][401][401]; //Σx^iをx=j~kまで足し合わせる
| ^~~
a.cc:11:4: note: 'LL Sum [401][401][401]' previously declared here
11 | LL Sum[401][401][401]; //Σx^iをx=j~kまで足し合わせる
| ^~~
a.cc:62:5: error: redefinition of 'int A [400]'
62 | int A[400];
| ^
a.cc:12:5: note: 'int A [400]' previously declared here
12 | int A[400];
| ^
a.cc:63:5: error: redefinition of 'int B [400]'
63 | int B[400];
| ^
a.cc:13:5: note: 'int B [400]' previously declared here
13 | int B[400];
| ^
a.cc:64:5: error: redefinition of 'int N'
64 | int N, C;
| ^
a.cc:14:5: note: 'int N' previously declared here
14 | int N, C;
| ^
a.cc:64:8: error: redefinition of 'int C'
64 | int N, C;
| ^
a.cc:14:8: note: 'int C' previously declared here
14 | int N, C;
| ^
a.cc:65:4: error: redefinition of 'LL memo [400][401]'
65 | LL memo[400][401];
| ^~~~
a.cc:15:4: note: 'LL memo [400][401]' previously declared here
15 | LL memo[400][401];
| ^~~~
a.cc:66:4: error: redefinition of 'LL f(int, int)'
66 | LL f(int k, int c) {
| ^
a.cc:16:4: note: 'LL f(int, int)' previously defined here
16 | LL f(int k, int c) {
| ^
a.cc:77:5: error: redefinition of 'int main()'
77 | int main() {
| ^~~~
a.cc:27:5: note: 'int main()' previously defined here
27 | int main() {
| ^~~~
|
s145955348
|
p04027
|
C++
|
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;
//////////////////
void solve(){
int N,C;
cin >> N >> C;
vector<LL> A(N),B(N);
for(int i=0;i<N;++i){
cin >> A[i];
}
for(int i=0;i<N;++i){
cin >> B[i];
}
vector<vector<LL> > G(N,vector<LL>(C+1,0));
for(int i=0;i<N;++i){
for(int c=0;c<=C;++c){
LL temp = 0;
for(int x=A[i];x<=B[i];++x){
temp += powMod(x,c);
if(temp >= MOD ){
temp -= MOD;
}
}
G[i][c] = temp;
}
}
vector< vector<LL> > dp(N,vector<LL>(C+1,0));
dp[0] = G[0];
for(int i=1;i<N;++i){
for(int now=0;now<=C;++now){
//dp[i][now]
for(int k=C-now;k>=0;--k){
dp[i][now+k] = (dp[i][now+k] + dp[i-1][now] * G[i][k])%MOD;
}
}
}
cout << dp[N-1][C] << endl;
}
#pragma region main
signed main(void){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;//小数を10進数表示
cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別
solve();
}
#pragma endregion //main()
|
a.cc: In function 'void solve()':
a.cc:63:41: error: 'powMod' was not declared in this scope
63 | temp += powMod(x,c);
| ^~~~~~
|
s990576888
|
p04027
|
C++
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
class Union_find{
private:
vector<int> par;
vector<int> rank;
int n;
public:
Union_find(int a){
n = a;
for(int i = 0;i < n;i++){
par.push_back(i);
rank.push_back(0);
}
}
int find(int x){
if(par[x] == x){
return x;
}else{
return par[x] = find(par[x]);
}
}
void unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
}else{
par[y] = x;
if(rank[x] == rank[y]) rank[x]++;
}
}
bool same(int x, int y){
return find(x) == find(y);
}
};
ll mod = 1e9+7;
ll powm(ll x, ll a){
ll res = 1;
REP(i, a){
res = (res * x) % mod;
}
return res;
}
int main(void){
int N, C;
ll A[401], B[401];
ll dp[401][401] = {};
cin >> N >> C;
REP(i, N){
cin >> A[i];
}
REP(i, N){
cin >> B[i];
}
ll mul[401][401] = {};
REP(i, N){
REP(j, C+1){
mul[i][j] = powm(i, j);
}
}
FOR(i, 1, N){
REP(j, C+1){
mul[i][j] = (mul[i-1][j] + mul[i][j]) % mod;
}
}
dp[0][0] = 1;
REP(i, N){
REP(j, C+1){
ll sum = 0;
REP(k, j+1){
sum = (sum + (dp[i][j-k] * (mul[B[i]][k] - mul[A[i]-1][k] + mod)%mod) % mod;
}
dp[i+1][j] += sum;
dp[i+1][j] %= mod;
}
}
cout << dp[N][C] << endl;
}
|
a.cc: In function 'int main()':
a.cc:106:108: error: expected ')' before ';' token
106 | sum = (sum + (dp[i][j-k] * (mul[B[i]][k] - mul[A[i]-1][k] + mod)%mod) % mod;
| ~ ^
| )
|
s959084471
|
p04027
|
C++
|
using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading;
// (づ°ω°)づﾐe★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
const int MOD = 1000000007;
public void Solve()
{
int n = ReadInt();
int m = ReadInt();
var a = ReadIntArray();
var b = ReadIntArray();
int max = b.Max();
var pdp = new int[m + 1, max + 1];
for (int i = 1; i <= max; i++)
{
long p = 1;
for (int j = 0; j <= m; j++)
{
pdp[j, i] = (int)((pdp[j, i - 1] + p) % MOD);
p = p * i % MOD;
}
}
var dp = new int[m + 1];
dp[0] = 1;
for (int i = 0; i < n; i++)
{
var ndp = new int[m + 1];
for (int j = 0; j <= m; j++)
{
long v = (pdp[j, b[i]] - pdp[j, a[i] - 1] + MOD) % MOD;
for (int k = 0; k + j <= m; k++)
ndp[k + j] = (int)((ndp[k + j] + dp[k] * v) % MOD);
}
dp = ndp;
}
Write(dp[m]);
}
#region Main
protected static TextReader reader;
protected static TextWriter writer;
static void Main()
{
#if DEBUG
reader = new StreamReader("..\\..\\input.txt");
//reader = new StreamReader(Console.OpenStandardInput());
writer = Console.Out;
//writer = new StreamWriter("..\\..\\output.txt");
#else
reader = new StreamReader(Console.OpenStandardInput());
writer = new StreamWriter(Console.OpenStandardOutput());
//reader = new StreamReader("input.txt");
//writer = new StreamWriter("output.txt");
#endif
try
{
new Solver().Solve();
//var thread = new Thread(new Solver().Solve, 1024 * 1024 * 128);
//thread.Start();
//thread.Join();
}
catch (Exception ex)
{
#if DEBUG
Console.WriteLine(ex);
#else
throw;
#endif
}
reader.Close();
writer.Close();
}
#endregion
#region Read / Write
private static Queue<string> currentLineTokens = new Queue<string>();
private static string[] ReadAndSplitLine() { return reader.ReadLine().Split(new[] { ' ', '\t', }, StringSplitOptions.RemoveEmptyEntries); }
public static string ReadToken() { while (currentLineTokens.Count == 0)currentLineTokens = new Queue<string>(ReadAndSplitLine()); return currentLineTokens.Dequeue(); }
public static int ReadInt() { return int.Parse(ReadToken()); }
public static long ReadLong() { return long.Parse(ReadToken()); }
public static double ReadDouble() { return double.Parse(ReadToken(), CultureInfo.InvariantCulture); }
public static int[] ReadIntArray() { return ReadAndSplitLine().Select(int.Parse).ToArray(); }
public static long[] ReadLongArray() { return ReadAndSplitLine().Select(long.Parse).ToArray(); }
public static double[] ReadDoubleArray() { return ReadAndSplitLine().Select(s => double.Parse(s, CultureInfo.InvariantCulture)).ToArray(); }
public static int[][] ReadIntMatrix(int numberOfRows) { int[][] matrix = new int[numberOfRows][]; for (int i = 0; i < numberOfRows; i++)matrix[i] = ReadIntArray(); return matrix; }
public static int[][] ReadAndTransposeIntMatrix(int numberOfRows)
{
int[][] matrix = ReadIntMatrix(numberOfRows); int[][] ret = new int[matrix[0].Length][];
for (int i = 0; i < ret.Length; i++) { ret[i] = new int[numberOfRows]; for (int j = 0; j < numberOfRows; j++)ret[i][j] = matrix[j][i]; } return ret;
}
public static string[] ReadLines(int quantity) { string[] lines = new string[quantity]; for (int i = 0; i < quantity; i++)lines[i] = reader.ReadLine().Trim(); return lines; }
public static void WriteArray<T>(IEnumerable<T> array) { writer.WriteLine(string.Join(" ", array)); }
public static void Write(params object[] array) { WriteArray(array); }
public static void WriteLines<T>(IEnumerable<T> array) { foreach (var a in array)writer.WriteLine(a); }
private class SDictionary<TKey, TValue> : Dictionary<TKey, TValue>
{
public new TValue this[TKey key]
{
get { return ContainsKey(key) ? base[key] : default(TValue); }
set { base[key] = value; }
}
}
private static T[] Init<T>(int size) where T : new() { var ret = new T[size]; for (int i = 0; i < size; i++)ret[i] = new T(); return ret; }
#endregion
}
|
a.cc:50:6: error: invalid preprocessing directive #region
50 | #region Main
| ^~~~~~
a.cc:86:6: error: invalid preprocessing directive #endregion
86 | #endregion
| ^~~~~~~~~
a.cc:88:6: error: invalid preprocessing directive #region
88 | #region Read / Write
| ^~~~~~
a.cc:117:6: error: invalid preprocessing directive #endregion
117 | #endregion
| ^~~~~~~~~
a.cc:1:7: error: expected nested-name-specifier before 'System'
1 | using System;
| ^~~~~~
a.cc:2:7: error: expected nested-name-specifier before 'System'
2 | using System.Collections.Generic;
| ^~~~~~
a.cc:3:7: error: expected nested-name-specifier before 'System'
3 | using System.Globalization;
| ^~~~~~
a.cc:4:7: error: expected nested-name-specifier before 'System'
4 | using System.IO;
| ^~~~~~
a.cc:5:7: error: expected nested-name-specifier before 'System'
5 | using System.Linq;
| ^~~~~~
a.cc:6:7: error: expected nested-name-specifier before 'System'
6 | using System.Text;
| ^~~~~~
a.cc:7:7: error: expected nested-name-specifier before 'System'
7 | using System.Threading;
| ^~~~~~
a.cc:10:1: error: expected unqualified-id before 'public'
10 | public class Solver
| ^~~~~~
|
s043030912
|
p04027
|
C++
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
long long mod=1000000007;
long long calc(long long p,int q){
long long ans =1;
for(int i=0;i<q;i++){
ans = (ans*p)%mod;
}
return ans;
}
int main(){
long long ruijo[401][401]={};
for(int t=0;t<401;t++){
ruijo[0][t]=t;
}
for(int k=1;k<401;k++){
for(int l=1;l<401;l++){
ruijo[k][l] = (ruijo[k][l-1] + calc(l,k))%mod;
}
}
long long n,c,tmp,g;
long long dp[401][401]={};
dp[0][0]=1;
vector <long long> a,b;
cin >> n >>c;
for(int i=0;i<n;i++){
cin >> tmp;
a.push_back(tmp);
}
for(int j=0;j<n;j++){
cin >> tmp;
b.push_back(tmp);
}
for(int x=1;x<=n;x++){
for(int y=0;y<=c;y++){
for(int z=0;z<=y;z++){
g = (ruijo[z][b[x-1]]-ruijo[z][a[x-1]-1] + 10*mod)%mod;
dp[x][y]=(dp[x][y]+g)%mod;
}
}
}
cout << dp[n][c] <<endl;
return 0;
|
a.cc: In function 'int main()':
a.cc:51:18: error: expected '}' at end of input
51 | return 0;
| ^
a.cc:19:11: note: to match this '{'
19 | int main(){
| ^
|
s282610482
|
p04027
|
C++
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
#define mod 1000000007;
int calc(long long p,int q){
long long ans =1;
for(int i=0;i<q;i++){
ans = ans * p %mod;
}
return ans;
}
int main(){
long long ruijo[401][401]={};
for(int t=0;t<401;t++){
ruijo[0][t]=t;
}
for(int k=1;k<401;k++){
for(int l=1;l<401;l++){
ruijo[k][l] = (ruijo[k][l-1] + calc(l,k))%mod;
}
}
long long n,c,tmp;
long long dp[401][401]={};
dp[0][0]=1;
vector <long long> a,b;
cin >> n >>c;
for(int i=0;i<n;i++){
cin >> tmp;
a.push_back(tmp);
}
for(int j=0;j<n;j++){
cin >> tmp;
b.push_back(tmp);
}
for(int x=1;x<=n;x++){
for(int y=0;y<=c;y++){
for(int z=0;z<=y;z++){
dp[x][y]=(dp[x][y]+(dp[x-1][y-z]*(ruijo[z][b[x-1]]-ruijo[z][a[x-1]-1]))%mod)%mod;
}
}
}
cout << dp[n][c] <<endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:8:23: error: expected ')' before ';' token
8 | #define mod 1000000007;
| ^
a.cc:44:105: note: in expansion of macro 'mod'
44 | dp[x][y]=(dp[x][y]+(dp[x-1][y-z]*(ruijo[z][b[x-1]]-ruijo[z][a[x-1]-1]))%mod)%mod;
| ^~~
a.cc:44:42: note: to match this '('
44 | dp[x][y]=(dp[x][y]+(dp[x-1][y-z]*(ruijo[z][b[x-1]]-ruijo[z][a[x-1]-1]))%mod)%mod;
| ^
a.cc:44:108: error: expected primary-expression before ')' token
44 | dp[x][y]=(dp[x][y]+(dp[x-1][y-z]*(ruijo[z][b[x-1]]-ruijo[z][a[x-1]-1]))%mod)%mod;
| ^
|
s624674140
|
p04027
|
C++
|
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
//cin.sync_with_stdio(false);
//streambuf
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
using ti3 = tuple<int, int, int>;
using vti3 = vector<ti3>;
template<class T, class T2> using umap = unordered_map<T, T2>;
template<class T> using uset = unordered_set<T>;
template<class T> void cmin(T &a, const T&b) { if (a > b)a = b; }
#define ALL(a) a.begin(),a.end()
#define rep(i,a) for(int i=0;i<a;i++)
#define rep1(i,a) for(int i=1;i<=a;i++)
vi a(400), b(400),ca(400);
ll mod = 1000000007;
template <class T>
inline void hash_combine(size_t & seed, const T & v) {
hash<T> hasher;
seed ^= hasher(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
namespace
{
template<typename S, typename T> struct hash<pair<S, T>> {
inline size_t operator()(const pair<S, T> & v) const {
size_t seed = 0;
hash_combine(seed, v.first);
hash_combine(seed, v.second);
return seed;
}
};
// Recursive template code derived from Matthieu M.
template <class Tuple, size_t Index = std::tuple_size<Tuple>::value - 1>
struct HashValueImpl
{
static void apply(size_t& seed, Tuple const& tuple)
{
HashValueImpl<Tuple, Index - 1>::apply(seed, tuple);
hash_combine(seed, std::get<Index>(tuple));
}
};
template <class Tuple>
struct HashValueImpl<Tuple, 0>
{
static void apply(size_t& seed, Tuple const& tuple)
{
hash_combine(seed, std::get<0>(tuple));
}
};
}
template <typename ... TT>
struct hash<std::tuple<TT...>>
{
size_t
operator()(std::tuple<TT...> const& tt) const
{
size_t seed = 0;
HashValueImpl<std::tuple<TT...> >::apply(seed, tt);
return seed;
}
}; }
umap<ti3, ll> memo;
ll pow(ll base, ll i,ll mod) {
ll a=1;
while (i) {
if (i & 1) {
a *= base;
a %= mod;
}
base *= base;
base %= mod;
i/=2;
}
return a;
}
ll f(int l,int n,int c) {
auto it = memo.find(ti3(l, n, c));
if (memo.end() != it)return it->second;
if (n == 1) {
ll buf = 0;
for (int j = a[l]; j <= b[l]; j++)buf += pow(j, c, mod);
return buf % mod;
}
ll buf = 0;
rep(i, c + 1) {
buf += f(l, n / 2, i) * f(l + n / 2, n - n / 2, c - i);
buf %= mod;
}
memo[ti3(l, n, c)] = buf;
return buf;
}
int main() {
int n, c;
cin >> n >> c;
rep(i, n)cin >> a[i];
rep(i, n)cin >> b[i];
vi ca(n);
ca[0] = c;
ll sum = 0;
cout << f(0,n,c) << endl;
}
|
a.cc:45:49: error: specialization of 'template<class _Tp> struct std::hash' in different namespace [-fpermissive]
45 | template<typename S, typename T> struct hash<pair<S, T>> {
| ^~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/bits/stl_bvector.h:65,
from /usr/include/c++/14/vector:67,
from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: from definition of 'template<class _Tp> struct std::hash'
59 | struct hash;
| ^~~~
a.cc:46:64: error: definition of 'std::size_t std::hash<std::pair<_T1, _T2> >::operator()(const std::pair<_T1, _T2>&) const' is not in namespace enclosing 'std::hash<std::pair<_T1, _T2> >' [-fpermissive]
46 | inline size_t operator()(const pair<S, T> & v) const {
| ^~~~~
|
s320561563
|
p04027
|
C
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod=1e9+7;
ll add(ll a,ll b){
return (a+b)%mod;
}
ll mul(ll a,ll b){
return (a*b)%mod;
}
#define MAX 405
int n,c;
int X[MAX],Y[MAX];
ll dp[2][MAX];
ll cost[2][MAX];
int main(){
cin>>n>>c;
for(int i=1;i<=n;i++)cin>>X[i];
for(int i=1;i<=n;i++)cin>>Y[i];
dp[0][0]=1;
for(int i=1;i<=n;i++){
int ai=i%2;
int bi=1-ai;
for(int j=0;j<MAX;j++)dp[ai][j]=0;
for(int p=X[i];p<=Y[i];p++){
for(int j=0;j<=c;j++){
cost[ai][j]=0;
if(j==0){
cost[ai][j]= dp[bi][j];
dp[ai][j]=add(dp[ai][j], dp[bi][j] );
}else{
cost[ai][j]=add(cost[ai][j], mul(cost[ai][j-1],p) );
cost[ai][j]=add(cost[ai][j], dp[bi][j]);
dp[ai][j]=add(dp[ai][j], cost[ai][j]);
}
}
}
}
cout<<dp[n%2][c]<<endl;
return 0;
}
|
main.c:1:9: fatal error: bits/stdc++.h: No such file or directory
1 | #include<bits/stdc++.h>
| ^~~~~~~~~~~~~~~
compilation terminated.
|
s073573883
|
p04027
|
C++
|
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
//cin.sync_with_stdio(false);
//streambuf
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
using ti3 = tuple<int, int, int>;
using vti3 = vector<ti3>;
template<class T, class T2> using umap = unordered_map<T, T2>;
template<class T> using uset = unordered_set<T>;
template<class T> void cmin(T &a, const T&b) { if (a > b)a = b; }
#define ALL(a) a.begin(),a.end()
#define rep(i,a) for(int i=0;i<a;i++)
#define rep1(i,a) for(int i=1;i<=a;i++)
vi a(400), b(400),ca(400);
ll mod = 1000000007;
umap<ti3, ll> memo;
ll pow(ll base, ll i,ll mod) {
ll a=1;
while (i) {
if (i & 1) {
a *= base;
a %= mod;
}
base *= base;
base %= mod;
i/=2;
}
return a;
}
ll f(int l,int n,int c) {
auto it = memo.find(ti3(l, n, c));
if (memo.end != it)return it->second;
if (n == 1) {
ll buf = 0;
for (int j = a[l]; j <= b[l]; j++)buf += pow(j, c, mod);
return buf % mod;
}
ll buf = 0;
rep(i, c + 1) {
buf += f(l, n / 2, i) * f(l + n / 2, n - n / 2, c - i);
buf %= mod;
}
memo[ti3(l, n, c)] = buf;
return buf;
}
int main() {
int n, c;
cin >> n >> c;
rep(i, n)cin >> a[i];
rep(i, n)cin >> b[i];
vi ca(n);
ca[0] = c;
ll sum = 0;
cout << f(0,n,c) << endl;
}
|
a.cc:36:15: error: use of deleted function 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::tuple<int, int, int>; _Tp = long long int; _Hash = std::hash<std::tuple<int, int, int> >; _Pred = std::equal_to<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, long long int> >]'
36 | umap<ti3, ll> memo;
| ^~~~
In file included from /usr/include/c++/14/unordered_map:41,
from /usr/include/c++/14/functional:63,
from a.cc:9:
/usr/include/c++/14/bits/unordered_map.h:148:7: note: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::tuple<int, int, int>; _Tp = long long int; _Hash = std::hash<std::tuple<int, int, int> >; _Pred = std::equal_to<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, long long int> >]' is implicitly deleted because the default definition would be ill-formed:
148 | unordered_map() = default;
| ^~~~~~~~~~~~~
/usr/include/c++/14/bits/unordered_map.h:148:7: error: use of deleted function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::tuple<int, int, int>; _Value = std::pair<const std::tuple<int, int, int>, long long int>; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, long long int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]'
In file included from /usr/include/c++/14/bits/unordered_map.h:33:
/usr/include/c++/14/bits/hashtable.h:539:7: note: 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::tuple<int, int, int>; _Value = std::pair<const std::tuple<int, int, int>, long long int>; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, long long int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]' is implicitly deleted because the default definition would be ill-formed:
539 | _Hashtable() = default;
| ^~~~~~~~~~
/usr/include/c++/14/bits/hashtable.h:539:7: error: use of deleted function 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::tuple<int, int, int>; _Value = std::pair<const std::tuple<int, int, int>, long long int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]'
In file included from /usr/include/c++/14/bits/hashtable.h:35:
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: note: 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::tuple<int, int, int>; _Value = std::pair<const std::tuple<int, int, int>, long long int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]' is implicitly deleted because the default definition would be ill-formed:
1731 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: error: use of deleted function 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::tuple<int, int, int>; _Value = std::pair<const std::tuple<int, int, int>, long long int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]'
/usr/include/c++/14/bits/hashtable_policy.h: In instantiation of 'std::__detail::_Hashtable_ebo_helper<_Nm, _Tp, true>::_Hashtable_ebo_helper() [with int _Nm = 1; _Tp = std::hash<std::tuple<int, int, int> >]':
/usr/include/c++/14/bits/hashtable_policy.h:1328:7: required from here
1328 | _Hash_code_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1245:49: error: use of deleted function 'std::hash<std::tuple<int, int, int> >::hash()'
1245 | _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
| ^~~~~
In file included from /usr/include/c++/14/bits/stl_bvector.h:65,
from /usr/include/c++/14/vector:67,
from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:102:12: note: 'std::hash<std::tuple<int, int, int> >::hash()' is implicitly deleted because the default definition would be ill-formed:
102 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/14/bits/functional_hash.h:102:12: error: no matching function for call to 'std::__hash_enum<std::tuple<int, int, int>, false>::__hash_enum()'
/usr/include/c++/14/bits/functional_hash.h:83:7: note: candidate: 'std::__hash_enum<_Tp, <anonymous> >::__hash_enum(std::__hash_enum<_Tp, <anonymous> >&&) [with _Tp = std::tuple<int, int, int>; bool <anonymous> = false]'
83 | __hash_enum(__hash_enum&&);
| ^~~~~~~~~~~
/usr/include/c++/14/bits/functional_hash.h:83:7: note: candidate expects 1 argument, 0 provided
/usr/include/c++/14/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::tuple<int, int, int>; bool <anonymous> = false]' is private within this context
102 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/14/bits/functional_hash.h:84:7: note: declared private here
84 | ~__hash_enum();
| ^
/usr/include/c++/14/bits/hashtable_policy.h:1245:49: note: use '-fdiagnostics-all-candidates' to display considered candidates
1245 | _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
| ^~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1328:7: note: 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::tuple<int, int, int>; _Value = std::pair<const std::tuple<int, int, int>, long long int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]' is implicitly deleted because the default definition would be ill-formed:
1328 | _Hash_code_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1328:7: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()'
/usr/include/c++/14/bits/hashtable_policy.h:1242:12: note: 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()' is implicitly deleted because the default definition would be ill-formed:
1242 | struct _Hashtable_ebo_helper<_Nm, _Tp, true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1242:12: error: use of deleted function 'std::hash<std::tuple<int, int, int> >::~hash()'
/usr/include/c++/14/bits/functional_hash.h:102:12: note: 'std::hash<std::tuple<int, int, int> >::~hash()' is implicitly deleted because the default definition would be ill-formed:
102 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/14/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::tuple<int, int, int>; bool <anonymous> = false]' is private within this context
/usr/include/c++/14/bits/functional_hash.h:84:7: note: declared private here
84 | ~__hash_enum();
| ^
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: note: use '-fdiagnostics-all-candidates' to display considered candidates
1731 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: error: use of deleted function 'std::__detail::_Hash_code_base<std::tuple<int, int, int>, std::pair<const std::tuple<int, int, int>, long long int>, std::__detail::_Select1st, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
/usr/include/c++/14/bits/hashtable_policy.h:1306:12: note: 'std::__detail::_Hash_code_base<std::tuple<int, int, int>, std::pair<const std::tuple<int, int, int>, long long int>, std::__detail::_Select1st, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()' is implicitly deleted because the default definition would be ill-formed:
1306 | struct _Hash_code_base
| ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1306:12: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()'
/usr/include/c++/14/bits/hashtable.h:539:7: note: use '-fdiagnostics-all-candidates' to display considered candidates
539 | _Hashtable() = default;
|
|
s119519354
|
p04027
|
C
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod=1e9+7;
ll add(ll a,ll b){
return (a+b)%mod;
}
ll mul(ll a,ll b){
return (a*b)%mod;
}
#define MAX 405
int n,c;
int X[MAX],Y[MAX];
ll dp[2][MAX];
ll cost[2][MAX];
int main(){
cin>>n>>c;
for(int i=1;i<=n;i++)cin>>X[i];
for(int i=1;i<=n;i++)cin>>Y[i];
dp[0][0]=1;
for(int i=1;i<=n;i++){
int ai=i%2;
int bi=1-ai;
for(int j=0;j<MAX;j++)dp[ai][j]=0;
for(int p=X[i];p<=Y[i];p++){
for(int j=0;j<=c;j++){
cost[ai][j]=0;
if(j==0){
cost[ai][j]= dp[bi][j];
dp[ai][j]=add(dp[ai][j], dp[bi][j] );
}else{
cost[ai][j]=add(cost[ai][j], mul(cost[ai][j-1],p) );
cost[ai][j]=add(cost[ai][j], dp[bi][j]);
dp[ai][j]=add(dp[ai][j], cost[ai][j]);
}
}
}
}
cout<<dp[n%2][c]<<endl;
return 0;
}
|
main.c:1:9: fatal error: bits/stdc++.h: No such file or directory
1 | #include<bits/stdc++.h>
| ^~~~~~~~~~~~~~~
compilation terminated.
|
s425692109
|
p04027
|
C
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod=1e9+7;
ll add(ll a,ll b){
return (a+b+mod+mod)%mod;
}
ll mul(ll a,ll b){
return (a*b)%mod;
}
ll mpow(ll a,ll b){
if(b==0)return 1;
ll res=mpow( mul(a,a) , b/2);
if(b%2==1)res=mul(res,a);
return res;
}
int n,c;
int X[500],Y[500];
ll dp[2][405];
ll cost[2][405];
int main(){
cin>>n>>c;
for(int i=1;i<=n;i++)cin>>X[i];
for(int i=1;i<=n;i++)cin>>Y[i];
dp[0][0]=1;
for(int i=1;i<=n;i++){
int ai=i%2;
int bi=1-ai;
for(int j=0;j<405;j++)
dp[ai][j]=0;
for(int p=X[i];p<=Y[i];p++){
for(int j=0;j<=c;j++){
cost[ai][j]=0;
if(j==0){
ll z=1;
for(int k=0;k<=j;k++){
cost[ai][j]=add(cost[ai][j],mul(dp[bi][j-k],z) );
dp[ai][j]=add(dp[ai][j], mul(dp[bi][j-k],z) );
z=mul(z,p);
}
continue;
}
cost[ai][j]=add(cost[ai][j], mul(cost[ai][j-1],p) );
cost[ai][j]=add(cost[ai][j], dp[bi][j]);
dp[ai][j]=add(dp[ai][j], cost[ai][j]);
}
}
}
cout<<dp[n%2][c]<<endl;
return 0;
}
|
main.c:1:9: fatal error: bits/stdc++.h: No such file or directory
1 | #include<bits/stdc++.h>
| ^~~~~~~~~~~~~~~
compilation terminated.
|
s206588391
|
p04027
|
C++
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
//struct edge {int from, to, cost;};
constexpr double EPS = 1e-10;
constexpr double PI = acos(-1.0);
//constexpr int INF = INT_MAX;
template<class T> inline T sqr(T x) {return x*x;}
long ret = 0, mod = 1000000000+7;
int power(long x, long n, long mod) {
if (n == 0) return 1;
if (n % 2 == 0) return power(x * x % mod, n/2, mod);
else return x * power(x, n-1, mod) % mod;
}
void calc(const VI &a, long i, long ans, long num) {
if (i == a.size() - 1) {
//cout << i << " " << ans << " " << num << endl;
ret = (ans * power(a[i],num,mod) + ret) % mod;
} else {
REP(j,0,num+1) calc(a, i+1, (ans*power(a[i],j,mod))%mod, num - j);
}
}
int main() {
int n,c;
cin >> n >> c;
VI a(n),b(n);
REP(i,0,n) cin >> a[i];
REP(i,0,n) cin >> b[i];
// a == b
shuffle(all(a));
calc(a, 0, 1, c);
cout << ret << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:81:16: error: no matching function for call to 'shuffle(std::vector<int>::iterator, std::vector<int>::iterator)'
81 | shuffle(all(a));
| ~~~~~~~^~~~~~~~
In file included from /usr/include/c++/14/algorithm:61,
from a.cc:3:
/usr/include/c++/14/bits/stl_algo.h:3697:5: note: candidate: 'template<class _RAIter, class _UGenerator> void std::shuffle(_RAIter, _RAIter, _UGenerator&&)'
3697 | shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~
/usr/include/c++/14/bits/stl_algo.h:3697:5: note: candidate expects 3 arguments, 2 provided
|
s059909470
|
p04027
|
C++
|
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000 * 1000 * 1000 + 7;
const int MAX_N = 410;
const int MAX_C = 410;
int a[MAX_N], b[MAX_N], n, c;
ll memo[MAX_N][MAX_C];
ll pow_mod(ll a, ll n, ll mod) {
if (n == 0) return 1;
if (n % 2 == 0) {
ll temp = pow_mod(a, n / 2, mod);
return (temp * temp) % mod;
} else {
return (a * pow_mod(a, n - 1, mod)) % mod;
}
}
// index個数まで見ていて使えるキャンディーの個数がcandys
ll rec(int index, int candys) {
if (memo[index][candys] >= 0) {
return memo[index][candys];
}
if (index == n) {
if (candys == 0) return memo[index][candys] = 1;
else return memo[index][candys] = 0;
}
ll res = 0;
for (int candy_num = 0; candy_num <= candys; candy_num++) {
res += pow_mod(a[index], candy_num, MOD) * rec(index + 1, candys - candy_num);
res %= MOD;
}
return memo[index][candys] = res;
}
int main() {
cin >> n >> c;
memset(memo, -1, sizeof(memo));
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
cout << rec(0, c) << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:44:5: error: 'memset' was not declared in this scope
44 | memset(memo, -1, sizeof(memo));
| ^~~~~~
a.cc:2:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
1 | #include <iostream>
+++ |+#include <cstring>
2 | using namespace std;
|
s652357811
|
p04027
|
C++
|
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#define INF 2000000010
#define mod7 1000000007
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL_MAX 9223372036854775807
#define INF_LL 9223372036854775
#define EPS 1e-10
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double
using namespace std;
#define MAX_N 405
#define MAX_C 405
LL N, C;
LL A[MAX_N], B[MAX_N];
void input(){
cin >> N >> C;
for(int i = 0; i < N; i++){
cin >> A[i];
}
for(int i = 0; i < N; i++){
cin >> B[i];
}
}
LL dp[MAX_N][MAX_C];
LL mPow(LL n, LL m){
LL ret = 1;
while(m){
if(m & 1){
ret *= n;
ret %= mod7;
}
n *= n;
n %= mod7;
m >>= 1;
}
return ret;
}
int main(){
input();
memset(dp, 0, sizeof(dp));
for(int i = 0; i < N; i++){
if(i == 0){
for(int j = 0; j <= C; j++){
if(j == 0){
dp[i+1][j] = 1;
}
else{
dp[i+1][j] = (dp[i+1][j-1] * A[i]) % mod7;
}
}
}
for(int j = 0; j <= C; j++){
for(int k = 0; k <= j; k++){
int c = j-k;
dp[i+1][j] += (dp[i][c] * mPow(A[i], k));
dp[i+1][j] %= mod7;
}
}
}
cout << dp[N][C] << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:61:3: error: 'memset' was not declared in this scope
61 | memset(dp, 0, sizeof(dp));
| ^~~~~~
a.cc:8:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
7 | #include <algorithm>
+++ |+#include <cstring>
8 |
|
s342491957
|
p04027
|
C++
|
#include <bits/stdc++.h>
using namespace std;
const int MODULO = (int) 1e9 + 7;
const int N = 405;
int a[N], b[N], power[N], sum[N];
int f[N][N];
int psum[N][N];
int F(int n, int c) {
if (n == 0) return c == 0 ? 1 : 0;
int &res = f[n][c];
if (res != -1) return res;
res = 0;
for (int x = 0; x <= c; ++x)
res = (res + 1LL * psum[n - 1][x] * F(n - 1, c - x)) % MODULO;
return res;
}
int main() {
ios::sync_with_stdio(false);
int n; cin >> n;
int c; cin >> c;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n; ++i) cin >> b[i];
for (int i = 0; i < N; ++i) power[i] = 1;
for (int pwr = 0; pwr <= c; ++pwr) {
for (int i = 1; i < N; ++i)
sum[i] = (sum[i - 1] + power[i]) % MODULO;
for (int i ne0; i < n; ++i)
psum[i][pwr] = sum[b[i]] - sum[a[i] - 1];
for (int i = 0; i < N; ++i)
power[i] = 1LL * power[i] * i % MODULO;
}
memset(f, -1, sizeof f);
cout << F(n, c) << '\n';
return 0;
}
|
a.cc: In function 'int main()':
a.cc:30:19: error: expected ';' before 'ne0'
30 | for (int i ne0; i < n; ++i)
| ^~~~
| ;
a.cc:30:20: error: 'ne0' was not declared in this scope
30 | for (int i ne0; i < n; ++i)
| ^~~
a.cc:30:30: error: expected ')' before ';' token
30 | for (int i ne0; i < n; ++i)
| ~ ^
| )
a.cc:30:34: error: 'i' was not declared in this scope
30 | for (int i ne0; i < n; ++i)
| ^
|
s565656627
|
p04028
|
C++
|
#include <bits/stdc++.h>
#include "../lib/math/modpow.hpp"
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
template <typename T1, typename T2>
bool chmax(T1 &a, const T2 &b) {
if(a < b) {a = b; return true;}
return false;
}
template <typename T1, typename T2>
bool chmin(T1 &a, const T2 &b) {
if(a > b) {a = b; return true;}
return false;
}
template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
os << p.first << ":" << p.second;
return os;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, SZ(v)) {
if(i) os << " ";
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n; cin >> n;
string s; cin >> s;
int sz = SZ(s);
vvll dp(n+1, vll(n+1));
dp[0][0] = 1;
REP(i, n) {
REP(j, n) {
if(j != 0) {
dp[i+1][j-1] += dp[i][j];
dp[i+1][j-1] %= MOD;
} else {
dp[i+1][j] += dp[i][j];
dp[i+1][j] %= MOD;
}
dp[i+1][j+1] += 2 * dp[i][j];
dp[i+1][j+1] %= MOD;
}
}
//REP(i, n+1) cout << dp[i] << endl;
ll inv2 = mod_pow<ll>(2, MOD-2, MOD);
ll now = 1;
REP(i, sz) now *= inv2, now %= MOD;
cout << dp[n][sz] * now % MOD << endl;
}
|
a.cc:2:10: fatal error: ../lib/math/modpow.hpp: No such file or directory
2 | #include "../lib/math/modpow.hpp"
| ^~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
|
s570699926
|
p04028
|
C++
|
// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#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 repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T,d-1>::type>;
template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> NTT
template <class ModInt, int64_t g>
struct NTT {
using modint = ModInt;
static constexpr int64_t mod = ModInt::mod, gen = g, max_lg = __builtin_ctzll(mod-1);
// mod:prime, g:primitive root
static_assert(mod > 0 && g > 0 && max_lg > 0, "");
using arr_t = array<ModInt,max_lg+1>;
static arr_t ws,iws;
static void init() {
for (int i = 0; i <= max_lg; i++) {
ws[i] = -ModInt(g).pow((mod-1)>>(i+2));
iws[i] = ModInt(1)/ws[i];
}
}
static void ntt(ModInt a[], int lg) {
for (int b = lg-1; b >= 0; b--) {
ModInt w = 1;
for (int i = 0, k = 0; i < (1<<lg); i += 1<<(b+1)) {
for (int j = i; j < (i|(1<<b)); j++) {
const int k = j|(1<<b);
const auto x = a[j], y = a[k];
a[j] = x + y*w;
a[k] = x - y*w;
}
w *= ws[__builtin_ctz(++k)];
}
}
// bit_reverse(a,1<<lg);
}
static void intt(ModInt a[], int lg) {
// bit_reverse(a,1<<lg);
for (int b = 0; b < lg; b++) {
ModInt w = 1;
for (int i = 0, k = 0; i < (1<<lg); i += 1<<(b+1)) {
for (int j = i; j < (i|(1<<b)); j++) {
const int k = j|(1<<b);
const auto x = a[j], y = a[k];
a[j] = x + y;
a[k] = w*(x - y);
}
w *= iws[__builtin_ctz(++k)];
}
}
}
template <class T>
static vector<ModInt> conv(vector<T> const& a, vector<T> const& b) {
if (a.empty() || b.empty()) return {};
init();
const int s = a.size() + b.size() - 1, lg = __lg(2*s-1);
assert(lg <= max_lg);
vector<ModInt> aa(1<<lg);
rep (i,a.size()) aa[i] = (int)a[i];
ntt(aa.data(), lg);
vector<ModInt> bb(1<<lg);
rep (i,b.size()) bb[i] = (int)b[i];
ntt(bb.data(), lg);
const auto x = ModInt(1)/ModInt(1<<lg);
rep (i,1<<lg) aa[i] *= bb[i]*x;
intt(aa.data(), lg); aa.resize(s);
return aa;
}
template <class T>
static vector<ModInt> conv(vector<T> const& a) {
if (a.empty()) return {};
init();
const int s = a.size()*2 - 1, lg = __lg(2*s-1);
assert(lg <= max_lg);
vector<ModInt> aa(1<<lg);
rep (i,a.size()) aa[i] = (int)a[i];
ntt(aa.data(), lg);
const auto x = ModInt(1)/ModInt(1<<lg);
rep (i,1<<lg) aa[i] *= aa[i]*x;
intt(aa.data(), lg); aa.resize(s);
return aa;
}
};
template <class ModInt, int64_t g>
typename NTT<ModInt,g>::arr_t NTT<ModInt,g>::ws;
template <class ModInt, int64_t g>
typename NTT<ModInt,g>::arr_t NTT<ModInt,g>::iws;
// <<<
// >>> modint
template <uint32_t MOD>
struct modint {
using u32 = uint32_t;
using u64 = uint64_t;
using i64 = int64_t;
using M = modint;
static constexpr u32 mul_inv(u32 n, int e = 5, u32 x = 1) {
return e == 0 ? x : mul_inv(n, e-1, x*(2-x*n));
}
static constexpr u32 mod = MOD;
static constexpr u32 nn = mul_inv(MOD);
static constexpr u32 r2 = -u64(MOD) % MOD;
u32 x;
constexpr modint(i64 x = 0) : x(reduce(((x%=MOD)<0 ? x+MOD : x)*r2)) {}
static constexpr u32 reduce(u64 w) {
return u32(w >> 32) + MOD - i64((u64(u32(w) * nn) * MOD) >> 32);
}
constexpr i64 val() const {
i64 r = reduce(x);
if (r >= MOD) r -= MOD;
return r;
}
constexpr explicit operator int() const { return val(); }
// constexpr explicit operator i64() const { return val(); }
constexpr bool operator==(M p) const { return val() == p.val(); }
constexpr bool operator!=(M p) const { return val() != p.val(); }
constexpr M operator+() const { return *this; }
constexpr M operator-() const { M r; r.x = x ? i64(2*MOD)-x : 0; return r; }
constexpr M &operator+=(M p) {
i64 t = x; if (((t += p.x) -= 2*MOD) < 0) t += 2*MOD;
x = t;
return *this;
}
constexpr M &operator-=(M p) { return *this += -p; }
constexpr M &operator*=(M p) { x = reduce(u64(x)*p.x); return *this; }
constexpr M &operator/=(M p) { *this *= p.inv(); return *this; }
constexpr M operator+(M p) const { return M(*this) += p; }
constexpr M operator-(M p) const { return M(*this) -= p; }
constexpr M operator*(M p) const { return M(*this) *= p; }
constexpr M operator/(M p) const { return M(*this) /= p; }
friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
constexpr M inv() const { return pow(MOD - 2); }
constexpr M pow(i64 n) const {
if (n < 0) return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
return r;
}
friend ostream &operator<<(ostream &os, M p) {
return os << p.val();
}
friend istream &operator>>(istream &is, M &a) {
u32 t; is >> t; a = t; return is;
}
#ifdef LOCAL
friend string to_s(M p) { return to_s(p.val(), MOD); }
#endif
};
// <<<
constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;
// >>> garner, convolution for arbitray mod
using ntt1 = NTT<modint< 167772161>, 3>; // mod-1 = 5<<25
using ntt2 = NTT<modint< 469762049>, 3>; // mod-1 = 7<<26
using ntt3 = NTT<modint<1224736769>, 3>; // mod-1 = 73<<24
//using ntt3 = NTT<modint<998244353>, 3>; // mod-1 = 119<<23
// https://math314.hateblo.jp/entry/2015/05/07/014908
template <class ModInt, class P, class Q, class R>
constexpr ModInt garner(P const& x, Q const& y, R const& z) {
using ll = int64_t;
const ll xx = (ll)x, yy = (ll)y, zz = (ll)z;
constexpr ll m1 = ntt1::mod, m2 = ntt2::mod;
constexpr auto m1_inv_m2 = ntt2::modint(m1).inv();
constexpr auto m12_inv_m3 = ntt3::modint(m1 * m2).inv();
constexpr auto m12_mod = ModInt(m1 * m2);
auto v1 = (yy - xx) * m1_inv_m2;
auto v2 = (zz - (xx + m1 * v1.val())) * m12_inv_m3;
return xx + m1 * v1.val() + m12_mod * ModInt(v2.val());
}
template <class ModInt>
vector<ModInt> conv(vector<ModInt> const& a, vector<ModInt> const& b) {
auto x = ntt1::conv(a, b);
auto y = ntt2::conv(a, b);
auto z = ntt3::conv(a, b);
vector<ModInt> ret(x.size());
rep (i,x.size()) ret[i] = garner<ModInt>(x[i],y[i],z[i]);
return ret;
}
template <class ModInt>
vector<ModInt> conv(vector<ModInt> const& a) {
auto x = ntt1::conv(a);
auto y = ntt2::conv(a);
auto z = ntt3::conv(a);
vector<ModInt> ret(x.size());
rep (i,x.size()) ret[i] = garner<ModInt>(x[i],y[i],z[i]);
return ret;
}
// <<<
using FPS = vector<mint>;
// FPS operator*(FPS const& x, FPS const& y) {
// FPS z(x.size()+y.size()-1);
// rep (i,x.size()) rep (j,y.size()) z[i+j] += x[i]*y[j];
// return z;
// }
// void operator*=(FPS &x, FPS const& y) {
// static FPS z;
// z.assign(x.size()+y.size()-1,0);
// rep (i,x.size()) rep (j,y.size()) z[i+j] += x[i]*y[j];
// swap(x,z);
// }
void operator*=(FPS &x, FPS const& y) {
x = conv(x,y);
}
int32_t main() {
int n; cin >> n;
string s; cin >> s;
auto dp0 = make_v<mint,2>(n+1,n+1);
dp0[0][0] = 1;
rep (j,n) rep (i,n+1) {
if (i+2 < n+1) dp0[i+1][j+1] += 2*dp0[i][j];
if (i-1 >= 0) dp0[i-1][j+1] += dp0[i][j];
}
dump(as_mat(dp0));
auto dp1 = make_v<mint,2>(n+1,n+1);
dp1[0][0] = 1;
rep (j,n) rep (i,n+1) {
if (i+2 < n+1) dp1[i+1][j+1] += 2*dp1[i][j];
dp1[max(0LL,i-1)][j+1] += dp1[i][j];
}
dump(as_mat(dp1));
const int m = s.size();
FPS res = dp1[0], p = dp0[0];
for (int k = m; k; k >>= 1) {
if (k&1) {
res *= p;
res.resize(n-m+1);
}
p *= p;
p.resize(n-m+1);
}
dump(res);
cout << res[n-m] << endl;
}
|
a.cc: In instantiation of 'constexpr ModInt garner(const P&, const Q&, const R&) [with ModInt = modint<1000000007>; P = modint<167772161>; Q = modint<469762049>; R = modint<1224736769>]':
a.cc:260:42: required from 'std::vector<_Tp> conv(const std::vector<_Tp>&, const std::vector<_Tp>&) [with ModInt = modint<1000000007>]'
260 | rep (i,x.size()) ret[i] = garner<ModInt>(x[i],y[i],z[i]);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
a.cc:287:13: required from here
287 | x = conv(x,y);
| ~~~~^~~~~
a.cc:245:19: error: invalid cast from type 'const modint<167772161>' to type 'll' {aka 'long int'}
245 | const ll xx = (ll)x, yy = (ll)y, zz = (ll)z;
| ^~~~~
a.cc:245:31: error: invalid cast from type 'const modint<469762049>' to type 'll' {aka 'long int'}
245 | const ll xx = (ll)x, yy = (ll)y, zz = (ll)z;
| ^~~~~
a.cc:245:43: error: invalid cast from type 'const modint<1224736769>' to type 'll' {aka 'long int'}
245 | const ll xx = (ll)x, yy = (ll)y, zz = (ll)z;
| ^~~~~
a.cc:210:24: warning: inline function 'constexpr modint<469762049>::M operator*(modint<469762049>::i64, modint<469762049>::M)' used but never defined
210 | friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
| ^~~~~~~~
a.cc:210:24: warning: inline function 'constexpr modint<1224736769>::M operator*(modint<1224736769>::i64, modint<1224736769>::M)' used but never defined
a.cc:208:24: warning: inline function 'constexpr modint<1000000007>::M operator+(modint<1000000007>::i64, modint<1000000007>::M)' used but never defined
208 | friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
| ^~~~~~~~
|
s665143747
|
p04028
|
C++
|
// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#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 repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T,d-1>::type>;
template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> NTT
template <class ModInt, int64_t g>
struct NTT {
using modint = ModInt;
static constexpr int64_t mod = ModInt::mod, gen = g, max_lg = __builtin_ctzll(mod-1);
// mod:prime, g:primitive root
static_assert(mod > 0 && g > 0 && max_lg > 0, "");
using arr_t = array<ModInt,max_lg+1>;
static arr_t ws,iws;
static void init() {
for (int i = 0; i <= max_lg; i++) {
ws[i] = -ModInt(g).pow((mod-1)>>(i+2));
iws[i] = ModInt(1)/ws[i];
}
}
static void ntt(ModInt a[], int lg) {
for (int b = lg-1; b >= 0; b--) {
ModInt w = 1;
for (int i = 0, k = 0; i < (1<<lg); i += 1<<(b+1)) {
for (int j = i; j < (i|(1<<b)); j++) {
const int k = j|(1<<b);
const auto x = a[j], y = a[k];
a[j] = x + y*w;
a[k] = x - y*w;
}
w *= ws[__builtin_ctz(++k)];
}
}
// bit_reverse(a,1<<lg);
}
static void intt(ModInt a[], int lg) {
// bit_reverse(a,1<<lg);
for (int b = 0; b < lg; b++) {
ModInt w = 1;
for (int i = 0, k = 0; i < (1<<lg); i += 1<<(b+1)) {
for (int j = i; j < (i|(1<<b)); j++) {
const int k = j|(1<<b);
const auto x = a[j], y = a[k];
a[j] = x + y;
a[k] = w*(x - y);
}
w *= iws[__builtin_ctz(++k)];
}
}
}
template <class T>
static vector<ModInt> conv(vector<T> const& a, vector<T> const& b) {
if (a.empty() || b.empty()) return {};
init();
const int s = a.size() + b.size() - 1, lg = __lg(2*s-1);
assert(lg <= max_lg);
vector<ModInt> aa(1<<lg);
rep (i,a.size()) aa[i] = (int)a[i];
ntt(aa.data(), lg);
vector<ModInt> bb(1<<lg);
rep (i,b.size()) bb[i] = (int)b[i];
ntt(bb.data(), lg);
const auto x = ModInt(1)/ModInt(1<<lg);
rep (i,1<<lg) aa[i] *= bb[i]*x;
intt(aa.data(), lg); aa.resize(s);
return aa;
}
template <class T>
static vector<ModInt> conv(vector<T> const& a) {
if (a.empty()) return {};
init();
const int s = a.size()*2 - 1, lg = __lg(2*s-1);
assert(lg <= max_lg);
vector<ModInt> aa(1<<lg);
rep (i,a.size()) aa[i] = (int)a[i];
ntt(aa.data(), lg);
const auto x = ModInt(1)/ModInt(1<<lg);
rep (i,1<<lg) aa[i] *= aa[i]*x;
intt(aa.data(), lg); aa.resize(s);
return aa;
}
};
template <class ModInt, int64_t g>
typename NTT<ModInt,g>::arr_t NTT<ModInt,g>::ws;
template <class ModInt, int64_t g>
typename NTT<ModInt,g>::arr_t NTT<ModInt,g>::iws;
// <<<
// >>> modint
template <uint32_t MOD>
struct modint {
using u32 = uint32_t;
using u64 = uint64_t;
using i64 = int64_t;
using M = modint;
static constexpr u32 mul_inv(u32 n, int e = 5, u32 x = 1) {
return e == 0 ? x : mul_inv(n, e-1, x*(2-x*n));
}
static constexpr u32 mod = MOD;
static constexpr u32 nn = mul_inv(MOD);
static constexpr u32 r2 = -u64(MOD) % MOD;
u32 x;
constexpr modint(i64 x = 0) : x(reduce(((x%=MOD)<0 ? x+MOD : x)*r2)) {}
static constexpr u32 reduce(u64 w) {
return u32(w >> 32) + MOD - i64((u64(u32(w) * nn) * MOD) >> 32);
}
constexpr i64 val() const {
i64 r = reduce(x);
if (r >= MOD) r -= MOD;
return r;
}
constexpr explicit operator i64() const { return val(); }
constexpr bool operator==(M p) const { return val() == p.val(); }
constexpr bool operator!=(M p) const { return val() != p.val(); }
constexpr M operator+() const { return *this; }
constexpr M operator-() const { M r; r.x = x ? i64(2*MOD)-x : 0; return r; }
constexpr M &operator+=(M p) {
i64 t = x; if (((t += p.x) -= 2*MOD) < 0) t += 2*MOD;
x = t;
return *this;
}
constexpr M &operator-=(M p) { return *this += -p; }
constexpr M &operator*=(M p) { x = reduce(u64(x)*p.x); return *this; }
constexpr M &operator/=(M p) { *this *= p.inv(); return *this; }
constexpr M operator+(M p) const { return M(*this) += p; }
constexpr M operator-(M p) const { return M(*this) -= p; }
constexpr M operator*(M p) const { return M(*this) *= p; }
constexpr M operator/(M p) const { return M(*this) /= p; }
friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
constexpr M inv() const { return pow(MOD - 2); }
constexpr M pow(i64 n) const {
if (n < 0) return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
return r;
}
friend ostream &operator<<(ostream &os, M p) {
return os << p.val();
}
friend istream &operator>>(istream &is, M &a) {
u32 t; is >> t; a = t; return is;
}
#ifdef LOCAL
friend string to_s(M p) { return to_s(p.val(), MOD); }
#endif
};
// <<<
constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;
// >>> garner, convolution for arbitray mod
using ntt1 = NTT<modint< 167772161>, 3>; // mod-1 = 5<<25
using ntt2 = NTT<modint< 469762049>, 3>; // mod-1 = 7<<26
using ntt3 = NTT<modint<1224736769>, 3>; // mod-1 = 73<<24
//using ntt3 = NTT<modint<998244353>, 3>; // mod-1 = 119<<23
// https://math314.hateblo.jp/entry/2015/05/07/014908
template <class ModInt, class P, class Q, class R>
constexpr ModInt garner(P const& x, Q const& y, R const& z) {
using ll = int64_t;
const ll xx = (ll)x, yy = (ll)y, zz = (ll)z;
constexpr ll m1 = ntt1::mod, m2 = ntt2::mod;
constexpr auto m1_inv_m2 = ntt2::modint(m1).inv();
constexpr auto m12_inv_m3 = ntt3::modint(m1 * m2).inv();
constexpr auto m12_mod = ModInt(m1 * m2);
auto v1 = (yy - xx) * m1_inv_m2;
auto v2 = (zz - (xx + m1 * v1.val())) * m12_inv_m3;
return xx + m1 * v1.val() + m12_mod * ModInt(v2.val());
}
template <class ModInt>
vector<ModInt> conv(vector<ModInt> const& a, vector<ModInt> const& b) {
auto x = ntt1::conv(a, b);
auto y = ntt2::conv(a, b);
auto z = ntt3::conv(a, b);
vector<ModInt> ret(x.size());
rep (i,x.size()) ret[i] = garner<ModInt>(x[i],y[i],z[i]);
return ret;
}
template <class ModInt>
vector<ModInt> conv(vector<ModInt> const& a) {
auto x = ntt1::conv(a);
auto y = ntt2::conv(a);
auto z = ntt3::conv(a);
vector<ModInt> ret(x.size());
rep (i,x.size()) ret[i] = garner<ModInt>(x[i],y[i],z[i]);
return ret;
}
// <<<
using FPS = vector<mint>;
// FPS operator*(FPS const& x, FPS const& y) {
// FPS z(x.size()+y.size()-1);
// rep (i,x.size()) rep (j,y.size()) z[i+j] += x[i]*y[j];
// return z;
// }
// void operator*=(FPS &x, FPS const& y) {
// static FPS z;
// z.assign(x.size()+y.size()-1,0);
// rep (i,x.size()) rep (j,y.size()) z[i+j] += x[i]*y[j];
// swap(x,z);
// }
void operator*=(FPS &x, FPS const& y) {
x = conv(x,y);
}
int32_t main() {
int n; cin >> n;
string s; cin >> s;
auto dp0 = make_v<mint,2>(n+1,n+1);
dp0[0][0] = 1;
rep (j,n) rep (i,n+1) {
if (i+2 < n+1) dp0[i+1][j+1] += 2*dp0[i][j];
if (i-1 >= 0) dp0[i-1][j+1] += dp0[i][j];
}
dump(as_mat(dp0));
auto dp1 = make_v<mint,2>(n+1,n+1);
dp1[0][0] = 1;
rep (j,n) rep (i,n+1) {
if (i+2 < n+1) dp1[i+1][j+1] += 2*dp1[i][j];
dp1[max(0LL,i-1)][j+1] += dp1[i][j];
}
dump(as_mat(dp1));
const int m = s.size();
FPS res = dp1[0], p = dp0[0];
for (int k = m; k; k >>= 1) {
if (k&1) {
res *= p;
res.resize(n-m+1);
}
p *= p;
p.resize(n-m+1);
}
dump(res);
cout << res[n-m] << endl;
}
|
a.cc: In instantiation of 'static std::vector<_Tp> NTT<ModInt, g>::conv(const std::vector<T>&, const std::vector<T>&) [with T = modint<1000000007>; ModInt = modint<167772161>; long int g = 3]':
a.cc:255:24: required from 'std::vector<_Tp> conv(const std::vector<_Tp>&, const std::vector<_Tp>&) [with ModInt = modint<1000000007>]'
255 | auto x = ntt1::conv(a, b);
| ~~~~~~~~~~^~~~~~
a.cc:286:13: required from here
286 | x = conv(x,y);
| ~~~~^~~~~
a.cc:129:34: error: invalid cast from type 'const __gnu_cxx::__alloc_traits<std::allocator<modint<1000000007> >, modint<1000000007> >::value_type' {aka 'const modint<1000000007>'} to type 'll' {aka 'long long int'}
129 | rep (i,a.size()) aa[i] = (int)a[i];
| ^~~~~~~
a.cc:133:34: error: invalid cast from type 'const __gnu_cxx::__alloc_traits<std::allocator<modint<1000000007> >, modint<1000000007> >::value_type' {aka 'const modint<1000000007>'} to type 'll' {aka 'long long int'}
133 | rep (i,b.size()) bb[i] = (int)b[i];
| ^~~~~~~
a.cc: In instantiation of 'static std::vector<_Tp> NTT<ModInt, g>::conv(const std::vector<T>&, const std::vector<T>&) [with T = modint<1000000007>; ModInt = modint<469762049>; long int g = 3]':
a.cc:256:24: required from 'std::vector<_Tp> conv(const std::vector<_Tp>&, const std::vector<_Tp>&) [with ModInt = modint<1000000007>]'
256 | auto y = ntt2::conv(a, b);
| ~~~~~~~~~~^~~~~~
a.cc:286:13: required from here
286 | x = conv(x,y);
| ~~~~^~~~~
a.cc:129:34: error: invalid cast from type 'const __gnu_cxx::__alloc_traits<std::allocator<modint<1000000007> >, modint<1000000007> >::value_type' {aka 'const modint<1000000007>'} to type 'll' {aka 'long long int'}
129 | rep (i,a.size()) aa[i] = (int)a[i];
| ^~~~~~~
a.cc:133:34: error: invalid cast from type 'const __gnu_cxx::__alloc_traits<std::allocator<modint<1000000007> >, modint<1000000007> >::value_type' {aka 'const modint<1000000007>'} to type 'll' {aka 'long long int'}
133 | rep (i,b.size()) bb[i] = (int)b[i];
| ^~~~~~~
a.cc: In instantiation of 'static std::vector<_Tp> NTT<ModInt, g>::conv(const std::vector<T>&, const std::vector<T>&) [with T = modint<1000000007>; ModInt = modint<1224736769>; long int g = 3]':
a.cc:257:24: required from 'std::vector<_Tp> conv(const std::vector<_Tp>&, const std::vector<_Tp>&) [with ModInt = modint<1000000007>]'
257 | auto z = ntt3::conv(a, b);
| ~~~~~~~~~~^~~~~~
a.cc:286:13: required from here
286 | x = conv(x,y);
| ~~~~^~~~~
a.cc:129:34: error: invalid cast from type 'const __gnu_cxx::__alloc_traits<std::allocator<modint<1000000007> >, modint<1000000007> >::value_type' {aka 'const modint<1000000007>'} to type 'll' {aka 'long long int'}
129 | rep (i,a.size()) aa[i] = (int)a[i];
| ^~~~~~~
a.cc:133:34: error: invalid cast from type 'const __gnu_cxx::__alloc_traits<std::allocator<modint<1000000007> >, modint<1000000007> >::value_type' {aka 'const modint<1000000007>'} to type 'll' {aka 'long long int'}
133 | rep (i,b.size()) bb[i] = (int)b[i];
| ^~~~~~~
|
s492654229
|
p04028
|
C++
|
/**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0) val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator - () const noexcept {
return val ? MOD - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= MOD) val -= MOD;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += MOD;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
return os << x.val;
}
friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1) t = t * a;
return t;
}
};
const int MOD = 1000000007;
//const int MOD = 998244353;
using mint = Fp<MOD>;
void solve() {
int n; string s; cin >> n >> s;
int m = (int)s.size();
vector<vector<mint>> dp(n + 1, vector<int>(m + 1, 0));
//static mint dp[330][330][330];
// rep(i, 330) {
// rep(j, 330) {
// rep(k, 330) {
// dp[i][j][k] = 0;
// }
// }
// }
// dp[0][0][0] = 1;
dp[0][0] = 1;
rep(i, n) {
vector<vector<mint>> nxt(n + 1, vector<int>(m + 1, 0));
rep(j, n + 1) {
rep(k, m + 1) {
if(j < k) continue;
else if(j == k) {
if(j > 0) nxt[j - 1][k - 1] += dp[j][k];
if(j == 0) nxt[j][k] += dp[j][k];
nxt[j + 1][k] += dp[j][k];
if(k < m) nxt[j + 1][k + 1] += dp[j][k];
if(k == m) nxt[j + 1][k] += dp[j][k];
} else {
if(j > 0) nxt[j - 1][k] += dp[j][k];
if(j == 0) nxt[j][k] += dp[j][k];
nxt[j + 1][k] += dp[j][k];
nxt[j + 1][k] += dp[j][k];
}
}
}
dp = move(nxt);
}
cout << dp[m][m] << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//int t; cin >> t; rep(i, t)solve();
solve();
return 0;
}
|
a.cc: In function 'void solve()':
a.cc:120:57: error: no matching function for call to 'std::vector<std::vector<Fp<1000000007> > >::vector(int, std::vector<int>)'
120 | vector<vector<mint>> dp(n + 1, vector<int>(m + 1, 0));
| ^
In file included from /usr/include/c++/14/vector:66,
from a.cc:8:
/usr/include/c++/14/bits/stl_vector.h:707:9: note: candidate: 'template<class _InputIterator, class> std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with <template-parameter-2-2> = _InputIterator; _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >]'
707 | vector(_InputIterator __first, _InputIterator __last,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:707:9: note: template argument deduction/substitution failed:
a.cc:120:57: note: deduced conflicting types for parameter '_InputIterator' ('int' and 'std::vector<int>')
120 | vector<vector<mint>> dp(n + 1, vector<int>(m + 1, 0));
| ^
/usr/include/c++/14/bits/stl_vector.h:678:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::initializer_list<_Tp>, const allocator_type&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; allocator_type = std::allocator<std::vector<Fp<1000000007> > >]'
678 | vector(initializer_list<value_type> __l,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:678:43: note: no known conversion for argument 1 from 'int' to 'std::initializer_list<std::vector<Fp<1000000007> > >'
678 | vector(initializer_list<value_type> __l,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:659:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, std::__type_identity_t<_Alloc>&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; std::__type_identity_t<_Alloc> = std::allocator<std::vector<Fp<1000000007> > >]'
659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:659:23: note: no known conversion for argument 1 from 'int' to 'std::vector<std::vector<Fp<1000000007> > >&&'
659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
| ~~~~~~~~~^~~~
/usr/include/c++/14/bits/stl_vector.h:640:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::false_type) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; allocator_type = std::allocator<std::vector<Fp<1000000007> > >; std::false_type = std::false_type]'
640 | vector(vector&& __rv, const allocator_type& __m, false_type)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:640:7: note: candidate expects 3 arguments, 2 provided
/usr/include/c++/14/bits/stl_vector.h:635:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::true_type) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; allocator_type = std::allocator<std::vector<Fp<1000000007> > >; std::true_type = std::true_type]'
635 | vector(vector&& __rv, const allocator_type& __m, true_type) noexcept
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:635:7: note: candidate expects 3 arguments, 2 provided
/usr/include/c++/14/bits/stl_vector.h:624:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&, std::__type_identity_t<_Alloc>&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; std::__type_identity_t<_Alloc> = std::allocator<std::vector<Fp<1000000007> > >]'
624 | vector(const vector& __x, const __type_identity_t<allocator_type>& __a)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:624:28: note: no known conversion for argument 1 from 'int' to 'const std::vector<std::vector<Fp<1000000007> > >&'
624 | vector(const vector& __x, const __type_identity_t<allocator_type>& __a)
| ~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:620:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >]'
620 | vector(vector&&) noexcept = default;
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:620:7: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:601:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >]'
601 | vector(const vector& __x)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:601:7: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:569:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(size_type, const value_type&, const allocator_type&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; size_type = long unsigned int; value_type = std::vector<Fp<1000000007> >; allocator_type = std::allocator<std::vector<Fp<1000000007> > >]'
569 | vector(size_type __n, const value_type& __value,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:569:47: note: no known conversion for argument 2 from 'std::vector<int>' to 'const std::vector<std::vector<Fp<1000000007> > >::value_type&' {aka 'const std::vector<Fp<1000000007> >&'}
569 | vector(size_type __n, const value_type& __value,
| ~~~~~~~~~~~~~~~~~~^~~~~~~
/usr/include/c++/14/bits/stl_vector.h:556:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(size_type, const allocator_type&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; size_type = long unsigned int; allocator_type = std::allocator<std::vector<Fp<1000000007> > >]'
556 | vector(size_type __n, const allocator_type& __a = allocator_type())
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:556:51: note: no known conversion for argument 2 from 'std::vector<int>' to 'const std::vector<std::vector<Fp<1000000007> > >::allocator_type&' {aka 'const std::allocator<std::vector<Fp<1000000007> > >&'}
556 | vector(size_type __n, const allocator_type& __a = allocator_type())
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_vector.h:542:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const allocator_type&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; allocator_type = std::allocator<std::vector<Fp<1000000007> > >]'
542 | vector(const allocator_type& __a) _GLIBCXX_NOEXCEPT
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:542:7: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:531:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector() [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >]'
531 | vector() = default;
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:531:7: note: candidate expects 0 arguments, 2 provided
a.cc:132:62: error: no matching function for call to 'std::vector<std::vector<Fp<1000000007> > >::vector(int, std::vector<int>)'
132 | vector<vector<mint>> nxt(n + 1, vector<int>(m + 1, 0));
| ^
/usr/include/c++/14/bits/stl_vector.h:707:9: note: candidate: 'template<class _InputIterator, class> std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with <template-parameter-2-2> = _InputIterator; _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >]'
707 | vector(_InputIterator __first, _InputIterator __last,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:707:9: note: template argument deduction/substitution failed:
a.cc:132:62: note: deduced conflicting types for parameter '_InputIterator' ('int' and 'std::vector<int>')
132 | vector<vector<mint>> nxt(n + 1, vector<int>(m + 1, 0));
| ^
/usr/include/c++/14/bits/stl_vector.h:678:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::initializer_list<_Tp>, const allocator_type&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; allocator_type = std::allocator<std::vector<Fp<1000000007> > >]'
678 | vector(initializer_list<value_type> __l,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:678:43: note: no known conversion for argument 1 from 'int' to 'std::initializer_list<std::vector<Fp<1000000007> > >'
678 | vector(initializer_list<value_type> __l,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:659:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, std::__type_identity_t<_Alloc>&) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<1000000007> > >; std::__type_identity_t<_Alloc> = std::allocator<std::vector<Fp<1000000007> > >]'
659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:659:23: note: no known conversion for argument 1 from 'int' to 'std::vector<std::vector<Fp<1000000007> > >&&'
659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
| ~~~~~~~~~^~~~
/usr/include/c++/14/bits/stl_vector.h:640:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::false_type) [with _Tp = std::vector<Fp<1000000007> >; _Alloc = std::allocator<std::vector<Fp<100000
|
s320869763
|
p04028
|
C++
|
#include<iostream>
using namespace std;
const int N = 5005, mod = 1e9 + 7;
int n, f[N][N], m; char s[N];
int main() {
scanf("%d%s", &n, s + 1); m = strlen(s + 1);
f[0][0] = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j <= i; j++) {
if (j) f[i + 1][j - 1] = (f[i + 1][j - 1] + f[i][j]) % mod;
else f[i + 1][j] = (f[i + 1][j] + f[i][j]) % mod;
f[i + 1][j + 1] = (f[i + 1][j + 1] + 1ll * f[i][j] * 2) % mod;
}
for (int i = 1; i <= m; i++) f[n][m] = 1ll * f[n][m] * 500000004 % mod;
printf("%d \n", f[n][m]);
return 0;
}
|
a.cc: In function 'int main()':
a.cc:6:39: error: 'strlen' was not declared in this scope
6 | scanf("%d%s", &n, s + 1); m = strlen(s + 1);
| ^~~~~~
a.cc:2:1: note: 'strlen' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
1 | #include<iostream>
+++ |+#include <cstring>
2 | using namespace std;
|
s129550650
|
p04028
|
C++
|
#include<bits/stdc++.h>
using namespace std;
using Lint=long long;
template<int mod> class ModInt
{
private:
Lint val;
public:
Lint value(){ return val; }
ModInt(Lint x=0){ val=x%mod; }
ModInt pow(int n){
ModInt res(1),x(val);
while(n>0){ if(n&1) res*=x; x*=x; n>>=1; }
return res;
}
ModInt inv(){ return pow(mod-2); }
ModInt& operator+=(ModInt rhs){ val+=rhs.val; if(val>=mod) val-=mod; return *this; }
ModInt& operator-=(ModInt rhs){ val+=mod-rhs.val; if(val>=mod) val-=mod; return *this; }
ModInt& operator*=(ModInt rhs){ val=val*rhs.val%mod; return *this; }
ModInt& operator/=(ModInt rhs){ *this*=rhs.inv(); return *this; }
ModInt operator+(ModInt rhs){ return ModInt(val)+=rhs; }
ModInt operator-(ModInt rhs){ return ModInt(val)-=rhs; }
ModInt operator*(ModInt rhs){ return ModInt(val)*=rhs; }
ModInt operator/(ModInt rhs){ return ModInt(val)/=rhs; }
};
using mint=ModInt<1000000007>;
mint dp[310][310][310];
int main()
{
int N; cin>>N;
string s; cin>>s;
assert(N<=300);
dp[0][0][0]=1;
for(int i=0;i<N;i++) for(int j=0;j<=i;j++) for(int k=0;k<=j;k++){
if(dp[i][j][k]==0) continue;
if(j>k){
dp[i+1][j+1][k]+=dp[i][j][k]; // insert 0
dp[i+1][j+1][k]+=dp[i][j][k]; // insert 1
dp[i+1][j-1][k]+=dp[i][j][k]; // erase
}else{
if(s[j]=='0') dp[i+1][j+1][j+1]+=dp[i][j][j];
else dp[i+1][j+1][j]+=dp[i][j][j];
if(s[j]=='1') dp[i+1][j+1][j+1]+=dp[i][j][j];
else dp[i+1][j+1][j]+=dp[i][j][j];
dp[i+1][max(0,j-1)][max(0,j-1)]+=dp[i][j][j];
}
}
cout<<dp[N][s.size()][s.size()].value()<<endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:38:23: error: no match for 'operator==' (operand types are 'mint' {aka 'ModInt<1000000007>'} and 'int')
38 | if(dp[i][j][k]==0) continue;
| ~~~~~~~~~~~^~~
| | |
| | int
| mint {aka ModInt<1000000007>}
In file included from /usr/include/c++/14/regex:68,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:181,
from a.cc:1:
/usr/include/c++/14/bits/regex.h:1103:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator==(const sub_match<_BiIter>&, const sub_match<_BiIter>&)'
1103 | operator==(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1103:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/regex.h:1199:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator==(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)'
1199 | operator==(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1199:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/regex.h:1274:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator==(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)'
1274 | operator==(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1274:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/regex.h:1366:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const typename std::iterator_traits<_Iter>::value_type*, const sub_match<_BiIter>&)'
1366 | operator==(typename iterator_traits<_Bi_iter>::value_type const* __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1366:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/regex.h:1441:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)'
1441 | operator==(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1441:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/regex.h:1534:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const typename std::iterator_traits<_Iter>::value_type&, const sub_match<_BiIter>&)'
1534 | operator==(typename iterator_traits<_Bi_iter>::value_type const& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1534:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/regex.h:1613:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)'
1613 | operator==(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1613:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/regex.h:2186:5: note: candidate: 'template<class _Bi_iter, class _Alloc> bool std::__cxx11::operator==(const match_results<_BiIter, _Alloc>&, const match_results<_BiIter, _Alloc>&)'
2186 | operator==(const match_results<_Bi_iter, _Alloc>& __m1,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:2186:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::__cxx11::match_results<_BiIter, _Alloc>'
38 | if(dp[i][j][k]==0) continue;
| ^
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_pair.h:1033:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator==(const pair<_T1, _T2>&, const pair<_T1, _T2>&)'
1033 | operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
| ^~~~~~~~
/usr/include/c++/14/bits/stl_pair.h:1033:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::pair<_T1, _T2>'
38 | if(dp[i][j][k]==0) continue;
| ^
In file included from /usr/include/c++/14/bits/stl_algobase.h:67:
/usr/include/c++/14/bits/stl_iterator.h:441:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator==(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)'
441 | operator==(const reverse_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:441:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::reverse_iterator<_Iterator>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/stl_iterator.h:486:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator==(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)'
486 | operator==(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:486:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::reverse_iterator<_Iterator>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/stl_iterator.h:1667:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator==(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)'
1667 | operator==(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1667:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::move_iterator<_IteratorL>'
38 | if(dp[i][j][k]==0) continue;
| ^
/usr/include/c++/14/bits/stl_iterator.h:1737:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator==(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)'
1737 | operator==(const move_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1737:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::move_iterator<_IteratorL>'
38 | if(dp[i][j][k]==0) continue;
| ^
In file included from /usr/include/c++/14/bits/char_traits.h:42,
from /usr/include/c++/14/string:42,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/postypes.h:192:5: note: candidate: 'template<class _StateT> bool std::operator==(const fpos<_StateT>&, const fpos<_StateT>&)'
192 | operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)
| ^~~~~~~~
/usr/include/c++/14/bits/postypes.h:192:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::fpos<_StateT>'
38 | if(dp[i][j][k]==0) continue;
| ^
In file included from /usr/include/c++/14/string:43:
/usr/include/c++/14/bits/allocator.h:235:5: note: candidate: 'template<class _T1, class _T2> bool std::operator==(const allocator<_CharT>&, const allocator<_T2>&)'
235 | operator==(const allocator<_T1>&, const allocator<_T2>&)
| ^~~~~~~~
/usr/include/c++/14/bits/allocator.h:235:5: note: template argument deduction/substitution failed:
a.cc:38:25: note: 'mint' {aka 'ModInt<1000000007>'} is not derived from 'const std::allocator<_CharT>'
38 | if(dp[i][j][k]==0) continue;
| ^
In file included from /usr/include/c++/14/bits/basic_string.h:47,
from /usr/include/c++/14/string:54:
/usr/include/c++/14/string_view:629:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator==(basic_string_view<_CharT, _Traits>, __type_identity_t<basic_string_view<_CharT, _Traits> >)'
629 | operator==(basic_string_view<_CharT, _Traits> __x,
| ^~~~~~~~
/usr/include/c++/14/string_view:629:5: note: template argument deduction/substi
|
s362817500
|
p04028
|
C++
|
# include <bits / stdc ++. h>
using namespace std ;
const int N = 5005 , mod = 1e9 + 7 ;
int n, f [N] [N], m; char s [N];
int main () {
freopen ( "pp.in" , "r" , stdin);
freopen ( "pp.out" , "w" , stdout);
scanf ( "% d% s" , & n, s + 1 ); m = strlen (s + 1 );
f [ 0 ] [ 0 ] = 1 ;
for ( int i = 0 ; i <n; i ++)
for ( int j = 0 ; j <= i; j ++) {
if (j) f [i + 1 ] [j- 1 ] = (f [i + 1 ] [j- 1 ] + f [i] [j])% mod;
else f [i + 1 ] [j] = (f [i + 1 ] [j] + f [i] [j])% mod;
f [i + 1 ] [j + 1 ] = (f [i + 1 ] [j + 1 ] + 1l l * f [i] [j] * 2 )% mod;
}
for ( int i = 1 ; i <= m; i ++) f [n] [m] = 1l l * f [n] [m] * 500000004 % mod;
printf ( "% d \ n" , f [n] [m]);
return 0 ;
}
|
a.cc:1:11: fatal error: bits / stdc ++. h: No such file or directory
1 | # include <bits / stdc ++. h>
| ^~~~~~~~~~~~~~~~~~~
compilation terminated.
|
s442582114
|
p04028
|
Java
|
.
|
Main.java:1: error: class, interface, enum, or record expected
.
^
1 error
|
s544690497
|
p04028
|
C++
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using long long = LL;
using namespace std;
LL p = 1000000007ll;
LL n,m;
map<LL,map<LL,map<LL,LL>>> memo;
LL solve(LL i,LL co,LL er)
{
if(i==n) {
if(co == m && er == 0) return 1;
else return 0;
}
if(memo[i][co].count(er)) return memo[i][co][er];
LL answer = 0;
answer += solve(i+1, co, max(er-1, 0ll));
if(co<m) answer += solve(i+1, co+1, er);
else answer += solve(i+1, co, er+1);
answer += solve(i+1, co, er+1);
return memo[i][co][er] = answer%p;
}
int main(void)
{
string s;
cin >> n >> s;
m=s.size();
cout << solve(0,0,0) <<endl;
}
|
a.cc:5:7: error: expected nested-name-specifier before 'long'
5 | using long long = LL;
| ^~~~
a.cc:7:1: error: 'LL' does not name a type
7 | LL p = 1000000007ll;
| ^~
a.cc:8:1: error: 'LL' does not name a type
8 | LL n,m;
| ^~
a.cc:10:5: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:12: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:19: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:22: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:22: error: template argument 1 is invalid
a.cc:10:22: error: template argument 2 is invalid
a.cc:10:22: error: template argument 3 is invalid
a.cc:10:22: error: template argument 4 is invalid
a.cc:10:24: error: template argument 1 is invalid
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:24: error: template argument 2 is invalid
a.cc:10:24: error: template argument 3 is invalid
a.cc:10:24: error: template argument 4 is invalid
a.cc:10:26: error: template argument 1 is invalid
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^
a.cc:10:26: error: template argument 2 is invalid
a.cc:10:26: error: template argument 3 is invalid
a.cc:10:26: error: template argument 4 is invalid
a.cc:12:1: error: 'LL' does not name a type
12 | LL solve(LL i,LL co,LL er)
| ^~
a.cc: In function 'int main()':
a.cc:29:10: error: 'n' was not declared in this scope
29 | cin >> n >> s;
| ^
a.cc:30:3: error: 'm' was not declared in this scope
30 | m=s.size();
| ^
a.cc:31:11: error: 'solve' was not declared in this scope
31 | cout << solve(0,0,0) <<endl;
| ^~~~~
|
s090271625
|
p04028
|
C++
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using LL = long long;
using namespace std;
LL p = 1000000007ll;
LL n,m;
map<LL,map<LL,map<LL,LL>>> memo;
LL solve(LL i,LL co,LL er)
{
if(i==n) {
if(co == m && er == 0) return 1;
else return 0;
}
if(memo[i][co].count(er)) return memo[i][co][er];
LL answer = 0;
answer += solve(i+1, co, max(er-1, 0));
if(co<m) answer += solve(i+1, co+1, er);
else answer += solve(i+1, co, er+1);
answer += solve(i+1, co, er+1);
return memo[i][co][er] = answer%p;
}
int main(void)
{
string s;
cin >> n >> s;
m=s.size();
cout << solve(0,0,0) <<endl;
}
|
a.cc: In function 'LL solve(LL, LL, LL)':
a.cc:20:31: error: no matching function for call to 'max(LL, int)'
20 | answer += solve(i+1, co, max(er-1, 0));
| ~~~^~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
257 | max(const _Tp& __a, const _Tp& __b)
| ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: template argument deduction/substitution failed:
a.cc:20:31: note: deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
20 | answer += solve(i+1, co, max(er-1, 0));
| ~~~^~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp)
| ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
5706 | max(initializer_list<_Tp> __l)
| ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
5716 | max(initializer_list<_Tp> __l, _Compare __comp)
| ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: template argument deduction/substitution failed:
a.cc:20:31: note: mismatched types 'std::initializer_list<_Tp>' and 'long long int'
20 | answer += solve(i+1, co, max(er-1, 0));
| ~~~^~~~~~~~~
|
s039449480
|
p04028
|
C++
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using long long = LL;
using namespace std;
LL p = 1000000007ll;
LL n,m;
map<LL,map<LL,map<LL,LL>>> memo;
LL solve(LL i,LL co,LL er)
{
if(i==n) {
if(co == m && er == 0) return 1;
else return 0;
}
if(memo[i][co].count(er)) return memo[i][co][er];
LL answer = 0;
answer += solve(i+1, co, max(er-1, 0));
if(co<m) answer += solve(i+1, co+1, er);
else answer += solve(i+1, co, er+1);
answer += solve(i+1, co, er+1);
return memo[i][co][er] = answer%p;
}
int main(void)
{
string s;
cin >> n >> s;
m=s.size();
cout << solve(0,0,0) <<endl;
}
|
a.cc:5:7: error: expected nested-name-specifier before 'long'
5 | using long long = LL;
| ^~~~
a.cc:7:1: error: 'LL' does not name a type
7 | LL p = 1000000007ll;
| ^~
a.cc:8:1: error: 'LL' does not name a type
8 | LL n,m;
| ^~
a.cc:10:5: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:12: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:19: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:22: error: 'LL' was not declared in this scope
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:22: error: template argument 1 is invalid
a.cc:10:22: error: template argument 2 is invalid
a.cc:10:22: error: template argument 3 is invalid
a.cc:10:22: error: template argument 4 is invalid
a.cc:10:24: error: template argument 1 is invalid
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^~
a.cc:10:24: error: template argument 2 is invalid
a.cc:10:24: error: template argument 3 is invalid
a.cc:10:24: error: template argument 4 is invalid
a.cc:10:26: error: template argument 1 is invalid
10 | map<LL,map<LL,map<LL,LL>>> memo;
| ^
a.cc:10:26: error: template argument 2 is invalid
a.cc:10:26: error: template argument 3 is invalid
a.cc:10:26: error: template argument 4 is invalid
a.cc:12:1: error: 'LL' does not name a type
12 | LL solve(LL i,LL co,LL er)
| ^~
a.cc: In function 'int main()':
a.cc:29:10: error: 'n' was not declared in this scope
29 | cin >> n >> s;
| ^
a.cc:30:3: error: 'm' was not declared in this scope
30 | m=s.size();
| ^
a.cc:31:11: error: 'solve' was not declared in this scope
31 | cout << solve(0,0,0) <<endl;
| ^~~~~
|
s915137957
|
p04028
|
C++
|
#include <bits/stdc++.h>
typedef long long LL;
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
LL p = 1000000007ll;
LL n,m;
map<LL,map<LL,map<LL,LL>>> memo;
LL solve(LL i,LL co,LL er)
{
if(i==n) {
if(co == m && er == 0) return 1;
else return 0;
}
if(memo[i][co].count(er)) return memo[i][co][er];
LL answer = 0;
answer += solve(i+1, co, max(er-1, 0));
if(co<m) answer += solve(i+1, co+1, er);
else answer += solve(i+1, co, er+1);
answer += solve(i+1, co, er+1);
return memo[i][co][er] = answer%p;
}
int main(void)
{
string s;
cin >> n >> s;
m=s.size();
cout << solve(0,0,0) <<endl;
}
|
a.cc: In function 'LL solve(LL, LL, LL)':
a.cc:20:31: error: no matching function for call to 'max(LL, int)'
20 | answer += solve(i+1, co, max(er-1, 0));
| ~~~^~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
257 | max(const _Tp& __a, const _Tp& __b)
| ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: template argument deduction/substitution failed:
a.cc:20:31: note: deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
20 | answer += solve(i+1, co, max(er-1, 0));
| ~~~^~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp)
| ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
5706 | max(initializer_list<_Tp> __l)
| ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
5716 | max(initializer_list<_Tp> __l, _Compare __comp)
| ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: template argument deduction/substitution failed:
a.cc:20:31: note: mismatched types 'std::initializer_list<_Tp>' and 'long long int'
20 | answer += solve(i+1, co, max(er-1, 0));
| ~~~^~~~~~~~~
|
s333274505
|
p04028
|
C++
|
#include <bits/stdc++.h>
using namespace std;
template<int mod> struct ModInt {
using ll = long long;
int x;
template<class T>
ModInt(T a) {
x = a % mod;
if (x < 0) {
x += mod;
}
}
ModInt() : x(0) {}
inline ModInt& operator+=(const ModInt& rhs)
{
(*this) += rhs.x;
return *this;
}
template<class T>
inline ModInt& operator+=(const T rhs)
{
x += rhs % mod;
if (x < 0) x += mod;
x %= mod;
return *this;
}
inline ModInt& operator-=(const ModInt& rhs)
{
(*this) -= rhs.x;
return *this;
}
template<class T>
inline ModInt& operator-=(const T rhs)
{
x -= rhs % mod;
if (x < 0) x += mod;
x %= mod;
return *this;
}
inline ModInt& operator*=(const ModInt& rhs)
{
(*this) *= rhs.x;
return *this;
}
template<class T>
inline ModInt& operator*=(const T rhs)
{
ll res = (ll) x * (rhs % mod);
x = res % mod;
if (x < 0) x += mod;
return *this;
}
inline ModInt& operator/=(const ModInt& rhs)
{
(*this) /= rhs.x;
return *this;
}
template<class T>
inline ModInt& operator/=(const T rhs)
{
int t = rhs % mod;
if (t < 0) t += mod;
ll res = modpow(t);
(*this) *= res;
return *this;
}
inline ModInt& operator=(const ModInt& rhs)
{
(*this) = rhs.x;
return *this;
}
template<class T>
inline ModInt& operator=(const T rhs)
{
x = rhs % mod;
if (x < 0) x += mod;
return *this;
}
inline int operator==(const ModInt& rhs) const
{
return (*this) == rhs.x;
}
template<class T>
inline int operator==(const T rhs) const
{
ModInt t(rhs);
return (*this).x == t.x;
}
inline int operator!=(const ModInt& rhs) const
{
return (*this) != rhs.x;
}
inline int operator!=(const int rhs) const
{
ModInt t(rhs);
return (*this).x != t.x;
}
inline ModInt operator++(signed unused)
{
ModInt res((*this).x);
++(*this);
return res;
}
inline ModInt& operator++()
{
(*this) += 1;
return (*this);
}
inline ModInt operator--(signed unused)
{
ModInt res((*this).x);
--(*this);
return res;
}
inline ModInt& operator--()
{
(*this) -= 1;
return (*this);
}
inline ModInt operator+() const
{
return (*this);
}
inline ModInt operator-() const
{
return (*this).x ? ModInt(mod - (*this).x) : ModInt(0);
}
template<class T>
int modpow(const T val, int p = mod - 2)
{
if (p == 0) return 1;
if (p % 2) return (long long) val * modpow(val, p-1) % mod;
long long t = modpow(val, p/2);
int res = t * t % mod;
return res;
}
operator int() const
{
return x;
}
friend ostream& operator<<(ostream& lhs, const ModInt& rhs)
{
lhs << rhs.x;
return lhs;
}
friend istream& operator>>(istream& lhs, ModInt& rhs)
{
long long t;
lhs >> t;
rhs.x = t % mod;
if (rhs.x < 0) rhs += mod;
return lhs;
}
friend const ModInt operator+(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) += rhs;}
template<class T>
friend const ModInt operator+(const ModInt& lhs, const T rhs) {return ModInt(lhs) += rhs;}
template<class T>
friend const ModInt operator+(T lhs, const ModInt& rhs) {return ModInt(lhs) += rhs;}
friend const ModInt operator-(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) -= rhs;}
template<class T>
friend const ModInt operator-(const ModInt& lhs, const T rhs) {return ModInt(lhs) -= rhs;}
template<class T>
friend const ModInt operator-(T lhs, const ModInt& rhs) {return ModInt(lhs) -= rhs;}
friend const ModInt operator*(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) *= rhs;}
template<class T>
friend const ModInt operator*(const ModInt& lhs, const T rhs) {return ModInt(lhs) *= rhs;}
template<class T>
friend const ModInt operator*(T lhs, const ModInt& rhs) {return ModInt(lhs) *= rhs;}
friend const ModInt operator/(const ModInt& lhs, const ModInt& rhs) {return ModInt(lhs) /= rhs;}
template<class T>
friend const ModInt operator/(const ModInt& lhs, const T rhs) {return ModInt(lhs) /= rhs;}
template<class T>
friend const ModInt operator/(T lhs, const ModInt& rhs) {return ModInt(lhs) /= rhs;}
template<class T>
friend const int operator==(T lhs, const ModInt& rhs) {return ModInt(lhs) == rhs;}
template<class T>
friend const int operator!=(T lhs, const ModInt& rhs) {return ModInt(lhs) != rhs;}
};
using modint = ModInt<1000000007>;
int main()
{
int n;
string s;
cin >> n >> s;
int l = s.length();
vector<vector<modint>> dp(n+1, vector<modint>(l+1, 0));
dp[0][0] = 1;
for (int i = 1; i < N+1; i++) {
for (int j = 0; j < l+1; j++) {
if (j) {
dp[i][j] += dp[i-1][j-1];
}
if (j < l) {
dp[i][j] += dp[i-1][j+1];
}
if (j == 0) {
dp[i][j] += dp[i-1][j];
}
}
}
modint res = dp[n][l];
for (int i = 0; i < l; i++) {
res /= 2;
}
cout << res << endl;
}
|
a.cc: In function 'int main()':
a.cc:191:23: error: 'N' was not declared in this scope
191 | for (int i = 1; i < N+1; i++) {
| ^
|
s166483874
|
p04028
|
C++
|
#include<bits/stdc++.h>
#define fr(i,n) for(int i=0;i<(n);++i)
#define foor(i,a,b) for(int i=(a);i<=(b);++i)
#define rf(i,n) for(int i=(n);i--;)
#define roof(i,b,a) for(int i=(b);i>=(a);--i)
#define elsif else if
#define all(x) x.begin(),x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define PQ priority_queue
#define NP(x) next_permutation(all(x))
#define M_PI 3.14159265358979323846
#define popcount __builtin_popcount
using namespace std; typedef vector<bool> vb; typedef vector<vb> vvb;
typedef vector<int> vi; typedef vector<vi> vvi;
typedef long long ll; typedef vector< ll> vl; typedef vector<vl> vvl;
typedef unsigned long long ull; typedef vector<ull> vu; typedef vector<vu> vvu;
typedef double dbl; typedef vector<dbl> vd; typedef vector<vd> vvd;
typedef string str; typedef vector<str> vs; typedef vector<vs> vvs;
typedef pair<int,int>pii; typedef vector<pii>vpii; typedef map<int,int>mii;
typedef pair< ll, ll>pll; typedef vector<pll>vpll; typedef map< ll, ll>mll;
typedef pair<dbl,dbl>pdd; typedef vector<pdd>vpdd; typedef map<dbl,dbl>mdd;
typedef pair<str,str>pss; typedef vector<pss>vpss; typedef map<str,str>mss;
typedef pair<int, ll>pil; typedef vector<pil>vpil; typedef map<int, ll>mil;
typedef pair< ll,int>pli; typedef vector<pli>vpli; typedef map< ll,int>mli;
typedef pair<dbl,int>pdi; typedef vector<pdi>vpdi; typedef map<dbl,int>mdi;
template<typename T>vector<T>&operator<<(vector<T>&v,const T t){v.push_back(t);return v;}
template<typename T>multiset<T>&operator<<(multiset<T>&m,const T t){m.insert(t);return m;}
template<typename T>set<T>&operator<<(set<T>&s,const T t){s.insert(t);return s;}
template<typename T>stack<T>&operator<<(stack<T>&s,const T t){s.push(t);return s;}
template<typename T>stack<T>&operator>>(stack<T>&s,T&t){t=s.top();s.pop();return s;}
template<typename T>queue<T>&operator<<(queue<T>&q,const T t){q.push(t);return q;}
template<typename T>queue<T>&operator>>(queue<T>&q,T&t){t=q.front();q.pop();return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator<<(PQ<T,vector<T>,U>&q,const T t){q.push(t);return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator>>(PQ<T,vector<T>,U>&q,T&t){t=q.top();q.pop();return q;}
template<typename T,typename U>istream&operator>>(istream&s,pair<T,U>&p){return s>>p.first>>p.second;}
template<typename T>istream&operator>>(istream&s,vector<T>&v){fr(i,v.size()){s>>v[i];}return s;}
template<typename T,typename U>ostream&operator<<(ostream&s,const pair<T,U>p){return s<<p.first<<" "<<p.second;}
//template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto a:v){s<<a<<endl;}return s;}
template<typename T>ostream&operator<<(ostream&s,const vector<T>v){fr(i,v.size()){i?s<<" "<<v[i]:s<<v[i];}return s;}
template<typename T>ostream&operator<<(ostream&s,const deque<T>d){fr(i,d.size()){i?s<<" "<<d[i]:s<<d[i];}return s;}
template<typename T>_Bit_reference operator&=(_Bit_reference b,T t){return b=b&t;}
template<typename T>_Bit_reference operator^=(_Bit_reference b,T t){return b=b^t;}
template<typename T>_Bit_reference operator|=(_Bit_reference b,T t){return b=b|t;}
template<typename T,typename U>pair<T,U>operator+(pair<T,U>a,pair<T,U>b){return {a.first+b.first,a.second+b.second};}
template<typename T,typename U>pair<T,U>operator-(pair<T,U>a,pair<T,U>b){return {a.first-b.first,a.second-b.second};}
void print(void){cout<<endl;}
template<typename T>void print(T t){cout<<t<<endl;}
template<typename T,typename...U>void print(T&&t,U&&...u){cout<<t<<" ";print(forward<U>(u)...);}
bool YN(bool b){print(b?"YES":"NO");return b;}bool PI(bool b){print(b?"POSSIBLE":"IMPOSSIBLE");return b;}
bool Yn(bool b){print(b?"Yes":"No");return b;}bool Pi(bool b){print(b?"Possible":"Impossible");return b;}
bool yn(bool b){print(b?"yes":"no");return b;}bool pi(bool b){print(b?"possible":"impossible");return b;}
const int MD=1e9+7;
template<typename T>str to_string(const T&n){ostringstream s;s<<n;return s.str();}
template<typename T>T&chmax(T&a,T b){return a=max(a,b);}
template<typename T>T&chmin(T&a,T b){return a=min(a,b);}
template<typename T,typename U>vector<pair<T,U>>dijkstra(const vector<vector<pair<T,U>>>&E,const U s,const T inf){using P=pair<T,U>;vector<P>d;fr(i,E.size()){d<<P{inf,i};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
template<typename T,typename U>map<U,pair<T,U>>dijkstra(map<U,vector<pair<T,U>>>E,const U s,const T inf){using P=pair<T,U>;map<U,P>d;for(pair<U,vector<P>>e:E){d[e.first]=P{inf,e.first};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
ll maxflow(vector<mil>&E,int s,int t){ll z=0;vi b(E.size(),-1);for(int i=0;;++i){static auto dfs=[&](int v,ll f,auto&dfs)->ll{if(v==t)return f;b[v]=i;for(auto&p:E[v]){if(b[p.first]<i&&p.second){if(ll r=dfs(p.first,min(f,p.second),dfs)){p.second-=r;E[p.first][v]+=r;return r;}}}return 0;};ll x=dfs(s,ll(1e18),dfs);z+=x;if(x==0)return z;}}
template<typename T>T distsq(pair<T,T>a,pair<T,T>b){return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);}
template<typename T>T max(const vector<T>a){T m=a[0];for(T e:a){m=max(m,e);}return m;}
template<typename T>T min(const vector<T>a){T m=a[0];for(T e:a){m=min(m,e);}return m;}
template<typename T>T gcd(const T a,const T b){return a?gcd(b%a,a):b;}
template<typename T>T gcd(const vector<T>a){T g=a[0];for(T e:a){g=gcd(g,e);}return g;}
template<typename T>vector<T>LIS(const vector<T>A){vector<T>B;for(T a:A){auto it=lower_bound(all(B),a);if(it==B.end()){B<<a;}else{*it=a;}}return B;}
template<typename T>vector<T>LCS(vector<T>A,vector<T>B){int N=A.size(),M=B.size();vector<vector<pair<int,pii>>>d(N+1,vector<pair<int,pii>>(M+1));fr(i,N){fr(j,M){if(A[i]==B[j]){d[i+1][j+1]={d[i][j].first+1,{i,j}};}else{d[i+1][j+1]=max(d[i][j+1],d[i+1][j]);}}}vector<T>r;for(pii p={N,M};d[p.first][p.second].first;p=d[p.first][p.second].second){r<<A[d[p.first][p.second].second.first];}Reverse(r);return r;}
str LCS(str S,str T){vector<char>s=LCS(vector<char>(S.begin(),S.end()),vector<char>(T.begin(),T.end()));return str(s.begin(),s.end());}
template<typename T>vector<pair<T,T>>ConvexHull(vector<pair<T,T>>V){if(V.size()<=3){return V;}Sort(V);rf(i,V.size()-1)V<<V[i];vector<pair<T,T>>r;for(pair<T,T>p:V){int s=r.size();while(s>=2&&(p.second-r[s-1].second)*(p.first-r[s-2].first)<(p.second-r[s-2].second)*(p.first-r[s-1].first)){r.pop_back();--s;}r<<p;}r.pop_back();return r;}
class UnionFind{vi p,s;void extend(int N){foor(i,p.size(),N){p<<i;s<<1;}}public:UnionFind(void){}UnionFind(int N){extend(N-1);}int find(int i){extend(i);return p[i]=p[i]==i?i:find(p[i]);}void unite(int a,int b){extend(a);extend(b);if((a=find(a))!=(b=find(b))){if(s[a]>s[b]){swap(a,b);}s[b]+=s[a];p[a]=b;}}void unite(pii p){return unite(p.first,p.second);}bool same(int a,int b){extend(a);extend(b);return find(a)==find(b);}bool same(pii p){return same(p.first,p.second);}int size(int x){extend(x);return s[find(x)];}};
ll MST(vector<pair<ll,pii>>&E){Sort(E);UnionFind uf;ll z=0;for(auto&e:E){if(!uf.same(e.second)){z+=e.first;uf.unite(e.second);}}return z;}
ll strmod(const str&s,const int m){ll x=0;fr(i,s.size()){x=(x*10+s[i]-48)%m;}return x;}
vvl mul(const vvl&A,const vvl&B,const int m){vvl C;fr(y,A.size()){C<<vl(B[y].size());}fr(y,C.size()){fr(x,C[y].size()){fr(i,A[0].size()){(C[y][x]+=A[y][i]*B[i][x])%=m;}}}return C;}
vvl pow(const vvl&A,const ll n,const int m){vvl B;fr(y,A.size()){B<<vl(A.size());}if(n==0){fr(i,B.size()){B[i][i]=1;}}elsif(n%2){B=mul(A,pow(A,n-1,m),m);}else{vvl C=pow(A,n/2,m);B=mul(C,C,m);}return B;}
ll pow(const ll a,const ll n,const int m){ll t;return n?(n&1?a>=0?a%m:(m-(-a%m))%m:1)*(t=pow(a,n>>1,m),t*t%m)%m:!!a;}
ll inv(const ll x,const int p){return pow(x,p-2,p);}
ll inv(const ll x){return inv(x,MD);}
vpll fact(const int n,const int p){vpll v(n+1);v[0].first=1;foor(i,1,n){v[i].first=v[i-1].first*i%p;}v[n].second=inv(v[n].first,p);roof(i,n,1){v[i-1].second=v[i].second*i%p;}return v;}
class Combination{const vpll f;const int M;public:Combination(int n,int m):f(fact(n,m)),M(m){}Combination(int n):Combination(n,MD){}ll P(int n,int k){return n<0||k<0||n<k?0ll:f[n].first*f[n-k].second%M;}ll C(int n,int k){return P(n,k)*f[k].second%M;}ll H(int n,int k){return n==0&&k==0?1ll:C(n+k-1,k);}};
ll C2(const int n){return(ll)n*~-n/2;}
ll sum(const vi a){ll s=0;for(int e:a){s+=e;}return s;}
ll sum(const vl a){ll s=0;for(ll e:a){s+=e;}return s;}
template<typename T>int MSB(T N){int r=-1;for(;N>0;N/=2){++r;}return r;}
template<typename T>class SegmentTree{vector<T>S;T(*const op)(T a,T b);const T zero;const int B;public:SegmentTree(int N,T(*f)(T a,T b),const T zero):S(1<<MSB(N-1)+2,zero),op(f),zero(zero),B(1<<MSB(N-1)+1){}SegmentTree(vector<T>v,T(*f)(T a,T b),const T zero):SegmentTree(v.size(),f,zero){fr(i,v.size()){S[S.size()/2+i]=v[i];}roof(i,S.size()/2-1,1){S[i]=op(S[i*2],S[i*2+1]);}}T calc(int l,int r){l+=B;r+=B;if(l>r){return zero;}if(l==r){return S[l];}T L=S[l],R=S[r];for(;l/2<r/2;l/=2,r/=2){if(l%2==0){L=op(L,S[l+1]);}if(r%2==1){R=op(S[r-1],R);}}return op(L,R);}void replace(int i,T x){for(S[i+=B]=x;i!=1;i/=2){if(i%2){S[i/2]=op(S[i-1],S[i]);}else{S[i/2]=op(S[i],S[i+1]);}}}void add(int i,T x){replace(i,op(S[B+i],x));}T top(){return S[1];}};
ll BITsum(vl&B,int i){ll z=0;while(i>0){z+=B[i];i-=i&-i;}return z;}
void BITadd(vl&B,int i,ll x){while(i<B.size()){B[i]+=x;i+=i&-i;}}
ll fib(const ll n,const int m){ll a,b,c,d,A,B,C,D;a=1;b=0;c=0;d=1;rf(i,63){A=a*a+b*c;B=a*b+b*d;C=c*a+d*c;D=c*b+d*d;if(n>>i&1){a=A;b=B;c=C;d=D;A=a+b;B=a;C=c+d;D=c;}a=A%m;b=B%m;c=C%m;d=D%m;}return b;}
vi primes(int n){vb b(n+1);vi p;foor(i,2,n){if(!b[i]){p<<i;for(int j=2*i;j<=n;j+=i){b[j]=true;}}}return p;}
vb isprime(const int n){vb v(n+1,true);v[0]=v[1]=false;foor(i,2,n){if(v[i]){for(int j=2*i;j<=n;j+=i){v[j]=false;}}}return v;}
int main(){cin.tie(0);ios::sync_with_stdio(false);
int N;cin>>N;
vvl d(N+1,vl(N+1));
d[0][0]=1;
fr(i,N){
(d[i+1][1]+=2*d[i][0])%=MD;
(d[i+1][0]+=d[i][0])%=MD;
foor(j,1,N-1){
(d[i+1][j+1]+=2*d[i][j])%=MD;
(d[i+1][j-1]+=d[i][j])%=MD;
}
}
print(d[N][S.size()]*inv(pow(2,S.size(),MD))%MD);
return 0;
}
|
a.cc: In function 'int main()':
a.cc:102:20: error: 'S' was not declared in this scope
102 | print(d[N][S.size()]*inv(pow(2,S.size(),MD))%MD);
| ^
|
s912734244
|
p04028
|
C++
|
#include<bits/stdc++.h>
using namespace std;
long long DP[5001][5001];
long long pow[5001];
int mod=1e9+7;
int main(){
int N;
string S;
cin>>N>>S;
int now=1;
for(int i=0;i<N+1;i++){
DP[0][i]=0;
pow[i]=now;
(now*=2)%=mod;
}
for(int i=1;i<N+1;i++){
(DP[i][0]=DP[i-1][1]+DP[i-1][0]);
for(int j=1;j<N+1;j++){
(DP[i][j]=DP[i-1][j-1]+DP[i-1][j+1])%=pow[j];
}
}
cout<<DP[N][S.size()]<<endl;
return 0;
}
|
a.cc:4:19: error: 'long long int pow [5001]' redeclared as different kind of entity
4 | long long pow[5001];
| ^
In file included from /usr/include/features.h:523,
from /usr/include/x86_64-linux-gnu/c++/14/bits/os_defines.h:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/c++config.h:683,
from /usr/include/c++/14/cassert:43,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:33,
from a.cc:1:
/usr/include/x86_64-linux-gnu/bits/mathcalls.h:173:1: note: previous declaration 'double pow(double, double)'
173 | __MATHCALL_VEC (pow,, (_Mdouble_ __x, _Mdouble_ __y));
| ^~~~~~~~~~~~~~
a.cc: In function 'int main()':
a.cc:13:8: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
13 | pow[i]=now;
| ^
a.cc:19:48: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
19 | (DP[i][j]=DP[i-1][j-1]+DP[i-1][j+1])%=pow[j];
| ^
|
s239712527
|
p04028
|
C++
|
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define mod 1000000007
typedef long long LL;
int n,m;
LL f[5005][5005]={1};
char s[5005];
int main()
{
scanf("%d",&m);
scanf("%s",s);
n=strlen(s);
for(int j=1;j<=m;j++)
for(int i=0;i<=m;i++)
{
if(i!=m)
f[i][j]+=2ll*f[i+1][j-1];
if(i==0)
f[i][j]+=f[i][j-1];
else
f[i][j]+=f[i-1][j-1];
f[i][j]%=mod;
}
printf("%lld",f[n][m]);
}
|
/tmp/ccbcq1MI.s: Assembler messages:
/tmp/ccbcq1MI.s: Fatal error: can't fill 256 bytes in section .data of /tmp/ccvMrLkS.o: 'No space left on device'
|
s818769177
|
p04028
|
C++
|
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define mod 1000000007
typedef long long LL;
int n,m;
LL f[5005][5005]={1};
char s[5005];
int main()
{
scanf("%d",&m);
scanf("%s",s);
n=strlen(s);
for(int j=1;j<=m;j++)
for(int i=0;i<=m;i++)
{
if(i!=m)
f[i][j]+=2ll*f[i+1][j-1];
if(i==0)
f[i][j]+=f[i][j-1];
else
f[i][j]+=f[i-1][j-1];
f[i][j]%=mod;
}
printf("%lld",f[n][m]%mod);
}
|
/tmp/cc8LAHZ2.s: Assembler messages:
/tmp/cc8LAHZ2.s: Fatal error: can't fill 256 bytes in section .data of /tmp/ccNMwuYU.o: 'No space left on device'
|
s012683358
|
p04028
|
C++
|
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define mod 1000000007
typedef long long LL;
int n,m;
LL f[5005][5005]={1};
char s[5005];
int main()
{
scanf("%d",&m);
scanf("%s",s);
n=strlen(s);
for(int j=1;j<=m;j++)
for(int i=0;i<=m;i++)
{
if(i!=m)
f[i][j]+=2ll*f[i+1][j-1];
if(i==0)
f[i][j]+=f[i][j-1];
else
f[i][j]+=f[i-1][j-1];
f[i][j]%=mod;
}
printf("%lld",f[n][m]%mod);
}
|
/tmp/ccP4mus5.s: Assembler messages:
/tmp/ccP4mus5.s: Fatal error: can't fill 256 bytes in section .data of /tmp/ccTVS4rt.o: 'No space left on device'
|
s277218962
|
p04028
|
C++
|
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define mod 1000000007
typedef long long LL;
int n,m;
LL f[5005][5005]={1};
char s[5005];
int main()
{
scanf("%d%s",&m,s);
n=strlen(s);
for(int j=1;j<=m;j++)
for(int i=0;i<=m;i++)
{
if(i!=m)
f[i][j]+=2ll*f[i+1][j-1];
if(i==0)
f[i][j]+=f[i][j-1];
else
f[i][j]+=f[i-1][j-1];
f[i][j]%=mod;
}
printf("%lld",f[n][m]%mod);
}
|
/tmp/ccvJZm1E.s: Assembler messages:
/tmp/ccvJZm1E.s: Fatal error: can't fill 256 bytes in section .data of /tmp/ccZmG3Vy.o: 'No space left on device'
|
s496971504
|
p04028
|
C++
|
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define Max(_A,_B) (_A>_B?_A:_B)
int n,f[5005][5005],len;
int clz=1E9+7;
char ch[5005];
long long pw(long long a,int b){
long long nw=1;
while(b){
if(b&1){
nw=nw*a%clz;
}
a=a*a%clz;
b>>=1;
}
return nw;
}
void init(){
// freopen("keyboard.in","r",stdin);
// freopen("keyboard.out","w",stdout);
scanf("%d",&n);
scanf("%s",ch);
len=int(strlen(ch));
f[0][0]=1;
for(int i=0;i<=n;++i){
for(int j=0;j<=i;++j){
f[i+1][j+1]=int(1LL*f[i][j]*2%clz+f[i+1][j+1]%clz)%clz;
f[i+1][Max(j-1,0)]=int(1LL*(f[i][j]+f[i+1][Max(j-1,0)])%clz);
}
}
int anss=(int(pw(pw(2,len),clz-2)*f[n][len]%clz));
printf("%d",ans);
}
//int(pw(pw(2,len),clz-2))*
int main(){
init();
return 0;
}
|
a.cc: In function 'void init()':
a.cc:35:17: error: 'ans' was not declared in this scope; did you mean 'anss'?
35 | printf("%d",ans);
| ^~~
| anss
|
s483407248
|
p04028
|
C++
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long mod=1e9+7;
ll pow(ll a, ll b, ll MOD)
{
ll x=1,y=a;
while(b > 0)
{
if(b%2 == 1)
{
x=(x*y);
if(x>MOD) x%=MOD;
}
y = (y*y);
if(y>MOD) y%=MOD;
b /= 2;
}
return x;
}
long long dp[5001][5001],n,l;
int main(){
cin>>n;
string s;
cin>>s; l=s.size();
dp[0][0]=1;
for(int i=0;i<n;i++){
for(int j=0;j<=n;j++){
if(dp[i][j]){
dp[i+1][j+1]+=2*dp[i][j];
dp[i+1][j+1]%=mod;
if(j==0){
dp[i+1][0]+=dp[i][0];
dp[i+1][0]%=mod;
}
else{
dp[i+1][j-1]+=dp[i][j];
dp[i+1][j-1]%=mod;
}
}
}
}
cout<<dp[n][l]*Pow(2,mod-2)%mod;
}
|
a.cc: In function 'int main()':
a.cc:44:24: error: 'Pow' was not declared in this scope; did you mean 'pow'?
44 | cout<<dp[n][l]*Pow(2,mod-2)%mod;
| ^~~
| pow
|
s090415525
|
p04028
|
C++
|
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
ll int MOD=1e9+7;
#define N 6000
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
ll int poww(ll int a,ll int b){
ll int ans=1,temp=a;
while(b){
if(b%2) ans=(temp*ans)%MOD;
b>>=1;
temp=(temp*temp)%MOD;
}
return ans;
}
ll int n;
ll int dp[N][N]={};
ll int calc(ll int a,ll int b){
if(a<b) return 0;
if(dp[a][b]) return dp[a][b];
visited[a][b]=1;
if(a==0){
if(b==0) return 1;
else return 0;
}
if(b==0){
return dp[a][b]=(calc(a-1,1)+calc(a-1,0))%MOD;
}
return dp[a][b]=(calc(a-1,b+1)+calc(a-1,b-1)*2)%MOD;
}
main(){
string s;
cin>>n>>s;
ll int t=s.size();
ll int inv=poww(poww(2,t),MOD-2);
cout<<calc(n,t)*inv%MOD;
return 0;
}
|
a.cc: In function 'long long int calc(long long int, long long int)':
a.cc:30:5: error: 'visited' was not declared in this scope
30 | visited[a][b]=1;
| ^~~~~~~
a.cc: At global scope:
a.cc:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
40 | main(){
| ^~~~
|
s310821136
|
p04028
|
C++
|
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
long long a[5002][5002]={{1}},b[2][5002],i,j,m,n,z=1e9+7;char c[5001];
int main()
{
scanf("%lld%s",&n,c),m=strlen(c);
for(i=0;i<=n;i++)
for(j=0;j<=m;j++)
{
b[i&1][j]=(b[i&1][j]<<1)%z;
a[i][j]=(a[i][j]+b[i&1][j])%z;
if(!j)a[i+1][j]=(a[i+1][j]+a[i][j])%z;
b[i&1][j]=(a[i][j]+b[i&1][j])%z;
a[i+1][j+1]=(a[i+1][j+1]+a[i][j])%z;
}
printf("%lld",a[n][m]);
return 0;
}
|
/tmp/cco3sW3H.s: Assembler messages:
/tmp/cco3sW3H.s: Fatal error: can't fill 256 bytes in section .data of /tmp/cccVeC2R.o: 'No space left on device'
/tmp/cco3sW3H.s: Fatal error: /tmp/cccVeC2R.o: No such file or directory
|
s102576391
|
p04028
|
C++
|
#include<cstdint>
template<std::uint_fast32_t MODULO>
struct modint {
private:
using uint32 = std::uint_fast32_t;
using uint64 = std::uint_fast64_t;
public:
uint32 a;
modint() :a(0) {}
modint(const std::int_fast64_t &x) :a(set(x%MODULO + MODULO)) {}
static uint32 set(const uint32 &x) { return(x<MODULO) ? x : x - MODULO; }
static modint make(const uint32 &x) { modint ret;ret.a = x;return ret; }
modint operator+(const modint &o)const { return make(set(a + o.a)); }
modint operator-(const modint &o)const { return make(set(a + MODULO - o.a)); }
modint operator*(const modint &o)const { return make((uint64)a*o.a%MODULO); }
modint operator/(const modint &o)const { return make((uint64)a*~o%MODULO); }
modint &operator+=(const modint &o) { return *this = *this + o; }
modint &operator-=(const modint &o) { return *this = *this - o; }
modint &operator*=(const modint &o) { return *this = *this * o; }
modint &operator/=(const modint &o) { return *this = *this / o; }
modint &operator^=(const uint32 &o) { return *this = *this^o; }
modint operator~ ()const { return *this ^ (MODULO - 2); }
modint operator- ()const { return make(set(MODULO - a)); }
modint operator++() { return *this = make(set(a + 1)); }
modint operator--() { return *this = make(set(a + MODULO - 1)); }
bool operator==(const modint &o)const { return a == o.a; }
bool operator!=(const modint &o)const { return a != o.a; }
bool operator< (const modint &o)const { return a < o.a; }
bool operator<=(const modint &o)const { return a <= o.a; }
bool operator> (const modint &o)const { return a > o.a; }
bool operator>=(const modint &o)const { return a >= o.a; }
explicit operator bool()const { return a; }
explicit operator uint32()const { return a; }
modint operator^(uint32 x)const {
uint64 t = a, u = 1;
while (x) { if (x & 1) u = u*t%MODULO;t = (t*t) % MODULO;x >>= 1; }
return make(u);
}
};
int main(void) {
using mint = modint<1000000007>;
int n;
std::string s;
std::cin >> n >> s;
mint dp[5003][5003] = {};
dp[0][0] = 1;
for (int i = 1;i <= n;++i) {
dp[i][0] = dp[i - 1][1] * 2 + dp[i - 1][0];
for (int j = 1;j <= i;++j) {
dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j + 1] * 2;
}
}
std::cout << dp[n][s.length()].a << std::endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:47:14: error: 'string' is not a member of 'std'
47 | std::string s;
| ^~~~~~
a.cc:2:1: note: 'std::string' is defined in header '<string>'; this is probably fixable by adding '#include <string>'
1 | #include<cstdint>
+++ |+#include <string>
2 |
a.cc:48:14: error: 'cin' is not a member of 'std'
48 | std::cin >> n >> s;
| ^~~
a.cc:2:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
1 | #include<cstdint>
+++ |+#include <iostream>
2 |
a.cc:48:26: error: 's' was not declared in this scope
48 | std::cin >> n >> s;
| ^
a.cc:57:14: error: 'cout' is not a member of 'std'
57 | std::cout << dp[n][s.length()].a << std::endl;
| ^~~~
a.cc:57:14: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:57:50: error: 'endl' is not a member of 'std'
57 | std::cout << dp[n][s.length()].a << std::endl;
| ^~~~
a.cc:2:1: note: 'std::endl' is defined in header '<ostream>'; this is probably fixable by adding '#include <ostream>'
1 | #include<cstdint>
+++ |+#include <ostream>
2 |
|
s515192615
|
p04028
|
C++
|
#include <iostream>
#include <algorithm>
#include <array>
#include <cstdint>
#include <climits>
#include <functional>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <type_traits>
#include <utility>
#include <vector>
using int32 = std::int_fast32_t;
using int64 = std::int_fast64_t;
using uint32 = std::uint_fast32_t;
using uint64 = std::uint_fast64_t;
using intl32 = std::int_least32_t;
using intl64 = std::int_least64_t;
using uintl32 = std::uint_least32_t;
using uintl64 = std::uint_least64_t;
using uint = uint32;
using ll = int64;
template<uint MD>
struct ModInt {
uint v;
ModInt() : v{ 0 } {}
ModInt(ll v) : v{ normS(v%MD + MD) } {}
static uint normS(const uint &x) { return (x<MD) ? x : x - MD; };
static ModInt make(const uint &x) { ModInt m; m.v = x; return m; }
const ModInt operator+(const ModInt &r) const { return make(normS(v + r.v)); }
const ModInt operator-(const ModInt &r) const { return make(normS(v + normS(MD - r.v))); }
const ModInt operator*(const ModInt &r) const { return make((ull)v*r.v%MD); }
ModInt& operator+=(const ModInt &r) { return *this = *this + r; }
ModInt& operator-=(const ModInt &r) { return *this = *this - r; }
ModInt& operator*=(const ModInt &r) { return *this = *this*r; }
static ModInt inv(const ModInt &x) {
return pow(ModInt(x), MD - 2);
}
};
using mint = ModInt<1000000007>;
int main(void) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
uint32 n;
std::string s;
std::cin >> n >> s;
mint dp[5003][5003] = {};
dp[0][0] = mint(1);
for (uint32 i = 1;i <= n;++i) {
dp[i][0] = dp[i - 1][1] + dp[i - 1][1] + dp[i - 1][0];
for (uint32 j = 1;j <= i;++j) {
dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j + 1] + dp[i - 1][j + 1];
}
}
std::cout << dp[n][s.length()].v << "\n";
return 0;
}
|
a.cc:28:7: error: conflicting declaration 'using uint = using uint32 = uint_fast32_t'
28 | using uint = uint32;
| ^~~~
In file included from /usr/include/stdlib.h:514,
from /usr/include/c++/14/cstdlib:79,
from /usr/include/c++/14/ext/string_conversions.h:43,
from /usr/include/c++/14/bits/basic_string.h:4154,
from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:1:
/usr/include/x86_64-linux-gnu/sys/types.h:150:22: note: previous declaration as 'typedef unsigned int uint'
150 | typedef unsigned int uint;
| ^~~~
a.cc: In member function 'const ModInt<MD> ModInt<MD>::operator*(const ModInt<MD>&) const':
a.cc:40:70: error: 'ull' was not declared in this scope; did you mean 'll'?
40 | const ModInt operator*(const ModInt &r) const { return make((ull)v*r.v%MD); }
| ^~~
| ll
|
s494385592
|
p04028
|
C++
|
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;
void solve(){
int N;
string str;
cin >> N >> str;
int size = str.size();
//何らかのi文字を作る通り数。
vector< LL > dp(N+1,0);
vector< LL > next(N+1,0);
vector< LL > zero(N+1,0);
dp[0] = 1;
for(int Len=1;Len<=N;++Len){
for(int i=0;i<=Len;++i){
if( dp[i] == 0 ) continue;
next[i+1] += dp[i]*2;
next[i+1] %= MOD;
if( i > 0){
next[i-1] += dp[i];
next[i-1] %= MOD;
}else{//i==0
next[0] += dp[i];
next[0] %= MOD;
}
}
dp = next;
next = zero;
}
//modの中で2^sizeで割る
LL MOD_2_size = powMod(powMod(2,MOD-2),size);
LL ans = (dp[size] * MOD_2_size) % MOD;
cout << ans << endl;
}
#pragma region main
signed main(void){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;//小数を10進数表示
cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別
solve();
}
#pragma endregion //main()
|
a.cc: In function 'void solve()':
a.cc:80:32: error: 'powMod' was not declared in this scope
80 | LL MOD_2_size = powMod(powMod(2,MOD-2),size);
| ^~~~~~
a.cc:80:25: error: 'powMod' was not declared in this scope
80 | LL MOD_2_size = powMod(powMod(2,MOD-2),size);
| ^~~~~~
|
s324311607
|
p04028
|
C++
|
#include <iostream>
#include <string>
using namespace std;
int n;
int memo[5001][10001];
bool tag[5001][10001];
const int mod = 1000000007;
const int invtwo = 500000004;
int dp(int i, int j)//i=押したキー回数 j=現在のカーソル位置
{
if (i < j)return 0;
if (i == 0)
{
if (j == 0)return 1;
return 0;
}
if (tag[i][j])return memo[i][j];
int ret = 0;
if (j == 0)
{
ret += dp(i - 1, j);
ret += dp(i - 1, j + 1);
}
else
{
ret += dp(i - 1, j + 1);
ret += dp(i - 1, j - 1) * 2;
}
ret %= mod;
tag[i][j] = true;
return memo[i][j] = ret;
}
int main(void)
{
cin >> n;
string s;
cin >> s;
memset(tag, false, sizeof(tag));
int ans = dp((int)n, s.size());
for (int i = 0; i < s.size(); ++i)
{
ans *= invtwo;
ans %= mod;
}
cout << ans << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:41:9: error: 'memset' was not declared in this scope
41 | memset(tag, false, sizeof(tag));
| ^~~~~~
a.cc:3:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
2 | #include <iostream>
+++ |+#include <cstring>
3 | #include <string>
|
s380123775
|
p04028
|
C++
|
#include <iostream>
#include <string>
using namespace std;
const int MOD = 1000000007;
const int MAX_N = 5000;
long long dp[MAX_N+1][MAX_N+1]={1};
int main() {
int N;
string s;
cin >> N >> s;
for(int i=0;i<N;i++) {
dp[i+1][0] = dp[i][0];
dp[i+1][1] = dp[i][0];
for(int j=1;j<=i;j++) {
dp[i+1][j+1] = dp[i][j];
dp[i+1][j-1] += dp[i][j] * 2;
dp[i+1][j-1] %= MOD;
}
}
cout << dp[N][s.length()] << endl;
return 0;
}
|
/tmp/ccaJ8oF6.s: Assembler messages:
/tmp/ccaJ8oF6.s: Fatal error: can't fill 256 bytes in section .data of /tmp/ccTAtWFU.o: 'No space left on device'
/tmp/ccaJ8oF6.s: Fatal error: /tmp/ccTAtWFU.o: No such file or directory
|
s034608176
|
p04028
|
C++
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
ll ret = 1;
ll p = a % mod;
while (n) {
if (n & 1) ret = ret * p % mod;
p = p * p % mod;
n >>= 1;
}
return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
const int MOD = ten(9) + 7;
const int N = ten(4);
ll inverse[N];
void init_inverse() {
inverse[1] = 1;
for (int i = 2; i < N; i++) inverse[i] = (MOD - MOD / i) * inverse[MOD%i] % MOD;
}
ll fact[N], infact[N];
void init_fast_fact() {
init_inverse();
fact[0] = fact[1] = 1;
for (int i = 2; i < N; i++) fact[i] = fact[i - 1] * i % MOD;
infact[0] = infact[1] = 1;
for (int i = 2; i < N; i++) infact[i] = infact[i - 1] * inverse[i] % MOD;
}
ll fast_nCk(int n, int k) {
if (n < 0 || k < 0) return 0;
if (k > n) return 0;
ll ret = fact[n] * infact[k] % MOD * infact[n - k] % MOD;
return ret;
}
ll pseudo_catalan(int a, int b, int c) {
if (c == a - 1) b--, c--;
if (c == b - 1) a--, c--;
ll ret = fast_nCk(a + b - 2, a - 1) - fast_nCk(a + b - 2, c - 1);
if (ret < 0) ret += MOD;
return ret;
}
int solve(int n, int m) {
init_fast_fact();
vector<ll> magic = { 1, 1, 3 };
for (int i = 3; i <= n; i++) {
ll tmp = 3 * (i + 1) * magic[i - 1] + 8 * (i - 2) * magic[i - 2] - 24 * (i - 2) * magic[i - 3];
magic.push_back(tmp % MOD * inverse[i + 1] % MOD);
if (magic[i] < 0) magic[i] += MOD;
}
vector<ll> power_of_2;
power_of_2.push_back(1);
FOR(i, n) power_of_2.push_back(power_of_2.back() * 2 % MOD);
ll ans = 0;
FOR(s, n + 1) {
const int rem = n - s;
if (rem < m) continue;
if ((rem - m) % 2 != 0) continue;
const int B = (rem - m) / 2;
const int A = rem - B;
const ll a1 = B == 0 ? 1 : pseudo_catalan(A , B + 1, B);
const ll s_ans = a1 * power_of_2[B] % MOD * magic[s] % MOD;
ans += s_ans;
}
return int(ans % MOD);
}
int main() {
int n; cin >> n;
string s; cin >> s;
int m = sz(s);
int ans = solve(n, m);
writerLn(ans);
solve2(n, m);
return 0;
}
|
a.cc: In function 'int main()':
a.cc:116:9: error: 'solve2' was not declared in this scope; did you mean 'solve'?
116 | solve2(n, m);
| ^~~~~~
| solve
|
s761780078
|
p04028
|
C++
|
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int mod = 1e9+7;
int add(int a, int b) { return (a+b)%mod; }
int sub(int a, int b) { return (a-b+mod)%mod; }
int mult(int a, int b) { return (long long) a*b%mod; }
int n;
string s;
int dp[5005][5005];
int main() {
cin >> n >> s;
dp[0][s.length()] = 1;
for (int i=0;i<n;i++) {
for (int j=0;j<5004;j++) {
if (j==0) {
dp[i+1][0] = add(dp[i+1][0],dp[i][j]);
} else {
dp[i+1][j-1] = add(dp[i+1][j-1],dp[i][j]);
}
dp[i+1][j+1] = add(dp[i+1][j+1],mult(dp[i][j],2));
}
cout << dp[n][0];
}
|
a.cc: In function 'int main()':
a.cc:26:2: error: expected '}' at end of input
26 | }
| ^
a.cc:13:12: note: to match this '{'
13 | int main() {
| ^
|
s148386327
|
p04028
|
C++
|
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int mod = 1e9+7;
int add(int a, int b) { return (a+b)%mod; }
int sub(int a, int b) { return (a-b+mod)%mod; }
int mult(int a, int b) { return (long long) a*b%mod; }
int n;
string s;
int dp[5005][5005];
int main() {
cin >> n >> s;
dp[0][s.length()] = 1;
for (int i=0;i<n;i++) {
for (int j=0;j<5004;j++) {
if (j==0) {
dp[i+1][0] = add(dp[i+1][0],dp[i][j]);
} else {
dp[i+1][j-1] = add(dp[i+1][j-1],dp[i][j]);
}
dp[i+1][1] = add(dp[i+1][1],mult(dp[i][j],2));
}
cout << dp[n][0];
}
|
a.cc: In function 'int main()':
a.cc:26:2: error: expected '}' at end of input
26 | }
| ^
a.cc:13:12: note: to match this '{'
13 | int main() {
| ^
|
s460789535
|
p04029
|
C++
|
#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<bitset>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i = (a); i < (n); i++)
#define Brep(n) for(int bit = 0; bit < (1<<n); bit++)
#define rep2nd(n,m) Srep(n) Lrep(j,0,m)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
#define P pair<int,int>
#define F first
#define S second
using namespace std;
int main(){
int n;
cin >> n;
vi dp(n);
dp[0] = 1;
Lrep(i,1,100) dp[i] = dp[i-1] + i + 1;
cout << dp[n-1] << endl;
}
p
|
a.cc:34:1: error: 'p' does not name a type
34 | p
| ^
|
s393508397
|
p04029
|
C++
|
#include<bits/stdc++.h>
using namespace std;
int main() {
cin>>n;
int s=0;
for(int i=1;i<=n; i++) {
s+=i;}
cout<<s;
return 0;}
|
a.cc: In function 'int main()':
a.cc:4:6: error: 'n' was not declared in this scope; did you mean 'yn'?
4 | cin>>n;
| ^
| yn
|
s288981560
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int souwa = N*(N+1)/2;
cout >> souwa >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:6: error: no match for 'operator>>' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'int')
8 | cout >> souwa >> endl;
| ~~~~ ^~ ~~~~~
| | |
| | int
| std::ostream {aka std::basic_ostream<char>}
a.cc:8:6: note: candidate: 'operator>>(int, int)' (built-in)
8 | cout >> souwa >> endl;
| ~~~~~^~~~~~~~
a.cc:8:6: note: no known conversion for argument 1 from 'std::ostream' {aka 'std::basic_ostream<char>'} to 'int'
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:41,
from a.cc:1:
/usr/include/c++/14/cstddef:131:5: note: candidate: 'template<class _IntegerType> constexpr std::__byte_op_t<_IntegerType> std::operator>>(byte, _IntegerType)'
131 | operator>>(byte __b, _IntegerType __shift) noexcept
| ^~~~~~~~
/usr/include/c++/14/cstddef:131:5: note: template argument deduction/substitution failed:
a.cc:8:1: note: cannot convert 'std::cout' (type 'std::ostream' {aka 'std::basic_ostream<char>'}) to type 'std::byte'
8 | cout >> souwa >> endl;
| ^~~~
In file included from /usr/include/c++/14/string:55,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, __cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
835 | operator>>(basic_istream<_CharT, _Traits>& __in,
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/bitset:1597:5: note: candidate: 'template<class _CharT, class _Traits, long unsigned int _Nb> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, bitset<_Nb>&)'
1597 | operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
| ^~~~~~~~
/usr/include/c++/14/bitset:1597:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
In file included from /usr/include/c++/14/istream:1109,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/bits/istream.tcc:978:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT&)'
978 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)
| ^~~~~~~~
/usr/include/c++/14/bits/istream.tcc:978:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:849:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char&)'
849 | operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:849:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:854:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char&)'
854 | operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:854:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:896:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT*)'
896 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:896:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:939:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char*)'
939 | operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:939:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:945:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char*)'
945 | operator>>(basic_istream<char, _Traits>& __in, signed char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:945:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:1099:5: note: candidate: 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&)'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/istream:1099:5: note: template argument deduction/substitution failed:
/usr/include/c++/14/istream: In substitution of 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&) [with _Istream = std::basic_ostream<char>&; _Tp = int&]':
a.cc:8:9: required from here
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:1099:5: error: no type named 'type' in 'struct std::enable_if<false, void>'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: candidate: 'template<class _Tp, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, complex<_Tp>&)'
509 | operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:143:
/usr/include/c++/14/iomanip:76:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Resetiosflags)'
76 | operator>>(basic_istream<_CharT, _Traits>& __is, _Resetiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:76:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:106:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setiosflags)'
106 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:106:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:137:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setbase)'
137 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setbase __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:137:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:177:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setfill<_CharT>)'
177 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setfill<_CharT> __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:177:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:207:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setprecision)'
207 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setprecision __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:207:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basi
|
s040169367
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int souwa = N*(N+1)/2;
cout >> int souwa >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:9: error: expected primary-expression before 'int'
8 | cout >> int souwa >> endl;
| ^~~
|
s292408987
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int souwa = N*(N+1)/2;
cout >> souwa >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:6: error: no match for 'operator>>' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'int')
8 | cout >> souwa >> endl;
| ~~~~ ^~ ~~~~~
| | |
| | int
| std::ostream {aka std::basic_ostream<char>}
a.cc:8:6: note: candidate: 'operator>>(int, int)' (built-in)
8 | cout >> souwa >> endl;
| ~~~~~^~~~~~~~
a.cc:8:6: note: no known conversion for argument 1 from 'std::ostream' {aka 'std::basic_ostream<char>'} to 'int'
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:41,
from a.cc:1:
/usr/include/c++/14/cstddef:131:5: note: candidate: 'template<class _IntegerType> constexpr std::__byte_op_t<_IntegerType> std::operator>>(byte, _IntegerType)'
131 | operator>>(byte __b, _IntegerType __shift) noexcept
| ^~~~~~~~
/usr/include/c++/14/cstddef:131:5: note: template argument deduction/substitution failed:
a.cc:8:1: note: cannot convert 'std::cout' (type 'std::ostream' {aka 'std::basic_ostream<char>'}) to type 'std::byte'
8 | cout >> souwa >> endl;
| ^~~~
In file included from /usr/include/c++/14/string:55,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, __cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
835 | operator>>(basic_istream<_CharT, _Traits>& __in,
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/bitset:1597:5: note: candidate: 'template<class _CharT, class _Traits, long unsigned int _Nb> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, bitset<_Nb>&)'
1597 | operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
| ^~~~~~~~
/usr/include/c++/14/bitset:1597:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
In file included from /usr/include/c++/14/istream:1109,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/bits/istream.tcc:978:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT&)'
978 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)
| ^~~~~~~~
/usr/include/c++/14/bits/istream.tcc:978:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:849:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char&)'
849 | operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:849:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:854:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char&)'
854 | operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:854:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:896:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT*)'
896 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:896:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:939:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char*)'
939 | operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:939:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:945:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char*)'
945 | operator>>(basic_istream<char, _Traits>& __in, signed char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:945:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:1099:5: note: candidate: 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&)'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/istream:1099:5: note: template argument deduction/substitution failed:
/usr/include/c++/14/istream: In substitution of 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&) [with _Istream = std::basic_ostream<char>&; _Tp = int&]':
a.cc:8:9: required from here
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/istream:1099:5: error: no type named 'type' in 'struct std::enable_if<false, void>'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: candidate: 'template<class _Tp, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, complex<_Tp>&)'
509 | operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:143:
/usr/include/c++/14/iomanip:76:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Resetiosflags)'
76 | operator>>(basic_istream<_CharT, _Traits>& __is, _Resetiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:76:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:106:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setiosflags)'
106 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:106:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:137:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setbase)'
137 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setbase __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:137:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:177:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setfill<_CharT>)'
177 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setfill<_CharT> __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:177:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> souwa >> endl;
| ^~~~~
/usr/include/c++/14/iomanip:207:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setprecision)'
207 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setprecision __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:207:5: note: template argument deduction/substitution failed:
a.cc:8:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basi
|
s083992513
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int souwa = N*(N+1)/2
cout >> souwa >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:1: error: expected ',' or ';' before 'cout'
8 | cout >> souwa >> endl;
| ^~~~
|
s723939532
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout >> int N*(N+1)/2; >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:9: error: expected primary-expression before 'int'
8 | cout >> int N*(N+1)/2; >> endl;
| ^~~
a.cc:8:24: error: expected primary-expression before '>>' token
8 | cout >> int N*(N+1)/2; >> endl;
| ^~
|
s042091474
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout >> N*(N+1)/2 >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:6: error: no match for 'operator>>' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'int')
8 | cout >> N*(N+1)/2 >> endl;
| ~~~~ ^~ ~~~~~~~~~
| | |
| | int
| std::ostream {aka std::basic_ostream<char>}
a.cc:8:6: note: candidate: 'operator>>(int, int)' (built-in)
8 | cout >> N*(N+1)/2 >> endl;
| ~~~~~^~~~~~~~~~~~
a.cc:8:6: note: no known conversion for argument 1 from 'std::ostream' {aka 'std::basic_ostream<char>'} to 'int'
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:41,
from a.cc:1:
/usr/include/c++/14/cstddef:131:5: note: candidate: 'template<class _IntegerType> constexpr std::__byte_op_t<_IntegerType> std::operator>>(byte, _IntegerType)'
131 | operator>>(byte __b, _IntegerType __shift) noexcept
| ^~~~~~~~
/usr/include/c++/14/cstddef:131:5: note: template argument deduction/substitution failed:
a.cc:8:1: note: cannot convert 'std::cout' (type 'std::ostream' {aka 'std::basic_ostream<char>'}) to type 'std::byte'
8 | cout >> N*(N+1)/2 >> endl;
| ^~~~
In file included from /usr/include/c++/14/string:55,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, __cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
835 | operator>>(basic_istream<_CharT, _Traits>& __in,
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/bitset:1597:5: note: candidate: 'template<class _CharT, class _Traits, long unsigned int _Nb> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, bitset<_Nb>&)'
1597 | operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
| ^~~~~~~~
/usr/include/c++/14/bitset:1597:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
In file included from /usr/include/c++/14/istream:1109,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/bits/istream.tcc:978:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT&)'
978 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)
| ^~~~~~~~
/usr/include/c++/14/bits/istream.tcc:978:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:849:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char&)'
849 | operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:849:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:854:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char&)'
854 | operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:854:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:896:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT*)'
896 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:896:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:939:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char*)'
939 | operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:939:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:945:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char*)'
945 | operator>>(basic_istream<char, _Traits>& __in, signed char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:945:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:1099:5: note: candidate: 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&)'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/istream:1099:5: note: template argument deduction/substitution failed:
/usr/include/c++/14/istream: In substitution of 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&) [with _Istream = std::basic_ostream<char>&; _Tp = int]':
a.cc:8:17: required from here
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:1099:5: error: no type named 'type' in 'struct std::enable_if<false, void>'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: candidate: 'template<class _Tp, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, complex<_Tp>&)'
509 | operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:143:
/usr/include/c++/14/iomanip:76:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Resetiosflags)'
76 | operator>>(basic_istream<_CharT, _Traits>& __is, _Resetiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:76:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:106:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setiosflags)'
106 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:106:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:137:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setbase)'
137 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setbase __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:137:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:177:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setfill<_CharT>)'
177 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setfill<_CharT> __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:177:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:207:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setprecision)'
207 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setprecision __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:2
|
s937619134
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout >> N(N+1)/2 >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:10: error: 'N' cannot be used as a function
8 | cout >> N(N+1)/2 >> endl;
| ~^~~~~
|
s808949161
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k=N(N+1)/2;
cout >> k >> endl;
}
|
a.cc: In function 'int main()':
a.cc:7:9: error: 'N' cannot be used as a function
7 | int k=N(N+1)/2;
| ~^~~~~
a.cc:9:6: error: no match for 'operator>>' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'int')
9 | cout >> k >> endl;
| ~~~~ ^~ ~
| | |
| | int
| std::ostream {aka std::basic_ostream<char>}
a.cc:9:6: note: candidate: 'operator>>(int, int)' (built-in)
9 | cout >> k >> endl;
| ~~~~~^~~~
a.cc:9:6: note: no known conversion for argument 1 from 'std::ostream' {aka 'std::basic_ostream<char>'} to 'int'
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:41,
from a.cc:1:
/usr/include/c++/14/cstddef:131:5: note: candidate: 'template<class _IntegerType> constexpr std::__byte_op_t<_IntegerType> std::operator>>(byte, _IntegerType)'
131 | operator>>(byte __b, _IntegerType __shift) noexcept
| ^~~~~~~~
/usr/include/c++/14/cstddef:131:5: note: template argument deduction/substitution failed:
a.cc:9:1: note: cannot convert 'std::cout' (type 'std::ostream' {aka 'std::basic_ostream<char>'}) to type 'std::byte'
9 | cout >> k >> endl;
| ^~~~
In file included from /usr/include/c++/14/string:55,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, __cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
835 | operator>>(basic_istream<_CharT, _Traits>& __in,
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/bitset:1597:5: note: candidate: 'template<class _CharT, class _Traits, long unsigned int _Nb> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, bitset<_Nb>&)'
1597 | operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
| ^~~~~~~~
/usr/include/c++/14/bitset:1597:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
In file included from /usr/include/c++/14/istream:1109,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/bits/istream.tcc:978:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT&)'
978 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)
| ^~~~~~~~
/usr/include/c++/14/bits/istream.tcc:978:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/istream:849:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char&)'
849 | operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:849:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/istream:854:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char&)'
854 | operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:854:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/istream:896:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT*)'
896 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:896:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/istream:939:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char*)'
939 | operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:939:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/istream:945:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char*)'
945 | operator>>(basic_istream<char, _Traits>& __in, signed char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:945:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/istream:1099:5: note: candidate: 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&)'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/istream:1099:5: note: template argument deduction/substitution failed:
/usr/include/c++/14/istream: In substitution of 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&) [with _Istream = std::basic_ostream<char>&; _Tp = int&]':
a.cc:9:9: required from here
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/istream:1099:5: error: no type named 'type' in 'struct std::enable_if<false, void>'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: candidate: 'template<class _Tp, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, complex<_Tp>&)'
509 | operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:143:
/usr/include/c++/14/iomanip:76:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Resetiosflags)'
76 | operator>>(basic_istream<_CharT, _Traits>& __is, _Resetiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:76:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/iomanip:106:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setiosflags)'
106 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:106:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/iomanip:137:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setbase)'
137 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setbase __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:137:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/iomanip:177:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setfill<_CharT>)'
177 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setfill<_CharT> __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:177:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 | cout >> k >> endl;
| ^
/usr/include/c++/14/iomanip:207:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setprecision)'
207 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setprecision __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:207:5: note: template argument deduction/substitution failed:
a.cc:9:9: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
9 |
|
s358677491
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k=N(N+1)/2
cout >> k >> endl;
}
|
a.cc: In function 'int main()':
a.cc:7:9: error: 'N' cannot be used as a function
7 | int k=N(N+1)/2
| ~^~~~~
|
s205554841
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0;
for(int i=1; i<=n; i++){
s += i}
}
cout << s << endl;
|
a.cc: In function 'int main()':
a.cc:9:9: error: expected ';' before '}' token
9 | s += i}
| ^
| ;
a.cc: At global scope:
a.cc:11:1: error: 'cout' does not name a type
11 | cout << s << endl;
| ^~~~
|
s296599280
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout >> N*(N+1)/2 >> endl;
}
|
a.cc: In function 'int main()':
a.cc:8:6: error: no match for 'operator>>' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'int')
8 | cout >> N*(N+1)/2 >> endl;
| ~~~~ ^~ ~~~~~~~~~
| | |
| | int
| std::ostream {aka std::basic_ostream<char>}
a.cc:8:6: note: candidate: 'operator>>(int, int)' (built-in)
8 | cout >> N*(N+1)/2 >> endl;
| ~~~~~^~~~~~~~~~~~
a.cc:8:6: note: no known conversion for argument 1 from 'std::ostream' {aka 'std::basic_ostream<char>'} to 'int'
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:41,
from a.cc:1:
/usr/include/c++/14/cstddef:131:5: note: candidate: 'template<class _IntegerType> constexpr std::__byte_op_t<_IntegerType> std::operator>>(byte, _IntegerType)'
131 | operator>>(byte __b, _IntegerType __shift) noexcept
| ^~~~~~~~
/usr/include/c++/14/cstddef:131:5: note: template argument deduction/substitution failed:
a.cc:8:1: note: cannot convert 'std::cout' (type 'std::ostream' {aka 'std::basic_ostream<char>'}) to type 'std::byte'
8 | cout >> N*(N+1)/2 >> endl;
| ^~~~
In file included from /usr/include/c++/14/string:55,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, __cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
835 | operator>>(basic_istream<_CharT, _Traits>& __in,
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.tcc:835:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/bitset:1597:5: note: candidate: 'template<class _CharT, class _Traits, long unsigned int _Nb> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, bitset<_Nb>&)'
1597 | operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
| ^~~~~~~~
/usr/include/c++/14/bitset:1597:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
In file included from /usr/include/c++/14/istream:1109,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/bits/istream.tcc:978:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT&)'
978 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)
| ^~~~~~~~
/usr/include/c++/14/bits/istream.tcc:978:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:849:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char&)'
849 | operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:849:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:854:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char&)'
854 | operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
| ^~~~~~~~
/usr/include/c++/14/istream:854:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:896:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _CharT*)'
896 | operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:896:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:939:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, unsigned char*)'
939 | operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:939:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:945:5: note: candidate: 'template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(basic_istream<char, _Traits>&, signed char*)'
945 | operator>>(basic_istream<char, _Traits>& __in, signed char* __s)
| ^~~~~~~~
/usr/include/c++/14/istream:945:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<char, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:1099:5: note: candidate: 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&)'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/istream:1099:5: note: template argument deduction/substitution failed:
/usr/include/c++/14/istream: In substitution of 'template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&) [with _Istream = std::basic_ostream<char>&; _Tp = int]':
a.cc:8:17: required from here
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/istream:1099:5: error: no type named 'type' in 'struct std::enable_if<false, void>'
1099 | operator>>(_Istream&& __is, _Tp&& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: candidate: 'template<class _Tp, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, complex<_Tp>&)'
509 | operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
| ^~~~~~~~
/usr/include/c++/14/complex:509:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:143:
/usr/include/c++/14/iomanip:76:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Resetiosflags)'
76 | operator>>(basic_istream<_CharT, _Traits>& __is, _Resetiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:76:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:106:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setiosflags)'
106 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setiosflags __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:106:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:137:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setbase)'
137 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setbase __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:137:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:177:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setfill<_CharT>)'
177 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setfill<_CharT> __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:177:5: note: template argument deduction/substitution failed:
a.cc:8:17: note: 'std::ostream' {aka 'std::basic_ostream<char>'} is not derived from 'std::basic_istream<_CharT, _Traits>'
8 | cout >> N*(N+1)/2 >> endl;
| ^
/usr/include/c++/14/iomanip:207:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(basic_istream<_CharT, _Traits>&, _Setprecision)'
207 | operator>>(basic_istream<_CharT, _Traits>& __is, _Setprecision __f)
| ^~~~~~~~
/usr/include/c++/14/iomanip:2
|
s194472973
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
number==N*(N+1)/2;
cout >> number >> endl;
}
|
a.cc: In function 'int main()':
a.cc:7:1: error: 'number' was not declared in this scope
7 | number==N*(N+1)/2;
| ^~~~~~
|
s584720224
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
number==1/2*N*(N+1);
cout >> number >> endl;
}
|
a.cc: In function 'int main()':
a.cc:7:1: error: 'number' was not declared in this scope
7 | number==1/2*N*(N+1);
| ^~~~~~
|
s665383990
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
number==1/2*N*(N+1)
cout >> number >> endl;
|
a.cc: In function 'int main()':
a.cc:7:1: error: 'number' was not declared in this scope
7 | number==1/2*N*(N+1)
| ^~~~~~
a.cc:8:24: error: expected '}' at end of input
8 | cout >> number >> endl;
| ^
a.cc:4:12: note: to match this '{'
4 | int main() {
| ^
|
s395509751
|
p04029
|
C++
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
scn(n);
cout<<(n*(n-1))/2<<endl;
}
|
a.cc: In function 'int main()':
a.cc:6:3: error: 'scn' was not declared in this scope; did you mean 'sin'?
6 | scn(n);
| ^~~
| sin
|
s495591927
|
p04029
|
C++
|
MZ��������������������@��������������������������������������� ��� �!�L�!This program cannot be run in DOS mode.
$�������PE��L�,-Z_���� ���� �F���z���JI��������`����@����������������������J����r������ ���������������������������I�X ����������������������������������������������������������J����������������������I�@��������������������������.text���@E������F�����������������`�P`.data�������`������J��������������@�0�.rdata������p������L��������������@�0@/4�������������� ���T��������������@�0@.bss����tHI���������������������������`�.idata��X ����I��
���p��������������@�0�.CRT���������J�����z��������������@�0�.tls���� ����J�����|��������������@�0�/14�����8���� J�����~��������������@�@B/29������ ���0J�� ������������������@�B/41�����I���PJ��������������������@�B/55���������`J��������������������@�B/67�����8����pJ��������������������@�0B/80�����������J��������������������@�B������������������������������������������������������������������������������������������ �D$ ����=����twL= ��������vs��?1҃�w'�D$�����$����s2����������������1҉Ѓ� ���t&�=����uy�D$�����$����92����u��D$����$���� 2�������빍t&��=���u��D$�����$ �����1�����������t��$ ����к�����y����t&��=�����g����D$�����$����1����t{���F����$����к�����5�����D$����$����1���$�������������
����������$����к����������D$����$ ����=1�����������D$����$����!1����������t&��S����q@���t �D$�����D$����$�����Ѓ� �$�@��1�����
���`@��$�������� ����uJ�/1��� `@����������. ��� 1�����D$���@��D$��@��$�������0��� $�z1��� 4���D$� `@��C�$�0��� ���D$�C0�$�0��� ���D$�CP�$�x0���o�����&������<�D$,�D$��@��D$�`@��$�@����D$,�����D$ �D$(�D$�q0����<Ð�� �$���� ��������&�����t&��� �$���� ��������&�����t&��%P����&�����v��%@������������U��VS���$�p@��@0������tu�$�p@���� 0�����p���D$p@�� $� 0�������D$)p@�� $��/����`@�����t�D$�@��$Ȁ@����$�@��a����e�[^]Í�&�����v���`@�@B@��0B@�뽍�&������&�����U�����`@���t �$Ȁ@��Сp����t �$�/�����Ð�U���(�E�P��E��T$�$�������O:�����E��$ �@����c:������U��WVS��,�E؉$�����y�����E؋U܃�������ӋE؋U܉���������� �ʉE��U�E��U�E��U���� ������������$�T$����������$�@�����������e�[^_]ÍL$����q�U��Q��4�G ���$��������$��������������$���������z��������E�U�E��� 0���E��U�E����"0���$�R-���E�����E�P��U������t������������M�ɍa��U��WVS��,�M��/�D������ ���� )�i�ʚ;)��ȉE�E�����} �������E ����t@�E������ �E������������ ���D$ʚ;�D$ �����$�T$�+,���E�E������ �E������������ ���D$ʚ;�D$ �����$�T$��+���E�} �d����E��,[^_]�U���(�E �P��U ������t~�E�$�����Y�����E��$���G�����E���E�E����E��U��������@��U��$���;�����U���������@��U�$���s;�����p������U���(�U��������@��E�E��� ;���E�E����:���E�E�D$�E�$�-����t8�E����-�����E��E�;E t�E�D$�E��$�������E���-��벐��U������������U��S�����w�����@�t �� ���;;�����[]�U��VS�� �}������} ����uz����������$�@��&���������E��U�E����a-���E�U�E���e-���$�T$� �@��5�������@��ߓ��ƅ�x���:���� �����$�@��������e�[^]�U����D$�����$����I����Ð��%������%������%������%������%������%������%������%������%������%������%������%������%������%������%�����f�f�U��WVS��L�`@�u�����e�[^_]Ð�*���e��$���z)���D������)��)ġ`@��E������;�t$%�D���uȃ��EčC���Eԅ�������E�������1��E�������&�����v���?�W����!�^���4�������v����@�\9�u��MЅ����������8������D�����x@�����9u�������U̅�������E�������1������t&��9U�r�E̅�t$�E����D$ �D$�����EĉD$�Eȉ$�����Eܣ�@��E���@��e��e�[^_]Ít&���D$@����<$�(�����m����� �d�����&����� �F1҃E��}���������������]����f����@�\9�u��P����E����D$ �D$�����uĉt$�}ȃ��<$�I���uĉ�1��E�����똍�&����f��Kހ� ��������$��p@��r������ϋMЅ��� ����S���T0��&����f����@�\9�u��ք��3�����r�(����`@��5�������� �����&�������@�\9�u��}�"t ��������'�A1��E����������������������������@�\9�u��}�'tw��ur�u�"��1��E����������������Z������K���$��������$�$q@��}�'tK���r����r��`@� ������������������������&�����"�A1��E�����3����t&���\���$����u�'��1��E�����������5������������7�����������������X��5�� �P��X�1Щ�� ������S1��������������1���t���� t
�����ƀt��������t�������tm��U����������$��$������$�������� $��$�����$��$����� $3�$����Ɂ����u �����t�������t�� ��t��@�$��������=����v%�����1���y���������@t
��� $��[�Ð���������`@�����t%�� f��С`@��P�@�`@���u�� Ít&��Í�&������&�����S��� U@����t)��t�t&���� U@���u��$� @��������[Ív�1��������Ã��� U@���u�뽍�&������&�����(����tÍ������(�����널����� �D$$��t��t������ � ��t&���D$�T$(�D$ �T$�$�H�������� � ���&����������VS���=d���D$$t
�d�������t��tR������[^� ��t&������-���������~�1ۍv��������t�Ѓ�9�������[^� ���&�����D$(�D$����D$�D$ �$���������[^� ���&������&�����1�Ð������������VS���$D���C$��� <������t-f���$�#��������#����u ��t�C�4$�Ћ[��u��$D���#������[^á@����uÍ�����S���D$ ����$�����"���Å�t@�D$ �$D����D$$�C�#���<��� <�����$D���C�8#��1�����[Ã������&����������S���@���\$ ��u��1�[Í�&������$D���H#���<������t(1�� �t&�����t�Ћ9ڋPu��t+�Q�$����$D���"��1�����[Í�&�����v��<���Ѝ�&������� �D$$��t��t_��t+������ �f��@����t�@����������� Ít&��@����uG�@����u��$D���@�������"�����f��@����t����������� Í�&����f�������@�����r���뮍v��$D����!�����m�������VS���4���D$����t$$�X@�D$����\$ �$�q@��!���D$ �t$� $�D$� ���
!��������UW��V��S�Ã�<�D$�D$ ����D$� $�/!���� ��������D$(��@t��u"��t1�� � ��9�r��<[^_]Í������D$ �l$�D$@����l$ �D$�D$�$�� �����L$(��t1�����9�r��@t���t��D$�l$ �D$�D$ �D$�D$�$� ������<[^_]É\$�D$ ����$�q@�������t&��\����tÍ������\�������w@�-�w@���~�WVS�� ��w@��� �������w@����:���C���/���C���x���������� ���w@�sL��K�S����@�����@�����@���������� ud)������� �D$ �T$ ���Y������w@�r��� [^_Í�&�����v����������w@��� =�w@��������w@���w@��H����t&����tK�T$�$<r@��D$ ���������v�����@�f��y������)�����ЍT$ �D$ ���������������y������)��T$ ȹ����D$ �������������������w@����w@��.�����&�����S����������@�����@��T$ �D$ ���P������w@�rЃ� [^_Ð��w@��t����D$�$r@�������������� �D$ �D$ � �����tL���t/��tS���tH���t+� �@ �D$ �$��t�T$ 1��� Ív��`@������,���������`@���������f��`@�릐����������,�D$�D$�D$0�$����$������,Ð�����������UWVS��<�(�T$ �L$(���-�������]������D$(%�@���D$ ��Չډ�� ���+t$ ��td�}�ރ�]�������-��������������/�������\������ ����D$ ��u��$�T$$�~ ���ƋD$ �$�p ���T$$)ƅ�u��ً\$(��� �B��]ti��t��t^�J�B��]tR��u��J��� ���r���ԍ������H�P;l$ ������������&�����]��]t���u 1���<[^_]Í��������-����>����t&��}�l$$�Չ|$,���t$ ��v���+\$ ����t'9�}��u�,$������ËD$ �$���)Å�uًT$$�L$(�|$,�R�� �G��]�w�����t ���h����W�ǍG��]�X�����u��W��������_�lj��̍t&�����|$,�l$$�|$$���։l$,�l$ �f���+\$ ����t+9��������u�4$�������ËD$ �$����)Å�uՋT$,�L$(�|$$�R�� �G��]�������t ��������W�ǍG��]�������u��W��������_�lj��̉��������&����f��\$(�� �B��]�g�����t ���X����J�B��]�H�����u��J��u�r���Ѝ�&�������볍t&�����������|$$�N����t&�����4�����&����f�U��WV��S��,�:����Ѐ�.�2���]��������σ� �|$��<?�����<[�����<*t[�� u ���B�����tu�D$��@������$�L$ �T$�j���ŋD$�$�\���L$ �T$)Ņ������+T$�2���<*t�1҄�t"�����������=�����t �����u��,��[^_]Ít&�����2���}!t�؉L$������Ņ�������L$�Ѝ]���������������맍t&���>����������͉�)��I�����&������.t[������������.�i�����&�����]�L$���R����L$���E��t,���z����t&���U��������]�����t&��]�q���<]u �E�]�t&���k<]t<t ��t2�C��k<]u��C� ����v��T$�C��u �S����Ή�뿺]��������?��������[���������&����f�W�HVS������ta��1��փ����#f���*tk��?tf��[�������������t/��u���u,��tЃ�~��]t6�˃�!t։˃������u�[^_Ít&��{��Kt��t��ڍ�&����f�[����^_�1��Ӎv�WV��S�Ӄ��B B������D$�B�$�����t&�K�S �C�y���{�4���������1�[^_Ã�����[^_Ít&�V��S�Ã�����t������C��t��u!�C��t�������� $�;�����[^Ít&�����Y����֍�&����V��S���@ �X�������$����F��t!�F������~f���������u�1���[^ø�����t&��U��WVS��l�EĉUЉMȀ��=���}ĉe��<$�����P���������)čD$ �T$�|$�$�����$� ���E������E��ǍE��D����Eԅ�������t�UЉ�������������u���4$���������� ��)ĉ�|$ ����t&�����A���t��r<u��B�����A���u�<$����E�����܅������U�������EԋMԅ������]��C</�3��<\�+���E��8.� ���x�����E������E�\�E������N���v��e��Ɖ$����������U��� )č|$ �}��N��t"��{tD� �G�������^�ΉǍN��u��^���u �F���Ή��̈_��� ���f��^��u��Mԍr�������E�,���<{t+��&����6��� ��<,u ������B��r<{u��B�����&����f�<}�����u҃}�{�u��M�������}ԋ}ЋEԺ�����������t&�������}tn��,������������������t&���B�R��t �������&�����P����������x�u����E�����e��Eԍe�[^_]Í�&�����v���������}�A�^���l����^���H�X��tk�^���T�����&�����M��{���O����A��{u�{��믈��u��4��&�����<������B��������r�B�������������@��E�����@�����&�������{t{��}�������������������v������v�������Q���u��E�����$�MȋE��"�����t��>,�����^�^����v��Eԋe��e�[^_]Í�&�����v������v����������B�E�{�����������e���������������i������@����E��$�����}ċUč �9�s�t&��</t <\t
���9�u�</t
<\t�E�\������</t�<\t��U��}��E��������6���MЉ]����������M��L�������E�u"�}ȅ�t"������D$��$�ׅ�t �t&���E��������$�������������}�t܉$�
���E̅�t��E��E�������t
��$�����E��E��E��������E���&�����v��Ẻ$�e ���ƅ��0���}ą�t�~uލ~ �MЋE���������u��N�E��e��D��������u�)čT$ �U��Ѕ��?�����U��L$�|$��$�o���U��$�4�������������u�)čD$ �E������&�����v����ΈB���t��N<u��F�����B���u�E��$������ƅ��8���}�1�������!lj}��E�@������U���^���e�������E��B����E؋UЉ$�MȋE���c����E��^����Ẻ$�p ���E����D����U�E������4����4$�)���܅�t$�U��t �U�����E��lj<$������e�������E�����u���M��$�t$�D$�U��-���D4 �U��M�</�����<\������u��E��2�D2�x����}���������EЉ]�%�@����� ��&����f������W���ʅ�t�G�4$�D$��u��[���ڋ]��E��$ �������U���������p�@������������~!�G�����U���"��������E�������������}ċUЉ��_����Eԅ�t�]��5����<$������������
��)ĉ��t$ ��������B����������y<u��A�����$ �����
���E��������E��p�@����������������E�����������&������&����U��WVS��,�u�]�} ��t�����t:�>hr@�t
��������hr@��4$�M����� �������t �e��[^_]Ít&���F ����뽍�&������t܉E܉e� $�
��������� ���M�)čD$�E������&���������B���t��{<u��C�����B���u�E��M܉$� ���e�M܅��f�����M��s����M��T�����&�����t&�WVS���t$ �>hr@�t��[^_Í�&�����~�^ ��~ߍt&��F�����$�����9�u�F�D$ ��[^_��������������U��WVS��,�D$�����$���� ���Å�t
�$�� �����D$|r@��$����� ���M��t�E�8�ux�D$�����D$~r@��$����� ���p�t$�h���$�� ���h���t$�D$~r@��$�k ���\$�$���� ��� $� ����5h���e��[^_]�&�����e��D$�����E�$�����D$�n ���D�������
��)ĉT$�E�|$ �<$�D$�D ��1҃��E�f�G�v?��f�E��G�}�f��/���f��\����f��:u �G�E��Gf�E����&�����f�E�}�f�}��u�e��������&�����v��E��U����t&����f��\t#�V��f��t4f��/u��f��/u�t&�����f��/t�f��\t��f��t���Ív�9M�������E�f��/tf��\t �E�.���f��E�1�f�P�D$�����|$�$������ ���P�T$�h���U�$� ���U�h���ƉT$�|$�$� ���\$�$����� ��� $�j����e��I���f��ȃ�9M��M���f��/t�f��\t�1�f�A���f��/tf��\�������&������Q��f��/t�f��\t��)����������f��������]���$�������Z�rf��\������؉�f���������f�A�f��/u��f��\t ��f��/uٍt&��B��f��/t�f��\t����v�f9E�� ���f�������\$�$�������� $�c����u�����f9G�Q�����K�����&����f���낍t&��]�E�1�f�1�D$�|$�E�$�N���u��������������������u�f��/t
f��\������u�f9q������Qf��/�����f��\��������{�����������������VS�Ӂ�T���T$�$�T$�������ƃ��tt1��K f�C�D$<�C ��t'1���v��C��f�Cf=���D<������u��D$$X��w�C��T����[^Í�&�����C�����T����[^Í������O�����������t$�����8 ��t$����8t���������������������������녍�&����VS�Ӂ�T���T$�$�T$�������ƅ�tu1��K f�C�D$<�C ��t(1���t&��C��f�Cf=���D<������u��D$$X��w�C��T����[^Í�&�����C�����T����[^Í������_����t������������T����[^Í�&�����UWVS��,����$@���������8������t$ �D$���D$�4$����|$ ���tM�
����������!�%����tꩀ����4�����Ã�)��L���/t@��\t;�\���f��D�-�v��
����������!�%����tꩀ�����������ÉЃ��*�����f������������!�%����tꩀ���u����������)� ���$����Ņ�������K������rR�T ���ljT������"�������������������E�����Dž������f�E��,����[^_]Ít&���t�����t��T�f�T�륍���������� ����t&������������t&��� ��1��������,����[^_]Í���������1������뀍�&����f��,$1������h��������� ����X����S���D$��t4�����ÍJ������~���������������!Ã���[�f����1��� �����S���\$ ��t$�����$��������t� $����1���[��G���� ���������鍴&������&����S���\$ ��t�����$�������u����� �����[Í�&�����������k����������t�ǃ��������[Ð�� �D$��t
������ ������ ���������ꍴ&����f�VS���t$$�\$ ��xO� $�W�����t7�����u�,��&������������������t����������9�|܃�[^Í������7���������[^Ð��������������UWVS���D$ ��������5l����ty�V9�wr�P��|$ �����Ӊу�����_�9�wS�p�9�wL�L$��tM�9���w�݉,$�l$ �}��t �S����ыl$ �U ��u�w �,$�!�)�9�u�D$��[^_]�f��$������������묐������������WVS�� �\$0�t$4��t:�|$� $�|$� ���9�t&��t 9t$ r0�'��������� 1�[^_Ít&��\$�t$� $������ [^_Ét$�|$� $������ [^_Ð��������UWVS�� �t$4��$����V�NjF�Z����u�Z �D$8؉D$��$�����9������1��tY�L$0�-l��)х�uX�l���n^ � �ȉ.�n��!�+^ ��9�t +T$0�;|$8w1�|$�D$� $�������������� ��[^_]Ít&��9�v��f��|$8�ɍ�&�����v��l$0�� [^��_]Ð��%������%������%������%������%�����QP=����L$ r������ �-���=���w�)�� �XYÐ��%�����%�����%������%������%������%|�����%x�����%t�����%p�����%l�����%h�����%d�����%`�����%\�����%X�����%T�����%L�����%H�����%<�����%8�����%0�����%(�����%$�����% �����%�����%�����%������%������%������%������%������%������%������%������%������%������%������%������%������%������%������%������%������%�����U���(�M�E�$�������U���(�M�E�������9E����t�����E���$�`����������U��S��$�M�E �$�����E�D$�$����������$[]�����U����M����U����M����U����M��E��E������U����M��E����P�E���E��ÐU��S���M�U�����E ���I�����)É�����[]Ð�U��S���M�)�����E ��� �����9�����[]�U����M����� ��U����M��E��Ð�U����M��E�����U����M��E��Ð�U����M��E�����U����M��E��@�Ð��U����M��E��P���ÐU����M��E��P���ÐU��S��4�M�E�������ËE��������)E9�����t �E �$������E���_����ËE���S����E��E�D$�E��$�����؉E�E���-���9E�r�E���>���9E�v �E���/�����E��4[]����U����M��E��P�E���)����Ð��U���(�M�E��������$�� ���Ð��U����M�E���������Ð�U����M�E���������Ð�U��]Ð�U���(�M�}�t�E�U�T$�$�/�����������U����M�E�������E���K������U����M�E��������Ð�U���(�M�}�t�E�U �T$�U�T$�$�����������U����M��E��������E��@�����E��@������Ð��U����M��E��Ð�U����M�E���I�����Ð�U���(�M�E�P�E��)������E��E�L$�$���I������E���$�����ÐU����E�D$�E �$�M���������Ð��U����D$�����E �$�M��������Ð��U����M�������U����E�$� ���D$�E �$�M���������Ð��U��WVS�������M��E������E������E�����E������E������}��������U��E��R���������M��Ѐ���E��E�P�E��Ћ�R�Á�����]��Ѓ���E��u��}����M��]� ȉEЉ� ؉EԋE썐�����E�� Ћ\��EЋU������1lj}���1}��EЃ��E��Eԃ���E��E��U��ǃ���}��Ѐ���E��E� E���t ��f��Zo��
�����������M��]���1lj}���1؉E��U��E�M��]�� \��E�������E�����}�6���D���U��E��R�ǁ������}��Ѐ���E��E�P�E��Ћ�R�ǁ������x����Ѓ����|����U��M��Ћ�x�����|��� ؉Eȉ� ��E̋E荐d����E�� Ћ\��EȋU������1lj�p�����1։�t����Eȃ���h����Ẽ����l�����h�����l����ǃ����0����Ѐ����4�����0�����4����� ���t ��f��Zo��
������������p�����t�����1lj�`�����1���d����U��E苵`�����d����4|��E������E���� ����� ���Ɓ�������X����Ѐ����\����E��P�����������P����Ѓ����T�����X�����\����Ћ�P�����T��� ؉E��� ��EċE������������E��U������1Ɖ�H���1Ӊ�L����E�����@����Eă����D�����@�����D����ǃ����(����Ѐ����,�����(�����,����� �t ��f��Zo��
������������H�����L�����1���8�����1���<����E���8�����<������ ����� ���E�ǀ� �������������[^_]ÐU��S��4�M�E�E؋E �E܋E؋U܉$�T$�4���M��Q�E�����}�7��������E�P��E�Ћ�R�E�U�E�U��1��� 1E�1U�E�i�-�L�E�i�-�QX� �-�L�e�щʉE�U�E�U�E�������$�T$����E�U�E�U�$�T$����M�]�ىT��E��Z����E�ǀ� ��8�����4[]���U���(�M�E�E�E �E�M�E�U�$�T$�������������U��WV��0�M�E䋀� ��=7��v
�E��������E䋈� ���Q�E䉐� ���E�T��ȉE��U�E��U��� �� ����UUUU�M؉�%UUUU�E܋E؋U܉�1M���1E�E��U�������������MЉ�%��q�EԋEЋUԉ�1M���1E�E��U�¸������������Ή�%������1u�1}�E��U��1��� 1E�1U�E��U��0^_]�U����M��E��U��E��U �P�����U���(�M�E�U �T$�U�$�������������U���(�M�U�E�T$�U�$������������U��WVS��|�M��E������E������E������E������E������E������E ���<����E����� �]��E ��������M��]�)�ӉȉډE��UċE�����ƋEă���lj� ���������E��Uă�����E��U��E��U��D$�T$ �$�����D$���������E��U��E��E��E��E�� �E��e�щʉE��U��E��U��M�����E��U�E��U�;E���E�r���E��U��D$�T$ �E��U�$�T$�/����E��U���M�c����E��U�E ���#����E�Ѓ�|[^_]����U���(�E���� �E�$������E��E��D$�E�$�O�����Ð��U���8�D$�E�D$ �E�D$�E �D$�E�$������U����E�D$ �E�D$�E �D$�E�$�F����U��S��D�MԋE��D$�p@��$������������E�Eԋ��E��Eԋ@�E�Eԉ��H���E܍E܉D$�E�$�����E�EԋU�$���������E�E�E��E �$����U� ������U�ыUԉD$�L$�$������E������Eԉ�������ÍM�������\$ �U�T$�D$�E��$������E��E��Eԉ�������ÍM�a������\$ �U��T$�U�T$�$�����E��EԋUԋR+U����T$�U��$��� ������EԋU��EԋU��P�E�������E�EԉP��]�����U���8�M�E�P�E�$���<������E���U���8�M�U�E�$���������E��Ð��U���(�M�E�P�E�@9�t-�E�P�E�M�L$�T$�$�����E�@�P�E�P�#�E���h����E�M�L$�$���������������U����M�E��������Ð�U���(�M�E���e����U�J�U��D$�L$�$�����E���h�����ÐU����E�E�E �E�E�U�E��U��E��U��Ð�U���8�E�E��E �E�E��U�E��U�E��U��D$8���D$ �����$�T$�����E��U�E��U��Ð�U���(�E�E��E �E�E��U�$�T$�d����Ð�U���(�E�E��E �E�E��U�$�T$�d����Ð�U��E]�U��VS���E�$������ƋE �$������ËE�$������U�T$ �t$�\$�$������[^]ÐU���(�E +E���E�}��~ �E����D$�E�D$�E�$�L����E�������E��Ð��U��E��E ��9�s�E ��E]ÐU��E ��E��9�s�E ��E]ÐU��E]�U����E �D$�E�$������ÐU����E �D$�E�$�������ÐU��E ]�f�f��������������������V@�U@�������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������@��4U@�������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������libgcc_s_dw2-1.dll�__register_frame_info�__deregister_frame_info��������������������������������������� ���
��� ��� �������ʚ;������vector::_M_realloc_insert����@��@��@��@��@�P@��@��@�@��@�@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@�@�
@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@��@�@��@�@��@�@�� @�Mingw runtime failure:
� VirtualQuery failed for %d bytes at address %p���� Unknown pseudo relocation protocol version %d.
��� Unknown pseudo relocation bit size %d.
���glob-1.0-mingw32������.������"��GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org GCC Build-2) 9.2.0��GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0���GCC: (MinGW.org Cross-GCC Build-20200531-1) 9.2.0����������������I�Z�� �����I���� �����I�
�� �����I�!�� �����I���� ������������������������������������������������������zR�| ������ �����������C V
G �(���8���d��������A�C bC L C j
����d���(���?����C@{����|���P�������C �������\�������C �������h�����������������d�����������������zR�| ���(��� ���H��������A�B
E��{
�A�A� K � ���H���̒��.����A�B
j� ���������zR�| ��� ��� �����������A�B
D� ���������zR�| ��� ��� ���$�������A�B
W� ���������zR�| ��� ��� �����������A�B
O� ���������zR�| ��� ��� ��� ���:����A�B
v� ��(���<���6��������A�B
F�����A�A�A� (���h������������D �Gu�Cu|� �A�C (���������������A�B
F�����A�A�A� �������˓�������A�B
�� � �������D��������A�B
�� � ��������������A�B
N� �� ��� ������&����A�B
D�]�A� �$���D�����������A�B
E����A�A� ���l����� ����A�B
X� ���������zR�| ��� ��� ���t�������A�B
R� ���������zR�| ��� ��� �����������A�B
R� ���������zR�| ��� ��� �����������A�B
R� ���������zR�| ��� ��� ���h�������A�B
W� ���������zR�| ��� ��� ����������A�B
O� ���������zR�| ��� ��� �������2����A�B
l� ���������zR�| ��� ��� �������(����A�B
b� ���������zR�| ��� ��� �������'����A�B
a� ���������zR�| ��� ��� ������� ����A�B
\� ���������zR�| ��� ��� ����������A�B
R� �� �������zPLR�|�t@�� ��� ���$�������C���8U@�A�B
� �� �������zPLR�|�t@�� ��� ���$�������;���<U@�A�B
w� ���������zR�| ��� ��� ���0���n����A�B
h� ��������zR�| ��� ��� �������!����A�B
]� ���������zR�| ��� ��� ���x���$����A�B
`� ���������zR�| ��� ��� �������(����A�B
D�_�A� ��������zR�| ��� ��� ���t�������A�B
W� ���������zR�| ��� ��� ���̽������A�B
L� ���������zR�| ��� ��� ������������A�B
D���A� �������zR�| ��� ��� ������� ����A�B
Y� ���������zR�| ���,��� �������Z���A�B
F���K�A�A�A� ����������zR�| ��� ��� ���(�������A�B
R� ���������zR�| ��� ��� �������)����A�B
e� ���������zR�| ��� ��� ������� ����A�B
H� ���������zR�| ��� ��� ��� ���-����A�B
g� ���������zR�| ��� ��� ���@�������A�B
J� ���������zR�| ��� ��� �����������A�B
W� ���������zR�| ��� ��� �������)����A�B
e� ���������zR�| ��� ��� �������g���A�B
D�]�� �������zR�| ��� ��� ���l�������A�B
R� ���������zR�| ��� ��� ���̺������A�B
J� ���������zR�| ��� ��� ���(���&����A�B
b� ���������zR�| ��� ��� ������&����A�B
b� ���������zR�| ��� ��� ���d�������A�B
M� ���������zR�| ��� ��� ��� �������A�B
L� ���������zR�| ���$��� �����������A�B
E����A�A� �������zR�| ��� ��� ���ĸ�� ����A�B
H� ���������zR�| ��� ��� �������!����A�B
]� ���������zR�| ��� ��� �����������A�B
W� ���������zR�| ��� ��� �����������A�B
D� ���������zR�| ��� ��� �������5����A�B
D�j�A� ��������zR�| ��� ��� ���Ը�������A�B
D���A� �������zR�| ��� ��� �������*����A�B
D�a�A� ��������zR�| ��� ��� ���x���,����A�B
f� ���������zR�| ��� ��� �������,����A�B
h� ���������zR�| ��� ��� �������&����A�B
b� ���������zR�| ��� ��� ���|���N����A�B
J� ��������zR�| ���,��� ���H�������A�B
I�����A�A�A� ����������zR�| ��� ��� �����������A�B
R� ���������zR�| ��� ��� ����������A�B
B� ���������zR�| ��� ��� ������� ����A�B
Y� ���������zR�| ��� ��� ���0��� ����A�B
Y� ���������zR�| ��� ��� �������!����A�B
]� ���������zR�| ��� ��� ��� ���(����A�B
d� ���������zR�| ��� ��� �������1����A�B
m� ���������zR�| ��� ��� ���P�������A�B
J� ���������zR�| ��� ��� ���س��5����A�B
o� ���������zR�| ���$��� �������K����A�B
E��@�A�A� �������zR�| ��� ��� �����������A�B
L� ���������zR�| ��� ��� ���8�������A�B
L� ���������zR�| ��� ��� �����������A�B
D� ���������zR�| ��� ��� ������E����A�B
A� ��������zR�| ���<��� �����������A�B
F���R
�A�A�A� B 7
�A�A�A� F ���������zR�| ���$��� ���̊�����]�H �A� _��������zR�| ������ �������1����N\� ���4���ċ��R����A�C o
A�D ����X������� ��������������zR�| ��� ��� ������C����C U
H `���D���<���$��������A�A �C d
F�A�H o
F�A�J _ F�A�����������������������������zR�| ���8��� ���p���`����A�A �C L I P C j C C A�A��,���X�������s����Q�C s N O E C
A�A �8���������������A�C P
C�I L H x E C
A�K ���0�������8��������C Z
C [
E i C Z
J d C ���������zR�| ��� ��� �������J����A�A �C ��d���<���܍�������A�A �C�C�EPXDCPm
A�A� A�A�G d@CPB@CPC
A�A� A�A�A �H�������d�������j�A �A�C0�
A� A�A�K �
A� A�A�B ����������zR�| ������ �������w����C A
D ��������zR�| ������ ���<���$����C0`��������zR�| ���<��� ���<���'���A�A �A�A�CP&
A�A� A�A�G <���\���,���'���A�C �A�C�C@�
C�A� A�A�E �<������� ��������A�D �A�k
� A�A�E Y
� F�A�A �D�������|���\����A�A �C�E @
C� A�A�A CF� A�A����(���$������I����A�C �E o
A�A�F (���P������K����A�C �C z
A�A�A <���|��ܕ������A�B
F����
�A�A�A� K "
�A�A�A� K ,������<��������A�B
F���F
�A�A�A� F �@������ ���W����A�A �A�C O
A� A�A�H oA� A�A��������zR�| ���,��� ���������A�B
F����
�A�A�A� H ��������zR�| ���@��� �����������A�A �H�P�C�W
C�A�H M
C�A�G L���`������������A�A �H�P�C�W
C�A�H M
C�A�G [ C�A��T��������������A�A �A�A�F�S
C�A� A�A�E S
C�A� A�A�G ���������O����A�Cv
C�C �(���,��إ��B����A�C V C Q
A�A ���,���X������_����A�C V C R
A�H eA�������,���'����CQ
A ��4������@���q����A�A �C R
A�A�G N A�A��������zR�| ���<��� ���p��������A�A �A�A�C �
A�A� A�A�C ��������zR�| ���T��� ���ئ��w����A�A �A�C0x
C� A�A�E T
A� A�A�A SA� A�A����������zR�| ���P��� �����������A�A �A�A�C0�
C�A� A�A�F _A�A� C�A��������������zR�| ������ ���H����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������x�I���������(�I���I���I���������@�I��I���I�����������I��I�X�I�����������I���I�p�I���������H�I���I�����������������������I��I�(�I�6�I�B�I�T�I�d�I�r�I���I���I���I���I���I���I���I� �I�*�I�<�I�����L�I�V�I�����b�I�r�I���I���I���I���I���I���I���I���I���I���I���I��I��I� �I�$�I�.�I�8�I�B�I�L�I�X�I�b�I�l�I�x�I���I���I���I���I���I���I���I���I�������I���I���I��I� �I�����,�I�<�I�L�I�`�I�l�I���I���I���I���I� �I�<�I�\�I�h�I�t�I���I���I���I�������I��I�(�I�6�I�B�I�T�I�d�I�r�I���I���I���I���I���I���I���I� �I�*�I�<�I�����L�I�V�I�����b�I�r�I���I���I���I���I���I���I���I���I���I���I���I��I��I� �I�$�I�.�I�8�I�B�I�L�I�X�I�b�I�l�I�x�I���I���I���I���I���I���I���I���I�������I���I���I��I� �I�����,�I�<�I�L�I�`�I�l�I���I���I���I���I� �I�<�I�\�I�h�I�t�I���I���I���I�������DeleteCriticalSection���EnterCriticalSection��ExitProcess�-FindClose�1FindFirstFileA��BFindNextFileA�aFreeLibrary��GetCommandLineA��GetLastError��GetModuleHandleA��BGetProcAddress���InitializeCriticalSection�/LeaveCriticalSection��2LoadLibraryA��lSetUnhandledExceptionFilter��TlsGetValue��VirtualProtect���VirtualQuery��Q�_strdup�S�_stricoll�Y�__getmainargs�x�__mb_cur_max����__p__environ����__p__fmode����__set_app_type����_cexit��_errno��?_fpreset��Y_fullpath��_iob���_isctype���_msize���_onexit��_pctype��_setmode��6abort�>atexit��Ecalloc��qfwrite���malloc���mbstowcs���memcpy���memmove��setlocale��signal���srand��strcoll��strlen���tolower��vfprintf��(wcstombs��ffree���realloc���%�__deregister_frame_info���T�__moddi3��k�__register_frame_info�w�__udivdi3�y�__umoddi3� _ZNSirsERi����_ZNSirsERx����2_ZNSolsEPFRSoS_E��A_ZNSolsEx��
_ZNSt6chrono3_V212system_clock3nowEv��#_ZNSt8ios_base15sync_with_stdioEb�1_ZNSt8ios_base4InitC1Ev���3_ZNSt8ios_base4InitD1Ev����_ZNSt9basic_iosIcSt11char_traitsIcEE3tieEPSo��_ZSt17__throw_bad_allocv��/_ZSt20__throw_length_errorPKc�@_ZSt3cin��C_ZSt4cout�D_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_�����_ZdlPv�����_Znwj� __gxx_personality_v0����I���I���I���I���I���I���I���I���I���I���I���I���I���I���I���I���I���I�KERNEL32.dll�����I��I�msvcrt.dll��(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�(�I�msvcrt.dll��<�I�<�I�<�I�<�I�<�I�libgcc_s_dw2-1.dll��P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�P�I�libstdc++-6.dll������������������������������������������������������������������������������������������������������������������������������������������������������������������������������ @�` @��������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������� ��8����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������� �������������HB@�*���������������&����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������"������������HB@�rB@�����3���z����� ������GNU C17 9.2.0 -mtune=generic -march=i586 -g -g -g -O2 -O2 -O2 -fbuilding-libgcc -fno-stack-protector� ../../../src/gcc-9.2.0/libgcc/libgcc2.c�/home/keith/builds/mingw/gcc-9.2.0-mingw32-cross-native/mingw32/libgcc�q���int�����unsigned int�short unsigned int�long long int� long double�_Float128�char�D��long int�_iobuf� ����_ptr�� ����_cnt������_base�� ���_flag������ _file������_charbuf������_bufsiz������_tmpfname�� ��� �D��FILE��]����� �� �
_iob�����short int�long unsigned int�
_argc�c����
_argv�dV�����
__mb_cur_max������
_sys_nerr������������ �
_sys_errlist����� _osver� ���� _winver� ���� _winmajor� ���� _winminor� ���� _fmode�`����
optind�< ����
optopt�= ����
opterr�> ����
optarg�A��� _daylight�\���� _timezone�]Q�����l�� ����� _tzname�^\�� daylight�}���� timezone�~Q�� tzname�\��hashval_t�*����htab_hash�/������
�������������htab_eq�6����
�������������
htab_hash_pointer�����
htab_eq_pointer�����unsigned char�stringop_alg����� ��no_stringop��libcall�rep_prefix_1_byte�rep_prefix_4_byte�rep_prefix_8_byte�loop_1_byte�loop�unrolled_loop�vector_loop�last_alg� �^��'�� �� ���L��!�� unspec_strings�J �� unspecv_strings�� ��stringop_strategy� ����max�������alg�� ��noalign�� �����]��stringop_algs�4����unknown_size�� ���size������������ ��������processor_costs���q ��add��
�����lea��
����shift_var��
����shift_const��
���� mult_init��
� ��mult_bit��
����$divide��
� ��(movsx������<movzx������@large_insn��
����Dmove_ratio��
����Hmovzbl_load��
����Lint_load��
� ��Pint_store��
� ��\fp_move��
����hfp_load��
� ��lfp_store�
� ��xmmx_move�
�����mmx_load�
� ���mmx_store�
� ���xmm_move�
�����ymm_move� �����zmm_move�
�����sse_load�
� ���sse_unaligned_load�
� ���sse_store�
� ���sse_unaligned_store�
� ���mmxsse_to_integer�
�����ssemmx_to_integer�
�����gather_static�
�����gather_per_elt� �����scatter_static�
����scatter_per_elt� ����l1_cache_size�
���� l2_cache_size�
����prefetch_block�
����simultaneous_prefetches�
����branch_cost�
���� fadd�
���� fmul�
����$fdiv�
����(fabs�!
����,fchs�"
����0fsqrt�#
����4sse_op�&
����8addss�'
����<mulss�(
����@mulsd�)
����Dfmass�*
����Hfmasd�+
����Ldivss�,
����Pdivsd�-
����Tsqrtss�.
����Xsqrtsd�/
����\reassoc_int�0
����`reassoc_fp�0����dreassoc_vec_int�0&����hreassoc_vec_fp�07����lmemcpy�7� ��pmemset�7"� ��tcond_taken_branch_cost�8
����xcond_not_taken_branch_cost�:
����|align_loop�@'���align_jump�A'���align_label�B'���align_func�C'������������ �� �����v ������� �� ������ ������� �� ������ ����� ix86_cost�F&� ��q �� ix86_size_cost�G%q ��ix86_tune_indices������-��X86_TUNE_SCHEDULE��X86_TUNE_PARTIAL_REG_DEPENDENCY�X86_TUNE_SSE_PARTIAL_REG_DEPENDENCY�X86_TUNE_SSE_SPLIT_REGS�X86_TUNE_PARTIAL_FLAG_REG_STALL�X86_TUNE_MOVX�X86_TUNE_MEMORY_MISMATCH_STALL�X86_TUNE_FUSE_CMP_AND_BRANCH_32�X86_TUNE_FUSE_CMP_AND_BRANCH_64�X86_TUNE_FUSE_CMP_AND_BRANCH_SOFLAGS� X86_TUNE_FUSE_ALU_AND_BRANCH�
X86_TUNE_ACCUMULATE_OUTGOING_ARGS� X86_TUNE_PROLOGUE_USING_MOVE� X86_TUNE_EPILOGUE_USING_MOVE�
X86_TUNE_USE_LEAVE�X86_TUNE_PUSH_MEMORY�X86_TUNE_SINGLE_PUSH�X86_TUNE_DOUBLE_PUSH�X86_TUNE_SINGLE_POP�X86_TUNE_DOUBLE_POP�X86_TUNE_PAD_SHORT_FUNCTION�X86_TUNE_PAD_RETURNS�X86_TUNE_FOUR_JUMP_LIMIT�X86_TUNE_SOFTWARE_PREFETCHING_BENEFICIAL�X86_TUNE_LCP_STALL�X86_TUNE_READ_MODIFY�X86_TUNE_USE_INCDEC�X86_TUNE_INTEGER_DFMODE_MOVES�X86_TUNE_OPT_AGU� X86_TUNE_AVOID_LEA_FOR_ADDR� X86_TUNE_SLOW_IMUL_IMM32_MEM� X86_TUNE_SLOW_IMUL_IMM8� X86_TUNE_AVOID_MEM_OPND_FOR_CMOVE� X86_TUNE_SINGLE_STRINGOP�!X86_TUNE_MISALIGNED_MOVE_STRING_PRO_EPILOGUES�"X86_TUNE_USE_SAHF�#X86_TUNE_USE_CLTD�$X86_TUNE_USE_BT�%X86_TUNE_AVOID_FALSE_DEP_FOR_BMI�&X86_TUNE_ADJUST_UNROLL�'X86_TUNE_ONE_IF_CONV_INSN�(X86_TUNE_USE_HIMODE_FIOP�)X86_TUNE_USE_SIMODE_FIOP�*X86_TUNE_USE_FFREEP�+X86_TUNE_EXT_80387_CONSTANTS�,X86_TUNE_GENERAL_REGS_SSE_SPILL�-X86_TUNE_SSE_UNALIGNED_LOAD_OPTIMAL�.X86_TUNE_SSE_UNALIGNED_STORE_OPTIMAL�/X86_TUNE_SSE_PACKED_SINGLE_INSN_OPTIMAL�0X86_TUNE_SSE_TYPELESS_STORES�1X86_TUNE_SSE_LOAD0_BY_PXOR�2X86_TUNE_INTER_UNIT_MOVES_TO_VEC�3X86_TUNE_INTER_UNIT_MOVES_FROM_VEC�4X86_TUNE_INTER_UNIT_CONVERSIONS�5X86_TUNE_SPLIT_MEM_OPND_FOR_FP_CONVERTS�6X86_TUNE_USE_VECTOR_FP_CONVERTS�7X86_TUNE_USE_VECTOR_CONVERTS�8X86_TUNE_SLOW_PSHUFB�9X86_TUNE_AVOID_4BYTE_PREFIXES�:X86_TUNE_USE_GATHER�;X86_TUNE_AVOID_128FMA_CHAINS�<X86_TUNE_AVOID_256FMA_CHAINS�=X86_TUNE_AVX256_UNALIGNED_LOAD_OPTIMAL�>X86_TUNE_AVX256_UNALIGNED_STORE_OPTIMAL�?X86_TUNE_AVX128_OPTIMAL�@X86_TUNE_AVX256_OPTIMAL�AX86_TUNE_DOUBLE_WITH_ADD�BX86_TUNE_ALWAYS_FANCY_MATH_387�CX86_TUNE_UNROLL_STRLEN�DX86_TUNE_SHIFT1�EX86_TUNE_ZERO_EXTEND_WITH_AND�FX86_TUNE_PROMOTE_HIMODE_IMUL�GX86_TUNE_FAST_PREFIX�HX86_TUNE_READ_MODIFY_WRITE�IX86_TUNE_MOVE_M1_VIA_OR�JX86_TUNE_NOT_UNPAIRABLE�KX86_TUNE_PARTIAL_REG_STALL�LX86_TUNE_PROMOTE_QIMODE�MX86_TUNE_PROMOTE_HI_REGS�NX86_TUNE_HIMODE_MATH�OX86_TUNE_SPLIT_LONG_MOVES�PX86_TUNE_USE_XCHGB�QX86_TUNE_USE_MOV0�RX86_TUNE_NOT_VECTORMODE�SX86_TUNE_AVOID_VECTOR_DECODE�TX86_TUNE_BRANCH_PREDICTION_HINTS�UX86_TUNE_QIMODE_MATH�VX86_TUNE_PROMOTE_QI_REGS�WX86_TUNE_EMIT_VZEROUPPER�XX86_TUNE_LAST�Y�M��=�� ����X� ix86_tune_features��-��ix86_arch_indices�����3���X86_ARCH_CMOV��X86_ARCH_CMPXCHG�X86_ARCH_CMPXCHG8B�X86_ARCH_XADD�X86_ARCH_BSWAP�X86_ARCH_LAST��M����� ����� ix86_arch_features�=��� x86_prefetch_sse�LM��_dont_use_tree_here_� x86_mfence�j
T��*��reg_class�����0��NO_REGS��AREG�DREG�CREG�BREG�SIREG�DIREG�AD_REGS�CLOBBERED_REGS�Q_REGS� NON_Q_REGS�
TLS_GOTBASE_REGS� INDEX_REGS� LEGACY_REGS�
GENERAL_REGS�FP_TOP_REG�FP_SECOND_REG�FLOAT_REGS�SSE_FIRST_REG�NO_REX_SSE_REGS�SSE_REGS�ALL_SSE_REGS�MMX_REGS�FLOAT_SSE_REGS�FLOAT_INT_REGS�INT_SSE_REGS�FLOAT_INT_SSE_REGS�MASK_REGS�ALL_MASK_REGS� ALL_REGS� LIM_REG_CLASSES� �Z������ �� ����K�
�� dbx_register_map�& �� dbx64_register_map�' �� svr4_dbx_register_map�( ��processor_type������� ��PROCESSOR_GENERIC��PROCESSOR_I386�PROCESSOR_I486�PROCESSOR_PENTIUM�PROCESSOR_LAKEMONT�PROCESSOR_PENTIUMPRO�PROCESSOR_PENTIUM4�PROCESSOR_NOCONA�PROCESSOR_CORE2�PROCESSOR_NEHALEM� PROCESSOR_SANDYBRIDGE�
PROCESSOR_HASWELL� PROCESSOR_BONNELL� PROCESSOR_SILVERMONT�
PROCESSOR_GOLDMONT�PROCESSOR_GOLDMONT_PLUS�PROCESSOR_TREMONT�PROCESSOR_KNL�PROCESSOR_KNM�PROCESSOR_SKYLAKE�PROCESSOR_SKYLAKE_AVX512�PROCESSOR_CANNONLAKE�PROCESSOR_ICELAKE_CLIENT�PROCESSOR_ICELAKE_SERVER�PROCESSOR_CASCADELAKE�PROCESSOR_INTEL�PROCESSOR_GEODE�PROCESSOR_K6�PROCESSOR_ATHLON� PROCESSOR_K8� PROCESSOR_AMDFAM10� PROCESSOR_BDVER1� PROCESSOR_BDVER2� PROCESSOR_BDVER3�!PROCESSOR_BDVER4�"PROCESSOR_BTVER1�#PROCESSOR_BTVER2�$PROCESSOR_ZNVER1�%PROCESSOR_ZNVER2�&PROCESSOR_max�'� ix86_tune�r w�� ix86_arch�s w�� ix86_preferred_stack_boundary�z ���� ix86_incoming_stack_boundary�{ ������= �� ����K�- �� regclass_map�~ = ��signed char�UQItype� {M��g ��long long unsigned int�float�complex float�double�complex double�complex long double� complex _Float128�w �� �� ������� �� __popcount_tab� � �� __clz_tab� ��func_ptr�
*I ��O ��8 ��[ �� �
__CTOR_LIST__�
/P ��
__DTOR_LIST__�
0P ��[ �� 6
U@�q �� 7
0U@�����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������%���% ��$� > ��&�I�� : ; 9 ��
�: ; 9 I8 ��� I���: ; 9 I��I�� !���
4�: ; 9 I?<�� 4�: ;9 I?<�� !�I/ ��
'I���I��&���> I: ; 9 ��(� �� : ; 9 ��
�: ;9 I8 ��
�: ;9 I8��> I: ;9 ���<���'��4�G: ;9 ������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������m����I����
������../../../src/gcc-9.2.0/libgcc/config/i386��cygwin.S�����HB@��""YK0g=YY0/>""�S���M���
������/home/keith/mingw32-gcc-9.2.0/include�../../../src/gcc-9.2.0/libgcc/../include�../.././gcc�../../../src/gcc-9.2.0/libgcc/../gcc/config/i386�../../../src/gcc-9.2.0/libgcc��stdio.h���stdlib.h���getopt.h���time.h���hashtab.h���insn-constants.h���i386.h���i386-opts.h���libgcc2.h���gbl-ctors.h���libgcc2.c��������������������������������������������������������������������| ��� �������HB@�*���A�A �f�A���������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������../../../src/gcc-9.2.0/libgcc/config/i386/cygwin.S�/home/keith/builds/mingw/gcc-9.2.0-mingw32-cross-native/mingw32/libgcc�GNU AS 2.32�����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������[������� ������s������� �������������� ��_atexit���� ��__onexit ��� ��.text����������&��*�������������.bss����������������������������.file��� �������gcygming-crtbegin.c_obj�����������������������������������0��� ������������������������������� ��.text���0����������������������.data���������������������������.bss������������������������������������������d����������������.rdata���������A�������������������������������2�����������������.file���x������g�����7��������������������E���������������������__ZnwjPvE��� ����������������������������D����������������������������D��� ������/��D�����������N��E�����������m��F��������������G���������������HI������������H��������������t5�������������������������.��t5��� ������l��L��������������P��������������T��������������X�����������
��\�����������4��`�����������[��d��������������h��������������l��������������p��������������t�����������%��x�����������Q��|�����������x����������__Z3rngi��� ��__ZL3mod��������__ZL1N����������__ZL1M������������������6����������������������������6��� ��������t7������������������������(��t7��� ������I���B������������������������h���B��� ���������J��� ��_main������� ������������� ���������c��� ������������� ����������D�����������������������������D��� ���������`5�������������������������Z��`5��� ���������8=�����2����������������������8=��� ������S���>�����(�����������������������>��� ����������>�����'�������������������� ���>��� ������y
���6����� ��������������������
���6��� �������
���6�������������������������
���6��� �������
���7�����C�������������������# ���7��� ������D ���B�����;�������������������c ���B��� ������} ��dB�����n�������������������� ��dB��� ������� ��@B�����!�������������������� ��@B��� ������ �� B�����$�������������������, �� B��� ������H ���4�����(�������������������� ���4��� ������� ���4�������������������������#
���4��� ������^
�� 5��������������������������
�� 5��� �������
��D<����������������������������D<��� ������h��`>����� �����������������������`>��� ����������>�����Z����������������������>��� ���������l6���������������������������l6��� ���������87�����)��������������������&��87��� ������Z��h4����� �����������������������h4��� ���������7�����-����������������������7��� ��������d7�������������������������G��d7��� ������{���D����������������������������D��� ���������(8�����)�������������������
��(8��� ������K���@�����g����������������������@��� ������
��t4�������������������������N��t4��� ��������� 5���������������������������� 5��� ���������C�����&�������������������@���C��� ������k���C�����&�����������������������C��� ���������L5���������������������������L5��� ������9��<5�������������������������s��<5��� ���������l=�������������������������n��l=��� ������/��\4����� ��������������������Y��\4��� ������~���7�����!�����������������������7��� ����������D������������������������ ���D��� ������"���D�������������������������^���D��� ���������$4�����5����������������������$4��� ���������5��������� ����������������E���5��� ������o���4�����*�����������������������4��� ������0 ���6�����,�������������������a ���6��� ������� ��`@�����,�������������������� ��`@��� ������� ��(C�����&��������������������, ��(C��� ������a ��PC�����N�������������������� ��PC��� ������� ��T8�������������������������� ��T8��� ������q ���3������������������������� ���3��� ������� ���6�������������������������
���6��� ������= ��L6����� �������������������d ��L6��� ������� ��,6����� ��������������������� ��,6��� ������� ���7�����!�������������������� ���7��� ������*!���@�����(�������������������~!���@��� �������!��,@�����1��������������������!��,@��� ������$"��,5�������������������������^"��,5��� �������"���3�����5��������������������"���3��� �������"���C�����K�������������������*#���C��� ������Y#��8�������������������������#��8��� �������#���4��������������������������#���4��� ������$���C�������������������������=$���C��� ������Z$��DD�����E��������������������$��DD��� ��___tcf_0���� ��___tcf_1���� ������=%������ ������n%��V��� ��.text��������b��4�������������.data���������������������������.bss���� �������GI���������������.rdata��D������f����������������������%��8E����������������������.ctors��$E�����������������������������������#����������������������%��,�����8��������������������%��d�����8��������������������%��������8��������������������������������
�����������������&��\�����8�������������������F&��������8�������������������p&��������8��������������������&�������8��������������������&��<�����8�������������������.'��t�����8��������������������'��������8�������������������*(��������8�������������������)�� �����8�������������������P)��T�����8�������������������g)��������D��������������������)��������D��������������������)�������8��������������������)��L�����8�������������������*��������8�������������������-*��������<��������������������*��������8��������������������*��0�����8�������������������
+��h�����<��������������������+��������8�������������������,��������H�������������������-��$�����8�������������������--��\�����8�������������������j-��������8��������������������-��������8��������������������-�� �����8�������������������.��< �����8�������������������9.��t �����8��������������������.��� �����<��������������������.��� �����8�������������������1/��
�����8�������������������y/��X
�����8��������������������/���
�����8��������������������/���
�����8�������������������!0��� �����8�������������������_0��8 �����@�������������������)1��x �����8�������������������W1��� �����8��������������������1��� �����8��������������������1�� �����8��������������������1��X �����<�������������������=2��� �����<�������������������p2��� �����<��������������������2��
�����8������������������� 3��D
�����8�������������������E3��|
�����8��������������������3���
�����8��������������������3���
�����H��������������������4��4�����8��������������������4��l�����8������������������� 5��������8�������������������65��������8�������������������]5�������8��������������������5��L�����8��������������������5��������8������������������� 6��������8�������������������]6��������8��������������������6��,�����@��������������������6��l�����8�������������������7��������8�������������������;7��������8�������������������a7�������8���������������.text���t������.idata$7D ������.idata$5�������.idata$4�������.idata$6�������@feat.00��������.text���|������.idata$7@ ������.idata$5�������.idata$4�������.idata$6�������@feat.00��������.text����������.idata$7< ������.idata$5�������.idata$4�������.idata$6�������@feat.00��������.text����������.idata$78 ������.idata$5�������.idata$4�������.idata$6t������@feat.00��������.text����������.idata$74 ������.idata$5�������.idata$4�������.idata$6h������.text����������.idata$70 ������.idata$5�������.idata$4�������.idata$6\������.text����������.idata$7, ������.idata$5�������.idata$4�������.idata$6<������@feat.00��������.text����������.idata$7( ������.idata$5�������.idata$4�������.idata$6 ������@feat.00��������.text����������.idata$7$ ������.idata$5�������.idata$4�������.idata$6�������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4�������.idata$6�������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4�������.idata$6�������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4�������.idata$6�������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4�������.idata$6l������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4|������.idata$6`������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4x������.idata$6L������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4t������.idata$6<������@feat.00��������.text����������.idata$7 ������.idata$5�������.idata$4p������.idata$6,������@feat.00�������������7������ �������������������.text�������������������������.rdata��������� ��C�����������������8��� ��� �������������������.text���� ��������������������.bss����$HI������������������������� 8���
��� �����������������������08���
��� ��___main�@��� ��.text����
���������
�������������.data�������������������������.bss����(HI�������������������������C8������ ������V8��`��� ��.text���`��������������������.bss����,HI���������������������.CRT$XDZ�����������������������.CRT$XDA�����������������������.CRT$XLA������������������������.tls$ZZZ �����������������������.tls$AAA����������������������������c8������ �������8��P��� �������8������ ��.text���p�����,��"�������������.bss����<HI���� ����������������������8������ ��.text���������*��!�������������.bss����\HI���������������������.rdata�������������������������������8������ �������������������.text���������w����������������.data�������������������������������8��P��� ������������������������8��P��� ��.text���P�����$���������������������9�� %��� ������9�� &��� ��.text������������1�������������.rdata��h�������������������������� 9���&��� �������������������.text����&��������������������.bss����hHI���������������������.rdata��|��������������������������19��P,��� ������B9��P.��� ������S9���.��� ������e9���.��� ������x9��P/��� �������9���/��� ��.text����*�����Q��������������������9���0��� �������������������.text����0���������������������������9���0��� �������������������.text����0�����w���������������������9��@1��� �������������������.text���@1����������������������.text��� 2������.idata$7�������.idata$5�������.idata$4h������.idata$6 ������@feat.00��������.text���(2������.idata$7�������.idata$5�������.idata$4d������.idata$6������@feat.00��������.text���02������.idata$7�������.idata$5�������.idata$4`������.idata$6�������@feat.00��������.text���82������.idata$7�������.idata$5�������.idata$4\������.idata$6�������@feat.00��������.text���@2������.idata$7�������.idata$5�������.idata$4X������.idata$6�������@feat.00��������.file����������gfake�������������������9������
���&���������������������9������ �������������������������9������ ���q����������������.text���H2�����*�����������������.data���������������������������.bss����pHI��������������������������:������ ��� ��������������������:������������������������������� :������
���8����������������.file���������glibgcc2.c���������.text���t2�����������������������.data���������������������������.bss����pHI���������������������������9��&���
���� ��������������������9����� ���5��������������������:�� ��� ������������������������9��q��� ���W������������������������$�����2�����������������.idata$5������.idata$6V������.idata$5������.idata$6L������.idata$4��������.idata$5������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5|������.idata$6�������.idata$5x������.idata$6�������.idata$5t������.idata$6�������.idata$5p������.idata$6x������.idata$5l������.idata$6l������.idata$5h������.idata$6b������.idata$5d������.idata$6X������.idata$5`������.idata$6L������.idata$5\������.idata$6B������.idata$5X������.idata$68������.idata$5T������.idata$6.������.idata$6$������.idata$5L������.idata$6 ������.idata$5H������.idata$6������.idata$6������.idata$6�������.idata$5<������.idata$6�������.idata$58������.idata$6�������.idata$6�������.idata$50������.idata$6�������.idata$5(������.idata$6�������.idata$5$������.idata$6�������.idata$5 ������.idata$6�������.idata$5������.idata$6�������.idata$6r������.idata$5������.idata$6b������.idata$4��������.idata$5������.idata$5�������.idata$6<������.idata$5�������.idata$6*������.idata$5�������.idata$6 ������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6r������.idata$5�������.idata$6d������.idata$5�������.idata$6T������.idata$5�������.idata$6B������.idata$5�������.idata$66������.idata$5�������.idata$6(������.idata$5�������.idata$6������.idata$5�������.idata$6�������.idata$4x�������.idata$5�������.file���.������gcygming-crtend.c������):�������������8:��E��� �������������������.text����3�����������������������.data���������������������������.bss����pHI������������������������������������0��������������������M:��E�������������������������[:��(E�����������������������������X�����2�����������������.idata$5,������.idata$6�������.idata$5 ������.idata$6�������.idata$5�������.idata$6�������.idata$5�������.idata$6�������.rdata�������������h:�������������h:�������������h:�������������h:�������������h:���������.idata$2<�������.idata$5�������.idata$4X������.idata$2P�������.idata$5�������.idata$4p������.idata$4l������.idata$5�������.idata$7�������.idata$4�������.idata$5�������.idata$7H �����������:��82��� �������:����������������:���������__cexit�$3��� �������:��L3��� �������:������ �������:��������������:�������������;��0����������$;���3��� ������6;��H����������F;��������������U;���3��� ������d;��0E����������s;��������������;��@�����������;��,3��� �������;��������������;��\3��� �������;��������������;��!����������<�������������!<��h����������1<�������������H<��������������W<�������������l<��������������<���������__errno� 3��� �������<���3��� �������<��������������<��L������___xl_c�������������<�����������_rang��� ������������<��������������=�����������_a��������6��������� =���� ����������:=��������������V=��������������h=����������_g�������
����������z=���������������=��������___xl_z� ������������=�������������=��������������=���3��� �������=�������������=��D����������
>�������������>������ ������H>��D3��� ������Y>�������������q>��������������>��4HI����������>��4�����������>������ �������>���3��� �������>��02��� ����������������������>��@����������?��pHI��������� ?���������������N?�������������m?������������{?��8�����������?���������������?���������__ZdlPv����� �������?����������������?���������������?�� 2��� �������?�������������@��(����������@��t���������� @��43��� ������,@�������������D@��|3��� ������V@�������������h@���������_strcoll�2��� ��_srand���2��� ������x@���3��� �������@��������������@��������������@��������������@��p������__dll__���������������@�����������_fwrite��2��� �������@��P�����������@��(2��� ������A��`����������A�������������!A��(�����������4A����@����������CA��\����������RA�� 3��� ������\A��������������rA��d3��� �������A��h�����������A��
�����������A���2��� �������A���������_memcpy��2��� �������A��������������A��������������A��������������A���2��� ������
B�� ������__argc������������� B�������������-B��������������9B���3��� ������HB��x����������WB�������������dB��<3��� ������sB���3��� ��_tolower�2��� ��___xl_a���������___xl_d�������������B�� E�����������B���2��� �������B������ �������B�����������__CRT_MTdHI����������B��tHI����������B�� HI����������B���������������B��8HI����������B�������������C������ ������CC����������_strdup�|2��� ������UC�������������jC��P�������__argv���������������C�� E������_calloc��2��� ��__fmode� ������������C��H�������������C��������������C���������__msize�3��� �������C��d�����������C���3��� �������C���������������C������������� D�������������*D��\����������8D��<�����������RD��lHI���������hD��������������|D���������������D��������������D��t2��� �������D�� �������__end__�������������D��������������D���������_signal��2��� ��_malloc��2��� �������D��0E����������E��,����������E���������������JE���3��� ������bE�������������tE��3��� ������E���������������E��������������E����@�����������E���������������E��|�����������E��������������E��T������_abort���2��� �������E��������������E������ ������F������ ������=F������ ������HF������������]F�� �����������jF�������������F��,HI����������F��������������F��t3��� �������F��$HI����������F��������������F������ ������G��@2��� ��������������������� G�������������bG��������������zG����������������G��������������G��������������G��t��� �������G���2��� �������G��H �����������G��H2�����������G���������������G�������������H��$���������� H�������������CH���������������_H�������������rH����������������H��������������H���������_strlen��2��� �������H��������������H��Z�����������H�� ����������I���������__Znwj��|��� ��_memmove�2��� ������I������ ������8I��0HI���������PI��T3��� ������_I�������������~I��l3��� �������I��������������I��������������I������ �������I��l�����������I��������������I�������������J��(����������1J�������������JJ�������������UJ������ ������nJ�������������~J��<�����������J���2��� �������J��������������J��������������J��X�����������J����������J��.eh_frame�.debug_aranges�.debug_info�.debug_abbrev�.debug_line�.debug_frame�.debug_str�__mingw32_init_mainargs�_mainCRTStartup�_WinMainCRTStartup�_deregister_frame_fn�___gcc_register_frame�___gcc_deregister_frame�.eh_frame�.rdata$zzz�.text$_ZnwjPv�.text$_ZSt3minIjERKT_S2_S2_�__ZSt3minIjERKT_S2_S2_�__ZN6__pstl9execution2v1L3seqE�__ZN6__pstl9execution2v1L3parE�__ZN6__pstl9execution2v1L9par_unseqE�__ZN6__pstl9execution2v1L5unseqE�__ZStL8__ioinit�__ZN9__gnu_cxxL21__default_lock_policyE�.text$_ZNKSt6chrono8durationIxSt5ratioILx1ELx1000000000EEE5countEv�__ZNKSt6chrono8durationIxSt5ratioILx1ELx1000000000EEE5countEv�__ZNSt15regex_constantsL13error_collateE�__ZNSt15regex_constantsL11error_ctypeE�__ZNSt15regex_constantsL12error_escapeE�__ZNSt15regex_constantsL13error_backrefE�__ZNSt15regex_constantsL11error_brackE�__ZNSt15regex_constantsL11error_parenE�__ZNSt15regex_constantsL11error_braceE�__ZNSt15regex_constantsL14error_badbraceE�__ZNSt15regex_constantsL11error_rangeE�__ZNSt15regex_constantsL11error_spaceE�__ZNSt15regex_constantsL15error_badrepeatE�__ZNSt15regex_constantsL16error_complexityE�__ZNSt15regex_constantsL11error_stackE�__ZNSt8__detailL19_S_invalid_state_idE�.text$_ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev�__ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev�.text$_ZNSt12_Vector_baseIiSaIiEEC2Ev�__ZNSt12_Vector_baseIiSaIiEEC2Ev�.text$_ZNSt6vectorIiSaIiEEC1Ev�__ZNSt6vectorIiSaIiEEC1Ev�__Z5solvev�__Z4mpowii�__Z7ipgraphii�__Z3dfsii�.text$_ZSt3maxIjERKT_S2_S2_�__ZSt3maxIjERKT_S2_S2_�.text$_ZNKSt6chrono10time_pointINS_3_V212system_clockENS_8durationIxSt5ratioILx1ELx1000000000EEEEE16time_since_epochEv�__ZNKSt6chrono10time_pointINS_3_V212system_clockENS_8durationIxSt5ratioILx1ELx1000000000EEEEE16time_since_epochEv�.text$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEC1Ey�__ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEC1Ey�.text$_ZNSt24uniform_int_distributionIiEC1Eii�__ZNSt24uniform_int_distributionIiEC1Eii�.text$_ZNSt24uniform_int_distributionIiEclISt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEEEiRT_�__ZNSt24uniform_int_distributionIiEclISt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEEEiRT_�.text$_ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev�__ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev�.text$_ZNSaIiED2Ev�__ZNSaIiED2Ev�.text$_ZNSt12_Vector_baseIiSaIiEED2Ev�__ZNSt12_Vector_baseIiSaIiEED2Ev�.text$_ZNSt6vectorIiSaIiEED1Ev�__ZNSt6vectorIiSaIiEED1Ev�.text$_ZNSt6vectorIiSaIiEE9push_backERKi�__ZNSt6vectorIiSaIiEE9push_backERKi�.text$_ZNSt6vectorIiSaIiEE5beginEv�__ZNSt6vectorIiSaIiEE5beginEv�.text$_ZNSt6vectorIiSaIiEE3endEv�__ZNSt6vectorIiSaIiEE3endEv�.text$_ZN9__gnu_cxxneIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_�__ZN9__gnu_cxxneIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_�.text$_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEppEv�__ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEppEv�.text$_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv�__ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv�.text$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EE4seedEy�__ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EE4seedEy�.text$_ZNSt24uniform_int_distributionIiE10param_typeC1Eii�__ZNSt24uniform_int_distributionIiE10param_typeC1Eii�.text$_ZNSt24uniform_int_distributionIiEclISt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEEEiRT_RKNS0_10param_typeE�__ZNSt24uniform_int_distributionIiEclISt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEEEiRT_RKNS0_10param_typeE�.text$_ZNSaIiEC2Ev�__ZNSaIiEC2Ev�.text$_ZNSt12_Vector_baseIiSaIiEE17_Vector_impl_dataC2Ev�__ZNSt12_Vector_baseIiSaIiEE17_Vector_impl_dataC2Ev�.text$_ZN9__gnu_cxx13new_allocatorIiED2Ev�__ZN9__gnu_cxx13new_allocatorIiED2Ev�.text$_ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij�__ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij�.text$_ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv�__ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv�.text$_ZSt8_DestroyIPiiEvT_S1_RSaIT0_E�__ZSt8_DestroyIPiiEvT_S1_RSaIT0_E�.text$_ZNSt16allocator_traitsISaIiEE9constructIiJRKiEEEvRS0_PT_DpOT0_�__ZNSt16allocator_traitsISaIiEE9constructIiJRKiEEEvRS0_PT_DpOT0_�.text$_ZNSt6vectorIiSaIiEE17_M_realloc_insertIJRKiEEEvN9__gnu_cxx17__normal_iteratorIPiS1_EEDpOT_�__ZNSt6vectorIiSaIiEE17_M_realloc_insertIJRKiEEEvN9__gnu_cxx17__normal_iteratorIPiS1_EEDpOT_�.text$_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_�__ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_�.text$_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv�__ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv�.text$_ZNSt8__detail5__modIyLy0ELy1ELy0EEET_S1_�__ZNSt8__detail5__modIyLy0ELy1ELy0EEET_S1_�.text$_ZNSt8__detail5__modIyLy312ELy1ELy0EEET_S1_�__ZNSt8__detail5__modIyLy312ELy1ELy0EEET_S1_�.text$_ZNKSt24uniform_int_distributionIiE10param_type1bEv�__ZNKSt24uniform_int_distributionIiE10param_type1bEv�.text$_ZNKSt24uniform_int_distributionIiE10param_type1aEv�__ZNKSt24uniform_int_distributionIiE10param_type1aEv�.text$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEclEv�__ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEclEv�.text$_ZN9__gnu_cxx13new_allocatorIiEC2Ev�__ZN9__gnu_cxx13new_allocatorIiEC2Ev�.text$_ZNSt16allocator_traitsISaIiEE10deallocateERS0_Pij�__ZNSt16allocator_traitsISaIiEE10deallocateERS0_Pij�.text$_ZSt8_DestroyIPiEvT_S1_�__ZSt8_DestroyIPiEvT_S1_�.text$_ZSt7forwardIRKiEOT_RNSt16remove_referenceIS2_E4typeE�__ZSt7forwardIRKiEOT_RNSt16remove_referenceIS2_E4typeE�.text$_ZN9__gnu_cxx13new_allocatorIiE9constructIiJRKiEEEvPT_DpOT0_�__ZN9__gnu_cxx13new_allocatorIiE9constructIiJRKiEEEvPT_DpOT0_�.text$_ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc�__ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc�.text$_ZN9__gnu_cxxmiIPiSt6vectorIiSaIiEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_�__ZN9__gnu_cxxmiIPiSt6vectorIiSaIiEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_�.text$_ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj�__ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj�.text$_ZNSt6vectorIiSaIiEE11_S_relocateEPiS2_S2_RS0_�__ZNSt6vectorIiSaIiEE11_S_relocateEPiS2_S2_RS0_�.text$_ZNSt8__detail4_ModIyLy0ELy1ELy0ELb1ELb0EE6__calcEy�__ZNSt8__detail4_ModIyLy0ELy1ELy0ELb1ELb0EE6__calcEy�.text$_ZNSt8__detail4_ModIyLy312ELy1ELy0ELb1ELb1EE6__calcEy�__ZNSt8__detail4_ModIyLy312ELy1ELy0ELb1ELb1EE6__calcEy�.text$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EE11_M_gen_randEv�__ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EE11_M_gen_randEv�.text$_ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij�__ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij�.text$_ZNSt12_Destroy_auxILb1EE9__destroyIPiEEvT_S3_�__ZNSt12_Destroy_auxILb1EE9__destroyIPiEEvT_S3_�.text$_ZNKSt6vectorIiSaIiEE8max_sizeEv�__ZNKSt6vectorIiSaIiEE8max_sizeEv�.text$_ZNKSt6vectorIiSaIiEE4sizeEv�__ZNKSt6vectorIiSaIiEE4sizeEv�.text$_ZNSt16allocator_traitsISaIiEE8allocateERS0_j�__ZNSt16allocator_traitsISaIiEE8allocateERS0_j�.text$_ZNSt6vectorIiSaIiEE14_S_do_relocateEPiS2_S2_RS0_St17integral_constantIbLb1EE�__ZNSt6vectorIiSaIiEE14_S_do_relocateEPiS2_S2_RS0_St17integral_constantIbLb1EE�.text$_ZNSt6vectorIiSaIiEE11_S_max_sizeERKS0_�__ZNSt6vectorIiSaIiEE11_S_max_sizeERKS0_�.text$_ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv�__ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv�.text$_ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv�__ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv�.text$_ZSt12__relocate_aIPiS0_SaIiEET0_T_S3_S2_RT1_�__ZSt12__relocate_aIPiS0_SaIiEET0_T_S3_S2_RT1_�.text$_ZNSt16allocator_traitsISaIiEE8max_sizeERKS0_�__ZNSt16allocator_traitsISaIiEE8max_sizeERKS0_�.text$_ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv�__ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv�.text$_ZSt12__niter_baseIPiET_S1_�__ZSt12__niter_baseIPiET_S1_�.text$_ZSt14__relocate_a_1IiiENSt9enable_ifIXsrSt24__is_bitwise_relocatableIT_vE5valueEPS2_E4typeES4_S4_S4_RSaIT0_E�__ZSt14__relocate_a_1IiiENSt9enable_ifIXsrSt24__is_bitwise_relocatableIT_vE5valueEPS2_E4typeES4_S4_S4_RSaIT0_E�__Z41__static_initialization_and_destruction_0ii�__GLOBAL__sub_I_rang�.gcc_except_table�.eh_frame$_ZnwjPv�.eh_frame$_ZSt3minIjERKT_S2_S2_�.eh_frame$_ZNKSt6chrono8durationIxSt5ratioILx1ELx1000000000EEE5countEv�.eh_frame$_ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev�.eh_frame$_ZNSt12_Vector_baseIiSaIiEEC2Ev�.eh_frame$_ZNSt6vectorIiSaIiEEC1Ev�.eh_frame$_ZSt3maxIjERKT_S2_S2_�.eh_frame$_ZNKSt6chrono10time_pointINS_3_V212system_clockENS_8durationIxSt5ratioILx1ELx1000000000EEEEE16time_since_epochEv�.eh_frame$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEC1Ey�.eh_frame$_ZNSt24uniform_int_distributionIiEC1Eii�.eh_frame$_ZNSt24uniform_int_distributionIiEclISt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEEEiRT_�.eh_frame$_ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev�.eh_frame$_ZNSaIiED2Ev�.eh_frame$_ZNSt12_Vector_baseIiSaIiEED2Ev�.eh_frame$_ZNSt6vectorIiSaIiEED1Ev�.eh_frame$_ZNSt6vectorIiSaIiEE9push_backERKi�.eh_frame$_ZNSt6vectorIiSaIiEE5beginEv�.eh_frame$_ZNSt6vectorIiSaIiEE3endEv�.eh_frame$_ZN9__gnu_cxxneIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_�.eh_frame$_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEppEv�.eh_frame$_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv�.eh_frame$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EE4seedEy�.eh_frame$_ZNSt24uniform_int_distributionIiE10param_typeC1Eii�.eh_frame$_ZNSt24uniform_int_distributionIiEclISt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEEEiRT_RKNS0_10param_typeE�.eh_frame$_ZNSaIiEC2Ev�.eh_frame$_ZNSt12_Vector_baseIiSaIiEE17_Vector_impl_dataC2Ev�.eh_frame$_ZN9__gnu_cxx13new_allocatorIiED2Ev�.eh_frame$_ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij�.eh_frame$_ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv�.eh_frame$_ZSt8_DestroyIPiiEvT_S1_RSaIT0_E�.eh_frame$_ZNSt16allocator_traitsISaIiEE9constructIiJRKiEEEvRS0_PT_DpOT0_�.eh_frame$_ZNSt6vectorIiSaIiEE17_M_realloc_insertIJRKiEEEvN9__gnu_cxx17__normal_iteratorIPiS1_EEDpOT_�.eh_frame$_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_�.eh_frame$_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv�.eh_frame$_ZNSt8__detail5__modIyLy0ELy1ELy0EEET_S1_�.eh_frame$_ZNSt8__detail5__modIyLy312ELy1ELy0EEET_S1_�.eh_frame$_ZNKSt24uniform_int_distributionIiE10param_type1bEv�.eh_frame$_ZNKSt24uniform_int_distributionIiE10param_type1aEv�.eh_frame$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EEclEv�.eh_frame$_ZN9__gnu_cxx13new_allocatorIiEC2Ev�.eh_frame$_ZNSt16allocator_traitsISaIiEE10deallocateERS0_Pij�.eh_frame$_ZSt8_DestroyIPiEvT_S1_�.eh_frame$_ZSt7forwardIRKiEOT_RNSt16remove_referenceIS2_E4typeE�.eh_frame$_ZN9__gnu_cxx13new_allocatorIiE9constructIiJRKiEEEvPT_DpOT0_�.eh_frame$_ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc�.eh_frame$_ZN9__gnu_cxxmiIPiSt6vectorIiSaIiEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_�.eh_frame$_ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj�.eh_frame$_ZNSt6vectorIiSaIiEE11_S_relocateEPiS2_S2_RS0_�.eh_frame$_ZNSt8__detail4_ModIyLy0ELy1ELy0ELb1ELb0EE6__calcEy�.eh_frame$_ZNSt8__detail4_ModIyLy312ELy1ELy0ELb1ELb1EE6__calcEy�.eh_frame$_ZNSt23mersenne_twister_engineIyLj64ELj312ELj156ELj31ELy13043109905998158313ELj29ELy6148914691236517205ELj17ELy8202884508482404352ELj37ELy18444473444759240704ELj43ELy6364136223846793005EE11_M_gen_randEv�.eh_frame$_ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij�.eh_frame$_ZNSt12_Destroy_auxILb1EE9__destroyIPiEEvT_S3_�.eh_frame$_ZNKSt6vectorIiSaIiEE8max_sizeEv�.eh_frame$_ZNKSt6vectorIiSaIiEE4sizeEv�.eh_frame$_ZNSt16allocator_traitsISaIiEE8allocateERS0_j�.eh_frame$_ZNSt6vectorIiSaIiEE14_S_do_relocateEPiS2_S2_RS0_St17integral_constantIbLb1EE�.eh_frame$_ZNSt6vectorIiSaIiEE11_S_max_sizeERKS0_�.eh_frame$_ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv�.eh_frame$_ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv�.eh_frame$_ZSt12__relocate_aIPiS0_SaIiEET0_T_S3_S2_RT1_�.eh_frame$_ZNSt16allocator_traitsISaIiEE8max_sizeERKS0_�.eh_frame$_ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv�.eh_frame$_ZSt12__niter_baseIPiET_S1_�.eh_frame$_ZSt14__relocate_a_1IiiENSt9enable_ifIXsrSt24__is_bitwise_relocatableIT_vE5valueEPS2_E4typeES4_S4_S4_RSaIT0_E�A_Children_and_Candies_ABC_Edit_.cpp�__setargv�___cpu_features_init�___do_global_dtors�___do_global_ctors�___dyn_tls_init@12�___tlregdtor�____w64_mingwthr_add_key_dtor�____w64_mingwthr_remove_key_dtor�___mingw_TLScallback�__pei386_runtime_relocator�_fesetenv�___mingw_aligned_free�___mingw_free�___mingw_glob�___mingw_globfree�___mingw_dirname�___mingw_opendir�___mingw_readdir�___mingw_closedir�___mingw_rewinddir�___mingw_telldir�___mingw_seekdir�___mingw_memalign_base�___mingw_realloc�___mingw_memalign_realloc�.debug_info�.debug_abbrev�.debug_line�.debug_aranges�.debug_str�.debug_frame�___FRAME_END__�_register_frame_ctor�.text.startup�.ctors.65535�.rdata_runtime_pseudo_reloc�___moddi3�___msvcrt_free�__imp__FindFirstFileA@8�_VirtualProtect@16�__ZSt20__throw_length_errorPKc�__imp___Znwj�___RUNTIME_PSEUDO_RELOC_LIST__�__imp___fullpath�_FindFirstFileA@8�__imp___setmode�__data_start__�_FreeLibrary@4�___DTOR_LIST__�__imp__VirtualProtect@16�__imp___onexit�___p__fmode�__imp__GetLastError@0�_SetUnhandledExceptionFilter@4�__imp__VirtualQuery@12�__fu3___ZSt4cout�__imp____register_frame_info�__nm___ZSt4cout�__imp__FindNextFileA@8�___tls_start__�__imp__TlsGetValue@4�__libmsvcrt_a_iname�__imp__InitializeCriticalSection@4�_DeleteCriticalSection@4�__rt_psrelocs_start�__imp__abort�__dll_characteristics__�__size_of_stack_commit__�___msvcrt_realloc�__size_of_stack_reserve__�__major_subsystem_version__�___crt_xl_start__�___crt_xi_start__�___crt_xi_end__�__imp__stricoll�__imp____mb_cur_max�__imp___ZNSt8ios_base15sync_with_stdioEb�_GetLastError@0�__imp____p__environ�__imp___pctype�__imp___ZSt3cin�__ZNSt9basic_iosIcSt11char_traitsIcEE3tieEPSo�_VirtualQuery@12�__imp____msvcrt_realloc�__imp___ZSt17__throw_bad_allocv�_mingw_initltsdrot_force�__imp___iob�__ZNSt8ios_base4InitC1Ev�_GetModuleHandleA@4�___register_frame_info�__libmoldname_a_iname�_hmod_libgcc�.weak.___register_frame_info.___EH_FRAME_BEGIN__�__imp____deregister_frame_info�__imp__strdup�__imp___isctype�__bss_start__�___RUNTIME_PSEUDO_RELOC_LIST_END__�__fpreset�__size_of_heap_commit__�___umoddi3�_libgcc_s_dw2_1_dll_iname�__imp___errno�__imp__srand�___p__environ�__imp__GetProcAddress@8�_GetProcAddress@8�___crt_xp_start__�__imp__wcstombs�_GetCommandLineA@0�__imp___ZNSt8ios_base4InitD1Ev�__fu4___ZSt3cin�___crt_xp_end__�__imp__signal�__minor_os_version__�__imp__atexit�___udivdi3�__imp__mbstowcs�__ZSt4cout�__head_libmsvcrt_a�__image_base__�__nm___ZSt3cin�__isctype�__section_alignment__�_LoadLibraryA@4�__imp__memmove�__fu2___ZSt3cin�_wcstombs�__imp__FreeLibrary@4�__IAT_end__�__head_libmoldname_a�__RUNTIME_PSEUDO_RELOC_LIST__�_setlocale�__imp____p__fmode�__imp____umoddi3�__tls_start�_ExitProcess@4�__imp__strcoll�__data_end__�___getmainargs�_FindClose@4�__CTOR_LIST__�_mbstowcs�__ZNSirsERi�___set_app_type�__bss_end__�__CRT_fmode�___crt_xc_end__�__tls_index�__imp___ZNSt8ios_base4InitC1Ev�__ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_�___crt_xc_start__�__imp____msvcrt_free�__head_libstdc___6_dll�___CTOR_LIST__�__rt_psrelocs_size�__imp____udivdi3�__imp___ZNSolsEPFRSoS_E�__imp__memcpy�_FindNextFileA@8�__file_alignment__�__imp___ZdlPv�__imp__LeaveCriticalSection@4�__imp__malloc�__head_libgcc_s_dw2_1_dll�___mingw_memalign_lwm�___EH_FRAME_BEGIN__�__major_os_version__�__IAT_start__�_stricoll�__tls_end�__imp___ZNSt6chrono3_V212system_clock3nowEv�__imp__GetModuleHandleA@4�__DTOR_LIST__�__imp___fpreset�.weak.___deregister_frame_info.___EH_FRAME_BEGIN__�_EnterCriticalSection@4�__imp___ZNSirsERx�__fullpath�__size_of_heap_reserve__�___crt_xt_start__�___ImageBase�__subsystem__�__imp__strlen�__CRT_fenv�__imp__calloc�__fu1___ZSt4cout�__ZSt17__throw_bad_allocv�__ZNSt6chrono3_V212system_clock3nowEv�__ZNSolsEx�__imp____getmainargs�___tls_end__�__imp__ExitProcess@4�_mingw_initltssuo_force�__imp___ZNSirsERi�_InitializeCriticalSection@4�___cpu_features�__imp__SetUnhandledExceptionFilter@4�__ZNSirsERx�___deregister_frame_info�__imp___ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_�__major_image_version__�__loader_flags__�__imp__tolower�__CRT_glob�___gxx_personality_v0�__setmode�_libstdc___6_dll_iname�___chkstk_ms�__head_libkernel32_a�__rt_psrelocs_end�__imp___cexit�__imp___ZSt20__throw_length_errorPKc�__minor_subsystem_version__�__imp__FindClose@4�__minor_image_version__�__imp__vfprintf�__imp___ZNSolsEx�__imp___ZNSt9basic_iosIcSt11char_traitsIcEE3tieEPSo�__fu0___ZSt3cin�__imp____set_app_type�__imp____moddi3�__ZNSt8ios_base15sync_with_stdioEb�_mingw_initltsdyn_force�_TlsGetValue@4�__imp__DeleteCriticalSection@4�_LeaveCriticalSection@4�__imp__GetCommandLineA@0�__imp__LoadLibraryA@4�__ZNSolsEPFRSoS_E�__imp__setlocale�__imp___ZSt4cout�__RUNTIME_PSEUDO_RELOC_LIST_END__�__libkernel32_a_iname�___dyn_tls_init_callback�__tls_used�__ZNSt8ios_base4InitD1Ev�___crt_xt_end__�__imp___msize�_vfprintf�__imp__EnterCriticalSection@4�__ZSt3cin�__imp__fwrite�__imp____gxx_personality_v0�
|
a.cc:1:5: error: stray '\3' in program
1 | MZ<U+FFFD><U+FFFD><U+0003><U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+000E><U+001F><U+FFFD><U+000E><U+FFFD><U+FFFD> <U+FFFD>!<U+FFFD><U+0001>L<U+FFFD>!This program cannot be run in DOS mode.
| ^~~~~~~~
a.cc:1:9: error: stray '\4' in program
1 | MZ<U+FFFD><U+FFFD><U+0003><U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+000E><U+001F><U+FFFD><U+000E><U+FFFD><U+FFFD> <U+FFFD>!<U+FFFD><U+0001>L<U+FFFD>!This program cannot be run in DOS mode.
| ^~~~~~~~
a.cc:1:25: error: stray '@' in program
1 | MZ��������������������@��������������������������������������� ��� �!�L�!This program cannot be run in DOS mode.
| ^
a.cc:1:65: error: stray '\16' in program
1 | MZ<U+FFFD><U+FFFD><U+0003><U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+000E><U+001F><U+FFFD><U+000E><U+FFFD><U+FFFD> <U+FFFD>!<U+FFFD><U+0001>L<U+FFFD>!This program cannot be run in DOS mode.
| ^~~~~~~~
a.cc:1:66: error: stray '\37' in program
1 | MZ<U+FFFD><U+FFFD><U+0003><U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+000E><U+001F><U+FFFD><U+000E><U+FFFD><U+FFFD> <U+FFFD>!<U+FFFD><U+0001>L<U+FFFD>!This program cannot be run in DOS mode.
| ^~~~~~~~
a.cc:1:68: error: stray '\16' in program
1 | MZ<U+FFFD><U+FFFD><U+0003><U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+000E><U+001F><U+FFFD><U+000E><U+FFFD><U+FFFD> <U+FFFD>!<U+FFFD><U+0001>L<U+FFFD>!This program cannot be run in DOS mode.
| ^~~~~~~~
a.cc:1:76: error: stray '\1' in program
1 | MZ<U+FFFD><U+FFFD><U+0003><U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+000E><U+001F><U+FFFD><U+000E><U+FFFD><U+FFFD> <U+FFFD>!<U+FFFD><U+0001>L<U+FFFD>!This program cannot be run in DOS mode.
| ^~~~~~~~
a.cc:3:14: error: stray '\1' in program
3 | $<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>PE<U+FFFD><U+FFFD>L<U+0001><U+000E><U+FFFD>,-Z_<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+001E><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+0007><U+0001><U+000B><U+0001><U+0002> <U+FFFD>F<U+FFFD><U+FFFD><U+FFFD>z<U+FFFD><U+FFFD><U+FFFD>JI<U+FFFD><U+FFFD><U+0012><U+FFFD><U+FFFD><U+FFFD><U+0010><U+FFFD><U+FFFD><U+FFFD>`<U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD><U+FFFD><U+0010><U+FFFD><U+FFFD><U+FFFD><U+0002><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+0001><U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>J<U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD>r<U+0013><U+0002><U+FFFD><U+0003><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD> <U+FFFD><U+FFFD><U+0010><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+0010><U+FFFD><U+FFFD><U+0010><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+0010><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>I<U+FFFD>X <U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+0004><U+0010>J<U+FFFD><U+0018><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>I<U+FFFD>@<U+0001><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>.text<U+FFFD><U+FFFD><U+FFFD>@E<U+FFFD><U+FFFD><U+FFFD><U+0010><U+FFFD><U+FFFD><U+FFFD>F<U+FFFD><U+FFFD><U+FFFD><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>`<U+FFFD>P`.data<U+FFFD><U+FFFD><U+FFFD><U+0018><U+FFFD><U+FFFD><U+FFFD><U+FFFD>`<U+FFFD><U+FFFD><U+FFFD><U+0002><U+FFFD><U+FFFD><U+FFFD>J<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD>0<U+FFFD>.rdata<U+FFFD><U+FFFD><U+FFFD><U+0007><U+FFFD><U+FFFD><U+FFFD>p<U+FFFD><U+FFFD><U+FFFD><U+0008><U+FFFD><U+FFFD><U+FFFD>L<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD>0@/4<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+001A><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+001C><U+FFFD><U+FFFD><U+FFFD>T<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>@<U+FFFD>0@.bss<U+FFFD><U+FFFD><U+FFFD><U+FFFD>tHI<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>`<U+FFFD>.idata<U+FFFD><U+FFFD>X <U+FFFD><U+FFFD><U+FFFD><U+FFFD>I<U+FFFD><U+FFFD>
| ^~~~~~~~
a.cc:3:15: error: stray '\16' in program
3 | $<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+FFFD>PE<U+FFFD><U+FFFD>L<U+0001><U+000E><U+FFFD>,-Z_<U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+001E><U+0004><U+FFFD><U+FFFD><U+FFFD><U+FFFD><U+0007><U+0001><U+000B><U+0001><U+0002> <U+FFFD>F<U+FFF
|
s778990615
|
p04029
|
C++
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n(n+1)/2 << endl;
}
|
a.cc: In function 'int main()':
a.cc:7:12: error: 'n' cannot be used as a function
7 | cout << n(n+1)/2 << endl;
| ~^~~~~
|
s810081352
|
p04029
|
Java
|
import java.util.*;
import java.io.*;
public class Main{
public static void main(String `[]args){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int [] arr = new int[n];
for(int i=0;i<n;i++)
arr[i] = scanner.nextInt();
int d =0;
if((arr[0]+arr[n-1])%2==0)
d =(((arr[0]+arr[n-1])/2));
else
d =(((arr[0]+arr[n-1])/2))+1;
int sum=0;
for(int i=0;i<n;i++)
sum = sum+(int) Math.pow((arr[i]-d),2);
System.out.println(sum);
//System.out.println()
//for(int i=0;i<n;i++)
}
}
|
Main.java:7: error: illegal character: '`'
public static void main(String `[]args){
^
1 error
|
s265608598
|
p04029
|
C++
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,c=0;
cin >> n;
for(i = 1; i <= n ; i++) c += i ;
cout << c;
}
|
a.cc: In function 'int main()':
a.cc:7:7: error: 'i' was not declared in this scope
7 | for(i = 1; i <= n ; i++) c += i ;
| ^
|
s545580492
|
p04029
|
C++
|
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll n;
cin << n*(n+1)/2 << endl;
}
|
a.cc: In function 'int main()':
a.cc:18:7: error: no match for 'operator<<' (operand types are 'std::istream' {aka 'std::basic_istream<char>'} and 'long long int')
18 | cin << n*(n+1)/2 << endl;
| ~~~ ^~ ~~~~~~~~~
| | |
| | long long int
| std::istream {aka std::basic_istream<char>}
a.cc:18:7: note: candidate: 'operator<<(int, long long int)' (built-in)
18 | cin << n*(n+1)/2 << endl;
| ~~~~^~~~~~~~~~~~
a.cc:18:7: note: no known conversion for argument 1 from 'std::istream' {aka 'std::basic_istream<char>'} to 'int'
In file included from /usr/include/c++/14/regex:68,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:181,
from a.cc:1:
/usr/include/c++/14/bits/regex.h:1715:5: note: candidate: 'template<class _Ch_type, class _Ch_traits, class _Bi_iter> std::basic_ostream<_CharT, _Traits>& std::__cxx11::operator<<(std::basic_ostream<_CharT, _Traits>&, const sub_match<_Bi_iter>&)'
1715 | operator<<(basic_ostream<_Ch_type, _Ch_traits>& __os,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1715:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:41:
/usr/include/c++/14/cstddef:125:5: note: candidate: 'template<class _IntegerType> constexpr std::__byte_op_t<_IntegerType> std::operator<<(byte, _IntegerType)'
125 | operator<<(byte __b, _IntegerType __shift) noexcept
| ^~~~~~~~
/usr/include/c++/14/cstddef:125:5: note: template argument deduction/substitution failed:
a.cc:18:3: note: cannot convert 'std::cin' (type 'std::istream' {aka 'std::basic_istream<char>'}) to type 'std::byte'
18 | cin << n*(n+1)/2 << endl;
| ^~~
In file included from /usr/include/c++/14/bits/basic_string.h:47,
from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/string_view:763:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, basic_string_view<_CharT, _Traits>)'
763 | operator<<(basic_ostream<_CharT, _Traits>& __os,
| ^~~~~~~~
/usr/include/c++/14/string_view:763:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/bits/basic_string.h:4077:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, const __cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
4077 | operator<<(basic_ostream<_CharT, _Traits>& __os,
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.h:4077:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/bitset:1687:5: note: candidate: 'template<class _CharT, class _Traits, long unsigned int _Nb> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, const bitset<_Nb>&)'
1687 | operator<<(std::basic_ostream<_CharT, _Traits>& __os,
| ^~~~~~~~
/usr/include/c++/14/bitset:1687:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
In file included from /usr/include/c++/14/bits/ios_base.h:46,
from /usr/include/c++/14/streambuf:43,
from /usr/include/c++/14/bits/streambuf_iterator.h:35,
from /usr/include/c++/14/iterator:66,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:54:
/usr/include/c++/14/system_error:339:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, const error_code&)'
339 | operator<<(basic_ostream<_CharT, _Traits>& __os, const error_code& __e)
| ^~~~~~~~
/usr/include/c++/14/system_error:339:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
In file included from /usr/include/c++/14/memory:80,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:56:
/usr/include/c++/14/bits/shared_ptr.h:70:5: note: candidate: 'template<class _Ch, class _Tr, class _Tp, __gnu_cxx::_Lock_policy _Lp> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, const __shared_ptr<_Tp, _Lp>&)'
70 | operator<<(std::basic_ostream<_Ch, _Tr>& __os,
| ^~~~~~~~
/usr/include/c++/14/bits/shared_ptr.h:70:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
In file included from /usr/include/c++/14/istream:41,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127:
/usr/include/c++/14/ostream:563:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, _CharT)'
563 | operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c)
| ^~~~~~~~
/usr/include/c++/14/ostream:563:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/ostream:573:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, char)'
573 | operator<<(basic_ostream<_CharT, _Traits>& __out, char __c)
| ^~~~~~~~
/usr/include/c++/14/ostream:573:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/ostream:579:5: note: candidate: 'template<class _Traits> std::basic_ostream<char, _Traits>& std::operator<<(basic_ostream<char, _Traits>&, char)'
579 | operator<<(basic_ostream<char, _Traits>& __out, char __c)
| ^~~~~~~~
/usr/include/c++/14/ostream:579:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<char, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/ostream:590:5: note: candidate: 'template<class _Traits> std::basic_ostream<char, _Traits>& std::operator<<(basic_ostream<char, _Traits>&, signed char)'
590 | operator<<(basic_ostream<char, _Traits>& __out, signed char __c)
| ^~~~~~~~
/usr/include/c++/14/ostream:590:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<char, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/ostream:595:5: note: candidate: 'template<class _Traits> std::basic_ostream<char, _Traits>& std::operator<<(basic_ostream<char, _Traits>&, unsigned char)'
595 | operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c)
| ^~~~~~~~
/usr/include/c++/14/ostream:595:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<char, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/ostream:654:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, const _CharT*)'
654 | operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s)
| ^~~~~~~~
/usr/include/c++/14/ostream:654:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
In file included from /usr/include/c++/14/ostream:1022:
/usr/include/c++/14/bits/ostream.tcc:307:5: note: candidate: 'template<class _CharT, class _Traits> std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, const char*)'
307 | operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s)
| ^~~~~~~~
/usr/include/c++/14/bits/ostream.tcc:307:5: note: template argument deduction/substitution failed:
a.cc:18:18: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::basic_ostream<_CharT, _Traits>'
18 | cin << n*(n+1)/2 << endl;
| ^
/usr/include/c++/14/ostream:671:5: note: candidate: 'template<class _Traits> std::basic_ostream<char, _Traits>& std::operator<<(basic_ostream<char, _Traits>&, const char*)'
671 | operator<<(basic_ostream<char, _Traits>& __out, const char* __s)
| ^~~~~~~~
/us
|
s005071195
|
p04029
|
C++
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i =a; i < b; i++)
#define all(a) a.begin(), a.end()
#define PI 3.14159265359
static const int INF = 1e9+7;
typedef long long ll;
using namespace std;
int main()
{
string s;
cin>>s;
string st;
int n=s.length();
rep(i,n)
{
if(s[i]=='1'){
st=st+s[i];
}
if(s[i]=='0')
{
st=st+s[i];
}
if(s[i]=='B'&&s!="")
{
st.pop_back(s[i]);
}
}
cout<<st;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:27:24: error: no matching function for call to 'std::__cxx11::basic_string<char>::pop_back(__gnu_cxx::__alloc_traits<std::allocator<char>, char>::value_type&)'
27 | st.pop_back(s[i]);
| ~~~~~~~~~~~^~~~~~
In file included from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
from a.cc:1:
/usr/include/c++/14/bits/basic_string.h:2174:7: note: candidate: 'void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::pop_back() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>]'
2174 | pop_back() noexcept
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.h:2174:7: note: candidate expects 0 arguments, 1 provided
|
s098209934
|
p04029
|
C++
|
#include<bits/stdc++>h>
using namespace std;
int main(){
int n;
cin>>n;
int x=0;
for(int i=1;i<=n;i++){
x+=i;
}
cout<<x<<endl;
}
|
a.cc:1:23: warning: extra tokens at end of #include directive
1 | #include<bits/stdc++>h>
| ^
a.cc:1:9: fatal error: bits/stdc++>: No such file or directory
1 | #include<bits/stdc++>h>
| ^~~~~~~~~~~~~~
compilation terminated.
|
s825332422
|
p04029
|
C++
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n(n+1))/2 << endl;
}
|
a.cc: In function 'int main()':
a.cc:7:13: error: 'n' cannot be used as a function
7 | cout << (n(n+1))/2 << endl;
| ~^~~~~
|
s941234878
|
p04029
|
C++
|
#include <iostream>
int main()
{
int num, sum = 0;
cin << num;
for(int i = 1; i <= num; i++)
{
sum += i;
}
cout << sum << endl;
return 0;
}
|
a.cc: In function 'int main()':
a.cc:6:3: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
6 | cin << num;
| ^~~
| std::cin
In file included from a.cc:1:
/usr/include/c++/14/iostream:62:18: note: 'std::cin' declared here
62 | extern istream cin; ///< Linked to standard input
| ^~~
a.cc:11:3: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
11 | cout << sum << endl;
| ^~~~
| std::cout
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
63 | extern ostream cout; ///< Linked to standard output
| ^~~~
a.cc:11:18: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
11 | cout << sum << endl;
| ^~~~
| std::endl
In file included from /usr/include/c++/14/iostream:41:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
744 | endl(basic_ostream<_CharT, _Traits>& __os)
| ^~~~
|
s983934450
|
p04029
|
C++
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
string s;
cin>>s;
vector<char> v;
for(char ch: s) {
if(ch != 'B')v.push_back(ch);
else if(v.size() > 1) v.pop_back();
}
|
a.cc: In function 'int main()':
a.cc:15:2: error: expected '}' at end of input
15 | }
| ^
a.cc:8:1: note: to match this '{'
8 | {
| ^
|
s214609230
|
p04029
|
C++
|
#include <stdio.h>
#include <string.h>
int main(){
char a[11];
scanf("%s",a);
for(int i=0;i<strlen(a);i++){
int db=0;
if(a[i]=='B'&&i!=0){
int j=i;
int k=1;
while(a[j]=='B'){
a[i-k]='B';
k++;
j++
}
db++
}
}
for(int i=0;i<strlen(a);i++){
if(s[i]!='B'){
printf("%c",s[i])
}
}
return 0;
}
|
a.cc: In function 'int main()':
a.cc:15:36: error: expected ';' before '}' token
15 | j++
| ^
| ;
16 | }
| ~
a.cc:17:29: error: expected ';' before '}' token
17 | db++
| ^
| ;
18 | }
| ~
a.cc:21:20: error: 's' was not declared in this scope
21 | if(s[i]!='B'){
| ^
|
s945430239
|
p04029
|
C++
|
#include <stdio.h> int main() { int N; scanf("%d", &N); printf("%d\n", N*(N+1)/2); return 0;}
|
a.cc:1:20: warning: extra tokens at end of #include directive
1 | #include <stdio.h> int main() { int N; scanf("%d", &N); printf("%d\n", N*(N+1)/2); return 0;}
| ^~~
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.