Round trip SPOC dataset parsing and code generation.log

/home/ernwong/anaconda3/envs/NL2code/bin/python /home/ernwong/Downloads/Software/PyCharm/pycharm-professional-2020.1.1/pycharm-2020.1.1/plugins/python/helpers/pydev/pydevconsole.py --mode=client --port=44163

import sys; print('Python %s on %s' % (sys.version, sys.platform))
sys.path.extend(['/home/ernwong/uni/se700/part4project/NL2code'])

PyDev console: starting.

Python 2.7.17 |Anaconda, Inc.| (default, Oct 21 2019, 19:04:46) 
[GCC 7.3.0] on linux2
>>> runfile('/home/ernwong/uni/se700/part4project/cpp_parser.py', wdir='/home/ernwong/uni/se700/part4project')


Found program (worker: 38, probid: 13A, subid: 41120785)

int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}
int main() {
int n, nn, ans = 0;
cin >> n;
for (int i = 2; i <= n - 1; ++i) {
nn = n;
while (nn) ans += nn % i, nn /= i;
}
int o = gcd(ans, n - 2);
cout << ans / o << "/" << (n - 2) / o << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}

int main() {
int n, nn, ans = 0;
cin >> n;
for (int i = 2; i <= n - 1; ++i) {
nn = n;
while (nn) ans += nn % i , nn /= i;
}
int o = gcd(ans, n - 2);
cout << ans / o << "/" << (n - 2) / o << "\n";
return 0;
}




Found program (worker: 54, probid: 13A, subid: 41120785)

int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}
int main() {
int n, nn, ans = 0;
cin >> n;
for (int i = 2; i <= n - 1; ++i) {
nn = n;
while (nn) ans += nn % i, nn /= i;
}
int o = gcd(ans, n - 2);
cout << ans / o << "/" << (n - 2) / o << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}

int main() {
int n, nn, ans = 0;
cin >> n;
for (int i = 2; i <= n - 1; ++i) {
nn = n;
while (nn) ans += nn % i , nn /= i;
}
int o = gcd(ans, n - 2);
cout << ans / o << "/" << (n - 2) / o << "\n";
return 0;
}




Found program (worker: 54, probid: 44A, subid: 34539187)

int main() {
string a, b;
int n;
set<string> st;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
st.insert(a + " " + b);
}
cout << st.size() << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes
missing: CXXBindTemporaryExpr

Generating code for tree
using namespace std;
int main() {
string a, b;
int n;
set<string> st;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
st.insert();
}
cout << st.size() << endl;
return 0;
}




Found program (worker: 54, probid: 13A, subid: 41576259)

int main() {
int n, m, su = 0, su2 = 0, a, b, c;
cin >> n;
m = n;
for (int i = 2; i < n; i++) {
while (n > 0) {
su += n % i;
n = n / i;
}
n = m;
}
c = su;
a = su;
m = m - 2;
b = m;
su2 = su % b;
while (su2 > 0) {
su = b;
b = su2;
su2 = su % b;
}
cout << c / b << "/" << m / b << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, m, su = 0, su2 = 0, a, b, c;
cin >> n;
m = n;
for (int i = 2; i < n; i++) {
while (n > 0) {
su += n % i;
n = n / i;
}
n = m;
}
c = su;
a = su;
m = m - 2;
b = m;
su2 = su % b;
while (su2 > 0) {
su = b;
b = su2;
su2 = su % b;
}
cout << c / b << "/" << m / b << endl;
return 0;
}




Found program (worker: 01, probid: 24A, subid: 44254490)

int gcd1(int a, int b) {
if (a == 0) return b;
return gcd1(b % a, a);
}
long long modx(long long base, long long ex) {
long long ans = 1LL, val = base;
while (ex > 0LL) {
if (ex & 1LL) ans = (ans * val) % 1000000009LL;
val = (val * val) % 1000000009LL;
ex = ex >> 1LL;
}
return ans;
}
int ans1 = 0, ans2 = 0;
int n, a, b, c;
const int maxn = 105;
bool visit[maxn];
vector<int> adj[maxn];
int dist[maxn][maxn];
vector<int> v;
void dfs(int start) {
visit[start] = true;
v.push_back(start);
for (int i = 0; i < adj[start].size(); i++) {
int pt = adj[start][i];
if (!visit[pt]) dfs(pt);
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a >> b >> c;
adj[a].push_back(b);
adj[b].push_back(a);
dist[b][a] = c;
}
dfs(1);
for (int i = 0; i < v.size(); i++) { ans1 += dist[v[i]][v[(i + 1) % n]]; }
for (int i = v.size() - 1; i >= 0; i--) {
if (i == 0)
ans2 += dist[v[i]][v[v.size() - 1]];
else
ans2 += dist[v[i]][v[i - 1]];
}
cout << min(ans1, ans2) << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int gcd1(int a, int b) {
if (a == 0) return b;
return gcd1(b % a, a);
}

long long modx(long long base, long long ex) {
long long ans = 1, val = base;
while (ex > 0) {
if (ex & 1) ans = (ans * val) % 1000000009;
val = (val * val) % 1000000009;
ex = ex >> 1;
}
return ans;
}

int ans1 = 0;
int ans2 = 0;
int n;
int a;
int b;
int c;
const int maxn = 105;
bool visit[105];
vector<int> adj[105];
int dist[105];
vector<int> v;
void dfs(int start) {
visit[start] = True;
v.push_back(start);
for (int i = 0; i < adj[start].size(); i++) {
int pt = adj[start][i];
if (!visit[pt]) dfs(pt);
}
}

int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a >> b >> c;
adj[a].push_back(b);
adj[b].push_back(a);
dist[b][a] = c;
}
dfs(1);
for (int i = 0; i < v.size(); i++) {
ans1 += dist[v[i]][v[(i + 1) % n]];
}
for (int i = v.size() - 1; i >= 0; i--) {
if (i == 0) ans2 += dist[v[i]][v[v.size() - 1]];
 else ans2 += dist[v[i]][v[i - 1]]}
cout << min(ans1, ans2) << endl;
return 0;
}




Found program (worker: 01, probid: 44A, subid: 37308623)

map<string, int> m;
map<string, int>::iterator it;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 1;
}
int ans = 0;
for (it = m.begin(); it != m.end(); it++) { ans++; }
cout << ans << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<string, int> m;
map<string, int>::iterator it;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 1;
}
int ans = 0;
for (it = m.begin(); it != m.end(); it ++ 0) {
ans++;
}
cout << ans << endl;
}




Found program (worker: 54, probid: 13A, subid: 45417071)

int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}




Found program (worker: 01, probid: 13A, subid: 45417071)

int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}




Found program (worker: 54, probid: 44A, subid: 44028823)

string s, s1;
set<string> se;
int main() {
int i, j, k;
int n, m;
cin >> n;
for (i = 0; i < n; i++) cin >> s >> s1, s += ' ', s += s1, se.insert(s);
cout << se.size() << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
string s;
string s1;
set<string> se;
int main() {
int i, j, k;
int n, m;
cin >> n;
for (i = 0; i < n; i++) cin >> s >> s1 , s += ' ' , s += s1 , se.insert(s);
cout << se.size() << endl;
}




Found program (worker: 01, probid: 44A, subid: 44028823)

string s, s1;
set<string> se;
int main() {
int i, j, k;
int n, m;
cin >> n;
for (i = 0; i < n; i++) cin >> s >> s1, s += ' ', s += s1, se.insert(s);
cout << se.size() << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
string s;
string s1;
set<string> se;
int main() {
int i, j, k;
int n, m;
cin >> n;
for (i = 0; i < n; i++) cin >> s >> s1 , s += ' ' , s += s1 , se.insert(s);
cout << se.size() << endl;
}




Found program (worker: 01, probid: 13A, subid: 41576064)

int main() {
int n, m, su = 0, su2 = 0, a, b, c;
cin >> n;
m = n;
for (int i = 2; i < n; i++) {
while (n > 0) {
su += n % i;
n = n / i;
}
n = m;
}
c = su;
a = su;
m = m - 2;
b = m;
su2 = su % b;
while (su2 > 0) {
su = b;
b = su2;
su2 = su % b;
}
cout << c / b << "/" << m / b << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, m, su = 0, su2 = 0, a, b, c;
cin >> n;
m = n;
for (int i = 2; i < n; i++) {
while (n > 0) {
su += n % i;
n = n / i;
}
n = m;
}
c = su;
a = su;
m = m - 2;
b = m;
su2 = su % b;
while (su2 > 0) {
su = b;
b = su2;
su2 = su % b;
}
cout << c / b << "/" << m / b << endl;
return 0;
}




Found program (worker: 54, probid: 13A, subid: 41576064)

int main() {
int n, m, su = 0, su2 = 0, a, b, c;
cin >> n;
m = n;
for (int i = 2; i < n; i++) {
while (n > 0) {
su += n % i;
n = n / i;
}
n = m;
}
c = su;
a = su;
m = m - 2;
b = m;
su2 = su % b;
while (su2 > 0) {
su = b;
b = su2;
su2 = su % b;
}
cout << c / b << "/" << m / b << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, m, su = 0, su2 = 0, a, b, c;
cin >> n;
m = n;
for (int i = 2; i < n; i++) {
while (n > 0) {
su += n % i;
n = n / i;
}
n = m;
}
c = su;
a = su;
m = m - 2;
b = m;
su2 = su % b;
while (su2 > 0) {
su = b;
b = su2;
su2 = su % b;
}
cout << c / b << "/" << m / b << endl;
return 0;
}




Found program (worker: 28, probid: 44A, subid: 41955968)

string s1[110], s2[110];
int n, ans, book[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> s1[i] >> s2[i];
for (int i = 0; i < n; ++i) {
int ok = 1;
for (int j = 0; j < n; ++j) {
if (i == j) continue;
if (s1[i] == s1[j] && s2[i] == s2[j]) {
if (book[j]) {
ok = 0;
break;
}
}
}
book[i] = 1;
ans += ok;
}
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
string s1[110];
string s2[110];
int n;
int ans;
int book[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> s1[i] >> s2[i];
for (int i = 0; i < n; ++i) {
int ok = 1;
for (int j = 0; j < n; ++j) {
if (i == j) continue;
if (s1[i] == s1[j] && s2[i] == s2[j]) {
if (book[j]) {
ok = 0;
break;
}
}
}
book[i] = 1;
ans += ok;
}
cout << ans << endl;
return 0;
}




Found program (worker: 54, probid: 44A, subid: 41955968)

string s1[110], s2[110];
int n, ans, book[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> s1[i] >> s2[i];
for (int i = 0; i < n; ++i) {
int ok = 1;
for (int j = 0; j < n; ++j) {
if (i == j) continue;
if (s1[i] == s1[j] && s2[i] == s2[j]) {
if (book[j]) {
ok = 0;
break;
}
}
}
book[i] = 1;
ans += ok;
}
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
string s1[110];
string s2[110];
int n;
int ans;
int book[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> s1[i] >> s2[i];
for (int i = 0; i < n; ++i) {
int ok = 1;
for (int j = 0; j < n; ++j) {
if (i == j) continue;
if (s1[i] == s1[j] && s2[i] == s2[j]) {
if (book[j]) {
ok = 0;
break;
}
}
}
book[i] = 1;
ans += ok;
}
cout << ans << endl;
return 0;
}




Found program (worker: 54, probid: 24A, subid: 41578417)

int num[105][105];
int vis[105];
int n;
int counts;
int en;
void dfs(int k) {
en = k;
if (k == 1 && vis[1] == 1) return;
vis[k] = 1;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
if (num[k][i] == -1) {
if (num[i][k] != -1) {
counts += num[i][k];
dfs(i);
}
} else {
dfs(i);
}
}
}
}
int main() {
int x, y, l;
int sum;
while (cin >> n) {
sum = 0;
memset(num, -1, sizeof(num));
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++) {
cin >> x >> y >> l;
num[x][y] = l;
sum += l;
}
counts = 0;
dfs(1);
if (num[en][1] == -1) counts += num[1][en];
cout << min(counts, sum - counts) << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int num[105];
int vis[105];
int n;
int counts;
int en;
void dfs(int k) {
en = k;
if (k == 1 && vis[1] == 1) return ;
vis[k] = 1;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
if (num[k][i] == -1) {
if (num[i][k] != -1) {
counts += num[i][k];
dfs(i);
}
}
 else {
dfs(i);
}
}
}
}

int main() {
int x, y, l;
int sum;
while (cin >> n.operator bool()) {
sum = 0;
memset(num, -1, sizeof (num));
memset(vis, 0, sizeof (vis));
for (int i = 0; i < n; i++) {
cin >> x >> y >> l;
num[x][y] = l;
sum += l;
}
counts = 0;
dfs(1);
if (num[en][1] == -1) counts += num[1][en];
cout << min(counts, sum - counts) << endl;
}
}




Found program (worker: 01, probid: 24A, subid: 41578417)

int num[105][105];
int vis[105];
int n;
int counts;
int en;
void dfs(int k) {
en = k;
if (k == 1 && vis[1] == 1) return;
vis[k] = 1;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
if (num[k][i] == -1) {
if (num[i][k] != -1) {
counts += num[i][k];
dfs(i);
}
} else {
dfs(i);
}
}
}
}
int main() {
int x, y, l;
int sum;
while (cin >> n) {
sum = 0;
memset(num, -1, sizeof(num));
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++) {
cin >> x >> y >> l;
num[x][y] = l;
sum += l;
}
counts = 0;
dfs(1);
if (num[en][1] == -1) counts += num[1][en];
cout << min(counts, sum - counts) << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int num[105];
int vis[105];
int n;
int counts;
int en;
void dfs(int k) {
en = k;
if (k == 1 && vis[1] == 1) return ;
vis[k] = 1;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
if (num[k][i] == -1) {
if (num[i][k] != -1) {
counts += num[i][k];
dfs(i);
}
}
 else {
dfs(i);
}
}
}
}

int main() {
int x, y, l;
int sum;
while (cin >> n.operator bool()) {
sum = 0;
memset(num, -1, sizeof (num));
memset(vis, 0, sizeof (vis));
for (int i = 0; i < n; i++) {
cin >> x >> y >> l;
num[x][y] = l;
sum += l;
}
counts = 0;
dfs(1);
if (num[en][1] == -1) counts += num[1][en];
cout << min(counts, sum - counts) << endl;
}
}




Found program (worker: 54, probid: 50A, subid: 48922124)

int main() {
int x, y;
cin >> x >> y;
cout << x * y / 2 << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x * y / 2 << endl;
}




Found program (worker: 01, probid: 50A, subid: 48922124)

int main() {
int x, y;
cin >> x >> y;
cout << x * y / 2 << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x * y / 2 << endl;
}




Found program (worker: 54, probid: 13A, subid: 46345032)

long long gcd(long long a, long long b) {
while (b != 0) {
long long t = b;
b = a % b;
a = t;
}
return a;
}
int main() {
long long a, s, i, j, k, ct, aa, g;
cin >> a;
s = 0;
for (i = 2; i <= a - 1; i++) {
aa = a;
ct = 0;
while (aa > 0) {
ct += aa % i;
aa /= i;
}
s += ct;
}
ct = a - 2;
g = gcd(s, ct);
s /= g;
ct /= g;
cout << s << "/" << ct << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
long long gcd(long long a, long long b) {
while (b != 0) {
long long t = b;
b = a % b;
a = t;
}
return a;
}

int main() {
long long a, s, i, j, k, ct, aa, g;
cin >> a;
s = 0;
for (i = 2; i <= a - 1; i++) {
aa = a;
ct = 0;
while (aa > 0) {
ct += aa % i;
aa /= i;
}
s += ct;
}
ct = a - 2;
g = gcd(s, ct);
s /= g;
ct /= g;
cout << s << "/" << ct << "\n";
return 0;
}




Found program (worker: 01, probid: 13A, subid: 46345032)

long long gcd(long long a, long long b) {
while (b != 0) {
long long t = b;
b = a % b;
a = t;
}
return a;
}
int main() {
long long a, s, i, j, k, ct, aa, g;
cin >> a;
s = 0;
for (i = 2; i <= a - 1; i++) {
aa = a;
ct = 0;
while (aa > 0) {
ct += aa % i;
aa /= i;
}
s += ct;
}
ct = a - 2;
g = gcd(s, ct);
s /= g;
ct /= g;
cout << s << "/" << ct << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
long long gcd(long long a, long long b) {
while (b != 0) {
long long t = b;
b = a % b;
a = t;
}
return a;
}

int main() {
long long a, s, i, j, k, ct, aa, g;
cin >> a;
s = 0;
for (i = 2; i <= a - 1; i++) {
aa = a;
ct = 0;
while (aa > 0) {
ct += aa % i;
aa /= i;
}
s += ct;
}
ct = a - 2;
g = gcd(s, ct);
s /= g;
ct /= g;
cout << s << "/" << ct << "\n";
return 0;
}




Found program (worker: 54, probid: 14A, subid: 47851877)

void fastIo() {}
int main() {
fastIo();
int n, m;
cin >> n >> m;
char MAT[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> MAT[i][j];
}
int LC = m, RC = -1, TR = n, BR = -1;
for (int i = 0; i < n; i++) {
bool first = false;
for (int j = 0; j < m; j++) {
if (MAT[i][j] == '*') {
if (!first) {
LC = min(LC, j);
first = true;
}
RC = max(RC, j);
}
}
}
for (int j = 0; j < m; j++) {
bool first = false;
for (int i = 0; i < n; i++) {
if (MAT[i][j] == '*') {
if (!first) { TR = min(TR, i); }
BR = max(BR, i);
}
}
}
for (int i = TR; i <= BR; i++) {
for (int j = LC; j <= RC; j++) { cout << MAT[i][j]; }
cout << '\n';
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
void fastIo() {
}

int main() {
fastIo();
int n, m;
cin >> n >> m;
char MAT[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> MAT[i][j];
}
int LC = m, RC = -1, TR = n, BR = -1;
for (int i = 0; i < n; i++) {
bool first = False;
for (int j = 0; j < m; j++) {
if (MAT[i][j] == '*') {
if (!first) {
LC = min(LC, j);
first = True;
}
RC = max(RC, j);
}
}
}
for (int j = 0; j < m; j++) {
bool first = False;
for (int i = 0; i < n; i++) {
if (MAT[i][j] == '*') {
if (!first) {
TR = min(TR, i);
}
BR = max(BR, i);
}
}
}
for (int i = TR; i <= BR; i++) {
for (int j = LC; j <= RC; j++) {
cout << MAT[i][j];
}
cout << '\n';
}
}




Found program (worker: 54, probid: 24A, subid: 45322935)

int i, n, a, b, c, fa[102][102], p1, p2;
vector<int> v[102];
bool viy[102][2];
void f1(int dg, int msh) {
if (viy[dg][0]) return;
viy[dg][0] = 1;
if (msh != v[dg][0]) {
p1 += fa[v[dg][0]][dg];
f1(v[dg][0], dg);
} else {
p1 += fa[v[dg][1]][dg];
f1(v[dg][1], dg);
}
}
void f2(int dg, int msh) {
if (viy[dg][1]) return;
viy[dg][1] = 1;
if (msh != v[dg][1]) {
p2 += fa[v[dg][1]][dg];
f2(v[dg][1], dg);
} else {
p2 += fa[v[dg][0]][dg];
f2(v[dg][0], dg);
}
}
int main() {
cin >> n;
for (i = 0; i < n; ++i) {
cin >> a >> b >> c;
v[a].push_back(b);
v[b].push_back(a);
fa[b][a] = c;
}
f1(1, 0);
f2(1, 0);
cout << min(p1, p2) << "\n";
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int i;
int n;
int a;
int b;
int c;
int fa[102];
int p1;
int p2;
vector<int> v[102];
bool viy[102];
void f1(int dg, int msh) {
if (viy[dg][0]) return ;
viy[dg][0] = 1;
if (msh != v[dg][0]) {
p1 += fa[v[dg][0]][dg];
f1(v[dg][0], dg);
}
 else {
p1 += fa[v[dg][1]][dg];
f1(v[dg][1], dg);
}
}

void f2(int dg, int msh) {
if (viy[dg][1]) return ;
viy[dg][1] = 1;
if (msh != v[dg][1]) {
p2 += fa[v[dg][1]][dg];
f2(v[dg][1], dg);
}
 else {
p2 += fa[v[dg][0]][dg];
f2(v[dg][0], dg);
}
}

int main() {
cin >> n;
for (i = 0; i < n; ++i) {
cin >> a >> b >> c;
v[a].push_back(b);
v[b].push_back(a);
fa[b][a] = c;
}
f1(1, 0);
f2(1, 0);
cout << min(p1, p2) << "\n";
}




Found program (worker: 54, probid: 44A, subid: 36341322)

set<string> set1;
set<string> set2;
map<string, int> map1;
map<string, int> map2;
int cp[101][101];
int mc1;
int mc2;
int malloc_1(string a) {
if (set1.count(a) != 0) {
return map1[a];
} else {
set1.insert(a);
map1[a] = mc1++;
return map1[a];
}
}
int malloc_2(string a) {
if (set2.count(a) != 0) {
return map2[a];
} else {
set2.insert(a);
map2[a] = mc2++;
return map2[a];
}
}
int main() {
int n;
int cnt = 0;
while (cin >> n) {
cnt = 0;
set1.clear();
set2.clear();
mc1 = mc2 = 0;
map1.clear();
memset(cp, 0, sizeof(cp));
map2.clear();
string a, b;
int c, d;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
c = malloc_1(a);
d = malloc_2(b);
if (cp[c][d] == 0) {
cnt++;
cp[c][d] = 1;
}
}
cout << cnt << endl;
}
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes
missing: CXXBindTemporaryExpr
missing: CXXBindTemporaryExpr

Generating code for tree
using namespace std;
set<string> set1;
set<string> set2;
map<string, int> map1;
map<string, int> map2;
int cp[101];
int mc1;
int mc2;
int malloc_1(string a) {
if (set1.count(a) != 0) {
return map1[a];
}
 else {
set1.insert(a);
map1[a] = mc1++;
return map1[a];
}
}

int malloc_2(string a) {
if (set2.count(a) != 0) {
return map2[a];
}
 else {
set2.insert(a);
map2[a] = mc2++;
return map2[a];
}
}

int main() {
int n;
int cnt = 0;
while (cin >> n.operator bool()) {
cnt = 0;
set1.clear();
set2.clear();
mc1 = mc2 = 0;
map1.clear();
memset(cp, 0, sizeof (cp));
map2.clear();
string a, b;
int c, d;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
c = malloc_1();
d = malloc_2();
if (cp[c][d] == 0) {
cnt++;
cp[c][d] = 1;
}
}
cout << cnt << endl;
}
return 0;
}




Found program (worker: 01, probid: 44A, subid: 36341322)

set<string> set1;
set<string> set2;
map<string, int> map1;
map<string, int> map2;
int cp[101][101];
int mc1;
int mc2;
int malloc_1(string a) {
if (set1.count(a) != 0) {
return map1[a];
} else {
set1.insert(a);
map1[a] = mc1++;
return map1[a];
}
}
int malloc_2(string a) {
if (set2.count(a) != 0) {
return map2[a];
} else {
set2.insert(a);
map2[a] = mc2++;
return map2[a];
}
}
int main() {
int n;
int cnt = 0;
while (cin >> n) {
cnt = 0;
set1.clear();
set2.clear();
mc1 = mc2 = 0;
map1.clear();
memset(cp, 0, sizeof(cp));
map2.clear();
string a, b;
int c, d;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
c = malloc_1(a);
d = malloc_2(b);
if (cp[c][d] == 0) {
cnt++;
cp[c][d] = 1;
}
}
cout << cnt << endl;
}
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes
missing: CXXBindTemporaryExpr
missing: CXXBindTemporaryExpr

Generating code for tree
using namespace std;
set<string> set1;
set<string> set2;
map<string, int> map1;
map<string, int> map2;
int cp[101];
int mc1;
int mc2;
int malloc_1(string a) {
if (set1.count(a) != 0) {
return map1[a];
}
 else {
set1.insert(a);
map1[a] = mc1++;
return map1[a];
}
}

int malloc_2(string a) {
if (set2.count(a) != 0) {
return map2[a];
}
 else {
set2.insert(a);
map2[a] = mc2++;
return map2[a];
}
}

int main() {
int n;
int cnt = 0;
while (cin >> n.operator bool()) {
cnt = 0;
set1.clear();
set2.clear();
mc1 = mc2 = 0;
map1.clear();
memset(cp, 0, sizeof (cp));
map2.clear();
string a, b;
int c, d;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
c = malloc_1();
d = malloc_2();
if (cp[c][d] == 0) {
cnt++;
cp[c][d] = 1;
}
}
cout << cnt << endl;
}
return 0;
}




Found program (worker: 01, probid: 13A, subid: 24912316)

int lcm(int a, int b) {
if (a < b) {
int tem = a;
a = b;
b = tem;
}
if (a % b == 0) {
return b;
} else
return lcm(b, a % b);
}
int main() {
int sum, n, su, i;
while (cin >> n) {
sum = 0;
for (i = 2; i < n; i++) {
su = 0;
int tem = n;
while (tem != 0) {
su += tem % i;
tem = tem / i;
}
sum += su;
}
int re = lcm(sum, n - 2);
cout << sum / re << "/" << (n - 2) / re << endl;
}
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int lcm(int a, int b) {
if (a < b) {
int tem = a;
a = b;
b = tem;
}
if (a % b == 0) {
return b;
}
 else return lcm(b, a % b);
}

int main() {
int sum, n, su, i;
while (cin >> n.operator bool()) {
sum = 0;
for (i = 2; i < n; i++) {
su = 0;
int tem = n;
while (tem != 0) {
su += tem % i;
tem = tem / i;
}
sum += su;
}
int re = lcm(sum, n - 2);
cout << sum / re << "/" << (n - 2) / re << endl;
}
return 0;
}




Found program (worker: 54, probid: 44A, subid: 37307505)

int main() {
int n;
cin >> n;
getchar();
string s;
map<string, int> p;
while (n--) {
getline(cin, s);
p[s]++;
}
cout << p.size() << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n;
cin >> n;
getchar();
string s;
map<string, int> p;
while (n--) {
getline(cin, s);
p[s]++;
}
cout << p.size() << endl;
return 0;
}




Found program (worker: 01, probid: 44A, subid: 37307505)

int main() {
int n;
cin >> n;
getchar();
string s;
map<string, int> p;
while (n--) {
getline(cin, s);
p[s]++;
}
cout << p.size() << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n;
cin >> n;
getchar();
string s;
map<string, int> p;
while (n--) {
getline(cin, s);
p[s]++;
}
cout << p.size() << endl;
return 0;
}




Found program (worker: 01, probid: 13A, subid: 41577664)

int GCD(int x, int y) {
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
int m, u;
cin >> m;
int x(0), y(m - 2);
for (int i = 2; i < m; i++) {
int n(m), z(0);
while (n != 0) {
z += n % i;
n /= i;
}
x += z;
}
u = GCD(x, y);
x /= u;
y /= u;
cout << x << "/" << y << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int GCD(int x, int y) {
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}

int main() {
int m, u;
cin >> m;
int x0(), ym - 2();
for (int i = 2; i < m; i++) {
int nm(), z0();
while (n != 0) {
z += n % i;
n /= i;
}
x += z;
}
u = GCD(x, y);
x /= u;
y /= u;
cout << x << "/" << y << endl;
return 0;
}




Found program (worker: 01, probid: 14A, subid: 46391886)

int n, m, min_i = 51, min_j = 51, max_i, max_j;
char a[55][55];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] == '*') {
min_i = min(min_i, i);
min_j = min(min_j, j);
max_i = max(max_i, i);
max_j = max(max_j, j);
}
}
for (int i = min_i; i <= max_i; i++) {
for (int j = min_j; j <= max_j; j++) { cout << a[i][j]; }
cout << "\n";
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int n;
int m;
int min_i = 51;
int min_j = 51;
int max_i;
int max_j;
char a[55];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] == '*') {
min_i = min(min_i, i);
min_j = min(min_j, j);
max_i = max(max_i, i);
max_j = max(max_j, j);
}
}
for (int i = min_i; i <= max_i; i++) {
for (int j = min_j; j <= max_j; j++) {
cout << a[i][j];
}
cout << "\n";
}
}




Found program (worker: 54, probid: 14A, subid: 46391886)

int n, m, min_i = 51, min_j = 51, max_i, max_j;
char a[55][55];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] == '*') {
min_i = min(min_i, i);
min_j = min(min_j, j);
max_i = max(max_i, i);
max_j = max(max_j, j);
}
}
for (int i = min_i; i <= max_i; i++) {
for (int j = min_j; j <= max_j; j++) { cout << a[i][j]; }
cout << "\n";
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int n;
int m;
int min_i = 51;
int min_j = 51;
int max_i;
int max_j;
char a[55];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] == '*') {
min_i = min(min_i, i);
min_j = min(min_j, j);
max_i = max(max_i, i);
max_j = max(max_j, j);
}
}
for (int i = min_i; i <= max_i; i++) {
for (int j = min_j; j <= max_j; j++) {
cout << a[i][j];
}
cout << "\n";
}
}




Found program (worker: 01, probid: 24A, subid: 41580578)

const int maxn = 100;
int G[maxn][maxn];
int G1[maxn][maxn];
int vis[maxn];
int num;
int N;
int lsum, ssum;
void dfs(int cur, int n) {
for (int i = 1; i <= num; i++) {
if (!vis[i] && G1[cur][i] != 0) {
vis[i] = 1;
if (G[cur][i] != 0) { lsum += G[cur][i]; }
dfs(i, n + 1);
}
}
if (n == N) {
if (G[cur][1]) { lsum += G[cur][1]; }
}
}
int main() {
while (cin >> N) {
memset(vis, 0, sizeof(vis));
memset(G, 0, sizeof(G));
memset(G1, 0, sizeof(G1));
int x, y, v;
num = 0;
lsum = 0;
ssum = 0;
for (int i = 0; i < N; i++) {
cin >> x >> y >> v;
G[x][y] = v;
G1[x][y] = v;
G1[y][x] = v;
ssum += v;
num = max(num, max(x, y));
}
vis[1] = 1;
dfs(1, 1);
cout << min(lsum, ssum - lsum) << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
const int maxn = 100;
int G[100];
int G1[100];
int vis[100];
int num;
int N;
int lsum;
int ssum;
void dfs(int cur, int n) {
for (int i = 1; i <= num; i++) {
if (!vis[i] && G1[cur][i] != 0) {
vis[i] = 1;
if (G[cur][i] != 0) {
lsum += G[cur][i];
}
dfs(i, n + 1);
}
}
if (n == N) {
if (G[cur][1]) {
lsum += G[cur][1];
}
}
}

int main() {
while (cin >> N.operator bool()) {
memset(vis, 0, sizeof (vis));
memset(G, 0, sizeof (G));
memset(G1, 0, sizeof (G1));
int x, y, v;
num = 0;
lsum = 0;
ssum = 0;
for (int i = 0; i < N; i++) {
cin >> x >> y >> v;
G[x][y] = v;
G1[x][y] = v;
G1[y][x] = v;
ssum += v;
num = max(num, max(x, y));
}
vis[1] = 1;
dfs(1, 1);
cout << min(lsum, ssum - lsum) << endl;
}
}




Found program (worker: 54, probid: 24A, subid: 41580578)

const int maxn = 100;
int G[maxn][maxn];
int G1[maxn][maxn];
int vis[maxn];
int num;
int N;
int lsum, ssum;
void dfs(int cur, int n) {
for (int i = 1; i <= num; i++) {
if (!vis[i] && G1[cur][i] != 0) {
vis[i] = 1;
if (G[cur][i] != 0) { lsum += G[cur][i]; }
dfs(i, n + 1);
}
}
if (n == N) {
if (G[cur][1]) { lsum += G[cur][1]; }
}
}
int main() {
while (cin >> N) {
memset(vis, 0, sizeof(vis));
memset(G, 0, sizeof(G));
memset(G1, 0, sizeof(G1));
int x, y, v;
num = 0;
lsum = 0;
ssum = 0;
for (int i = 0; i < N; i++) {
cin >> x >> y >> v;
G[x][y] = v;
G1[x][y] = v;
G1[y][x] = v;
ssum += v;
num = max(num, max(x, y));
}
vis[1] = 1;
dfs(1, 1);
cout << min(lsum, ssum - lsum) << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
const int maxn = 100;
int G[100];
int G1[100];
int vis[100];
int num;
int N;
int lsum;
int ssum;
void dfs(int cur, int n) {
for (int i = 1; i <= num; i++) {
if (!vis[i] && G1[cur][i] != 0) {
vis[i] = 1;
if (G[cur][i] != 0) {
lsum += G[cur][i];
}
dfs(i, n + 1);
}
}
if (n == N) {
if (G[cur][1]) {
lsum += G[cur][1];
}
}
}

int main() {
while (cin >> N.operator bool()) {
memset(vis, 0, sizeof (vis));
memset(G, 0, sizeof (G));
memset(G1, 0, sizeof (G1));
int x, y, v;
num = 0;
lsum = 0;
ssum = 0;
for (int i = 0; i < N; i++) {
cin >> x >> y >> v;
G[x][y] = v;
G1[x][y] = v;
G1[y][x] = v;
ssum += v;
num = max(num, max(x, y));
}
vis[1] = 1;
dfs(1, 1);
cout << min(lsum, ssum - lsum) << endl;
}
}




Found program (worker: 01, probid: 50A, subid: 48890387)

int main() {
int m, n, s = 0;
cin >> m >> n;
if (m % 2 != 0 && n % 2 != 0) {
if (n == 1) {
s = (((m - 1) / 2) * n);
cout << s << "\n";
} else if (m == 1) {
s = (((n - 1) / 2) * m);
cout << s << "\n";
} else {
s = (((m - 1) / 2) * n) + n / 2;
cout << s << "\n";
}
} else if (m % 2 == 0)
cout << (m / 2) * n << "\n";
else if (n % 2 == 0)
cout << (n / 2) * m << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int m, n, s = 0;
cin >> m >> n;
if (m % 2 != 0 && n % 2 != 0) {
if (n == 1) {
s = (((m - 1) / 2) * n);
cout << s << "\n";
}
 else if (m == 1) {
s = (((n - 1) / 2) * m);
cout << s << "\n";
}
 else {
s = (((m - 1) / 2) * n) + n / 2;
cout << s << "\n";
}
}
 else if (m % 2 == 0) cout << (m / 2) * n << "\n";
 else if (n % 2 == 0) cout << (n / 2) * m << "\n";
return 0;
}




Found program (worker: 54, probid: 50A, subid: 48890387)

int main() {
int m, n, s = 0;
cin >> m >> n;
if (m % 2 != 0 && n % 2 != 0) {
if (n == 1) {
s = (((m - 1) / 2) * n);
cout << s << "\n";
} else if (m == 1) {
s = (((n - 1) / 2) * m);
cout << s << "\n";
} else {
s = (((m - 1) / 2) * n) + n / 2;
cout << s << "\n";
}
} else if (m % 2 == 0)
cout << (m / 2) * n << "\n";
else if (n % 2 == 0)
cout << (n / 2) * m << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int m, n, s = 0;
cin >> m >> n;
if (m % 2 != 0 && n % 2 != 0) {
if (n == 1) {
s = (((m - 1) / 2) * n);
cout << s << "\n";
}
 else if (m == 1) {
s = (((n - 1) / 2) * m);
cout << s << "\n";
}
 else {
s = (((m - 1) / 2) * n) + n / 2;
cout << s << "\n";
}
}
 else if (m % 2 == 0) cout << (m / 2) * n << "\n";
 else if (n % 2 == 0) cout << (n / 2) * m << "\n";
return 0;
}




Found program (worker: 54, probid: 44A, subid: 37326610)

map<string, int> m;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 3;
}
int cnt = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); ++it) { cnt++; }
cout << cnt << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<string, int> m;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 3;
}
int cnt = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); ++it) {
cnt++;
}
cout << cnt << endl;
return 0;
}




Found program (worker: 01, probid: 13A, subid: 45558597)

int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 2; i < n; i++) {
int temp = 0;
int num = n;
while (num != 0) {
temp += (num % i);
num /= i;
}
ans += temp;
}
cout << ans / __gcd(ans, n - 2) << "/" << (n - 2) / __gcd(ans, n - 2) << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 2; i < n; i++) {
int temp = 0;
int num = n;
while (num != 0) {
temp += (num % i);
num /= i;
}
ans += temp;
}
cout << ans / __gcd(ans, n - 2) << "/" << (n - 2) / __gcd(ans, n - 2) << "\n";
return 0;
}




Found program (worker: 54, probid: 24A, subid: 47180396)

int edges[105][105];
void dfs(int *visited, int index, long *ans, int n) {
visited[index] = 1;
for (int i = 0; i < n; i++) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}
void dfs2(int *visited, int index, long *ans, int n) {
visited[index] = 1;
for (int i = n - 1; i >= 0; i--) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}
int main() {
int n;
cin >> n;
int a, b, c;
int visited[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) { edges[i][j] = -1; }
}
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
a--;
b--;
edges[a][b] = 0;
edges[b][a] = c;
visited[i] = 0;
}
long ans = 0;
dfs(visited, 0, &ans, n);
for (int i = n - 1; i >= 0; i--) {
if (edges[0][i] >= 0) {
ans += edges[i][0];
break;
}
}
long ans2 = 0;
for (int i = 0; i < n; i++) { visited[i] = 0; }
dfs2(visited, 0, &ans2, n);
for (int i = 0; i < n; i++) {
if (edges[0][i] >= 0) {
ans2 += edges[i][0];
break;
}
}
ans = min(ans, ans2);
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int edges[105];
void dfs(int * visited, int index, long * ans, int n) {
visited[index] = 1;
for (int i = 0; i < n; i++) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}

void dfs2(int * visited, int index, long * ans, int n) {
visited[index] = 1;
for (int i = n - 1; i >= 0; i--) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}

int main() {
int n;
cin >> n;
int a, b, c;
int visited[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
edges[i][j] = -1;
}
}
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
a--;
b--;
edges[a][b] = 0;
edges[b][a] = c;
visited[i] = 0;
}
long ans = 0;
dfs(visited, 0, &ans, n);
for (int i = n - 1; i >= 0; i--) {
if (edges[0][i] >= 0) {
ans += edges[i][0];
break;
}
}
long ans2 = 0;
for (int i = 0; i < n; i++) {
visited[i] = 0;
}
dfs2(visited, 0, &ans2, n);
for (int i = 0; i < n; i++) {
if (edges[0][i] >= 0) {
ans2 += edges[i][0];
break;
}
}
ans = min(ans, ans2);
cout << ans << endl;
return 0;
}




Found program (worker: 01, probid: 24A, subid: 47180396)

int edges[105][105];
void dfs(int *visited, int index, long *ans, int n) {
visited[index] = 1;
for (int i = 0; i < n; i++) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}
void dfs2(int *visited, int index, long *ans, int n) {
visited[index] = 1;
for (int i = n - 1; i >= 0; i--) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}
int main() {
int n;
cin >> n;
int a, b, c;
int visited[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) { edges[i][j] = -1; }
}
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
a--;
b--;
edges[a][b] = 0;
edges[b][a] = c;
visited[i] = 0;
}
long ans = 0;
dfs(visited, 0, &ans, n);
for (int i = n - 1; i >= 0; i--) {
if (edges[0][i] >= 0) {
ans += edges[i][0];
break;
}
}
long ans2 = 0;
for (int i = 0; i < n; i++) { visited[i] = 0; }
dfs2(visited, 0, &ans2, n);
for (int i = 0; i < n; i++) {
if (edges[0][i] >= 0) {
ans2 += edges[i][0];
break;
}
}
ans = min(ans, ans2);
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int edges[105];
void dfs(int * visited, int index, long * ans, int n) {
visited[index] = 1;
for (int i = 0; i < n; i++) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}

void dfs2(int * visited, int index, long * ans, int n) {
visited[index] = 1;
for (int i = n - 1; i >= 0; i--) {
if (edges[index][i] >= 0) {
if (visited[i] == 0) {
*ans = *ans + edges[index][i];
dfs(visited, i, ans, n);
}
}
}
}

int main() {
int n;
cin >> n;
int a, b, c;
int visited[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
edges[i][j] = -1;
}
}
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
a--;
b--;
edges[a][b] = 0;
edges[b][a] = c;
visited[i] = 0;
}
long ans = 0;
dfs(visited, 0, &ans, n);
for (int i = n - 1; i >= 0; i--) {
if (edges[0][i] >= 0) {
ans += edges[i][0];
break;
}
}
long ans2 = 0;
for (int i = 0; i < n; i++) {
visited[i] = 0;
}
dfs2(visited, 0, &ans2, n);
for (int i = 0; i < n; i++) {
if (edges[0][i] >= 0) {
ans2 += edges[i][0];
break;
}
}
ans = min(ans, ans2);
cout << ans << endl;
return 0;
}




Found program (worker: 16, probid: 50A, subid: 48324161)

int main() {
int l, b;
cin >> l >> b;
cout << ((l * b) / 2) << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int l, b;
cin >> l >> b;
cout << ((l * b) / 2) << endl;
return 0;
}




Found program (worker: 54, probid: 50A, subid: 48324161)

int main() {
int l, b;
cin >> l >> b;
cout << ((l * b) / 2) << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int l, b;
cin >> l >> b;
cout << ((l * b) / 2) << endl;
return 0;
}




Found program (worker: 54, probid: 13A, subid: 41577536)

int GCD(int x, int y) {
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
int m, u;
cin >> m;
int x(0), y(m - 2);
for (int i = 2; i < m; i++) {
int n(m), z(0);
while (n != 0) {
z += n % i;
n /= i;
}
x += z;
}
u = GCD(x, y);
x /= u;
y /= u;
cout << x << "/" << y << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int GCD(int x, int y) {
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}

int main() {
int m, u;
cin >> m;
int x0(), ym - 2();
for (int i = 2; i < m; i++) {
int nm(), z0();
while (n != 0) {
z += n % i;
n /= i;
}
x += z;
}
u = GCD(x, y);
x /= u;
y /= u;
cout << x << "/" << y << endl;
return 0;
}




Found program (worker: 01, probid: 13A, subid: 41577536)

int GCD(int x, int y) {
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
int m, u;
cin >> m;
int x(0), y(m - 2);
for (int i = 2; i < m; i++) {
int n(m), z(0);
while (n != 0) {
z += n % i;
n /= i;
}
x += z;
}
u = GCD(x, y);
x /= u;
y /= u;
cout << x << "/" << y << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int GCD(int x, int y) {
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}

int main() {
int m, u;
cin >> m;
int x0(), ym - 2();
for (int i = 2; i < m; i++) {
int nm(), z0();
while (n != 0) {
z += n % i;
n /= i;
}
x += z;
}
u = GCD(x, y);
x /= u;
y /= u;
cout << x << "/" << y << endl;
return 0;
}




Found program (worker: 54, probid: 44A, subid: 22167816)

int main() {
int n;
string a[105], b[105];
cin >> n;
int i, j, ans = n;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
for (j = 0; j < i; j++) {
if (a[i] == a[j] && b[i] == b[j]) {
ans--;
break;
}
}
}
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n;
string a[105], b[105];
cin >> n;
int i, j, ans = n;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
for (j = 0; j < i; j++) {
if (a[i] == a[j] && b[i] == b[j]) {
ans--;
break;
}
}
}
cout << ans << endl;
return 0;
}




Found program (worker: 01, probid: 44A, subid: 22167816)

int main() {
int n;
string a[105], b[105];
cin >> n;
int i, j, ans = n;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
for (j = 0; j < i; j++) {
if (a[i] == a[j] && b[i] == b[j]) {
ans--;
break;
}
}
}
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n;
string a[105], b[105];
cin >> n;
int i, j, ans = n;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
for (j = 0; j < i; j++) {
if (a[i] == a[j] && b[i] == b[j]) {
ans--;
break;
}
}
}
cout << ans << endl;
return 0;
}




Found program (worker: 01, probid: 11A, subid: 45130435)

int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b < prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
} else if (b == prev) {
count++;
prev += d;
} else {
prev = b;
}
} else {
prev = b;
}
}
cout << count << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b < prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
}
 else if (b == prev) {
count++;
prev += d;
}
 else {
prev = b;
}
}
 else {
prev = b;
}
}
cout << count << endl;
return 0;
}




Found program (worker: 54, probid: 11A, subid: 45130435)

int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b < prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
} else if (b == prev) {
count++;
prev += d;
} else {
prev = b;
}
} else {
prev = b;
}
}
cout << count << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b < prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
}
 else if (b == prev) {
count++;
prev += d;
}
 else {
prev = b;
}
}
 else {
prev = b;
}
}
cout << count << endl;
return 0;
}




Found program (worker: 54, probid: 24A, subid: 41581509)

bool vis[200];
int a[101][101], c[101][101];
int main() {
int n, x1, x2, i, j, x, y, w, ans1, ans2, cur;
cin >> n;
bool bo;
memset(a, 0, sizeof(a));
memset(c, 0, sizeof(c));
for (i = 0; i < n; i++) {
cin >> x >> y >> w;
a[x][y] = 1;
a[y][x] = -1;
c[x][y] = c[y][x] = w;
}
ans1 = 0;
ans2 = 0;
cur = 1;
vis[1] = true;
while (true) {
bo = true;
for (i = 1; i <= n; i++)
if (vis[i] == false) bo = false;
if (bo) break;
for (i = 1; i <= n; i++)
if (a[cur][i] != 0 && vis[i] == false) {
if (a[cur][i] < 0) ans1 += c[cur][i];
cur = i;
vis[cur] = true;
break;
}
}
if (a[cur][1] < 0) ans1 += c[cur][1];
cur = 1;
memset(vis, false, sizeof(vis));
while (true) {
bo = true;
for (i = 1; i <= n; i++)
if (vis[i] == false) bo = false;
if (bo) break;
for (i = n; i >= 1; i--) {
if ((a[cur][i] != 0) && (vis[i] == false)) {
if (a[cur][i] < 0) ans2 += c[cur][i];
cur = i;
vis[cur] = true;
break;
}
}
}
if (a[cur][2] < 0) ans2 += c[cur][1];
cout << min(ans1, ans2) << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
bool vis[200];
int a[101];
int c[101];
int main() {
int n, x1, x2, i, j, x, y, w, ans1, ans2, cur;
cin >> n;
bool bo;
memset(a, 0, sizeof (a));
memset(c, 0, sizeof (c));
for (i = 0; i < n; i++) {
cin >> x >> y >> w;
a[x][y] = 1;
a[y][x] = -1;
c[x][y] = c[y][x] = w;
}
ans1 = 0;
ans2 = 0;
cur = 1;
vis[1] = True;
while (True) {
bo = True;
for (i = 1; i <= n; i++) if (vis[i] == False) bo = False;
if (bo) break;
for (i = 1; i <= n; i++) if (a[cur][i] != 0 && vis[i] == False) {
if (a[cur][i] < 0) ans1 += c[cur][i];
cur = i;
vis[cur] = True;
break;
}
}
if (a[cur][1] < 0) ans1 += c[cur][1];
cur = 1;
memset(vis, False, sizeof (vis));
while (True) {
bo = True;
for (i = 1; i <= n; i++) if (vis[i] == False) bo = False;
if (bo) break;
for (i = n; i >= 1; i--) {
if ((a[cur][i] != 0) && (vis[i] == False)) {
if (a[cur][i] < 0) ans2 += c[cur][i];
cur = i;
vis[cur] = True;
break;
}
}
}
if (a[cur][2] < 0) ans2 += c[cur][1];
cout << min(ans1, ans2) << endl;
}




Found program (worker: 01, probid: 50A, subid: 48718323)

int main() {
int n, m;
cin >> n >> m;
if (n % 2 && m % 2)
cout << (n / 2) * m + m / 2 << "\n";
else if (n % 2)
cout << (m / 2) * n << "\n";
else if (m % 2)
cout << (n / 2) * m << "\n";
else
cout << (n / 2) * m << "\n";
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n % 2 && m % 2) cout << (n / 2) * m + m / 2 << "\n";
 else if (n % 2) cout << (m / 2) * n << "\n";
 else if (m % 2) cout << (n / 2) * m << "\n";
 else cout << (n / 2) * m << "\n"}




Found program (worker: 54, probid: 50A, subid: 48718323)

int main() {
int n, m;
cin >> n >> m;
if (n % 2 && m % 2)
cout << (n / 2) * m + m / 2 << "\n";
else if (n % 2)
cout << (m / 2) * n << "\n";
else if (m % 2)
cout << (n / 2) * m << "\n";
else
cout << (n / 2) * m << "\n";
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n % 2 && m % 2) cout << (n / 2) * m + m / 2 << "\n";
 else if (n % 2) cout << (m / 2) * n << "\n";
 else if (m % 2) cout << (n / 2) * m << "\n";
 else cout << (n / 2) * m << "\n"}




Found program (worker: 01, probid: 13A, subid: 46541412)

int sum;
int gcd(int a, int b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}
void add(int n, int x) {
while (n != 0) {
sum += n % x;
n /= x;
}
}
int main() {
int n;
cin >> n;
for (int i = 2; i < n; i++) add(n, i);
int div = gcd(sum, n - 2);
cout << sum / div << '/' << (n - 2) / div << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int sum;
int gcd(int a, int b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}

void add(int n, int x) {
while (n != 0) {
sum += n % x;
n /= x;
}
}

int main() {
int n;
cin >> n;
for (int i = 2; i < n; i++) add(n, i);
int div = gcd(sum, n - 2);
cout << sum / div << '/' << (n - 2) / div << endl;
return 0;
}




Found program (worker: 54, probid: 13A, subid: 46541412)

int sum;
int gcd(int a, int b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}
void add(int n, int x) {
while (n != 0) {
sum += n % x;
n /= x;
}
}
int main() {
int n;
cin >> n;
for (int i = 2; i < n; i++) add(n, i);
int div = gcd(sum, n - 2);
cout << sum / div << '/' << (n - 2) / div << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int sum;
int gcd(int a, int b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}

void add(int n, int x) {
while (n != 0) {
sum += n % x;
n /= x;
}
}

int main() {
int n;
cin >> n;
for (int i = 2; i < n; i++) add(n, i);
int div = gcd(sum, n - 2);
cout << sum / div << '/' << (n - 2) / div << endl;
return 0;
}




Found program (worker: 54, probid: 44A, subid: 38318926)

int n;
string s[105];
int ans;
int main() {
cin >> n;
ans = n;
for (int i = 0; i <= n; i++) {
getline(cin, s[i]);
for (int j = 0; j < i; j++)
if (s[j] == s[i]) {
ans--;
break;
}
}
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int n;
string s[105];
int ans;
int main() {
cin >> n;
ans = n;
for (int i = 0; i <= n; i++) {
getline(cin, s[i]);
for (int j = 0; j < i; j++) if (s[j] == s[i]) {
ans--;
break;
}
}
cout << ans << endl;
return 0;
}




Found program (worker: 54, probid: 45A, subid: 41666685)

map<int, string> m;
map<int, string>::iterator it;
int main() {
char s[20];
int n;
m[0] = "January";
m[1] = "February";
m[2] = "March";
m[3] = "April";
m[4] = "May";
m[5] = "June";
m[6] = "July";
m[7] = "August";
m[8] = "September";
m[9] = "October";
m[10] = "November";
m[11] = "December";
while (cin >> s >> n) {
int j = 0;
for (it = m.begin(); it != m.end(); it++) {
++j;
if (it->second == s) break;
}
cout << m[(j + n - 1) % 12] << endl;
}
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<int, string> m;
map<int, string>::iterator it;
int main() {
char s[20];
int n;
m[0] = "January";
m[1] = "February";
m[2] = "March";
m[3] = "April";
m[4] = "May";
m[5] = "June";
m[6] = "July";
m[7] = "August";
m[8] = "September";
m[9] = "October";
m[10] = "November";
m[11] = "December";
while (cin >> s >> n.operator bool()) {
int j = 0;
for (it = m.begin(); it != m.end(); it ++ 0) {
++j;
if (it.second == s) break;
}
cout << m[(j + n - 1) % 12] << endl;
}
return 0;
}




Found program (worker: 01, probid: 45A, subid: 41666685)

map<int, string> m;
map<int, string>::iterator it;
int main() {
char s[20];
int n;
m[0] = "January";
m[1] = "February";
m[2] = "March";
m[3] = "April";
m[4] = "May";
m[5] = "June";
m[6] = "July";
m[7] = "August";
m[8] = "September";
m[9] = "October";
m[10] = "November";
m[11] = "December";
while (cin >> s >> n) {
int j = 0;
for (it = m.begin(); it != m.end(); it++) {
++j;
if (it->second == s) break;
}
cout << m[(j + n - 1) % 12] << endl;
}
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<int, string> m;
map<int, string>::iterator it;
int main() {
char s[20];
int n;
m[0] = "January";
m[1] = "February";
m[2] = "March";
m[3] = "April";
m[4] = "May";
m[5] = "June";
m[6] = "July";
m[7] = "August";
m[8] = "September";
m[9] = "October";
m[10] = "November";
m[11] = "December";
while (cin >> s >> n.operator bool()) {
int j = 0;
for (it = m.begin(); it != m.end(); it ++ 0) {
++j;
if (it.second == s) break;
}
cout << m[(j + n - 1) % 12] << endl;
}
return 0;
}




Found program (worker: 54, probid: 24A, subid: 41580526)

const int maxn = 100;
int G[maxn][maxn];
int G1[maxn][maxn];
int vis[maxn];
int num;
int N;
int lsum, ssum;
void dfs(int cur, int n) {
for (int i = 1; i <= num; i++) {
if (!vis[i] && G1[cur][i] != 0) {
vis[i] = 1;
if (G[cur][i] != 0) { lsum += G[cur][i]; }
dfs(i, n + 1);
}
}
if (n == N) {
if (G[cur][1]) { lsum += G[cur][1]; }
}
}
int main() {
while (cin >> N) {
memset(vis, 0, sizeof(vis));
memset(G, 0, sizeof(G));
memset(G1, 0, sizeof(G1));
int x, y, v;
num = 0;
lsum = 0;
ssum = 0;
for (int i = 0; i < N; i++) {
cin >> x >> y >> v;
G[x][y] = v;
G1[x][y] = v;
G1[y][x] = v;
ssum += v;
num = max(num, max(x, y));
}
vis[1] = 1;
dfs(1, 1);
cout << min(lsum, ssum - lsum) << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
const int maxn = 100;
int G[100];
int G1[100];
int vis[100];
int num;
int N;
int lsum;
int ssum;
void dfs(int cur, int n) {
for (int i = 1; i <= num; i++) {
if (!vis[i] && G1[cur][i] != 0) {
vis[i] = 1;
if (G[cur][i] != 0) {
lsum += G[cur][i];
}
dfs(i, n + 1);
}
}
if (n == N) {
if (G[cur][1]) {
lsum += G[cur][1];
}
}
}

int main() {
while (cin >> N.operator bool()) {
memset(vis, 0, sizeof (vis));
memset(G, 0, sizeof (G));
memset(G1, 0, sizeof (G1));
int x, y, v;
num = 0;
lsum = 0;
ssum = 0;
for (int i = 0; i < N; i++) {
cin >> x >> y >> v;
G[x][y] = v;
G1[x][y] = v;
G1[y][x] = v;
ssum += v;
num = max(num, max(x, y));
}
vis[1] = 1;
dfs(1, 1);
cout << min(lsum, ssum - lsum) << endl;
}
}




Found program (worker: 01, probid: 11A, subid: 46119189)

long long fp(long long n, long long p) {
if (p == 0) return 1;
if (p == 1) return n;
long long res = fp(n, p / 2) % int(1e9 + 7);
res = ((res % int(1e9 + 7)) * (res % int(1e9 + 7))) % int(1e9 + 7);
if (p % 2) res = (res * n) % int(1e9 + 7);
return res % int(1e9 + 7);
}
long long n, m, arr[100005], a, ans = 0;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (i) {
if (arr[i] <= arr[i - 1]) {
a = (arr[i - 1] - arr[i]) / m;
ans += a;
arr[i] += a * m;
if (arr[i] <= arr[i - 1]) arr[i] += m, ans++;
}
}
}
cout << ans << '\n';
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
long long fp(long long n, long long p) {
if (p == 0) return 1;
if (p == 1) return n;
long long res = fp(n, p / 2) % int(1.0E+9 + 7);
res = ((res % int(1.0E+9 + 7)) * (res % int(1.0E+9 + 7))) % int(1.0E+9 + 7);
if (p % 2) res = (res * n) % int(1.0E+9 + 7);
return res % int(1.0E+9 + 7);
}

long long n;
long long m;
long long arr[100005];
long long a;
long long ans = 0;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (i) {
if (arr[i] <= arr[i - 1]) {
a = (arr[i - 1] - arr[i]) / m;
ans += a;
arr[i] += a * m;
if (arr[i] <= arr[i - 1]) arr[i] += m , ans++;
}
}
}
cout << ans << '\n';
return 0;
}




Found program (worker: 54, probid: 11A, subid: 46119189)

long long fp(long long n, long long p) {
if (p == 0) return 1;
if (p == 1) return n;
long long res = fp(n, p / 2) % int(1e9 + 7);
res = ((res % int(1e9 + 7)) * (res % int(1e9 + 7))) % int(1e9 + 7);
if (p % 2) res = (res * n) % int(1e9 + 7);
return res % int(1e9 + 7);
}
long long n, m, arr[100005], a, ans = 0;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (i) {
if (arr[i] <= arr[i - 1]) {
a = (arr[i - 1] - arr[i]) / m;
ans += a;
arr[i] += a * m;
if (arr[i] <= arr[i - 1]) arr[i] += m, ans++;
}
}
}
cout << ans << '\n';
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
long long fp(long long n, long long p) {
if (p == 0) return 1;
if (p == 1) return n;
long long res = fp(n, p / 2) % int(1.0E+9 + 7);
res = ((res % int(1.0E+9 + 7)) * (res % int(1.0E+9 + 7))) % int(1.0E+9 + 7);
if (p % 2) res = (res * n) % int(1.0E+9 + 7);
return res % int(1.0E+9 + 7);
}

long long n;
long long m;
long long arr[100005];
long long a;
long long ans = 0;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (i) {
if (arr[i] <= arr[i - 1]) {
a = (arr[i - 1] - arr[i]) / m;
ans += a;
arr[i] += a * m;
if (arr[i] <= arr[i - 1]) arr[i] += m , ans++;
}
}
}
cout << ans << '\n';
return 0;
}




Found program (worker: 54, probid: 50A, subid: 49071472)

int main() {
int i, j, k, l, m, n, o, p, a, b;
cin >> a;
cin >> b;
cout << (a * b) / 2 << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int i, j, k, l, m, n, o, p, a, b;
cin >> a;
cin >> b;
cout << (a * b) / 2 << endl;
}




Found program (worker: 04, probid: 50A, subid: 49071472)

int main() {
int i, j, k, l, m, n, o, p, a, b;
cin >> a;
cin >> b;
cout << (a * b) / 2 << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int i, j, k, l, m, n, o, p, a, b;
cin >> a;
cin >> b;
cout << (a * b) / 2 << endl;
}




Found program (worker: 01, probid: 13A, subid: 45412450)

int base(int n, int b) {
int res = 0;
while (n != 0) {
res += (n % b);
n /= b;
}
return res;
}
int main() {
int n, a = 0, b, c;
cin >> n;
for (int i = 2; i <= n - 1; i++) { a += base(n, i); }
b = n - 2;
c = __gcd(a, b);
cout << a / c << '/' << b / c << "\n";
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int base(int n, int b) {
int res = 0;
while (n != 0) {
res += (n % b);
n /= b;
}
return res;
}

int main() {
int n, a = 0, b, c;
cin >> n;
for (int i = 2; i <= n - 1; i++) {
a += base(n, i);
}
b = n - 2;
c = __gcd(a, b);
cout << a / c << '/' << b / c << "\n";
return 0;
}




Found program (worker: 01, probid: 44A, subid: 37324329)

map<string, int> m;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 1;
}
int cnt = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); ++it) { cnt++; }
cout << cnt << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<string, int> m;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 1;
}
int cnt = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); ++it) {
cnt++;
}
cout << cnt << endl;
return 0;
}




Found program (worker: 54, probid: 44A, subid: 37324329)

map<string, int> m;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 1;
}
int cnt = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); ++it) { cnt++; }
cout << cnt << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<string, int> m;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
string str;
getline(cin, str);
m[str] = 1;
}
int cnt = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); ++it) {
cnt++;
}
cout << cnt << endl;
return 0;
}




Found program (worker: 54, probid: 24A, subid: 48488129)

int main() {
int n;
cin >> n;
int a[n], b[n], c[n], total = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
total += c[i];
}
bool v[n + 1] = {0};
int i = 0, m = 0, second;
while (!v[i]) {
int k = 0;
v[i] = 1;
if (m == 0)
second = b[i];
else
second = a[i];
for (int j = 0; j < n; j++) {
if (a[j] == second && !v[j]) {
i = j;
k = 1;
m = 0;
break;
}
}
if (k == 1) continue;
for (int j = 0; j < n; j++) {
if (b[j] == second && !v[j]) {
i = j;
ans += c[j];
k = m = 1;
break;
}
}
if (k == 1) continue;
cout << min(ans, total - ans) << endl;
}
return 0;
}


Generating clang AST and parsing the JSON
<stdin>:11:8: error: variable-sized object may not be initialized
bool v[n + 1] = {0};
       ^~~~~
1 error generated.
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n], total = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
total += c[i];
}
bool v[n + 1];
int i = 0, m = 0, second;
return 0;
}




Found program (worker: 54, probid: 45A, subid: 48201527)

int main() {
string a;
int s;
cin >> a >> s;
int d;
if (a == "January")
d = 1;
else if (a == "February")
d = 2;
else if (a == "March")
d = 3;
else if (a == "April")
d = 4;
else if (a == "May")
d = 5;
else if (a == "June")
d = 6;
else if (a == "July")
d = 7;
else if (a == "August")
d = 8;
else if (a == "September")
d = 9;
else if (a == "October")
d = 10;
else if (a == "November")
d = 11;
else
d = 12;
d--;
d = d + s;
d = d % 12;
if (d == 0)
a = "January";
else if (d == 1)
a = "February";
else if (d == 2)
a = "March";
else if (d == 3)
a = "April";
else if (d == 4)
a = "May";
else if (d == 5)
a = "June";
else if (d == 6)
a = "July";
else if (d == 7)
a = "August";
else if (d == 8)
a = "September";
else if (d == 9)
a = "October";
else if (d == 10)
a = "November";
else
a = "December";
cout << a << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
string a;
int s;
cin >> a >> s;
int d;
if (a == "January") d = 1;
 else if (a == "February") d = 2;
 else if (a == "March") d = 3;
 else if (a == "April") d = 4;
 else if (a == "May") d = 5;
 else if (a == "June") d = 6;
 else if (a == "July") d = 7;
 else if (a == "August") d = 8;
 else if (a == "September") d = 9;
 else if (a == "October") d = 10;
 else if (a == "November") d = 11;
 else d = 12d--;
d = d + s;
d = d % 12;
if (d == 0) a = "January";
 else if (d == 1) a = "February";
 else if (d == 2) a = "March";
 else if (d == 3) a = "April";
 else if (d == 4) a = "May";
 else if (d == 5) a = "June";
 else if (d == 6) a = "July";
 else if (d == 7) a = "August";
 else if (d == 8) a = "September";
 else if (d == 9) a = "October";
 else if (d == 10) a = "November";
 else a = "December"cout << a << endl;
}




Found program (worker: 01, probid: 11A, subid: 47844088)

int main() {
int n, d, a;
cin >> n >> d;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
int c = 0;
for (int i = 0; i <= n - 2; i++) {
if (v[i] < v[i + 1])
continue;
else if (v[i] == v[i + 1]) {
v[i + 1] += d;
c++;
} else if (v[i] > v[i + 1]) {
int x = (v[i] - v[i + 1]) / d + 1;
c += x;
v[i + 1] += d * x;
}
}
cout << c << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, d, a;
cin >> n >> d;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
int c = 0;
for (int i = 0; i <= n - 2; i++) {
if (v[i] < v[i + 1]) continue;
 else if (v[i] == v[i + 1]) {
v[i + 1] += d;
c++;
}
 else if (v[i] > v[i + 1]) {
int x = (v[i] - v[i + 1]) / d + 1;
c += x;
v[i + 1] += d * x;
}
}
cout << c << endl;
return 0;
}




Found program (worker: 54, probid: 11A, subid: 47844088)

int main() {
int n, d, a;
cin >> n >> d;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
int c = 0;
for (int i = 0; i <= n - 2; i++) {
if (v[i] < v[i + 1])
continue;
else if (v[i] == v[i + 1]) {
v[i + 1] += d;
c++;
} else if (v[i] > v[i + 1]) {
int x = (v[i] - v[i + 1]) / d + 1;
c += x;
v[i + 1] += d * x;
}
}
cout << c << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, d, a;
cin >> n >> d;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
int c = 0;
for (int i = 0; i <= n - 2; i++) {
if (v[i] < v[i + 1]) continue;
 else if (v[i] == v[i + 1]) {
v[i + 1] += d;
c++;
}
 else if (v[i] > v[i + 1]) {
int x = (v[i] - v[i + 1]) / d + 1;
c += x;
v[i + 1] += d * x;
}
}
cout << c << endl;
return 0;
}




Found program (worker: 54, probid: 50A, subid: 48906460)

int main() {
int n, m;
cin >> n >> m;
cout << ((n * m) / 2) << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << ((n * m) / 2) << endl;
return 0;
}




Found program (worker: 04, probid: 50A, subid: 48906460)

int main() {
int n, m;
cin >> n >> m;
cout << ((n * m) / 2) << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << ((n * m) / 2) << endl;
return 0;
}




Found program (worker: 54, probid: 44A, subid: 39145320)

long long n, zs, m;
string c[105], s[105];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i] >> c[i];
for (int j = 1; j < i; j++)
if (s[i] == s[j] && c[i] == c[j])
break;
else
m++;
if (m == i - 1) zs++;
m = 0;
}
cout << zs << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
long long n;
long long zs;
long long m;
string c[105];
string s[105];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i] >> c[i];
for (int j = 1; j < i; j++) if (s[i] == s[j] && c[i] == c[j]) break;
 else m++if (m == i - 1) zs++;
m = 0;
}
cout << zs << endl;
return 0;
}




Found program (worker: 54, probid: 24A, subid: 29298750)

int a[105], b[105], c[105];
long long result = 0;
int n;
void dfs(int start, int self) {
for (int i = 1; i <= n; i++) {
if (self == i) continue;
if (start == a[i]) {
if (b[i] == a[1]) return;
dfs(b[i], i);
} else if (start == b[i]) {
result += c[i];
if (a[i] == a[1]) return;
dfs(a[i], i);
}
}
}
int main() {
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
sum += c[i];
}
dfs(b[1], 1);
result = min(result, sum - result);
cout << result << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int a[105];
int b[105];
int c[105];
long long result = 0;
int n;
void dfs(int start, int self) {
for (int i = 1; i <= n; i++) {
if (self == i) continue;
if (start == a[i]) {
if (b[i] == a[1]) return ;
dfs(b[i], i);
}
 else if (start == b[i]) {
result += c[i];
if (a[i] == a[1]) return ;
dfs(a[i], i);
}
}
}

int main() {
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
sum += c[i];
}
dfs(b[1], 1);
result = min(result, sum - result);
cout << result << endl;
return 0;
}




Found program (worker: 01, probid: 24A, subid: 29298750)

int a[105], b[105], c[105];
long long result = 0;
int n;
void dfs(int start, int self) {
for (int i = 1; i <= n; i++) {
if (self == i) continue;
if (start == a[i]) {
if (b[i] == a[1]) return;
dfs(b[i], i);
} else if (start == b[i]) {
result += c[i];
if (a[i] == a[1]) return;
dfs(a[i], i);
}
}
}
int main() {
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
sum += c[i];
}
dfs(b[1], 1);
result = min(result, sum - result);
cout << result << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int a[105];
int b[105];
int c[105];
long long result = 0;
int n;
void dfs(int start, int self) {
for (int i = 1; i <= n; i++) {
if (self == i) continue;
if (start == a[i]) {
if (b[i] == a[1]) return ;
dfs(b[i], i);
}
 else if (start == b[i]) {
result += c[i];
if (a[i] == a[1]) return ;
dfs(a[i], i);
}
}
}

int main() {
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
sum += c[i];
}
dfs(b[1], 1);
result = min(result, sum - result);
cout << result << endl;
return 0;
}




Found program (worker: 54, probid: 45A, subid: 13115103)

int main() {
vector<string> v(120);
for (int i = 0; i < 120; i += 12) {
v[i] = "January";
v[i + 1] = "February";
v[i + 2] = "March";
v[i + 3] = "April";
v[i + 4] = "May";
v[i + 5] = "June";
v[i + 6] = "July";
v[i + 7] = "August";
v[i + 8] = "September";
v[i + 9] = "October";
v[i + 10] = "November";
v[i + 11] = "December";
}
string x;
cin >> x;
int n, z;
cin >> n;
for (int i = 0; i < 120; i++) {
if (v[i] == x) {
z = i;
break;
}
}
cout << v[z + n] << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
vector<string> v120();
for (int i = 0; i < 120; i += 12) {
v[i] = "January";
v[i + 1] = "February";
v[i + 2] = "March";
v[i + 3] = "April";
v[i + 4] = "May";
v[i + 5] = "June";
v[i + 6] = "July";
v[i + 7] = "August";
v[i + 8] = "September";
v[i + 9] = "October";
v[i + 10] = "November";
v[i + 11] = "December";
}
string x;
cin >> x;
int n, z;
cin >> n;
for (int i = 0; i < 120; i++) {
if (v[i] == x) {
z = i;
break;
}
}
cout << v[z + n] << endl;
}




Found program (worker: 01, probid: 11A, subid: 45130544)

int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b <= prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
} else {
prev = b;
}
} else {
prev = b;
}
}
cout << count << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b <= prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
}
 else {
prev = b;
}
}
 else {
prev = b;
}
}
cout << count << endl;
return 0;
}




Found program (worker: 54, probid: 11A, subid: 45130544)

int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b <= prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
} else {
prev = b;
}
} else {
prev = b;
}
}
cout << count << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int prev;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (i > 0) {
if (b <= prev) {
int mult = (prev - b) / d + (((prev - b) % d) ? 1 : 0);
if (b + d * mult == prev) mult++;
count += mult;
prev = b + mult * d;
}
 else {
prev = b;
}
}
 else {
prev = b;
}
}
cout << count << endl;
return 0;
}




Found program (worker: 54, probid: 13A, subid: 45417038)

int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}




Found program (worker: 01, probid: 13A, subid: 45417038)

int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int i, n, k, rem, sum = 0, l;
cin >> n;
for (i = 2; i < n; i++) {
k = n;
while (k > 0) {
rem = k % i;
sum += rem;
k /= i;
}
}
l = __gcd(sum, n - 2);
cout << sum / l << "/" << (n - 2) / l << endl;
}




Found program (worker: 01, probid: 44A, subid: 48212577)

int main() {
set<string> s;
int n;
string m;
cin >> n;
getchar();
for (int i = 1; i <= n; i++) {
getline(cin, m);
s.insert(m);
}
cout << s.size() << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
set<string> s;
int n;
string m;
cin >> n;
getchar();
for (int i = 1; i <= n; i++) {
getline(cin, m);
s.insert(m);
}
cout << s.size() << endl;
return 0;
}




Found program (worker: 54, probid: 44A, subid: 48212577)

int main() {
set<string> s;
int n;
string m;
cin >> n;
getchar();
for (int i = 1; i <= n; i++) {
getline(cin, m);
s.insert(m);
}
cout << s.size() << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
set<string> s;
int n;
string m;
cin >> n;
getchar();
for (int i = 1; i <= n; i++) {
getline(cin, m);
s.insert(m);
}
cout << s.size() << endl;
return 0;
}




Found program (worker: 01, probid: 50A, subid: 49041427)

int main() {
int a, b;
cin >> a >> b;
cout << (a * b) / 2 << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b) / 2 << endl;
return 0;
}




Found program (worker: 54, probid: 50A, subid: 49041427)

int main() {
int a, b;
cin >> a >> b;
cout << (a * b) / 2 << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b) / 2 << endl;
return 0;
}




Found program (worker: 01, probid: 24A, subid: 45661041)

int n, a, b, c, sum = 0, gtw = 0;
int edge[100][100];
bool ada_edge() {
bool ro = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) { ro = ro or (edge[i][j] != 0); }
}
return ro;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
sum = sum + c;
a--;
b--;
edge[a][b] = c;
}
a = 0;
while (ada_edge()) {
int ada_out_edge = 0;
for (int i = 0; i < n; i++) { ada_out_edge = ada_out_edge or (edge[a][i] != 0); }
if (ada_out_edge) {
for (int i = 0; i < n; i++) {
if (edge[a][i] != 0) {
edge[a][i] = 0;
a = i;
break;
}
}
} else {
for (int i = 0; i < n; i++) {
if (edge[i][a] != 0) {
gtw = gtw + edge[i][a];
edge[i][a] = 0;
a = i;
break;
}
}
}
}
cout << min(gtw, sum - gtw) << '\n';
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int n;
int a;
int b;
int c;
int sum = 0;
int gtw = 0;
int edge[100];
bool ada_edge() {
bool ro = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ro = ro || (edge[i][j] != 0);
}
}
return ro;
}

int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
sum = sum + c;
a--;
b--;
edge[a][b] = c;
}
a = 0;
while (ada_edge()) {
int ada_out_edge = 0;
for (int i = 0; i < n; i++) {
ada_out_edge = ada_out_edge || (edge[a][i] != 0);
}
if (ada_out_edge) {
for (int i = 0; i < n; i++) {
if (edge[a][i] != 0) {
edge[a][i] = 0;
a = i;
break;
}
}
}
 else {
for (int i = 0; i < n; i++) {
if (edge[i][a] != 0) {
gtw = gtw + edge[i][a];
edge[i][a] = 0;
a = i;
break;
}
}
}
}
cout << min(gtw, sum - gtw) << '\n';
return 0;
}




Found program (worker: 54, probid: 11A, subid: 46849712)

int main() {
long long n, d, b, o;
long long ans = 0;
long long pre = 0;
cin >> n >> d;
for (long long i = 0; i < n; i++) {
cin >> b;
if (b <= pre) {
o = (b % d <= pre % d) + (pre / d) - (b / d);
ans += o;
b += o * d;
}
pre = b;
}
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
long long n, d, b, o;
long long ans = 0;
long long pre = 0;
cin >> n >> d;
for (long long i = 0; i < n; i++) {
cin >> b;
if (b <= pre) {
o = (b % d <= pre % d) + (pre / d) - (b / d);
ans += o;
b += o * d;
}
pre = b;
}
cout << ans << endl;
return 0;
}




Found program (worker: 01, probid: 11A, subid: 46849712)

int main() {
long long n, d, b, o;
long long ans = 0;
long long pre = 0;
cin >> n >> d;
for (long long i = 0; i < n; i++) {
cin >> b;
if (b <= pre) {
o = (b % d <= pre % d) + (pre / d) - (b / d);
ans += o;
b += o * d;
}
pre = b;
}
cout << ans << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
long long n, d, b, o;
long long ans = 0;
long long pre = 0;
cin >> n >> d;
for (long long i = 0; i < n; i++) {
cin >> b;
if (b <= pre) {
o = (b % d <= pre % d) + (pre / d) - (b / d);
ans += o;
b += o * d;
}
pre = b;
}
cout << ans << endl;
return 0;
}




Found program (worker: 54, probid: 13A, subid: 40538278)

int gcd(int a, int b) {
if (b == 0) { return a; }
return gcd(b, a % b);
}
int A;
int main() {
cin >> A;
long long s = 0;
for (int i = 2; i < A; i++) {
int x = A;
while (x != 0) {
s += x % i;
x /= i;
}
}
int g = gcd(A - 2, s);
cout << s / g << '/' << (A - 2) / g << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}

int A;
int main() {
cin >> A;
long long s = 0;
for (int i = 2; i < A; i++) {
int x = A;
while (x != 0) {
s += x % i;
x /= i;
}
}
int g = gcd(A - 2, s);
cout << s / g << '/' << (A - 2) / g << endl;
return 0;
}




Found program (worker: 01, probid: 13A, subid: 40538278)

int gcd(int a, int b) {
if (b == 0) { return a; }
return gcd(b, a % b);
}
int A;
int main() {
cin >> A;
long long s = 0;
for (int i = 2; i < A; i++) {
int x = A;
while (x != 0) {
s += x % i;
x /= i;
}
}
int g = gcd(A - 2, s);
cout << s / g << '/' << (A - 2) / g << endl;
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}

int A;
int main() {
cin >> A;
long long s = 0;
for (int i = 2; i < A; i++) {
int x = A;
while (x != 0) {
s += x % i;
x /= i;
}
}
int g = gcd(A - 2, s);
cout << s / g << '/' << (A - 2) / g << endl;
return 0;
}




Found program (worker: 01, probid: 44A, subid: 48201336)

map<string, int> asd;
map<string, int> dsa;
map<int, int> dataa[105];
int main() {
int z;
cin >> z;
string a, s;
int d = 1, f = 1;
int itung = 0;
while (z--) {
cin >> a >> s;
if (asd[a] == 0) {
asd[a] = d;
d++;
}
if (dsa[s] == 0) {
dsa[s] = f;
f++;
}
if (dataa[asd[a]][dsa[s]] == 0) {
dataa[asd[a]][dsa[s]]++;
itung++;
}
}
cout << itung << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<string, int> asd;
map<string, int> dsa;
map<int, int> dataa[105];
int main() {
int z;
cin >> z;
string a, s;
int d = 1, f = 1;
int itung = 0;
while (z--) {
cin >> a >> s;
if (asd[a] == 0) {
asd[a] = d;
d++;
}
if (dsa[s] == 0) {
dsa[s] = f;
f++;
}
if (dataa[asd[a]][dsa[s]] == 0) {
dataa[asd[a]][dsa[s]]++;
itung++;
}
}
cout << itung << endl;
}




Found program (worker: 54, probid: 44A, subid: 48201336)

map<string, int> asd;
map<string, int> dsa;
map<int, int> dataa[105];
int main() {
int z;
cin >> z;
string a, s;
int d = 1, f = 1;
int itung = 0;
while (z--) {
cin >> a >> s;
if (asd[a] == 0) {
asd[a] = d;
d++;
}
if (dsa[s] == 0) {
dsa[s] = f;
f++;
}
if (dataa[asd[a]][dsa[s]] == 0) {
dataa[asd[a]][dsa[s]]++;
itung++;
}
}
cout << itung << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
map<string, int> asd;
map<string, int> dsa;
map<int, int> dataa[105];
int main() {
int z;
cin >> z;
string a, s;
int d = 1, f = 1;
int itung = 0;
while (z--) {
cin >> a >> s;
if (asd[a] == 0) {
asd[a] = d;
d++;
}
if (dsa[s] == 0) {
dsa[s] = f;
f++;
}
if (dataa[asd[a]][dsa[s]] == 0) {
dataa[asd[a]][dsa[s]]++;
itung++;
}
}
cout << itung << endl;
}




Found program (worker: 01, probid: 7A, subid: 47095062)

char catur[8][8];
bool vis[8][8];
bool sb = 1;
int cnt = 0;
int main() {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
cin >> catur[i][j];
sb = sb & (catur[i][j] == 'B');
}
}
for (int j = 0; j < 8; j++) {
int lol = 0;
for (int i = 0; i < 8 && catur[i][j] == 'B'; i++) { lol++; }
if (lol == 8) {
for (int i = 0; i < 8 && catur[i][j] == 'B'; i++) { vis[i][j] = 1; }
cnt++;
}
}
for (int i = 0; i < 8; i++) {
int lol = 0;
for (int j = 0; j < 8 && catur[i][j] == 'B'; j++) { lol++; }
if (lol == 8) {
for (int j = 0; j < 8 && catur[i][j] == 'B'; j++) { vis[i][j] = 1; }
cnt++;
}
}
if (sb) { cnt = cnt / 2; }
cout << cnt << '\n';
return 0;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
char catur[8];
bool vis[8];
bool sb = 1;
int cnt = 0;
int main() {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
cin >> catur[i][j];
sb = sb & (catur[i][j] == 'B');
}
}
for (int j = 0; j < 8; j++) {
int lol = 0;
for (int i = 0; i < 8 && catur[i][j] == 'B'; i++) {
lol++;
}
if (lol == 8) {
for (int i = 0; i < 8 && catur[i][j] == 'B'; i++) {
vis[i][j] = 1;
}
cnt++;
}
}
for (int i = 0; i < 8; i++) {
int lol = 0;
for (int j = 0; j < 8 && catur[i][j] == 'B'; j++) {
lol++;
}
if (lol == 8) {
for (int j = 0; j < 8 && catur[i][j] == 'B'; j++) {
vis[i][j] = 1;
}
cnt++;
}
}
if (sb) {
cnt = cnt / 2;
}
cout << cnt << '\n';
return 0;
}




Found program (worker: 01, probid: 24A, subid: 41587889)

int graph[105][105];
int vis[105];
int m[105][105];
int t;
int k;
int n;
void dfs(int u) {
k++;
vis[u] = 1;
if (k == n) { t += m[1][u]; }
for (int i = 0; i < 105; i++) {
if (graph[u][i] == 1 && vis[i] == 0) {
t += m[i][u];
if (k == n) { return; }
dfs(i);
}
}
}
int main() {
while (cin >> n) {
t = 0;
k = 0;
int sum = 0;
memset(graph, 0, sizeof(graph));
memset(vis, 0, sizeof(vis));
memset(m, 0, sizeof(m));
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
graph[x][y] = graph[y][x] = 1;
m[y][x] = z;
sum += z;
}
dfs(1);
if (sum - t < t) { t = sum - t; }
cout << t << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int graph[105];
int vis[105];
int m[105];
int t;
int k;
int n;
void dfs(int u) {
k++;
vis[u] = 1;
if (k == n) {
t += m[1][u];
}
for (int i = 0; i < 105; i++) {
if (graph[u][i] == 1 && vis[i] == 0) {
t += m[i][u];
if (k == n) {
return ;
}
dfs(i);
}
}
}

int main() {
while (cin >> n.operator bool()) {
t = 0;
k = 0;
int sum = 0;
memset(graph, 0, sizeof (graph));
memset(vis, 0, sizeof (vis));
memset(m, 0, sizeof (m));
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
graph[x][y] = graph[y][x] = 1;
m[y][x] = z;
sum += z;
}
dfs(1);
if (sum - t < t) {
t = sum - t;
}
cout << t << endl;
}
}




Found program (worker: 54, probid: 24A, subid: 41587889)

int graph[105][105];
int vis[105];
int m[105][105];
int t;
int k;
int n;
void dfs(int u) {
k++;
vis[u] = 1;
if (k == n) { t += m[1][u]; }
for (int i = 0; i < 105; i++) {
if (graph[u][i] == 1 && vis[i] == 0) {
t += m[i][u];
if (k == n) { return; }
dfs(i);
}
}
}
int main() {
while (cin >> n) {
t = 0;
k = 0;
int sum = 0;
memset(graph, 0, sizeof(graph));
memset(vis, 0, sizeof(vis));
memset(m, 0, sizeof(m));
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
graph[x][y] = graph[y][x] = 1;
m[y][x] = z;
sum += z;
}
dfs(1);
if (sum - t < t) { t = sum - t; }
cout << t << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int graph[105];
int vis[105];
int m[105];
int t;
int k;
int n;
void dfs(int u) {
k++;
vis[u] = 1;
if (k == n) {
t += m[1][u];
}
for (int i = 0; i < 105; i++) {
if (graph[u][i] == 1 && vis[i] == 0) {
t += m[i][u];
if (k == n) {
return ;
}
dfs(i);
}
}
}

int main() {
while (cin >> n.operator bool()) {
t = 0;
k = 0;
int sum = 0;
memset(graph, 0, sizeof (graph));
memset(vis, 0, sizeof (vis));
memset(m, 0, sizeof (m));
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
graph[x][y] = graph[y][x] = 1;
m[y][x] = z;
sum += z;
}
dfs(1);
if (sum - t < t) {
t = sum - t;
}
cout << t << endl;
}
}




Found program (worker: 54, probid: 50A, subid: 42237816)

int main() {
int a, b;
cin >> a >> b;
cout << (a * b / 2) << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b / 2) << endl;
}




Found program (worker: 01, probid: 50A, subid: 42237816)

int main() {
int a, b;
cin >> a >> b;
cout << (a * b / 2) << endl;
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes

Generating code for tree
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b / 2) << endl;
}




Found program (worker: 54, probid: 45A, subid: 42073143)

int num[3005];
map<string, int> ma;
int ans = 0;
bool is_prime(int u);
int main() {
string s;
s = "January";
ma[s] = 1;
s = "February";
ma[s] = 2;
s = "March";
ma[s] = 3;
s = "April";
ma[s] = 4;
s = "May";
ma[s] = 5;
ma["June"] = 6;
ma["July"] = 7;
ma["August"] = 8;
ma["September"] = 9;
ma["October"] = 10;
ma["November"] = 11;
ma["December"] = 12;
int n;
cin >> s;
cin >> n;
if (n % 12 == 0)
cout << s << endl;
else {
int a = ma[s];
n += a;
if (n % 12 == 1) cout << "January" << endl;
if (n % 12 == 2) cout << "February" << endl;
if (n % 12 == 3) cout << "March" << endl;
if (n % 12 == 4) cout << "April" << endl;
if (n % 12 == 5) cout << "May" << endl;
if (n % 12 == 6) cout << "June" << endl;
if (n % 12 == 7) cout << "July" << endl;
if (n % 12 == 8) cout << "August" << endl;
if (n % 12 == 9) cout << "September" << endl;
if (n % 12 == 10) cout << "October" << endl;
if (n % 12 == 11) cout << "November" << endl;
if (n % 12 == 0) cout << "December" << endl;
}
}


Generating clang AST and parsing the JSON
Filtering out nodes from header includes

Parsing clang AST into ASTNodes
missing: CXXBindTemporaryExpr
Traceback (most recent call last):
  File "<input>", line 1, in <module>
  File "/home/ernwong/Downloads/Software/PyCharm/pycharm-professional-2020.1.1/pycharm-2020.1.1/plugins/python/helpers/pydev/_pydev_bundle/pydev_umd.py", line 197, in runfile
    pydev_imports.execfile(filename, global_vars, local_vars)  # execute the script
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 354, in <module>
    PARSERS.update(EXPRESSIONS)
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 85, in parse_clang_ast
    root_node.add_child(
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 103, in parse
    log_node_handling("handling ExprStmt: {}".format(node["kind"]))
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 196, in parse_function
    for inner in node["inner"]:
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 103, in parse
    log_node_handling("handling ExprStmt: {}".format(node["kind"]))
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 148, in inner
    log_node_handling("handling {}: {}".format(node_type, inner_child))
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 100, in parse
    return ASTNode("type", value=qual_type)
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 177, in parse_pass_through
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 103, in parse
    log_node_handling("handling ExprStmt: {}".format(node["kind"]))
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 148, in inner
    log_node_handling("handling {}: {}".format(node_type, inner_child))
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 103, in parse
    log_node_handling("handling ExprStmt: {}".format(node["kind"]))
  File "/home/ernwong/uni/se700/part4project/cpp_parser.py", line 264, in parse_overloaded_operator_call
    return parse(node["inner"][1])
  File "/home/ernwong/uni/se700/part4project/NL2code/astnode.py", line 22, in __init__
    self.add_child(child)
  File "/home/ernwong/uni/se700/part4project/NL2code/astnode.py", line 134, in add_child
    child.parent = self
AttributeError: 'NoneType' object has no attribute 'parent'