1 solutions

  • 0
    @ 2025-11-5 17:25:40

    C :

    #include "stdio.h"
    int m,n;
    int F(int t)
    {
    	if(t==1)
    		return 0;
    	else
    		return (F(t-1)+m)%t;
    }
    int main()
    {
    	scanf("%d%d",&n,&m);
    	printf("%d\n",F(n)+1);
    	return 0;
    }
    
    

    C++ :

    #include<stdio.h>
    int main()
    {
    	long n,m;
    	scanf("%ld%ld",&n,&m);
    	int i,r=0;
    	for (i=2;i<=n;i++)
    	{
    		r=(r+m)%i;	
    	}
    	printf("%d\n",r+1);
    	return 0;
    }
    

    Pascal :

    var k,n,ans,i:longint;
    begin
      readln(n,k);
      ans:=0;
      for i:=2 to n do ans:=(ans+k) mod i;
      writeln(ans+1);
    end.
    
    • 1

    Information

    ID
    18420
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By