Computer Science/Data Structure, Algorithm

Jungol] 1178 : 정수의 곱과 자릿수

TwinParadox 2015. 7. 20. 23:00
728x90

http://www.jungol.co.kr/problem.php?id=1178


#include <iostream>

using namespace std;

int sub(int n)

{

static int cnt = 0;

int k;

cnt++;

if (n >= 10)

sub(n / 10);

else

{

k = cnt;

cnt = 0;

return k;

}

}

int main(void)

{

int n;

int arr[10][2], i, result[10][2] = { 0 }, j;

cin >> n;

for (i = 0; i < n; i++)

for (j = 0; j < 2; j++)

cin >> arr[i][j];


for (i = 0; i < n; i++)

{

result[i][0] = arr[i][0] * arr[i][1];

result[i][1]=sub(result[i][0]);

}

for (i = 0; i < n; i++)

{

for (j = 0; j < 2; j++)

cout << result[i][j] << " ";

cout << endl;

}

}

728x90