Submission #3730788

---

Source Code Expand

//#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<numeric>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<ctype.h>
#include <fstream>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
using namespace std;
typedef long long ll;//int64
typedef unsigned long long ull;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int dy[4]={0,1,0,-1};
//----------program from here----------

int main(){
  char s[5]={0},cand[25][2]={0};
  int n=0;
  cin >> s >> n;
  for(int i=1;i<=5;++i){
    for(int j=1;j<=5;++j){
      cand[i*j-1][0] = s[i-1];
      cand[i*j-1][1] = s[j-1];
      cout << cand[i*j-1] << endl;
    }
  }
  cout << cand[n] << endl;
  return 0;
}

Submission Info

Judge Result