OJ Board

Code: Select all

#include<iostream>
#include<string>
#include<strstream>
using namespace std;
char* str;
string temp;
int arr[10005];
void main()
{
	int k,n,num,m,count;
	string s;
	while(!cin.eof())
	{
		cin>>k;
		num = count = 0;
		getline(cin,temp);
		getline(cin,s);
		str = new char[s.length()+1];
		strcpy(str,s.c_str());
		strstream sstr(str,s.length()+1);
		string news = "";
		while(sstr>>n)
		{
			m = n-num;
			arr[count] = m;
			num = m*-k;
			count++;
		}
		cout<<"q(x): ";
		for(int i=0;i<count-1;i++)
		{
			cout<<arr[i];
			if(i != count-2)
				cout<<" ";
		}
		cout<<endl<<"r = "<<arr[count-1]<<endl<<endl;
	}
}

Code: Select all

while(!cin.eof()) 
{ 
   cin>>k;
   num = count = 0;
   ...

Code: Select all

while(cin>>k) 
{ 
  num = count = 0;
   ...

Code: Select all

q(x): 
r = 0

q(x): 
r = 0

Code: Select all

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long int valdec(vector<char> no)
{
	long int res;
	int n=no.size();
	if(no[0]=='-')
	{
		res=0;
		long int power=1;
		for(int i=n-1;i>=1;i--)
		{
			res+=(no[i]-'0')*power;
			power*=10;
		}
		res*=-1;
	}
	else if(isdigit(no[0]))
	{
		res=0;
		long int power=1;
		for(int i=n-1;i>=0;i--)
		{
			res+=(no[i]-'0')*power;
			power*=10;
		}
	}
	return res;
}
main()
{
	long int k;
	while(cin>>k)
	{
		char ch;
		cin.get(ch);
		vector<char> no;
		vector<long int> a;
		while(cin.get(ch))
		{
			if(ch==' ')
			{
				a.push_back(valdec(no));
				no.clear();
				continue;
			}
			else if(ch=='\n')
			{
				a.push_back(valdec(no));
				no.clear();
				break;
			}
			else 
				no.push_back(ch);
		}

		vector<long int> q(a.size()-1);
		long int r;
		int n=a.size()-1;
		cout<<"q(x): ";
		q[0]=a[0];
		cout<<q[0]<<" ";
		for(int i=1;i<n;i++)
		{
			q[i]=q[i-1]*k+a[i];
			cout<<q[i]<<" ";
		}
		cout<<endl;
		r=a[n]+k*q[n-1];
		cout<<"r = "<<r<<endl;
		cout<<endl;
	}
}

Code: Select all

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define MAX_DEGREE 20000
#define MAX_LEN 200000

char input[MAX_LEN];

int main()
{
	int i;
	long a[MAX_DEGREE];
	int k;
	int degree;
	long r;
	int j;
	long q[MAX_DEGREE];
	long t;
	char* p;
	int n;
	char word[100];
	int first = 1;

//	freopen("in5.txt", "r", stdin);

	while (scanf("%d", &k) != EOF)
	{
		scanf(" %[^\n]", input);
		
		i = 0;

		p = strtok(input, " ");

		while (p != NULL)
		{
			a[i] = atoi(p);			
			p = strtok(NULL, " ");
			i++;
		}
		
		degree = i;

		if (first)
		{
			first = 0;
		}
		else
		{
			printf("\n");
		}

/*		if (degree < 2)
		{
			printf("q(x): 0\nr = %ld\n", a[0]);
			continue;			
		}*/

		r = 0;

		j = 0;

		for (i = 0;i < degree-1;i++)
		{
			t = a[i]-r;

			q[j] = t;

			r = -t*k;

			j++;
		}

		r = a[i]-r;

		printf("q(x): ");
		for (i = 0;i < degree-1;i++)
		{
			printf("%ld ", q[i]);
		}

		printf("\n");
		printf("r = %ld\n", r);
	}

	return 0;
}