@chwj0608

#include <iostream> using namespace std; int main() { int t; int tj; int ooo = 30; int cnt=0; cin >> t >> tj;

#include <iostream> using namespace std; int main() { int N, X, S, T, ans = -1; cin >> N >> X; for (int i = 0; i < N; i++)

#include <iostream> using namespace std; int main() { int arr[5]; int arro = 0; for(int i = 0;i < 5;i++){ cin >> arr[i]; arro += arr[i] * arr[i];

#include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n]; for(int i = 0;i < n;i++) {

#include <iostream> #include <algorithm> #include <vector> using namespace std;

#include <iostream> #include <vector> using namespace std; int main() { int k; int sum=0; vector<int>n;

#include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { vector<pair<int,string>> tn; int arr[3]; char a;

#include <iostream> using namespace std; int main() { int a,b; while (true) { cin >> a >> b; if(a == 0&&b == 0){

#include <iostream> using namespace std; int main() { int g; int x = 0; int gg_town=1; int b = 1; cin >> g;

#include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n]={0,}; int max;

#include <iostream> using namespace std; int main() { int n,m; cin >> n >> m; int a[n][m]; int b[n][m]; for(int i = 0;i< n;i++){

#include <iostream> using namespace std; int main() { int n,m; cin >> n >> m; int a[n][m]; int b[n][m]; int ab[n][m];

#include <iostream> using namespace std; int main() { int n; cin >> n; int sum = 1; if(n == 0)

#include <iostream> using namespace std; int main() { long long P; int K, t; scanf("%lld %d",&P,&K); bool check = true;

#include <iostream> using namespace std; int main() { int r1; int s; int r2; cin >> r1 >> s; r2 = s*2-r1;

#include <iostream> #include <string> using namespace std; int main() { string aah; string AAH; cin >> aah; cin >> AAH;

#include<iostream> using namespace std; int main() { int n, k; scanf("%d %d",&n,&k); int cnt = 0; int arr[10000]; int j = 0;

#include <iostream> int main() { int n; scanf("%d",&n); int arr[n]; int narr[n]; int x1[n];

#include <iostream> int main() { int n; int w = 0; scanf("%d",&n); for(int i = 1;i <= n;i++){ if(n % i == 0){ w += i; }

#include <iostream> int main() { int a; scanf("%d",&a); for(int i =1;i<10;i++){ printf("%d*%d=%d\n",a,i,a*i); } return 0; }